[ create a new paste ] login | about

Link: http://codepad.org/kb50OJYq    [ raw code | output | fork ]

tenten321 - Python, pasted on Jan 1:
#Project Euler 5:
#What is the smallest number divisible by each of the numbers 1 to 20 (or n)?

#Runtime, iteration setup:
import time
start = time.time()
global bigO 
bigO = 0

#Init:
n=20
primes=[]

#First, find the primes between 1 and n:
for i in range(2,n+1):
  print "i ",i
  for p in primes:
    print "p ",p
    if i%p == 0:
      print i, " is not prime."
      break
  primes.append(i)
  print primes

print primes


Output:
i  2
[2]
i  3
p  2
[2, 3]
i  4
p  2
4  is not prime.
[2, 3, 4]
i  5
p  2
p  3
p  4
[2, 3, 4, 5]
i  6
p  2
6  is not prime.
[2, 3, 4, 5, 6]
i  7
p  2
p  3
p  4
p  5
p  6
[2, 3, 4, 5, 6, 7]
i  8
p  2
8  is not prime.
[2, 3, 4, 5, 6, 7, 8]
i  9
p  2
p  3
9  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9]
i  10
p  2
10  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10]
i  11
p  2
p  3
p  4
p  5
p  6
p  7
p  8
p  9
p  10
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
i  12
p  2
12  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
i  13
p  2
p  3
p  4
p  5
p  6
p  7
p  8
p  9
p  10
p  11
p  12
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
i  14
p  2
14  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]
i  15
p  2
p  3
15  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]
i  16
p  2
16  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]
i  17
p  2
p  3
p  4
p  5
p  6
p  7
p  8
p  9
p  10
p  11
p  12
p  13
p  14
p  15
p  16
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]
i  18
p  2
18  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]
i  19
p  2
p  3
p  4
p  5
p  6
p  7
p  8
p  9
p  10
p  11
p  12
p  13
p  14
p  15
p  16
p  17
p  18
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
i  20
p  2
20  is not prime.
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]
[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]


Create a new paste based on this one


Comments: