[INSHack2019]Yet Another RSA Challenge - Part 1

from output import n,p,c
import re
# print(n,p,c)

import itertools
com=itertools.product(['fc','9f'],repeat=4)
com=list(com)#组合


hex_p=hex(p)
#替换

for index,each in enumerate(com) :
    print('in for loop')
    print(index,each)
    each=list(each)
    res=re.sub('fc',lambda m:each.pop(),hex_p)
    p=int(res,16)
    if n%p==0:
        print(p)
        break

# assert 1==0
p=int(res[2:],16)
assert n%p==0
q=n//p
e=65537
phi=(p-1)*(q-1)
import libnum
d = libnum.invmod(e, phi)
m = pow(c, d, n)
print(libnum.n2s(m))