mirror of
https://github.com/jlengrand/project_euler.git
synced 2026-03-10 08:41:20 +00:00
6eb94866e1
to be very ugly. I'm sure I can find something better than that ! Still have to perform some good work on prime numbers! (one day . . . ) I begin to lack some primes problems cause of that :s Signed-off-by: Julien Lengrand-Lambert <julien@lengrand.fr>
24 lines
608 B
Python
24 lines
608 B
Python
#!/usr/bin/env python
|
|
'''
|
|
Created on 10 feb. 2012
|
|
|
|
@author: Julien Lengrand-Lambert
|
|
|
|
DESCRIPTION: Solves problem 31 of Project Euler
|
|
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
|
|
|
|
1p, 2p, 5p, 10p, 20p, 50p, L1 (100p) and L2 (200p).
|
|
It is possible to make L2 in the following way:
|
|
|
|
1 * L1 + 1 * 50p + 2 * 20p + 1 * 5p + 1 * 2p + 3 * 1p
|
|
How many different ways can L2 be made using any number of coins?
|
|
'''
|
|
def aaa():
|
|
"""
|
|
Returns
|
|
"""
|
|
return 1
|
|
|
|
if __name__ == '__main__':
|
|
print "Answer : %d " % (1)
|