DarkWarrior703
b403487142
Update double_factorial.cpp
2020-04-25 22:37:50 +03:00
DarkWarrior703
9fef832f57
Update double_factorial.cpp
2020-04-25 22:34:44 +03:00
DarkWarrior703
e6874e4d18
Update double_factorial.cpp
2020-04-25 22:28:20 +03:00
DarkWarrior703
a4d3475ed5
Update sqrt_double.cpp
2020-04-25 16:30:52 +03:00
DarkWarrior703
f27f3fcbf0
Update sqrt_double.cpp
2020-04-25 16:29:50 +03:00
DarkWarrior703
c8f11deea2
Update sqrt_double.cpp
2020-04-25 16:28:31 +03:00
DarkWarrior703
e9a0234cbe
Update sqrt_double.cpp
2020-04-25 16:26:36 +03:00
DarkWarrior703
d4ab125657
Update sqrt_double.cpp
2020-04-25 16:25:00 +03:00
DarkWarrior703
878dc0bf6c
Update sqrt_double.cpp
2020-04-25 16:21:45 +03:00
DarkWarrior703
e4504d641b
Rename double_factorial to double_factorial.cpp
2020-04-25 16:18:32 +03:00
DarkWarrior703
2b917ee43a
Rename sqrt_double to sqrt_double.cpp
2020-04-25 16:17:15 +03:00
DarkWarrior703
a77f0d3afe
Create double_factorial
...
Calculates the double factorial of an integer
2020-04-24 21:01:14 +03:00
DarkWarrior703
a23baf9db1
Create sqrt_double
...
Calculates the sqrt of every number in O(logn) with fixed precision.
2020-04-24 20:54:32 +03:00
John Law
30521478e7
Add Number of Positive Divisors in math
...
Added number_of_positive_divisors.cpp in math directory
2020-04-16 16:18:01 +02:00
nikhil kala
dbdf7f14a5
Merge pull request #695 from coleman2246/master
...
feat: add euclidean algorithm implementation of gcd
2020-04-16 12:05:21 +05:30
Mann Mehta
2d54bfa1e3
Modified description
2020-04-15 09:23:00 +05:30
Mann Mehta
583264da0f
Resolve errors
2020-04-15 09:14:50 +05:30
Mann Mehta
30ee762347
Renamed to number_of_positive_divisors.cpp from number_of_divisors.cpp
2020-04-15 09:11:53 +05:30
Mann Mehta
4da35f1edf
Modified number_of_divisors.cpp
2020-04-15 09:10:00 +05:30
Mann Mehta
6c20a62a9b
Renamed file name to number_of_divisors.cpp from number-of-divisors.cpp
2020-04-15 03:13:10 +05:30
Mann Mehta
5ee32c63de
Resolve typo errors
2020-04-15 03:08:49 +05:30
Mann Mehta
877125eb8a
Added number-of-divisors.cpp in math directory
2020-04-15 03:00:23 +05:30
Mann Mehta
8219e124a7
Resolve typo errors
2020-04-04 18:16:40 +05:30
Mann Mehta
a82e679f2e
Updated with changes in math/binary_exponent.cpp
2020-04-04 18:11:57 +05:30
Mann Mehta
1d4a67c6ea
Update math/binary_exponent.cpp
...
Co-Authored-By: John Law <johnlaw.po@gmail.com>
2020-04-04 17:29:11 +05:30
Mann Mehta
bcb3677f78
Update math/binary_exponent.cpp
...
Co-Authored-By: John Law <johnlaw.po@gmail.com>
2020-04-04 17:28:19 +05:30
Mann Mehta
085c6943a0
resolve else clause braces error
2020-04-02 04:37:16 +05:30
Mann Mehta
331fce2203
resolve else clause formatting error
2020-04-02 04:34:47 +05:30
Mann Mehta
3bb191c116
resolve format error
2020-04-02 04:31:44 +05:30
Mann Mehta
7b19550f7f
format binary_exponent.cpp
2020-04-02 04:28:03 +05:30
Mann Mehta
4828788897
Resolve type error
2020-04-02 04:10:26 +05:30
Mann Mehta
55ff267e5e
Added comments
2020-04-02 04:09:04 +05:30
Mann Mehta
c7a50927b7
resolve compile error
2020-04-02 04:07:01 +05:30
Mann Mehta
70ac13f4a0
added binary_exponent.cpp
2020-04-02 04:03:22 +05:30
John Law
58f6815aad
Format Euler's Totient
2020-03-31 23:26:32 +02:00
Mann Mehta
1d6492bf33
resolve compilation error
2020-03-29 17:39:39 +05:30
Mann Mehta
022e2f02e7
modified by removing namespace using-directive
2020-03-29 17:36:33 +05:30
Mann Mehta
ea36236554
modified the spaces before braces
2020-03-29 17:31:34 +05:30
Mann Mehta
5b0c634269
modifed the spaces and code structure
2020-03-29 17:26:45 +05:30
Mann Mehta
7be8986c11
Added eulers totient function in math
2020-03-29 17:18:49 +05:30
cole
d099d8ee60
feat: add euclidean algorithm implementation of gcd
2019-12-28 01:10:53 -05:00
Bahadir Altun
79d50738f2
Add fast power ( #691 )
...
* Add fast power
Computes a^b in O(logN) time.
* Change long long to int64_t
* Update fast_power.cpp
* Update fast_power.cpp
* Add tests
* Update sample tests
* Update rand function
* Remove extra-spaces
2019-12-26 09:30:30 +01:00
Ajay Singh
4194b204f6
Prime ( #585 )
...
* Prime
Here we can check prime upto 10^8 in O(1). It is very useful in Competitive programming.
* Update and rename Math/Primeupto10^8.cpp to math/primes_up_to_10^8.cpp
* long long -> int64
* cstdint::int64_t
* int64_t
* std::cin
2019-12-07 08:33:23 +01:00
Akshay Gupta
bc8e8dfc2b
factorial.cpp ( #561 )
...
* Create factorial.cpp
* Update and rename Math/factorial.cpp to math/factorial.cpp
* Update factorial.cpp
* Update factorial.cpp
2019-12-05 23:02:52 +01:00
Shrikar17
525cafea94
Added factorisation technique ( #604 )
...
* Added factorisation technique
* Update and rename Math/hcf.txt to math/greatest_common_divisor.cpp
* Update greatest_common_divisor.cpp
2019-12-04 09:24:48 +01:00
5ur3
0ce3226f00
Create PrimeNumbers.cpp ( #607 )
...
* Create PrimeNumbers.cpp
* Rename Math/PrimeNumbers/PrimeNumbers.cpp to math/prime_numbers.cpp
* Trailing whitespace, std::cin, std::cout, std::endl
* std::vector
* std::vector again
2019-12-04 09:05:08 +01:00
Christian Clauss
86f0bc936d
Flatten the math directory ( #657 )
2019-11-28 14:34:13 +01:00
Christian Clauss
3fc7de16c0
rename Math -> math ( #651 )
2019-11-28 13:31:18 +01:00
