1.一張紙的厚度大約是0.08mm，對(duì)折多少次之后能達(dá)到珠穆朗瑪峰的高度（8848.13米）？
n = 0.008
count = 1
while n < 8848130:
n = 2 * n
count += 1
print('需要對(duì)折',count,'次')
- 古典問(wèn)題：有一對(duì)兔子，從出生后第3個(gè)月起每個(gè)月都生一對(duì)兔子，小兔子長(zhǎng)到第三個(gè)月后每個(gè)月又生一對(duì)兔子，假如兔子都不死，問(wèn)每個(gè)月的兔子總數(shù)為多少?
m = int(input('要計(jì)算的月數(shù)：'))
if m < 3:
S = 2
elif m < 5:
S = 2 + 2 * (m - 2)
elif m < 7:
S = 6
s = 2
for _ in range(m - 4):
s += 2
S += s
else:
S = 16
s1 = 4
s2 = 6
for _ in range(m - 6):
s1,s2 =s2,s1 + s2
S += s2
print('第',m,'個(gè)月有',S,'只兔子')
- 將一個(gè)正整數(shù)分解質(zhì)因數(shù)。例如:輸入90,打印出90=2x3x3x5
n = int(input('要計(jì)算的數(shù)：'))
i = 2
print(n,'= ',end='')
while 1 < i < n:
if n % i == 0:
print(i,'* ',end='')
n = n // i
else:
i += 1
print(n)
- 輸入兩個(gè)正整數(shù)m和n，求其最大公約數(shù)和最小公倍數(shù)。
m = int(input('m = '))
n = int(input('n = '))
for i in range(m,m*n+1):
if i % m == 0:
if i % n == 0:
print(m,'和',n,'的最小公倍數(shù)是',i,'最大公約數(shù)是',m*n//i)
break
- 找出1000以內(nèi)的所有完數(shù)
F = []
for i in range(2,1000):
S = 0
F.clear()
for j in range(1,i):
if i % j == 0:
F.append(j)
for k in range(len(F)):
S += F[k]
if S == i:
print(i)
6.輸入某年某月某日，判斷這一天是這一年的第幾天？
y = int(input('year:'))
m = int(input('month:'))
d = int(input('day:'))
list_ly = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
list_oy = [0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
if y % 400 == 0 or y % 100 != 0 and y % 4 ==0:
n = sum(list_oy[:m]) + d
else:
n = sum(list_ly[:m]) + d
- 某個(gè)公司采用公用電話傳遞數(shù)據(jù)，數(shù)據(jù)是四位的整數(shù)，在傳遞過(guò)程中是加密的，加密規(guī)則如下：每位數(shù)字都加上5,然后用和除以10的余數(shù)代替該數(shù)字，再將第一位和第四位交換，第二位和第三位交換。求輸入的四位整數(shù)加密后的值
M = int(input('輸入要加密的四位整數(shù)：'))
C = []
list_M = [M // 1000, M % 1000 // 100, M % 100 // 10, M % 10]
for index in range(len(list_M)):
list_M[index] = (list_M[index] + 5) % 10
for item in list_M[::-1]:
C.append(item)
print(C)
- 獲取第n個(gè)丑數(shù)。 什么是丑數(shù): 因子只包含2，3，5的數(shù)
n = int(input('獲取第幾個(gè)丑數(shù)：'))
i = 1
count = 0
while count != n:
j = i
while i % 2 == 0:
i = i // 2
while i % 5 == 0:
i = i // 5
while i % 3 == 0:
i = i // 3
if i == 1:
count += 1
i = j + 1
print(j)
