A:斐波那契与7
ed=202202011200
a=1
b=1
res=0
'''
for i in range(3,10000+1):
c=(a+b)%10
#print(a,b,c)
if c==7:
res+=1
print(i,res)
a=b
b=c
'''
print(ed//60*8)
#26960268160
B:小蓝做实验
f=open("primes.txt")
a=[]
for i in f:a.append(i.strip())
print(a)
C:取模
for _ in range(int(input())):
n,m=map(int,input().split())
dic={}
for i in range(1,m+1):
t=n%i
if t in dic:
print("Yes")
break
dic[t]=1
else:print("No")
D: 内存空间
res=0
for _ in range(int(input())):
#print(res)
s=input()
if "[]" not in s:
if s[0]=='i':
x=s.count(",")+1
res+=x*4
elif s[0]=='l':
x=s.count(",")+1
res+=x*8
else:
cnt=0
for i in s:
if i=="\"":
if cnt==0:cnt=1
else:
res+=cnt-1
cnt=0
elif cnt:cnt+=1
else:
if s[0]=="i":
cnt=0
for i in range(len(s)):
if s[i]=="[" and s[i+1]!="]":
for j in range(i+1,len(s)):
if s[j]=="]":
x=int(s[i+1:j:])
res+=x*4
break
elif s[0]=="l":
cnt=0
for i in range(len(s)):
if s[i]=="[" and s[i+1]!="]":
for j in range(i+1,len(s)):
if s[j]=="]":
x=int(s[i+1:j:])
res+=x*8
#print(x)
break
p=[]
for i in range(4):
p.append(res%1024)
res//=1024
#print(p,res)
name=["B","KB","MB","GB"]
for i in range(3,-1,-1):
if p[i]:
print("{}{}".format(p[i],name[i]),end="")
E:近似GCD
'''
不要想着从不符合条件的开始计数,有的时候根本不会到那里
而是想着一有符合条件的,就计数
'''
res=0
n,g=map(int,input().split())
a=[0]+list(map(int,input().split()))
for i in range(1,n+1):
if a[i]%g!=0:a[i]=1
else:a[i]=0
for i in range(1,n+1):a[i]+=a[i-1]
j=0
for i in range(1,n):
j=max(j,i+1)
res+=j-i-1
while j<=n:
if a[j]-a[i-1]<=1:
res+=1
else:break
j+=1
print(res)
H:打折 40%
n,m=map(int,input().split())
N=n+5
price=[float("inf")]*N
time=[[] for i in range(1000005)]
idx=0
dic={}
def get(x):
global idx
if x not in dic:
dic[x]=idx
idx+=1
return dic[x]
maxn=0
for i in range(m):
s,t,p,c=map(int,input().split())
maxn=max(maxn,t)
for j in range(c):
a,b=map(int,input().split())
price[a]=min(price[a],b)
for k in range(s,t+1):
time[k].append([a,b*p//100])
res=float("inf")
for i in range(maxn+1):
time[i].sort(key=lambda x:x[1])
#print(i,time[i])
now=[float("inf")]*N
for a,b in time[i]:
now[a]=min(now[a],b)
for j in range(1,n+1):
now[j]=min(now[j],price[j])
res=min(res,sum(now[1:n+1:]))
print(res)
I:owo 5%
import itertools
n=int(input())
a=[]
def check(b):
s=""
for i in b:s+=i
res=0
for i in range(2,len(s)):
if s[i-2:i+1:]=="owo":res+=1
return res
for i in range(n):
a.append(input())
res=0
for b in itertools.permutations(a, i+1):
res=max(res,check(b))
print(res)
J:替换字符 40%
s=list(input())
for i in range(int(input())):
l,r,a,b=input().split()
l=int(l)
r=int(r)
for j in range(l-1,r):
if s[j]==a:s[j]=b
print("".join(s))