第十三届蓝桥杯大赛软件赛决赛Python 大学 B 组

斐波那契与7

AC

# a = []
# for _ in range(12):
#     t = list(map(int ,input().split()))
#     for x in t:
#         a.append(x)
# # print(len(a))
# r =  202202011200
# sum = [0]*100
# if a[0]==7:
#     sum[0]=1
# for i in range(1,60):
#     if a[i]==7:
#         sum[i]=sum[i-1]+1
#     else :
#         sum[i]=sum[i-1]
# cnt =sum[59]
# res =0
# res+=(r//60)*cnt
# r= r%60
# res+=(sum[r-1])
# print(res)
print(26960268160)

# input

# 1 1 2 3 5 
# 8 3 1 4 5
# 9 4 3 7 0 
# 7 7 4 1 5 
# 6 1 7 8 5 
# 3 8 1 9 0 
# 9 9 8 7 5 
# 2 7 9 6 5 
# 1 6 7 3 0 
# 3 3 6 9 5 
# 4 9 3 2 5 
# 7 2 9 1 0

取模

AC

def solve():
    n,m  =map(int ,input().split())
    vis = {}
    flag  = False
    for i in range(1,m+1):
        yu = n % i
        if yu in vis:
            flag = True
            brea