n=int(input())
ls=[int(i)for i ininput().split()]for i inrange(n):
cnt=0for j inrange(i):if ls[j]<ls[i]:
cnt+=1print(cnt,end=" ")
P1427 小鱼的数字游戏
ls=[int(i)for i ininput().split()]
ls.pop()
ls=ls[::-1]for i in ls:print(i,end=" ")
P5727 【深基5.例3】冰雹猜想
n=int(input())
ls=[n]while n!=1:if n%2==0:
n//=2
ls.append(n)else:
n=n*3+1
ls.append(n)
ls=ls[::-1]for i in ls:print(i,end=" ")
P1047 [NOIP2005 普及组] 校门外的树
l,m=map(int,input().split())
ls=[1]*(l+1)for i inrange(m):
a,b=map(int,input().split())for i inrange(a,b+1):
ls[i]=0print(ls.count(1))
P5728 【深基5.例5】旗鼓相当的对手
N=int(input())
ls=[]for i inrange(N):
a,b,c=map(int,input().split())
ls.append([a,b,c])
cnt=0for a in ls:
i=sum(a)for b in ls:if b==a:continueelse:
j=sum(b)ifabs(j-i)<=10:for c inrange(3):ifabs(a[c]-b[c])>5:breakelse:
cnt+=1print(cnt//2)
P5729 【深基5.例7】工艺品制作
w,x,h=map(int,input().split())
q=int(input())
ls=[]for i inrange(q):
sl=[int(i)for i ininput().split()]
ls.append(sl)
sl=[[[1for i inrange(h)]for j inrange(x)]for k inrange(w)]for a in ls:for i inrange(a[0]-1,a[3]):for j inrange(a[1]-1,a[4]):for k inrange(a[2]-1,a[5]):
sl[i][j][k]=0
cnt=0for i inrange(w):for j inrange(x):for k inrange(h):if sl[i][j][k]==1:
cnt+=1print(cnt)
P2550 [AHOI2001]彩票摇奖
n=int(input())
ls=[int(i)for i ininput().split()]
di=dict(zip([0,1,2,3,4,5,6],[0,0,0,0,0,0,0]))for i inrange(n):
sl=[int(i)for i ininput().split()]
cnt=7for i in sl:if i in ls:
cnt-=1try:
di[cnt]+=1except:passfor i in di.values():print(i,end=" ")
P2615 [NOIP2015 提高组] 神奇的幻方
n=int(input())
m=n//2
ls=[[0for i inrange(n)]for i inrange(n)]defhanshu(ls,n,m):
ls[0][m]=str(1)
x,y=2,pow(n,2)
a,b=0,m
while x<=y:if a==0and b!=n-1:
ls[n-1][b+1]=str(x)
a,b=n-1,b+1elif b==n-1and a!=0:
ls[a-1][0]=str(x)
a,b=a-1,0elif a==0and b==n-1:
ls[a+1][b]=str(x)
a,b=a+1,b
else:if ls[a-1][b+1]==0:
ls[a-1][b+1]=str(x)
a,b=a-1,b+1else:
ls[a+1][b]=str(x)
a,b=a+1,b
x+=1for i in ls:print(" ".join(i))
hanshu(ls,n,m)
M,N=map(int,input().split())
di=dict(zip([0,1,2,3,4,5,6,7,8,9],[0,0,0,0,0,0,0,0,0,0]))
ls=[str(i)for i inrange(M,N+1)]for i in ls:if"0"in i:
di[0]+=i.count("0")if"1"in i:
di[1]+=i.count("1")if"2"in i:
di[2]+=i.count("2")if"3"in i:
di[3]+=i.count("3")if"4"in i:
di[4]+=i.count("4")if"5"in i:
di[5]+=i.count("5")if"6"in i:
di[6]+=i.count("6")if"7"in i:
di[7]+=i.count("7")if"8"in i:
di[8]+=i.count("8")if"9"in i:
di[9]+=i.count("9")for i in di.values():print(i,end=" ")
P2141 [NOIP2014 普及组] 珠心算测验
n=int(input())
ls=[int(i)for i ininput().split()]
ls.sort()
di=[]for i inrange(n):for j inrange(i+1,n):
x=ls[i]+ls[j]if x in ls:
di.append(x)print(len(set(di)))
P1614 爱与愁的心痛
n,m=map(int,input().split())
ls=[]for i inrange(n):
ls.append(int(input()))for i inrange(n-m+1):if i==0:
x=sum(ls[i:i+m])
y=x
else:
x=x-ls[i-1]+ls[i+m-1]if x<y:
y=x
print(y)
P2911 [USACO08OCT]Bovine Bones G
a,b,c=map(int,input().split())
d=a+b+c
ls1=[i for i inrange(3,d+1)]
ls2=[0]*(d-1)
di=dict(zip(ls1,ls2))for i inrange(1,a+1):for j inrange(1,b+1):for k inrange(1,c+1):
e=i+j+k
di[e]+=1print(max(di,key=di.get))
P1161 开灯
from math import floor
n=int(input())
ls=[0]*10000000for i inrange(n):
a,b=map(eval,input().split())for i inrange(1,b+1):
j=floor(i*a)if ls[j-1]==0:
ls[j-1]=1else:
ls[j-1]=0for i in ls:if i==1:print(ls.index(i)+1)break
P5731 【深基5.习6】蛇形方阵
n=int(input())
ls1=[[0for i inrange(n)]for i inrange(n)]defhanshu(ls1):global n
ls1[0][0]=1
a,b,c=0,0,1
d=pow(n,2)while c<d:
c+=1if b!=n-1and ls1[a][b+1]==0and ls1[a+1][b]==0:
a,b=a,b+1
ls1[a][b]=c
elif a!=n-1and ls1[a+1][b]==0:
a,b=a+1,b
ls1[a][b]=c
elif b!=0and ls1[a][b-1]==0:
a,b=a,b-1
ls1[a][b]=c
elif a!=0and ls1[a-1][b]==0:
a,b=a-1,b
ls1[a][b]=c
else:
a,b=a,b+1
ls1[a][b]=c
return ls1
ls=hanshu(ls1)for i in ls:print(" ",end="")for j in i:print("{:2d}".format(j),end=" ")print("")
P5732 【深基5.习7】杨辉三角
n=int(input())
ls=[]for i inrange(n):
sl=[]if i==0:
sl.append(1)elif i==1:
sl.append(1)
sl.append(1)else:
sl.append(1)for j inrange(1,i):
sl.append(ls[i-1][j-1]+ls[i-1][j])
sl.append(1)
ls.append(sl)for i in ls:for j in i:print(j,end=" ")print("")
P1789 【Mc生存】插火把
n,m,k=map(int,input().split())
ls=[[0for i inrange(n)]for i inrange(n)]defhanshu1(x,y,n):global ls
x-=1
y-=1for i inrange(5):
z=y-2+i
if z<0or z>n-1:passelse:
ls[x][z]=1for i inrange(5):
z=x-2+i
if z<0or z>n-1:passelse:
ls[z][y]=1if x+1<=n-1and y+1<=n-1:
ls[x+1][y+1]=1if x-1>=0and y-1>=0:
ls[x-1][y-1]=1if x-1>=0and y+1<=n-1:
ls[x-1][y+1]=1if x+1<=n-1and y-1>=0:
ls[x+1][y-1]=1for i inrange(m):
x,y=map(int,input().split())
hanshu1(x,y,n)defhanshu2(a,b):
a-=1
b-=1for i inrange(-2,3):if a+i<0or a+i>n-1:passelse:for j inrange(-2,3):if b+j<0or b+j>n-1:passelse:
ls[a+i][b+j]=1for i inrange(k):
a,b=map(int,input().split())
hanshu2(a,b)
cnt=0for i in ls:for j in i:if j==0:
cnt+=1print(cnt)
P1319 压缩技术
ls=[int(i)for i ininput().split()]
x=ls.pop(0)
sl=[]
y=0for i in ls:if y==0:for j inrange(i):
sl.append(0)
y=1else:for j inrange(i):
sl.append(1)
y=0
z=0
X=pow(x,2)for i inrange(X):print(sl[i],end="")
z+=1if z%x==0:print("")
P1320 压缩技术(续集版)
ls=[]
x=[i for i ininput().rstrip()]for i in x:
ls.append(int(i))
m=len(x)for i inrange(m-1):
x=[i for i ininput().rstrip()]for i in x:
ls.append(int(i))print(m,end=" ")
y=0
z=0
n=pow(m,2)for i inrange(n):if ls[i]==y:
z+=1else:print(z,end=" ")
y=ls[i]
z=1print(z)
P1205 [USACO1.2] 方块转换 Transformations
n=int(input())
ls1=[]for i inrange(n):
sl1=[i for i ininput().rstrip()]
ls1.append(sl1)
ls2=[]for i inrange(n):
sl2=[i for i ininput().rstrip()]
ls2.append(sl2)defhanshu1(ls1):
ls2=[[0for i inrange(n)]for i inrange(n)]for i inrange(n):for j inrange(n):
ls2[i][j]=ls1[n-j-1][i]return ls2
defhanshu2(ls1):
ls2=hanshu1(ls1)
ls3=hanshu1(ls2)return ls3
defhanshu3(ls1):
ls2=hanshu1(ls1)
ls3=hanshu1(ls2)
ls4=hanshu1(ls3)return ls4
defhanshu4(ls1):
ls2=[]for i in ls1:
ls2.append(i[::-1])return ls2
defhanshu5(ls1,ls6):
ls2=hanshu4(ls1)
ls3=hanshu1(ls2)
ls4=hanshu2(ls2)
ls5=hanshu3(ls2)if ls3==ls6 or ls4==ls6 or ls5==ls6:returnTruereturnFalse
ls=[]if hanshu1(ls1)==ls2:
ls.append(1)if hanshu2(ls1)==ls2:
ls.append(2)if hanshu3(ls1)==ls2:
ls.append(3)if hanshu4(ls1)==ls2:
ls.append(4)if hanshu5(ls1,ls2)==True:
ls.append(5)if ls1==ls2:
ls.append(6)if ls==[]:print(7)else:print(min(ls))