Commit Graph

249 Commits

Author SHA1 Message Date
d2d19d3efa Added bigint header file and edited the solution to include bigint to correctly handle the large numbers 2021-11-10 13:07:18 +01:00
Philippe Zwietering
26b32ce7c8 Woops had a erroneous function in problem 066 2021-11-09 16:12:37 +01:00
Philippe Zwietering
2477b229d5 Found the solution for 066, now just have to work out the implementation 2021-11-09 16:11:25 +01:00
aafaeb91fc I solved it by using someones pseudocode and to be honest I don't completely understand how it works 2021-11-06 13:48:12 +01:00
7430bccec9 Finished 62 in a jiffy, wasn't hard when using a sorted list to keep track of the found cubes 2021-11-02 13:50:35 +01:00
f649acf5a3 Did it all on my own, while being incredibly quick at the same time, very proud 2021-11-02 12:55:06 +01:00
7eaf59bb45 Changed the folder structure of codeforces problemsets 2021-11-02 12:54:37 +01:00
5c71f0bbdd Changed the base to include all includes 2021-10-30 21:46:56 +02:00
38ad5e4d1f Cleaned up project euler folder and moved the license and readme 2021-10-30 19:59:38 +02:00
e0c627a384 Rebased projecteuler folder, now includes all contest programming stuff 2021-10-26 10:54:24 +02:00
1aa6120838 Easy one tussendoor met hulp van Miekster 2021-05-15 00:23:57 +02:00
1879be093d Started on 061, did a lot of stuff that was really really slow, now try to use bit masking 2021-04-29 21:53:12 +02:00
dff7d5b48e Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/project-euler 2021-04-26 19:07:47 +02:00
4821130440 Added 061 to cmake 2021-04-26 19:07:44 +02:00
5e43dee9cc Forgot to commit solution of 59, copied from internet 2021-04-26 00:10:41 +02:00
85574d755f Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/project-euler 2021-04-26 00:06:51 +02:00
57f6869306 Added all warnings to cmake 2021-04-26 00:06:45 +02:00
462b7138a0 Added std to cout because vscode was a lil' bitch 2021-04-20 23:23:56 +02:00
bfb2a5fe85 Found the five pairwise concatative prime number 2021-04-20 23:08:20 +02:00
d4a063ef64 Started on 060 2021-04-19 16:14:58 +02:00
0b15db7b92 Well that truly cost me some grey hairs 2021-04-19 00:55:03 +02:00
4d657b5506 work in progress 2021-04-17 21:49:11 +02:00
a92e4b6429 Added cmakelists and changed externals file structure 2021-04-16 17:57:58 +02:00
197b3eea8a Renamed all folders 2021-04-16 16:58:48 +02:00
dbc6cfef05 From now on programming in C++, no Python cheats anymore 2021-04-16 16:54:43 +02:00
17d591c658 For some reason the execution time is very variable, also I learned that sympy isprime exists 2021-04-11 02:14:57 +02:00
fd9f4b7a49 Had it run 10 times too many integers woops, but still easy to solve 2021-04-10 00:48:31 +02:00
fbfce7984e Brute forcing all day 2021-04-09 16:16:42 +02:00
f5aaf8e36a Not that hard, just a loopty loop and keep track of which ones you did already 2021-04-08 18:11:54 +02:00
6661d47747 I wouldn't call it hard, it was just a metric shitton of work to get all cases handled correctly 2021-04-08 16:09:20 +02:00
c712043c4c Gotta love these easy ones 2021-04-06 10:19:08 +02:00
cc10f8f4e0 52 was so easy that at first I thought my code was bugged 2021-04-06 01:56:27 +02:00
a4d31debeb Strictly speaking this algorithm has an O(n^2) part in it, but it runs under a second so... 2021-04-06 01:16:05 +02:00
3f1859d923 Testing gitea migration to privately owned server 2021-03-28 03:12:48 +02:00
a4363d2e24 Added 51 description and first observrations 2021-03-25 00:10:00 +01:00
906fa69004 Misinterpreted that questin multiple times, finally just did an exhaustive search 2021-03-12 01:11:59 +01:00
9bb3ada0ba Tricky one, but quick code 2021-03-06 18:43:50 +01:00
1eaf67e3f0 Remember that 0^0 is not 0, or at least not implemented as such (what it truly is is a mystery) 2021-03-06 17:51:52 +01:00
df64e1015d Quite a slow solution for 47, but it works 2021-03-06 01:32:47 +01:00
f7ee0fca41 Finished 46 with quite a quick algorithm 2021-03-06 00:57:36 +01:00
731aecfad3 45 really easy once you can quickly verify pentagonal numbers 2021-03-02 00:03:01 +01:00
ead9f6e82d Not even that slow of a solution for 44 2021-03-01 23:45:01 +01:00
ac3557e3f2 43 done, not too bad 2021-02-27 23:34:17 +01:00
126ed459a0 42 was too easy, can't be the answer to everything 2021-02-27 22:46:09 +01:00
01c47248bf Oof I feel ashamed by having written this code, 41 2021-02-26 01:43:39 +01:00
de82029eef Basically just indexing, god python is easy 2021-02-26 01:02:00 +01:00
0b13772d44 Finished the pythagorean triangle circumferences 2021-02-26 00:52:25 +01:00
136d9e8bd2 Found highest pandigital concat product 2021-02-26 00:22:50 +01:00
8eab5128a1 Dumb solution is quick enough so me do dumb solution 2021-02-25 23:37:52 +01:00
2726c2d2ca Finished 36, was really easy 2021-02-23 16:33:00 +01:00