昂

昂

昂昂昂

当年CSDN密码泄露，大家还没注意到程序员的逆天密码能力么？
密码：ppnn13%dkstFeb.1st，
解释：娉娉袅袅十三余，豆蔻梢头二月初
密码：Tree_0f0=sprintf(“2_Bird_ff0/a”)
解释：两个黄鹂鸣翠柳
密码：csbt34.ydhl12s
解释：池上碧苔三四点，叶底黄鹂一两声
密码：for$n(@RenSheng)$n+=”die”
解释：人生自古谁无死
密码：while(1)Ape1Cry&&Ape2Cry
解释：两岸猿声啼不住
密码：doWhile(1){LeavesFly();YangtzeRiverFlows();
解释：无边落木萧萧下，不尽长江滚滚来
密码：tcmlflw,syred>febhua]
解释：停车坐爱枫林晚，霜叶红于二月花
密码：dig?F*ckDang5
解释：锄禾日当午
密码： 1dcypsz1/2jss1/2j#f00
解释：一道残阳铺水中，半江瑟瑟半江红
密码：ps!see(5tl)shit!say(man)
解释：平生不看武腾兰，便称男人也枉然

from itertools import *
impossible = {'19': '5',
'13': '2',
'91': '5',
'97': '8',
'73': '5',
'71': '4',
'93': '6',
'17': '4',
'46': '5',
'28': '5',
'31': '2',
'64': '5',
'37': '5',
'79': '8',
'39': '6',
'82': '5'}
def counts():
iterlst = chain(*(permutations('123456789', i) for i in range(4, 10)))
count = 0
for i in iterlst:
stri = ''.join(i)
for k, v in impossible.items():
if k in stri and v not in stri[:stri.find(k)]:
break
else:
count += 1
return count
print(counts())

from itertools import *
impossible = {'19': '5',
'13': '2',
'91': '5',
'97': '8',
'73': '5',
'71': '4',
'93': '6',
'17': '4',
'46': '5',
'28': '5',
'31': '2',
'64': '5',
'37': '5',
'79': '8',
'39': '6',
'82': '5'}
def counts():
iterlst = chain(*(permutations('123456789', i) for i in range(4, 10)))
count = 0
for i in iterlst:
stri = ''.join(i)
for k, v in impossible.items():
if k in stri and v not in stri[:stri.find(k)]:
break
else:
count += 1
return count
print(counts())

from itertools import *
impossible = {'19': '5',
'13': '2',
'91': '5',
'97': '8',
'73': '5',
'71': '4',
'93': '6',
'17': '4',
'46': '5',
'28': '5',
'31': '2',
'64': '5',
'37': '5',
'79': '8',
'39': '6',
'82': '5'}
def counts():
iterlst = chain(*(permutations('123456789', i) for i in range(4, 10)))
count = 0
for i in iterlst:
stri = ''.join(i)
for k, v in impossible.items():
if k in stri and v not in stri[:stri.find(k)]:
break
else:
count += 1
return count
print(counts())

from itertools import *
impossible = {'19': '5',
'13': '2',
'91': '5',
'97': '8',
'73': '5',
'71': '4',
'93': '6',
'17': '4',
'46': '5',
'28': '5',
'31': '2',
'64': '5',
'37': '5',
'79': '8',
'39': '6',
'82': '5'}
def counts():
iterlst = chain(*(permutations('123456789', i) for i in range(4, 10)))
count = 0
for i in iterlst:
stri = ''.join(i)
for k, v in impossible.items():
if k in stri and v not in stri[:stri.find(k)]:
break
else:
count += 1
return count
print(counts())

当年CSDN密码泄露，大家还没注意到程序员的逆天密码能力么？
密码：ppnn13%dkstFeb.1st，
解释：娉娉袅袅十三余，豆蔻梢头二月初
密码：Tree_0f0=sprintf(“2_Bird_ff0/a”)
解释：两个黄鹂鸣翠柳
密码：csbt34.ydhl12s
解释：池上碧苔三四点，叶底黄鹂一两声
密码：for$n(@RenSheng)$n+=”die”
解释：人生自古谁无死
密码：while(1)Ape1Cry&&Ape2Cry
解释：两岸猿声啼不住
密码：doWhile(1){LeavesFly();YangtzeRiverFlows();
解释：无边落木萧萧下，不尽长江滚滚来
密码：tcmlflw,syred>febhua]
解释：停车坐爱枫林晚，霜叶红于二月花
密码：dig?F*ckDang5
解释：锄禾日当午
密码： 1dcypsz1/2jss1/2j#f00
解释：一道残阳铺水中，半江瑟瑟半江红
密码：ps!see(5tl)shit!say(man)
解释：平生不看武腾兰，便称男人也枉然

当年CSDN密码泄露，大家还没注意到程序员的逆天密码能力么？
密码：ppnn13%dkstFeb.1st，
解释：娉娉袅袅十三余，豆蔻梢头二月初
密码：Tree_0f0=sprintf(“2_Bird_ff0/a”)
解释：两个黄鹂鸣翠柳
密码：csbt34.ydhl12s
解释：池上碧苔三四点，叶底黄鹂一两声
密码：for$n(@RenSheng)$n+=”die”
解释：人生自古谁无死
密码：while(1)Ape1Cry&&Ape2Cry
解释：两岸猿声啼不住
密码：doWhile(1){LeavesFly();YangtzeRiverFlows();
解释：无边落木萧萧下，不尽长江滚滚来
密码：tcmlflw,syred>febhua]
解释：停车坐爱枫林晚，霜叶红于二月花
密码：dig?F*ckDang5
解释：锄禾日当午
密码： 1dcypsz1/2jss1/2j#f00
解释：一道残阳铺水中，半江瑟瑟半江红
密码：ps!see(5tl)shit!say(man)
解释：平生不看武腾兰，便称男人也枉然

飘过