def permute(): global pp perm = prm(number,2) for p in perm: for num in p: pp+=num xd=str(int(pp,16)) if(len(xd)==27): digit.append(xd) pp=""
def permutations(s): return list(set([''.join(p) for p in prm(s, len(s))]))
from itertools import permutations as prm print(*map(''.join, prm(map(str, range(1, int(input()) + 1)))), sep='\n')
from itertools import permutations as prm import sys s=list(sys.stdin.readline().split('\n')[0]) a=map(int,(sys.stdin.readline().split('\n')[0]).split()) i=1 b=[] global flag while i<=len(s): z=prm(s,i) b+=z i+=1 c=[] for x in b: x=''.join(x) x=int(x) flag=0 for z in a: if (x%z)==0: flag=0 else: flag=1 break if flag==0: c.append(x) print max(c)
from itertools import permutations as prm import base58 as b58 prime = "" words = [ "First", "21digit", "prime", "found", "in", "consecutive", "digits", "of", "e", "BTC", "XRP", "ETH", "Phemex" ] number = [] digit = [] print("".join(words)) for i in words: number.append(b58.b58decode(i).hex()) #104 pp = "" perm = prm(number, 3) for p in perm: for num in p: pp += num print(pp) gg = str(int(pp, 16)) if (len(gg) == 27): digit.append(gg) print("/" * 100) pp = "" print(digit) """ all 27 digit in 3 ites computation output : '258800203769860074053924645',
symb = entry[pos] # BACKTRACKING: for coming in states: # Percorre todos os possiveis # estados em analize atualmente going = T[coming][symb] if len(going) == 0: return None # Estado sem saída # Se houver transiçao, vai para o conjunto going # de estados e analisa o proximo elemento new_transition = test(entry,going,pos+1) if new_transition != None: return new_transition return None # CRIANDO OS INPUTS DE TESTE from itertools import permutations as prm a = '' b = '' total_list = [] num_elementos = 6 for i in range(1,num_elementos+1): a = a+'a' b = b+'b' possibilidades = prm(a+b,i) # Calculo das permutaçoes de a e b para i elementos my_list = list(dict.fromkeys(list(possibilidades))) # Remove as duplicatas for c in my_list: total_list.append("".join(c)) for i in total_list: main(i)
from itertools import permutations as prm s, t = map(str, raw_input().split()) l = list(prm(s, int(t))) l.sort() for x in l: print("".join(x))