My programs which I used to solve ProjectEuler problems.
I guess only easy problems will be solved.
for n in range(1,63):
- Problem n
and:
- Problem 67 - Maximum path sum II
- Problem 69 - Totient maximum
- Problem 71 - Ordered fractions
- Problem 73 - Counting fractions in a range
- Problem 74 - Digit factorial chains
- Problem 75 - Singular integer right triangles
- Problem 76 - Counting summations
- Problem 79 - Passcode derivation
- Problem 81 - Path sum: two ways
- Problem 82 - Path sum: three ways
- Problem 83 - Path sum: four ways
- Problem 85 - Counting rectangles
- Problem 86 - Cuboid route
- Problem 91 - Right triangles with integer coordiantes
- Problem 92 - Square digit chains
- Problem 96 - Su Doku
- Problem 97 - Lathe non-Mersenne prime
- Problem 99 - Largest exponential
- Problem 102 - Triangle containment
- Problem 107 - Minimal network
- Problem 109 - Darts
- Problem 112 - Bouncy numbers
- Problem 125 - Palindromic sums
- Problem 127 - abc-hits
- Problem 116 - Red, green or blue tiles
- Problem 117 - Red, green and blue tiles
- Problem 124 - Ordered radicals
- Problem 144 - Investigating multiple reflections of a laser beam
- Problem 173 - Hollow square laminaes
- Problem 179 - Consecutive positive divisors
- Problem 187 - Semiprimes
- Problem 188 - The hyperexponentiation of a number
- Problem 191 - Prize Strings
- Problem 203 - Squarefree Binomial Coefficients
- Problem 204 - Generalised Hamming Numbers
- Problem 205 - Dice Game
- Problem 206 - Concealed square
- Problem 345 - Matrix Sum
- Problem 357 - Prime generating integers
- Problem 387 - Harshad Numbers
- Problem 587 - Concave triangle