flip/contests
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
72 Commits 1 Branch 0 Tags
fbfce7984ea0b75908e7495eced142eb11189028
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
Philippe Zwietering fbfce7984e Brute forcing all day
2021-04-09 16:16:42 +02:00
1
Added problem description for future reference
2020-03-28 03:30:25 +01:00
2
Finished problem 2: sum of even fibonacci numbers
2020-03-28 03:30:48 +01:00
3
Technically was a bug in 3
2020-03-29 04:02:44 +02:00
4
Finished 4, palindrome was 906609
2020-03-28 18:19:36 +01:00
5
Finished 5, rather ugly, but answer is 232792560
2020-03-28 18:51:09 +01:00
6
6 was rather easy, answer 25164150
2020-03-28 18:57:32 +01:00
7
Finished 7
2020-03-29 04:03:01 +02:00
8
Found the biggest, 23514624000
2020-03-30 21:38:44 +02:00
9
Finished 9, easy brute force solution
2020-03-31 00:46:27 +02:00
10
Finished 10, finally learned to write a proper friggin sieve
2020-03-31 00:49:32 +02:00
11
Finished 11, always remember there are 2 diagonals
2020-03-31 15:33:02 +02:00
12
Work in progress, 15 doesn't work like intended
2020-04-07 11:41:01 +02:00
13
This was probably the easiest problem so far, Python is just cheating
2020-04-05 14:48:53 +02:00
14
Found the longest Collatz chain: 837799
2020-04-05 15:36:53 +02:00
15
Finally finished, learned how not init nested array
2020-04-09 02:14:55 +02:00
16
Forgot to add problem description
2020-04-09 02:39:45 +02:00
17
I learned that 18 is spelled as eighteen
2020-04-09 03:02:24 +02:00
18
Finished with a divide and conquer approach, max sum is 1074
2020-04-11 22:38:23 +02:00
19
Was lazy, used datetime library for this
2020-04-11 22:56:17 +02:00
20
Forgot problem description
2020-04-11 23:08:54 +02:00
21
Python is frustratingly weird with equality checks
2020-04-12 01:09:31 +02:00
22
Finished 23, pretty darn slow and ugly solution
2020-04-14 00:37:45 +02:00
23
Finished 23, pretty darn slow and ugly solution
2020-04-14 00:37:45 +02:00
24
Really fast solution, not bruteforce
2020-04-14 18:36:37 +02:00
25
First 25 done. I still feel dirty for using Python
2020-04-14 21:14:18 +02:00
26
Finally finished 26, think I did it good enough
2020-11-08 01:57:52 +01:00
27
Ok so this solution is supersuperslow but it worked
2020-11-08 22:09:34 +01:00
28
That one was easy
2020-11-08 22:45:13 +01:00
29
Very easy to do in Python
2020-11-08 22:54:08 +01:00
30
Easy bruteforce solution
2020-11-08 23:28:22 +01:00
31
Standard coin change algorithm
2020-11-09 00:35:30 +01:00
32
Solved the pandigits, tried to do it way more complicated than necessary at first
2021-02-13 20:14:10 +01:00
33
Manually edit end result to simplified fraction
2021-02-22 20:51:32 +01:00
34
34 done, that was way too easy haha
2021-02-22 21:04:13 +01:00
35
35 done, slow but it works
2021-02-22 21:35:25 +01:00
36
Finished 36, was really easy
2021-02-23 16:33:00 +01:00
37
Dumb solution is quick enough so me do dumb solution
2021-02-25 23:37:52 +01:00
38
Found highest pandigital concat product
2021-02-26 00:22:50 +01:00
39
Finished the pythagorean triangle circumferences
2021-02-26 00:52:25 +01:00
40
Basically just indexing, god python is easy
2021-02-26 01:02:00 +01:00
41
Oof I feel ashamed by having written this code, 41
2021-02-26 01:43:39 +01:00
42
42 was too easy, can't be the answer to everything
2021-02-27 22:46:09 +01:00
43
43 done, not too bad
2021-02-27 23:34:17 +01:00
44
Not even that slow of a solution for 44
2021-03-01 23:45:01 +01:00
45
45 really easy once you can quickly verify pentagonal numbers
2021-03-02 00:03:01 +01:00
46
Finished 46 with quite a quick algorithm
2021-03-06 00:57:36 +01:00
47
Quite a slow solution for 47, but it works
2021-03-06 01:32:47 +01:00
48
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
49
Tricky one, but quick code
2021-03-06 18:43:50 +01:00
50
Misinterpreted that questin multiple times, finally just did an exhaustive search
2021-03-12 01:11:59 +01:00
51
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
52
52 was so easy that at first I thought my code was bugged
2021-04-06 01:56:27 +02:00
53
Gotta love these easy ones
2021-04-06 10:19:08 +02:00
54
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
55
Not that hard, just a loopty loop and keep track of which ones you did already
2021-04-08 18:11:54 +02:00
56
Brute forcing all day
2021-04-09 16:16:42 +02:00
.gitignore
Added vs code to gitignore
2021-02-13 15:08:32 +01:00
base.py
Gotta love these easy ones
2021-04-06 10:19:08 +02:00
LICENSE
Initial commit
2020-03-30 21:49:44 +02:00
README.md
Initial commit
2020-03-30 21:49:44 +02:00

README.md

project-euler

My personal (usually not optimized) solutions for the Project Euler challenges

Description
My (often not so optimized) solutions for all kinds of coding competitions and programming puzzle solving websites.
Readme MIT 1.1 MiB
Languages
Rust 49.4%
C++ 32.3%
Python 18.2%