基础练习part

阶乘计算

n=int(input())
ans=1
for i in range(1,n+1):
    ans*=i
print(ans)

高精度加法

a,b = int(input()),int(input())
print(a+b)

Huffuman树

n = int(input())
li = list(map(int,input().split()))
lj = []
for i in range(n-1):
  m1 = min(li)
  li.remove(m1)
  m2 = min(li)
  li.remove(m2)
  m = m1+m2
  lj.append(m)
  li.append(m)
print(sum(lj))

2n皇后问题（搜索）

博主CodingFishzhi的思路：

• 先在index放置黑皇后
• 递归，在index+1行放置黑皇后
• 递归到底，index == n ，这个时候说明黑皇后已经全部放置完毕（一种情况），这个时候再开始第二次dfs2（0），这个时候是放置白皇后，白皇后也放置完毕以后，一个解就找到了。

报时助手

h,m = input().split()
d = {"0":"zero", "1":"one", "2":"two", "3":"three", "4":"four", "5":"five", "6":"six", "7":"seven", "8":"eight", "9":"nine", "10":"ten", "11":"eleven", 
"12":"twelve", "13":"thirteen", "14":"fourteen", "15":"fifteen", "16":"sixteen", "17":"seventeen", "18":"eighteen", "19":"nineteen", "20":"twenty",
"30":"thirty", "40":"forty", "50":"fifty","21":"twenty one","22":"twenty two","23":"twenty three","24":"twenty four",}
d2 = {"2":"twenty","3":"thirty","4":"forty","5":"fifty"}
if m=="0":
   print(d.get(h)+" o'clock")
else:
   if m not in list(d.keys()):
       s1 = d2.get(m[0])
       s2 = d.get(m[1])
       s = s1+" "+s2
       print(d.get(h)+" "+s)
   else:
       print(d.get(h)+" "+d.get(m))

字符串对比

s1,s2 = input(),input()
n = 4
if len(s1)!=len(s2):
   n = 1
elif s1==s2:
   n = 2
elif s1.lower()==s2.lower():
   n =3
else:
   n = 4
print(n)