deffunc(i,j):
strs1 =str(i)
strs2 =str(j)
len1 =len(strs1)
len2 =len(strs2)
sum1 =0if len1==len2:for i inrange(1,len1+1):
cnt =-1*i
if strs1[cnt]!=strs2[cnt]:
sum1+=int(strs1[cnt])+int(strs2[cnt])elif len1>len2:for i inrange(1,len2+1):
cnt =-1*i
if strs1[cnt]!=strs2[cnt]:
sum1+=int(strs1[cnt])+int(strs2[cnt])for i inrange(len2+1,len1+1):
cnt =-1*i
sum1+=int(strs1[cnt])elif len1<len2:for i inrange(1,len1+1):
cnt =-1*i
if strs1[cnt]!=strs2[cnt]:
sum1+=int(strs1[cnt])+int(strs2[cnt])for i inrange(len1+1,len2+1):
cnt =-1*i
sum1+=int(strs2[cnt])return sum1
print(func(2021,922))
ans =0# 桥之间的遍历for i inrange(1,2021):for j inrange(i+1,2021):
ans+=func(i,j)print(ans)
F 小平方
n =int(input())
n_ban =1.0*n /2
ans =0for i inrange(1,n):
cnt =(i**2)% n
if(1.0*cnt)<n_ban:
ans+=1print("{:.0f}".format(ans))
G 完全平方数
import math
# 判断一个数是否为完全平方数deffunc(num):
flag =0for i inrange(int(math.sqrt(num))+1):if i*i == num:
flag =1breakif i*i >num:breakif flag ==1:returnTrueelse:returnFalse
n =int(input())
ans =0for x inrange(1,n+1):if func(n*x):
ans = x
breakprint("{:.0f}".format(ans))
H 负载均衡
思路:以时间为顺序点,来模仿操作系统的流程
"""
2(计算机数) 6(任务数)
5 5 (计算机运算能力)
ai(时刻) bi(计算机编号) ci(秒) di(算力)
2 6
5 5
1 1 5 3
2 2 2 6
3 1 2 3
4 1 6 1
5 1 3 3
6 1 3 4
#D 187539689
"""# 稍微复杂,先过classPC:def__init__(self,id,xingneng):
self.id=id# 性能
self.xingneng = xingneng
# 被任务占用的 任务id# self.thing_id = []# 被占用的性能
self.useing_xingneng =[]# 每个任务剩余的时间
self.shengyv_time =[]# 计算机剩余的性能
self.shengyv_xingneng = xingneng
# 计算机剩余的任务个数
self.shengyv_renwu =0
com_nums,thing_nums =map(int,input().split())
com_ablity =[int(i)for i ininput().split()]
things =[]for _ inrange(thing_nums):
temp =[int(i)for i ininput().split()]
things.append(temp)# 初始化PC
PCS =[]for i inrange(com_nums):
pc = PC(i+1,com_ablity[i])
PCS.append(pc)
now_time =0
thing_flag =0while(thing_flag<thing_nums):# 这一秒时候,所有计算机完成情况for i inrange(com_nums):
pc = PCS[i]if pc.shengyv_renwu !=0:for j inrange(len(pc.shengyv_time)):
pc.shengyv_time[j]-=1if pc.shengyv_time[j]==0:
pc.shengyv_xingneng += pc.useing_xingneng[j]
pc.useing_xingneng[j]=0
pc.shengyv_renwu-=1# 清除 0
pc.useing_xingneng =[i for i in pc.useing_xingneng if i!=0]
pc.shengyv_time =[i for i in pc.shengyv_time if i!=0]if now_time == things[thing_flag][0]:
bi,ci,di = things[thing_flag][1],things[thing_flag][2],things[thing_flag][3]
thing_flag+=1if di<=PCS[bi-1].shengyv_xingneng:
PCS[bi-1].useing_xingneng.append(di)
PCS[bi-1].shengyv_time.append(ci)
PCS[bi-1].shengyv_xingneng-=di
PCS[bi-1].shengyv_renwu+=1print("{:.0f}".format(PCS[bi-1].shengyv_xingneng))else:print("-1")
now_time+=1
# 判断两点坐标是否相互攻击deffunc(p1,p2):
flag =0if(p1[0]+1)==p2[0]and(p1[1]+2)==p2[1]:
flag =1elif(p1[0]+1)==p2[0]and(p1[1]-2)==p2[1]:
flag =1elif(p1[0]-1)==p2[0]and(p1[1]+2)==p2[1]:
flag =1elif(p1[0]-1)==p2[0]and(p1[1]-2)==p2[1]:
flag =1elif(p1[0]+2)==p2[0]and(p1[1]+1)==p2[1]:
flag =1elif(p1[0]+2)==p2[0]and(p1[1]-1)==p2[1]:
flag =1elif(p1[0]-2)==p2[0]and(p1[1]+1)==p2[1]:
flag =1elif(p1[0]-2)==p2[0]and(p1[1]-1)==p2[1]:
flag =1if flag ==1:returnTrueelse:returnFalse# 判断坐标 与之前的坐标是否冲突defzb_and_zbs(zb,zbs):iflen(zbs)==0:returnFalseelse:
flag =0for zb2 in zbs:if func(zb,zb2):
flag =1breakif flag ==1:returnTrueelse:returnFalse# 递归defdg(zbs,all_zb,K,i):global ans
iflen(zbs)==K:#print(zbs)
ans=(ans+1)%1000000007eliflen(zbs)<K:for j inrange(i,len(all_zb)):
one_zb = all_zb[j]
zbs1 = zbs[:]if(one_zb notin zbs)and(not zb_and_zbs(one_zb,zbs)):
zbs1.append(one_zb)
dg(zbs1,all_zb,K,j+1)
n,m,K =map(int,input().split())# 构建所有的坐标
all_zb =[]for i inrange(n):for j inrange(m):
all_zb.append([i,j])# 写递归
zbs =[]global ans
ans =0for i inrange(len(all_zb)):
zbs =[all_zb[i]]
dg(zbs,all_zb,K,i+1)print(ans)