PAT打卡1019-1022

1019（要注意为6174的输入）

number = input()
i=0
while (number!='6174' and number!='0000') or i==0:
    while len(number)<4:
        number='0'+number
    number = [int(i) for i in number]
    front = sorted(number, reverse=True)
    behind = sorted(number)
    front = front[0] * 1000 + front[1] * 100 + front[2] * 10 + front[3]
    behind = behind[0] * 1000 + behind[1] * 100 + behind[2] * 10 + behind[3]
    number = front - behind
    number=str(number)
    front=str(front)
    behind=str(behind)
    while len(front)<4:
        front='0'+front
    while len(behind)<4:
        behind='0'+behind
    while len(number)<4:
        number='0'+number
    print("{} - {} = {}".format(front,behind,number),end="")
    print()
    i=2

1020：（17/25）

K,N=input().split(" ")
K,N=int(K),int(N)
kucun=input().split(" ")
kucun=[int(i) for i in kucun]
price=input().split(" ")
price=[int(i) for i in price]
danjia=[price[i]/kucun[i] for i in range(K)]
def MAXindex(num):
    maxindex=0
    for i in range(len(num)):
        if num[i]>num[maxindex]:
           maxindex=i
    return maxindex
def precnt(number,need):
    if number<=need:
        return 1
    elif need==0:
        return 'empty'
    else:
        return number/need
Z=0
for i in range(K):
    if precnt(kucun[MAXindex(danjia)], N) == 'empty':
        break
    Z = Z + price[MAXindex(danjia)] / precnt(kucun[MAXindex(danjia)], N)
    N = N - kucun[MAXindex(danjia)]
    if N<0:
        N=0
    del price[MAXindex(danjia)]
    del kucun[MAXindex(danjia)]
    del danjia[MAXindex(danjia)]
print("%.2f" % Z)

1021：

n = input()
n=[int(i) for i in n]
jilu=[0,0,0,0,0,0,0,0,0,0]
for i in n:
    if i==0:
        jilu[0]+=1
    if i==1:
        jilu[1]+=1
    if i==2:
        jilu[2]+=1
    if i==3:
        jilu[3]+=1
    if i==4:
        jilu[4]+=1
    if i==5:
        jilu[5]+=1
    if i==6:
        jilu[6]+=1
    if i==7:
        jilu[7]+=1
    if i==8:
        jilu[8]+=1
    if i==9:
        jilu[9]+=1

for i in range(len(jilu)):
    if jilu[i]!=0:
        print("{}:{}".format(i,jilu[i]))

1022

A,B,D = map(int,input().split())
list = []
sum = A+B
if sum == 0:
    print(0)
else:
    while sum:
        list.append(sum%D)
        sum //= D
    list.reverse()
    for i in list:
        print(i,end='')