-
Notifications
You must be signed in to change notification settings - Fork 2
/
euler008.py
96 lines (85 loc) · 3.9 KB
/
euler008.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
"""
The four adjacent digits in the 1000-digit number that have the greatest product are
9 * 9 * 8 * 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
821663704844031**9989**0008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product.
What is the value of this product?
"""
def countDigit(numstr):
count = {}
for digit in numstr:
if digit not in count:
count[digit] = 1
else:
count[digit] += 1
return count
def getMax(num, maxStr, n, k):
for i in range(n - k):
if num[i] <= num[i + k]:
maxStr = num[i + 1:i + k + 1]
else:
lastMax = getMax(num[i + 1:], maxStr, n - i - 1, k)
# print num[i + 1:], lastMax, maxStr
# print lastMax, maxStr
count1 = countDigit(lastMax)
count2 = countDigit(maxStr)
for digit in count1:
if digit in count2:
count1[digit] -= 1
count2[digit] -= 1
# print count1, count2
sum1 = 1
sum2 = 1
# if lastMax != maxStr:
for char in count1:
sum1 *= int(char) ** count1[char]
for char in count2:
sum2 *= int(char) ** count2[char]
if sum1 >= sum2:
maxStr = lastMax
break
return maxStr
def main():
t = 1
# t = int(raw_input().strip())
for a0 in xrange(t):
n, k = 10, 5
# n, k = raw_input().strip().split(' ')
n, k = [int(n), int(k)]
num = '3675356291'
# num = raw_input().strip()
num = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
n = len(num)
k = 13
maxStr = num[0:k]
temp = getMax(num, maxStr, n, k)
sum1 = 1
print temp
for char in temp:
sum1 *= int(char)
print sum1
return 0
if __name__ == '__main__':
# print "This program is being run by itself"
main()
else:
print 'I am being imported from another module'