jlengrand/project_euler
1
0
Fork 0
mirror of https://github.com/jlengrand/project_euler.git synced 2026-03-10 08:41:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Solves Problem 33 (coin change). Adds some new problems

Browse Source
This commit is contained in:
julien Lengrand-Lambert
2012-05-02 09:05:08 +02:00
parent f09f83e0a4
commit a00fe0fab3
6 changed files with 116 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
e_41.py Normal file
View File

@@ -0,0 +1,15 @@
#!/usr/bin/env python
'''
Created on 10 feb. 2012
@author: Julien Lengrand-Lambert
DESCRIPTION: Solves problem 41 of Project Euler
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
What is the largest n-digit pandigital prime that exists?
'''
if __name__ == '__main__':
print 1
#print "Answer : %d " % (last_ten())