Krishna Vedala
a376316d82
fix openmp for MSVC
2020-05-22 20:35:03 -04:00
Krishna Vedala
38e0a2354c
warning free print uint64
2020-04-24 07:41:24 -04:00
Krishna Vedala
42f56b62ac
use signed int for openmp for loop
2020-04-23 20:59:02 -04:00
Krishna Vedala
9451beb977
more mallocs
2020-04-23 20:53:53 -04:00
Krishna Vedala
dee56f7781
move openmp loop variable outside
2020-04-23 20:17:32 -04:00
Krishna Vedala
5185ebaa03
Merge branch 'project_euler'
...
* project_euler:
updating DIRECTORY.md
+project euler problem 401
# Conflicts:
# DIRECTORY.md
2020-04-23 16:57:45 -04:00
Krishna Vedala
509454680e
+project euler problem 401
2020-04-23 16:31:59 -04:00
Krishna Vedala
44a89fb3ba
fixed stdint.h artefact
2020-04-08 10:02:08 -04:00
Krishna Vedala
66ef12de2c
remove stdint.h dependency
2020-04-08 09:59:44 -04:00
Krishna Vedala
63206ab47a
use long long int for printf compatibility
2020-04-08 09:48:04 -04:00
Krishna Vedala
de027fe4ff
using long long int for pritf compatibility
2020-04-08 09:46:44 -04:00
Krishna Vedala
1b826807ed
code cleanup to prevent gcc warnings
2020-04-08 09:41:12 -04:00
Krishna Vedala
99f299d172
Merge branch 'master' into project_euler/master2
2020-04-07 10:41:35 -04:00
Krishna Vedala
860b1fd501
added stdint.h for fixed width ints
2020-04-07 00:41:14 -04:00
Krishna Vedala
6a09ade47d
added stdint.h for fixed width ints
2020-04-07 00:39:42 -04:00
Krishna Vedala
fe5c6a724d
replace uint8 with unsigned char
2020-04-07 00:37:24 -04:00
Krishna Vedala
2d9d2d87fe
using the new function_timer library
2020-04-07 00:24:40 -04:00
Krishna Vedala
d24b6ea344
added option to enable or disable use of openmp
2020-04-07 00:24:13 -04:00
Krishna Vedala
1e7fc84c3a
added cmake to project euler
2020-04-07 00:12:34 -04:00
Krishna Vedala
855c9124b8
added stdint.h for integer length typedefs
2020-04-03 08:10:28 -04:00
Krishna Vedala
daca8c97e2
brute-force method
2020-04-02 23:50:51 -04:00
Krishna Vedala
1914f98fcd
Merge branch 'project_euler/problem_25' into project_euler/master2
...
* project_euler/problem_25:
solution using arbitrary number of digits took 11ms
2020-04-02 20:15:57 -04:00
Krishna Vedala
3032428b65
Merge branch 'project_euler/problem_24' into project_euler/master2
...
* project_euler/problem_24:
algorithm by Dijkstra
2020-04-02 20:15:48 -04:00
Krishna Vedala
52b83e3ca6
Merge branch 'project_euler/problem_23' into project_euler/master2
...
* project_euler/problem_23:
updating DIRECTORY.md
move time computation inside loop + comments
faster parallleization
time computation inside the loop & print loop info
added comments
sol1 optimized by storing abundant numbers in a condensed array
brute-force - compute abundant numbers every time
# Conflicts:
# DIRECTORY.md
2020-04-02 20:15:39 -04:00
Krishna Vedala
c0eaae7546
Merge branch 'project_euler/problem_22' into project_euler/master2
...
* project_euler/problem_22:
added source text file
updating DIRECTORY.md
sort using both lazy sort and shell-sort
# Conflicts:
# DIRECTORY.md
2020-04-02 20:13:14 -04:00
Krishna Vedala
3077a981dd
Merge branch 'project_euler/problem_21' into project_euler/master2
...
* project_euler/problem_21:
updating DIRECTORY.md
speed optimized solution + optional OpenMP
# Conflicts:
# DIRECTORY.md
2020-04-02 20:10:30 -04:00
Krishna Vedala
feec93558c
Merge branch 'project_euler/problem_19' into project_euler/master2
...
* project_euler/problem_19:
updating DIRECTORY.md
Project Euler / Problem 19
# Conflicts:
# DIRECTORY.md
2020-04-02 20:08:51 -04:00
Krishna Vedala
8279092455
solution using arbitrary number of digits
...
took 11ms
(cherry picked from commit 54e3cdc92f81bebe8678257916766b5b8af9b2b0)
2020-04-02 20:02:22 -04:00
Krishna Vedala
eecdadecd4
algorithm by Dijkstra
2020-04-02 18:23:12 -04:00
Krishna Vedala
fa24b792a7
move time computation inside loop + comments
2020-04-02 13:26:54 -04:00
Krishna Vedala
3598708121
faster parallleization
2020-04-02 13:25:26 -04:00
Krishna Vedala
ba31018aef
time computation inside the loop & print loop info
2020-04-02 13:23:51 -04:00
Krishna Vedala
f34164e601
added comments
2020-04-02 13:15:25 -04:00
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
