浙江省2023年10月高三信息技术强基联盟统测卷

a=[30,10,20,11,12,50]

d=[0]*6 ; max=0 ; n=len(a)

for i in range(1,n):

    for j in range(i):

        if a[j]<a[i]:

            d[i]+=1

    if d[i]>max:

        max=d[i]

def fun(k):

    if k==1 :

        return "1"

    elifk%2==0:

        return fun(k- 1)+str(k%2)

    else:

        returnstr(k%2)+fun(k- 1)

s=input()

stack=[0]* len(s)；top=- 1；presign='+'；num=0

for i in range(len(s)):

    if'0'<=s[i]<='9':

        num=num*10+int(s[i])

    if i==len(s)- 1 or s[i] in'+-*/':

        if presign=='+':

            top+=1

            stack[top]=num

        elifpresign=='-':

            top+=1

            stack[top]=-num

        elifpresign=='*':

            top+=1

            stack[top]=stack[top- 1]*num

        else:

            top+=1

            stack[top]=stack[top- 1]//num

        presign=s[i]

        num=0

print(sum(stack))     #sum 函数对 stack 中所有元素求和

a=[i for i in range(1,7)]

b=[0]*6

head, tail=0,0

for i in range(1,7):

    cnt=1

    while cnt<i:

        a[tail]=a[head]

        head=(head+1)%6

        tail=(tail+1)%6

        cnt+=1

    b[a[head]- 1]=i

    head=(head+1)%6

图 1

图 2

图 3

图 1

图  2