Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

Merge branch 'oops'

  • Loading branch information...
commit 28c02d9d45b531d86e85364c3b457793aecdce92 2 parents 7e8010d + b269830
@krmaxwell authored
Showing with 92 additions and 9 deletions.
  1. +11 −9 README.md
  2. +10 −0 prob10.py
  3. +61 −0 prob11.py
  4. +10 −0 prob9.py
View
20 README.md
@@ -1,11 +1,13 @@
My code for working through [Project Euler](https://projecteuler.net/).
-* **Problem 1:** COMPLETE
-* **Problem 2:** COMPLETE
-* **Problem 3:** COMPLETE
-* **Problem 4:** COMPLETE
-* **Problem 5:** COMPLETE
-* **Problem 6:** COMPLETE
-* **Problem 7:** COMPLETE
-* **Problem 8:** COMPLETE
-
+* **Problem 01:** COMPLETE
+* **Problem 02:** COMPLETE
+* **Problem 03:** COMPLETE
+* **Problem 04:** COMPLETE
+* **Problem 05:** COMPLETE
+* **Problem 06:** COMPLETE
+* **Problem 07:** COMPLETE
+* **Problem 08:** COMPLETE
+* **Problem 09:** COMPLETE
+* **Problem 10:** COMPLETE
+* **Problem 11:** in progress
View
10 prob10.py
@@ -0,0 +1,10 @@
+#!/usr/bin/python
+
+from eulerlib import *
+
+mysum = 0
+
+for n in range(2,2000000):
+ if is_prime(n):
+ mysum += n
+print "Sum is",mysum
View
61 prob11.py
@@ -0,0 +1,61 @@
+#!/usr/bin/python
+
+from array import *
+
+myprod=0
+myarray=[]
+# load data from problem
+myarray.append([8,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,8])
+myarray.append([49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00])
+myarray.append([81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65])
+myarray.append([52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91])
+myarray.append([22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80])
+myarray.append([24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50])
+myarray.append([32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70])
+myarray.append([67,26,20,68,02,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21])
+myarray.append([24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72])
+myarray.append([21,36,23,9,75,00,76,44,20,45,35,14,00,61,33,97,34,31,33,95])
+myarray.append([78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,9,53,56,92])
+myarray.append([16,39,05,42,96,35,31,47,55,58,88,24,00,17,54,24,36,29,85,57])
+myarray.append([86,56,00,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58])
+myarray.append([19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40])
+myarray.append([04,52,8,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66])
+myarray.append([88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69])
+myarray.append([04,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36])
+myarray.append([20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,04,36,16])
+myarray.append([20,73,35,29,78,31,90,01,74,31,49,71,48,86,81,16,23,57,05,54])
+myarray.append([01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,01,89,19,67,48])
+
+i=6
+j=8
+print "Test product is",myarray[i][j]*myarray[i+1][j+1]*myarray[i+2][j+2]*myarray[i+3][j+3]
+
+# first check down
+for i in range(0,16):
+ for j in range(0,19):
+ newprod = myarray[i][j]*myarray[i+1][j]*myarray[i+2][j]*myarray[i+3][j]
+ if newprod > myprod:
+ myprod = newprod
+
+# then check across
+for i in range(0,19):
+ for j in range(0,16):
+ newprod = myarray[i][j]*myarray[i][j+1]*myarray[i][j+2]*myarray[i][j+3]
+ if newprod > myprod:
+ myprod = newprod
+
+# then check NW-SE
+for i in range(0,16):
+ for j in range(0,16):
+ newprod = myarray[i][j]*myarray[i+1][j+1]*myarray[i+2][j+2]*myarray[i+3][j+3]
+ if newprod > myprod:
+ myprod = newprod
+
+# then check NE-SW
+for i in range(3,19):
+ for j in range(3,19):
+ newprod = myarray[i][j]*myarray[i-1][j-1]*myarray[i-2][j-2]*myarray[i-3][j-3]
+ if newprod > myprod:
+ myprod = newprod
+
+print "Maximum product is",myprod
View
10 prob9.py
@@ -0,0 +1,10 @@
+#!/usr/bin/python
+
+# Uses Euclid's algorithm
+for n in range(1,1000):
+ for m in range(n,1000):
+ a = m**2 - n**2
+ b = 2*m*n
+ c = m**2+n**2
+ if (a+b+c == 1000):
+ print "a=",a,", b=",b,", c=",c," product=",a*b*c
Please sign in to comment.
Something went wrong with that request. Please try again.