Submission #2514404

---

Source Code Expand

import itertools

S = input()
st = list(set(S))
if len(st) > 5:
    print(-1)
    exit()

def is_prime(n):
    if n < 2: return False
    if n == 2: return True
    if n%2 == 0: return False
    m = 3
    while m*m <= n:
        if n%m == 0: return False
        m += 2
    return True

for comb in itertools.combinations('13579',len(st)):
    for ptn in itertools.permutations(comb):
        ns = S
        for d,c in zip(ptn,st):
            ns = ns.replace(c,d)
        if is_prime(int(ns)):
            print(ns)
            exit()
print(-1)

Submission Info

Judge Result