2021-06-06

1. 百分制转等级制

score=float(input())

if score>=90 and score<=100:

    grade="A"

elif score>=80 and score<90:

    grade='B'

elif score>=70 and score<80:

    grade='C'

elif score>=60 and score<70:

    grade="D"

elif score>=0 and score<60:

    grade='E'

else:

    grade='Error'

print(grade)

 

1. 华氏温度转摄氏温度

f=float(input())

c=(f-32)/1.8

print("%.2f"%c)

 

1. 求余数

a,b=map(int,input().split())

c=a % b

print("%d"%c)

 

1. 判断三个数的状态

 

a,b,c=map(float,input().split())

if a==b==c:

    print(2)

elif (a==b and a!=c) or (a==c and a!=b) or (b==c and c!=a):

    print(1)

else:

print(0)

 

1. 使用分支语句对三个数进行排序

a,b,c=map(float,input().split())

if a<b :

            a,b=b,a

if a<c :

            a,c=c,a

if b<c :

            b,c=c,b

print("%.2f>=%.2f>=%.2f" %(a,b,c))

 

1. n以内序列求和

n=int(input())

n1= n + 1

sum=0

x=0

while x<n1:

    sum = sum+x

    x = x+1

print(sum)

 

1. 求圆的面积和周长

radius=float(input())

perimeter=2*3.1415926*radius

area=3.1415926*radius*radius

print("%.2f,%.2f"% (perimeter,area))

 

1. 使用分支语句排序（升级版）

num=input()

num_list=num.split()

#取list前三个元素，并将元素str类型转换为float类型

f_num_list=[float(i)for i in num_list[0:3]]

if num_list[-1]=="1":

    f_num_list.sort(reverse=True)

    print(">=".join([str("%.2f"%x)for x in f_num_list]))

 

elif num_list[-1]=="-1":

    f_num_list.sort(reverse=False)

    print("<=".join([str("%.2f"%x)for x in f_num_list]))

else:

    print("Error")

1. 数列特征

n = int(input())

list1 = list(map(int,input().split()))

print(max(list1))

print(min(list1))

print(sum(list1))

1. 查找整数

def main():

    n=int(input())

    lst=input().split(' ')

    a=int(input())

    num=1

    if str(a) in lst:

        for i in lst:

            if int(i)==a:

                print(num)

                break

            num=num+1

    else:

        print(-1)           

main()

 

 

1. 杨辉三角形

num = int(input())

yh=[[]] * num

for row in range(len(yh)):

    yh[row] = [None] * (row+1)

    for col in range(len(yh[row])):

        if col==0 or col==row:

            yh[row][col]=1

        else:

            yh[row][col]=yh[row-1][col]+yh[row-1][col-1]

        print(yh[row][col],end=' ')

    print( )   

1. 字符删除

str1=input()

ch=input()

str2=str1.replace(ch,'')

print(str2)

  

1. 薪水计算

t,m=map(float,input().split())

if t<=40:

    s=t*m

elif t<=50:

    s=40*m+1.5*(t-40)*m

else:

    s=40*m+1.5*10*m+2*(t-50)*m

print('%.2f'%s)

 

1. 明明的随机数

 

1. A+B问题

while True:

try:

x=input().split()

print(int(x[0])+int(x[1]))

except:

break

1. 水仙花数

for i in range(100,1000):

    str1=str(i)

    a=int(str1[0])

    b=int(str1[1])

    c=int(str1[2])

    if a*a*a+b*b*b+c*c*c==i:

        print("%d"%i)

    else:

        continue

Ap-102 数列排序

n = int(input())

li = list(map(int, input().split()))    

li.sort()   

for i in li:

    print(i, end=" ")

 

 

Ap-012时间转换

t = int(input())

if t>=0 and t<=86399:

    h = t // 3600

    m = t%3600 // 60

    s = t % 3600 % 60

print(str(h)+':'+str(m)+':'+str(s))

 

 

Ap-007闰年判断

n=int(input())

if n%400==0 or (n%4==0and n%100!=0):

    print('yes')

else:

print('no')

 

 

Ap-104字符串对比

str1 = input()

str2 = input()

 

len1 = len(str1)

len2 = len(str2)

 

if len1 == len2:

    judge1 = sum([str1[x] == str2[x] for x in range(len1)])

    judge2 = sum([str1[x].upper() == str2[x].upper() for x in range(len1)])

    if judge1 == len1:

        print(2)

    elif judge2 == len1:

        print(3)

    else:

        print(4)

 

else:

print(1)

 

 

Ap-106FJ的字符串

n=int(input())

a='ABCDEFGHIJKLMNOPQRSTUVWXYZ'

s='A'

for i in range(1,n):

    s=s+a[i]+s

print(s)

 

APP-001龟兔赛跑预测

v1,v2,t,s,l = map(int,input().split())

if v1<=100 and v2<=100 and t<=300 and s<=10 and l<=10000 and l%v1==0 and l%v2==0:

    s1,s2,i = 0,0,0

    while s1<l and s2<l:

        s1,s2,i=v1+s1,v2+s2,i+1

        if s1==l or s2==l:

            break

        elif s1-s2>=t:

            s2,i=s2+v2*s,i+s

    if s1>s2:print('R')

    if s1==s2:print('D')

    if s1<s2:print('T')

print(i)

 

Ap-103回形取数

m,n = map(int,input().split())

s = [[]*n]*m

for i in range(m):

    s[i] = [int(j) for j in input().split()]

if m<n:min=m

else:min=n

len=int((min+1)/2)

for t in range(len):

    if t==len-1 and (min+1)%2==0:

        if m<n:#横向输出

            for i in range(t,n-t):

                print(s[t][i],sep=' ',end=' ')

        else:#纵向输出

            for i in range(t,m-t):

                print(s[i][t],sep=' ',end=' ')

    else:

        for i in range(t,m-t):#向下读

            print(s[i][t],sep=' ',end=' ')

        for i in range(t+1,n-t):#向右读

            print(s[m-1-t][i],sep=' ',end=' ')

        for i in range(m-2-t,t-1,-1):#向上读

            print(s[i][n-1-t],sep=' ',end=' ')

        for i in range(n-2-t,t,-1):#向左读

            print(s[t][i],sep=' ',end=' ')

 

Ap-109 huffuman树

all = 0

huf = []

n = int(input())

huf =input().split()

huf = list(map(int,huf))

while len(huf)>1:

minx = (min(huf))

huf.remove(minx)

all += minx

if len(huf)==0:

break

miny = min(huf)

all+=miny

huf.remove(miny)

huf.append(minx+miny)

print(all)