CCF CSP python

 

n=int(input())
arr=[int(i) for i in input().split()]
ans=[(arr[0]+arr[1])//2]
for i in range(1,n-1):
    ans.append((arr[i-1]+arr[i]+arr[i+1])//3)
ans.append((arr[n-1]+arr[n-2])//2)
for i in range(n):
    print(ans[i],end=' ')

小明种苹果

n,m=map(int,input().split())
max1=0
index=0
sums=[]
for i in range(n):
    arr=[int(i) for i in input().split()]
    sums.append(arr[0])
    if -sum(arr[1:])>max1:
        max1=-sum(arr[1:])
        index=i
    sums.append(sum(arr[1:]))

sums=sum(sums)
#print(sums,end=' ')
#print(index+1,end=' ')
#print(max1)
print(sums,index+1,max1)

n=int(input())
arr=[int(i) for i in input().split()]
ans=1
for i in range(n-1):
    if arr[i]==arr[i+1]:
        continue
    else:
        ans+=1
print(ans)
        

from collections import Counter
n=int(input())
arr=[int(i) for i in input().split()]
arr.sort()
arr=Counter(arr)
arr=arr.most_common(1)[0]
print(arr[0])

n=int(input())
arr=[int(i) for i in input().split()]
arr.sort()
max=0
index=0
for i in range(n):
    if arr.count(arr[i])>max:
      max=arr.count(arr[i])
      index=i
print(arr[index])

n=int(input())
arr=[int(i) for i in input().split()]
arr.sort()
left=0
right=n-1
ans=0
while leftarr[right]:
        left+=1
    else:
        right-=1
print(ans)
        

n=int(input())
arr=[int(i) for i in input().split()]
arr.sort()
ans=0
for i in range(n-1):
    if arr[i+1]-arr[i]==1:
        ans+=1
print(ans)
        

n=int(input())
arr=[int(i) for i in input().split()]
hash={}
for i in range(n):
    if arr[i] not in hash:
        print(1,end=' ')
        hash[arr[i]]=1
    else:
        hash[arr[i]]+=1
        print(hash[arr[i]],end=' ')

        

n = int(input())
a = list(map(int, input().split()))
b = [0]*n 
for i in range(n):
    b[i] = a[:i+1].count(a[i])
for i in b:
    print(i, end=' ')

n,m=map(int,input().split())
b=[]
for i in range(n):
    a=list(map(int,input().split()))[::-1]
    b.append(a)
for i in range(m):
    for j in range(n):
        print(b[j][i],end=' ')
    print()