算法笔记上机训练实战指南（胡凡）Python实现

按书本顺序记录，不使用第三方库

B1001

num,step=int(input()),0
while num!=1:
    if num%2==0:
        num/=2
    else:
        num=(3*num+1)/2
    step+=1

print(step)

B1011

times,time=int(input()),0
while time!=times:
    time+=1
    a,b,c=map(int,input().split())
    if a+b>c:
        print('Case#%d:true'%time)
    else:
        print('Case#%d:false'%time)

B1016

a,b,c,d=map(int,input().split())
pa,pb=0,0
while a!=0:
    if a%10==b:
        pa=pa*10+b
    else:pass
    a//=10
while c!=0:
    if c%10==d:
        pb=pb*10+d
    else:pass
    c//=10
print(int(pa)+int(pb))

B1026

import time
start=time.time()
time.sleep(1)
end=time.time()
ans=end-start
if ans%1>=0.5:
    ans=int(ans//1+1)
else:ans=int(ans//1)
print('{0:2d}:{1:2d}:{2:2d}'.format(ans//3600,ans%3600//60,ans%60))

B1046

times=int(input())
failA,failB=0,0
for i in range(times):
    a,b,c,d=map(int,input().split())
    if a+c==b and a+c!=d:
        failB+=1
    elif a+c!=b and a+c==d:
        failA+=1
    else:pass
print(failA,failB)

B1008

nums,times=map(int,input().split())
li=list(map(int,input().split()))
times%=nums
li.reverse()
li[:times]=li[:times][::-1]
li[times:]=li[times:][::-1]
print(li)

B1012

li=list(map(int,input().split()))
A1, A2, A3, A4, A5 =0, 0, 0, 0, 0
count2,count4=0,0
for item in li:
    if item%5==0 and item%2==0:
        A1+=item
    elif item%5==1:
        count2+=1
        if count2%2==0:
            A2-=item
        else:A2+=item
    elif item%5==2:
        A3+=1
    elif item%5==3:
        A4+=item
        count4+=1
    elif item%5==4:
        if item>A5:A5=item
if A1!=0:print(A1,end=' ')
else:print('N',end=' ')
if A2!=0:print(A2,end=' ')
else:print('N',end=' ')
if A3!=0:print(A3,end=' ')
else:print('N',end=' ')
if A4!=0:print('{0:.1f}'.format(A4/count4),end=' ')
else:print('N',end=' ')
if A5!=0:print(A5,end=' ')
else:print('N',end=' ')

B1018

d_j,d_y={},{}
cj,cy,cp=0,0,0
times=int(input())
for i in range(times):
    jia,yi=input().split()
    if jia==yi:
        cp+=1
    elif (jia=='C' and yi=='J' )or(jia=='J' and yi=='B')or(jia=='B' and yi=='C'):
        cj+=1
        if jia in d_j.keys():
            d_j[jia]+=1
        else:
            d_j[jia]=1
    else:
        cy+=1
        if yi in d_y.keys():
            d_y[yi]+=1
        else:
            d_y[yi]=1

#按值排序
d_j=dict(sorted(d_j.items(),key=lambda d_j:d_j[1],reverse=True))

#d_j=dict(sorted(d_j.keys(),key=lambda d_j:d_j[0],reverse=True))
d_y=dict(sorted(d_y.items(),key=lambda d_y:d_y[1],reverse=True))

print(cj,end=' ')
print(cp,end=' ')
print(cy)

print(cy,end=' ')
print(cp,end=' ')
print(cj)
j_k_li=sorted(list(d_j.keys()),reverse=False)
y_k_li=sorted(list(d_y.keys()),reverse=False)
print(j_k_li[0],end=' ')
print(y_k_li[0])

A1042

import copy
times=int(input())
li_ori=[]
for i in range(1,55):
    if i<=13:
        instance='S'+str(i)
        li_ori.append(instance)
    elif i>13 and i<=26:
        instance='H'+str(i-13)
        li_ori.append(instance)
    elif i>26 and i<=39:
        instance='C'+str(i-26)
        li_ori.append(instance)
    elif i>39 and i<=52:
        instance='D'+str(i-39)
        li_ori.append(instance)
    else:
        instance='J'+str(i-52)
        li_ori.append(instance)

li_end=[0]*54

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

for i in range(times):
    if i==0:
        for j in range(54):
            li_end[li[j]-1]=li_ori[j]
    else:
        li_aft=copy.deepcopy(li_end)
        for k in range(54):
            li_end[li[k]-1]=li_aft[k]
print(li_end)

A1046

li=list(map(int,input().split()))
n=li[0]  #n个点
distance_sum=0
distance_li=[0]*(n+1)
for i in range(1,n+1):
    distance_li[i]=li[i]
    distance_sum+=li[i]
times=int(input())
for i in range(times):
    distance1=0
    p1,p2=map(lambda x:int(x)-1,input().split())

    if p1<p2:
        while p1<p2:
            distance1+=distance_li[p2]
            p2-=1
        distance2=distance_sum-distance1
        print(min(distance1,distance2))
    elif p1==p2:
        print(0)
    else:
        while p2<p1:
            distance1+=distance_li[p1]
            p1-=1
        distance2=distance_sum-distance1
        print(min(distance1,distance2))

未完