1. Miki Tebeka
  2. euler

Commits

Miki Tebeka  committed 8949bb6

8 & 9

  • Participants
  • Parent commits 0d6fb83
  • Branches default

Comments (0)

Files changed (2)

File julia/8.jl

View file
+# Find the greatest product of five consecutive digits in the 1000-digit number.
+# 
+# 73167176531330624919225119674426574742355349194934
+# 96983520312774506326239578318016984801869478851843
+# 85861560789112949495459501737958331952853208805511
+# 12540698747158523863050715693290963295227443043557
+# 66896648950445244523161731856403098711121722383113
+# 62229893423380308135336276614282806444486645238749
+# 30358907296290491560440772390713810515859307960866
+# 70172427121883998797908792274921901699720888093776
+# 65727333001053367881220235421809751254540594752243
+# 52584907711670556013604839586446706324415722155397
+# 53697817977846174064955149290862569321978468622482
+# 83972241375657056057490261407972968652414535100474
+# 82166370484403199890008895243450658541227588666881
+# 16427171479924442928230863465674813919123162824586
+# 17866458359124566529476545682848912883142607690042
+# 24219022671055626321111109370544217506941658960408
+# 07198403850962455444362981230987879927244284909188
+# 84580156166097919133875499200524063689912560717606
+# 05886116467109405077541002256983155200055935729725
+# 71636269561882670428252483600823257530420752963450
+#
+# Answer: 40824
+
+
+n = replace("""
+73167176531330624919225119674426574742355349194934
+96983520312774506326239578318016984801869478851843
+85861560789112949495459501737958331952853208805511
+12540698747158523863050715693290963295227443043557
+66896648950445244523161731856403098711121722383113
+62229893423380308135336276614282806444486645238749
+30358907296290491560440772390713810515859307960866
+70172427121883998797908792274921901699720888093776
+65727333001053367881220235421809751254540594752243
+52584907711670556013604839586446706324415722155397
+53697817977846174064955149290862569321978468622482
+83972241375657056057490261407972968652414535100474
+82166370484403199890008895243450658541227588666881
+16427171479924442928230863465674813919123162824586
+17866458359124566529476545682848912883142607690042
+24219022671055626321111109370544217506941658960408
+07198403850962455444362981230987879927244284909188
+84580156166097919133875499200524063689912560717606
+05886116467109405077541002256983155200055935729725
+71636269561882670428252483600823257530420752963450
+""", "\n", "")
+
+function prod5(start)
+    return prod(map(i -> integer(n[i:i]), start:start+4))
+end
+
+println(maximum(map(prod5, 1:length(n)-5)))

File julia/9.jl

View file
+# A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
+# a^(2) + b^(2) = c^(2)
+# 
+# For example, 3^(2) + 4^(2) = 9 + 16 = 25 = 5^(2).
+# 
+# There exists exactly one Pythagorean triplet for which a + b + c = 1000.
+# Find the product abc.
+#
+# Answer: 31875000
+
+function triplets()
+    function inner()
+        for a = 1:999
+            for b = 1:(999-a)
+                produce(a, b, 1000-a-b)
+            end
+        end
+    end
+    return @task inner()
+end
+
+for (a, b, c) = triplets()
+    if a^2 + b^2 == c^2
+        println(a * b * c)
+        break
+    end
+end