Krishna Vedala
|
50a113addb
|
sol1 optimized by storing abundant numbers in a condensed array
|
2020-04-02 12:28:04 -04:00 |
|
Krishna Vedala
|
baaec2a3e0
|
brute-force - compute abundant numbers every time
|
2020-04-02 12:27:23 -04:00 |
|
Krishna Vedala
|
1d780f1a2f
|
added source text file
|
2020-04-02 01:14:31 -04:00 |
|
Krishna Vedala
|
a617fb71e5
|
sort using both lazy sort and shell-sort
(cherry picked from commit 0cbea99c3e77736b571ef7702a7f6a3ce6a031be)
|
2020-04-01 23:54:35 -04:00 |
|
Krishna Vedala
|
858856ea76
|
speed optimized solution + optional OpenMP
|
2020-04-01 21:09:42 -04:00 |
|
Krishna Vedala
|
d972d473f6
|
added computational time
|
2020-04-01 19:58:45 -04:00 |
|
Krishna Vedala
|
7706011fe0
|
added additional summary
|
2020-04-01 19:41:57 -04:00 |
|
Krishna Vedala
|
2c7944864b
|
make tmp variable unsigned
|
2020-04-01 19:35:45 -04:00 |
|
Krishna Vedala
|
d8ede0523a
|
added comments
|
2020-04-01 19:31:52 -04:00 |
|
Krishna Vedala
|
9083ea41dc
|
fixed signedness
|
2020-04-01 19:26:41 -04:00 |
|
Krishna Vedala
|
b7c579f79d
|
method 1 using linked lists for digits
|
2020-04-01 19:24:12 -04:00 |
|
Krishna Vedala
|
c751359c3f
|
Project Euler / Problem 19
|
2020-04-01 12:10:59 -04:00 |
|
Krishna Vedala
|
6ff4ac36d8
|
Merge branch 'project_euler/problem_16' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 15:49:17 -04:00 |
|
Krishna Vedala
|
772da4e1ac
|
Merge branch 'project_euler/problem_15' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 15:48:28 -04:00 |
|
Krishna Vedala
|
5e2dbc583b
|
Merge branch 'project_euler/problem_14' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 15:47:30 -04:00 |
|
Krishna Vedala
|
471d3a9247
|
Merge branch 'project_euler/problem_13' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 15:46:02 -04:00 |
|
Krishna Vedala
|
079938ea7c
|
algorithm from http://www.cplusplus.com/forum/beginner/68694/
|
2020-03-30 15:43:16 -04:00 |
|
Krishna Vedala
|
1dc71abe93
|
combinatorial solution
|
2020-03-30 14:49:54 -04:00 |
|
Krishna Vedala
|
16cc1b71ff
|
added printf info
|
2020-03-30 11:42:49 -04:00 |
|
Krishna Vedala
|
6bfc6b691a
|
optimized solution with option to compile using platform independent OpenMP parallelization.
|
2020-03-30 11:25:15 -04:00 |
|
Krishna Vedala
|
944fbbea7c
|
solution using arbitrary length decimal number addition using array allocation
|
2020-03-30 10:48:24 -04:00 |
|
Krishna Vedala
|
657c317957
|
added numbers as a text file
|
2020-03-30 09:25:07 -04:00 |
|
Krishna Vedala
|
c45653e074
|
Merge branch 'project_euler/problem_12' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 08:45:31 -04:00 |
|
Krishna Vedala
|
58d1d75958
|
added algorithm summary in comments
|
2020-03-30 08:42:43 -04:00 |
|
Krishna Vedala
|
618614e5e1
|
Merge branch 'project_euler/problem_12' into project_euler/master
|
2020-03-30 00:36:47 -04:00 |
|
Krishna Vedala
|
51448a7399
|
Merge branch 'project_euler/problem_10' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 00:36:35 -04:00 |
|
Krishna Vedala
|
058da0b344
|
Merge branch 'project_euler/problem_09' into project_euler/master
* project_euler/problem_09:
updating DIRECTORY.md
optimized solution using only one loop copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py
updating DIRECTORY.md
brute force method for Euler# 09
# Conflicts:
# DIRECTORY.md
|
2020-03-30 00:33:20 -04:00 |
|
Krishna Vedala
|
f6054c5d1c
|
algorithm implemented as presented in https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol2.py
|
2020-03-30 00:24:22 -04:00 |
|
Krishna Vedala
|
ad84e9b08d
|
fixed bug when n=5000
|
2020-03-29 23:20:41 -04:00 |
|
Krishna Vedala
|
feaf57d4a3
|
fixed error when n=5000
|
2020-03-29 23:13:01 -04:00 |
|
Krishna Vedala
|
747a50d3ca
|
Euler prob# 10 using sieve of Eratosthenes
|
2020-03-29 22:23:06 -04:00 |
|
Krishna Vedala
|
266383a700
|
add new-line to printf
|
2020-03-29 22:23:05 -04:00 |
|
Krishna Vedala
|
6e6e9e3d7e
|
brute force method to find primes and add them
|
2020-03-29 22:23:04 -04:00 |
|
Krishna Vedala
|
51115bf0b9
|
optimized solution using only one loop
copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py
|
2020-03-29 21:33:58 -04:00 |
|
Krishna Vedala
|
30bc9a201f
|
brute force method for Euler# 09
|
2020-03-29 21:20:49 -04:00 |
|
Krishna Vedala
|
6dd882487e
|
an optimized solution - O(n) complexity
|
2020-03-29 20:28:46 -04:00 |
|
Krishna Vedala
|
6fa88fea35
|
brute-force method - O(n^2)
|
2020-03-29 20:28:46 -04:00 |
|
Krishna Vedala
|
0d1eb3551d
|
add input data as an ASCII text file
|
2020-03-29 20:28:32 -04:00 |
|
Aman Raj
|
b25076fb8c
|
Project Euler Solution
|
2019-10-01 19:51:55 +05:30 |
|
iamAafil
|
f4a529eb9a
|
added sol4.c
|
2019-06-11 19:02:34 +05:30 |
|
iamAafil
|
30364389ef
|
change sol1.c
|
2019-06-10 22:48:42 +05:30 |
|
AKASH JAIN
|
82436cc4e0
|
An efficient solution.
|
2018-10-27 22:32:02 +05:30 |
|
Anup Kumar Panwar
|
444d4b11d5
|
Refactor
|
2018-10-08 21:18:35 +05:30 |
|