Skip to content

mtrigueira/euler

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

projecteuler.net solutions

Solutions to the first 100 problems from projecteuler.net in Java with Tests.

Java version

Class coverage Method coverage Branch coverage Line coverage Instruction coverage

  1. Multiples of 3 or 5 10 ms
  2. Even Fibonacci numbers 0 ms
  3. Largest prime factor of 600851475143 20 ms
  4. Largest palindrome product 10 ms
  5. Smallest multiple 0 ms
  6. Sum square difference 0 ms
  7. 10001st prime 147 ms
  8. Largest product in a series 10 ms
  9. Special Pythagorean triplet 4 ms
  10. Sum of primes below 2,000,000 41 ms
  11. Largest product in a grid 5 ms
  12. Highly divisible triangular number 182 ms
  13. Large sum 3 ms
  14. Longest Collatz sequence 264 ms
  15. Lattice paths 5 ms
  16. Power digit sum 1 ms
  17. Number letter counts 12 ms
  18. Maximum path sum I 0 ms
  19. Counting Sundays 0 ms
  20. Factorial digit sum 10 ms
  21. Amicable numbers 20 ms
  22. Names scores 0 ms
  23. Non-abundant sums 344 ms
  24. Lexicographic permutations 0 ms
  25. 1000-digit Fibonacci number 112 ms
  26. Reciprocal cycles 114 ms
  27. Quadratic primes 47 ms
  28. Number spiral diagonals 6 ms
  29. Distinct powers 6 ms
  30. Digit fifth powers 30 ms
  31. Coin sums 48 ms
  32. Pandigital products 235 ms
  33. Digit cancelling fractions 5 ms
  34. Digit factorials 435 ms
  35. Circular primes 50 ms
  36. Double-base palindromes 175 ms
  37. Truncatable primes 50 ms
  38. Largest pandigital multiple 25 ms
  39. Integer right triangles 47 ms
  40. Champernowne's constant 83 ms
  41. Pandigital prime 264 ms
  42. Coded triangle numbers 0 ms
  43. Pandigital primes 30 ms
  44. Pentagonal numbers 21 ms
  45. Triangular, pentagonal, and hexagonal 0 ms
  46. Goldbach's other conjecture 96 ms
  47. Distinct primes factors 184 ms
  48. Self powers 25 ms
  49. Prime permutations 14 ms
  50. Consecutive prime sum 110 ms
  51. Prime digit replacements 280 ms
  52. Permuted multiples 65 ms
  53. Combinatoric selections 35 ms
  54. Poker hands 10 ms
  55. Lychrel numbers 70 ms
  56. Powerful digit sum 30 ms
  57. Square root convergents 92 ms
  58. Spiral primes 110 ms
  59. XOR decryption 8 ms
  60. Prime pair sets 510 ms
  61. Cyclical figurate numbers 67 ms
  62. Cubic Permutations 13 ms
  63. Powerful digit counts 1 ms
  64. Odd period square roots 18 ms
  65. Convergents of e 1 ms
  66. Diophantine equation 3 ms
  67. Maximum path sum II 0 ms
  68. Magic 5-gon ring 94 ms
  69. Totient maximum 0 ms
  70. Totient permutations 171 ms
  71. Ordered fractions 0 ms
  72. Counting fractions 34 ms
  73. Counting fractions in a range 1 ms
  74. Digit factorial chains 54 ms
  75. Singular right angle triangles 72 ms
  76. Counting summations 1 ms
  77. Prime summations 121 ms
  78. Coin partitions 39 ms
  79. Passcode derivation 0 ms
  80. Square root digital expansion 87 ms
  81. Path sum: Two ways 0 ms
  82. Path sum: Three ways 3 ms
  83. Path sum: Four ways 0 ms
  84. Monopoly odds 61 ms
  85. Counting rectangles 0 ms
  86. Cuboid route 0 ms
  87. Prime power triples 135 ms
  88. Product-sum numbers 1 ms
  89. Roman numerals 2 ms
  90. Cube digit pairs 110 ms
  91. Right triangles with integer coordinates 30 ms
  92. Square digit chains 0 ms
  93. Arithmetic Expressions 450 ms
  94. Almost equal triangles 1 ms
  95. Amicable chains 100 ms
  96. Su Doku 3 ms
  97. Largest non-mersenne prime 43 ms
  98. Anagramic squares 13 ms
  99. Largest exponential 1 ms
  100. Arranged probability 0 ms

Total time: 6323 ms

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages