mirror of
https://github.com/jlengrand/project_euler.git
synced 2026-03-10 08:41:20 +00:00
a35f0a5c3b
Initiates problem 35 First shot was ok. Problem 35 can be done with some reuse. Signed-off-by: Julien Lengrand-Lambert <julien@lengrand.fr>
17 lines
533 B
Python
17 lines
533 B
Python
#!/usr/bin/env python
|
|
"""
|
|
##---
|
|
# Julien Lengrand-Lambert
|
|
#Created on : Thu Jan 19 10:12:06 CET 2012
|
|
#
|
|
# DESCRIPTION : Solves problem 35 of Project Euler
|
|
The number, 197, is called a circular prime because all rotations of the digits:
|
|
197, 971, and 719, are themselves prime.
|
|
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
|
|
How many circular primes are there below one million?
|
|
##---
|
|
"""
|
|
|
|
if __name__ == '__main__' :
|
|
print "Answer is : %d" % (1000000)
|
|
raw_input() |