-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path031.py
executable file
·68 lines (57 loc) · 1.23 KB
/
031.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
#!/usr/bin/python
import sys
from operator import mul,add
if __name__ == '__main__':
target = 200
if len(sys.argv) == 2:
target = int(sys.argv[1])
coin_values = [1,2,5,10,20,50,100,200]
coin_values.reverse()
def split(coin):
s = []
i = 0
while coin != 0:
value = coin_values[i]
if i == len(coin_values)-1:
s += [value]
break
if value < coin or (s != [] and value == coin):
s += [value] * (coin // value)
coin = coin % value
else:
i += 1
return s
def descend(coins):
hits = 0
i = 0
while i < len(coins):
# print coins
s = split(coins[i])
coins = coins[:i] + s + coins[i+1:]
hits += 1
if coins[i] == coin_values[-1]:
i += 1
return hits
print descend([target])
#sys.exit(0)
hits = 0
coin_values = [1,2,5,10,20,50,100,200]
counts = [0]*len(coin_values)
limits = map(lambda x: target // x, coin_values)
i = 0
total = 0
while i < len(coin_values):
total = sum(map(mul, coin_values, counts))
if total == target:
hits += 1
i = 0
while i < len(coin_values):
counts[i] += 1
if counts[i] > limits[i] or sum(map(mul, coin_values, counts)) > target:
for j in xrange(0,i+1):
counts[j] = 0
i += 1
else:
break
# print counts
print hits