Skip to content
Solutions to Project Euler problems http://projecteuler.net
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
04 - largest palindrome
06 - squares and sums
07 - 10001st prime
08 - largest substring product
09 - pythagorean triplet = 1000
10 - sum of primes < 2mil
11 - 20x20 grid product
12 - triangle number divisors
13 - sum of 100 50-digit nums
14 - longest sequence
15 - possible routes
16 - sum of digits in 2^1000
18 - maximum sum
20 - sum of digits in 100!
21 - sum of amicable pairs
22 - name scores
23 - abundant numbers
24 - lexographical permutation
25 - thousand digit fibonacci
28 - 1001x1001 spiral
29 - set of powers
40 - nth digit
42 - triangle words
.gitignore
README.md

README.md

This repository contains solutions (mostly in C) to Project Euler problems.

Don't look if you don't want spoilers!

Most problems can be compiled with

clang filename.c

and executed with

./a.out

Some problems require the gmp library (libgmp.org).

You can’t perform that action at this time.