Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def isprime(n):
- if n == 2:
- return 1
- if n % 2 == 0:
- return 0
- mx = n**0.5+1
- i = 3
- while i <= mx:
- if n % i == 0:
- return 0
- i+=2
- return 1
- print("------------------")
- i = 0
- primes = []
- orig = [2, 9, 8, 1, 2, 3]
- for i1 in range(6):
- for i2 in range(5):
- for i3 in range(4):
- for i4 in range(3):
- for i5 in range(2):
- num = 0
- temp = orig[:]
- num *= 10
- num += temp[i1]
- for o in range(i1, 5):
- temp[o] = temp[o+1]
- num *= 10
- num += temp[i2]
- for o in range(i2, 4):
- temp[o] = temp[o+1]
- num *= 10
- num += temp[i3]
- for o in range(i3, 3):
- temp[o] = temp[o+1]
- num *= 10
- num += temp[i4]
- for o in range(i4, 2):
- temp[o] = temp[o+1]
- num *= 10
- num += temp[i5]
- for o in range(i5, 1):
- temp[o] = temp[o+1]
- num *= 10
- num += temp[0]
- if (isprime(num)):
- if num not in primes:
- primes.append(num)
- print(num)
- i += 1
- print(i)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement