目录
#解题思路:拼数字的话1的卡片肯是用的最快的
num=0
for i in range(1,10000):
num+=str(i).count("1")
if 2021 == num:
print(i)
break
3181
40257
import time
start = time.perf_counter()
n = 4 #2021041820210418
ans = [] # 记录所有能把N整除的整数
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
case = set() #以元组形式记录符合条件的每种方案set()可以去重
#print(ans)
for i in ans:
for j in ans:
for k in ans:
if i * j * k == n:
case.add((i, j, k))
print(len(case)) #元组个数即答案
end = time.perf_counter()
print('Running time: %s Seconds' % (end - start))
2430
文章来源互联网,如有侵权,请联系管理员删除。邮箱:417803890@qq.com / QQ:417803890
Python Free
邮箱:417803890@qq.com
QQ:417803890
皖ICP备19001818号-4
© 2019 copyright www.pythonf.cn - All rights reserved
微信扫一扫关注公众号:
Python Free