[MOVED TO GITLAB] Solutions for the problems from Project Euler.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
1
10
100
101
102
103
104
105
106
107
108
109
11
110
111
112
113
114
115
116
117
118
119
12
120
121
122
123
124
125
126
127
128
129
13
130
131
132
133
134
135
136
137
138
139
14
140
141
142
143
144
145
146
147
148
149
15
150
151
152
153
154
155
156
157
158
159
16
160
161
162
163
164
165
166
167
168
169
17
170
171
172
173
174
175
176
177
178
179
18
180
181
182
183
184
185
186
187
188
189
19
190
191
192
193
194
195
196
197
198
199
2
20
200
201
202
203
204
205
206
207
208
209
21
210
211
212
213
214
215
216
217
218
219
22
220
221
222
223
224
225
226
227
228
229
23
230
231
232
233
234
235
236
237
238
239
24
240
241
242
243
244
245
246
247
248
249
25
250
251
252
253
254
255
256
257
258
259
26
260
261
262
263
264
265
266
267
268
269
27
270
271
272
273
274
275
276
277
278
279
28
280
281
282
283
284
285
286
287
288
289
29
290
291
292
293
294
295
296
297
298
299
3
30
300
301
302
303
304
305
306
307
308
309
31
310
311
312
313
314
315
316
317
318
319
32
320
321
322
323
324
325
326
327
328
329
33
330
331
332
333
334
335
336
337
338
339
34
340
341
342
343
344
345
346
347
348
349
35
350
351
352
353
354
355
356
357
358
359
36
360
361
362
363
364
365
366
367
368
369
37
370
371
372
373
374
375
376
377
378
379
38
380
381
382
383
384
385
386
387
388
389
39
390
391
392 Init Oct 6, 2015
393
394
395
396
397
398
399
4
40
400
401
402
403
404
405
406
407
408
409
41
410
411
412
413
414
415
416
417
418
419
42
420
421
422
423
424
425
426
427
428
429
43
430
431
432
433
434
435
436
437
438
439
44
440
441
442
443
444
445
446
447
448
449
45
450
451
452
453
454
455
456
457
458
459
46
460
461
462
463
464
465
466
467
468
469
47
470
471
472
473
474
475
476
477
478
479
48
480
481
482
483
484
485
486
487
488
489
49
490
491
492
493
494
495
496
497
498
499
5
50
500
501
502 Init Oct 6, 2015
503
504
505
506
507
508
509
51
510
511
512
513
514
515
516
517
518
519
52
520
521
522
523
524
525
526
527
528
529
53
530
531
532
533
534
535
536
537
538
539
54
540
541
542
543
544
545
546
547
548
549
55
550
551
552
553
554
555
556
557
558
559
56
560
561
562
563
564
565
566
567
568
569
57
570
571
572
573
574
575
576
577
578
579
58
580
581
582
583
584
585
586
587
588
589
59
590
591
592
593
594
595
596
597
598
599
6
60
600
601
602
603
604
605
606
607
608
61
62
63
64
65
66
67
68
69
7
70
71
72
73
74
75
76
77
78
79
8
80
81
82
83
84
85
86
87
88
89
9
90
91
92
93
94
95
96
97
98
99
LICENSE
README.md
clean.sh
fetch.sh

README.md

Project Euler Solutions

The Project Euler is a website hosting a series of computational problems. This repository also mirrors all the problem statements (with some delay).

Statement fetcher

Use fetch.sh to fetch all the problem statements locally. See fetch.sh -h for more details.

Objectives

The main objective is to be smart and to grasp a deep understanding of every problem.

  • Write the fastest possible code under a limit condition. The 'limit' variable is to make clear that nothing is precomputed.

  • The only output should be the result.

  • Some problem solutions are not an algorithm but merely a mathematical derivation (also known as a "pen and paper" solution).

  • Code should be short and clear.

  • Focus on the algorithm, avoid language implementation-specific optmization. Hardware-specific optimizations are usually discarded, although some of them, which are the essence of computer science, can be used (e.g. binary operations).

  • Every implementation should run in less than a minute on any decent computer as suggested on the home page. Strive to keep running-time below a second, or even 10 ms on a modern computer. Compiler optimization is disabled.

  • Explain the main algorithm in head comment if needed. Point out the tricks and pitfalls, explain why some approaches would be slow.

  • If possible or reasonable, write portable code, use the standard of the language only, without external library nor external file. Every problem should be straighforward to compile and execute.

  • There might exist various solutions where complexity is unclear or where performance depends on the input. There are usually trade-offs in memory/speed or speed/code length. These implementations are kept together for comparison.

  • Code has to be proven and should not be working just because of some lucky shot. Indeed, a wrong algorithms can output the right result.

  • Some problems evolve around big numbers, thus assisting the resolution with a big number library makes the resolution trivial and pointless. The goal is to either avoid going through big numbers manipulation, or to find an efficient way to store them.

Note

A lot of solutions available on the forum and out there on the Internet are plain brute force: I think the authors missed the point. Many problems suggested on Project Euler are rather simple to implement using a naive approach. The real purpose of the project is to make you think of a fast and elegant resolution.

Contribution

Feedback on solved problems is very welcome. Please do not send me anything on problems yet to be solved.