輾轉(zhuǎn)相除法求最大公約數(shù)

• 源代碼

a = eval(input("請(qǐng)輸入一個(gè)整數(shù)："))
b = eval(input("請(qǐng)輸入另一個(gè)整數(shù)："))
m = min(a, b)
M = max(a, b)

while True:
      if M % m != 0:
        m = M % m
        M = min(a,b)
        a = M
        b = m
    else:
         break
    
print(m)

• 參考代碼

num1 = int(input("請(qǐng)輸入第一個(gè)數(shù)字："))
num2 = int(input("請(qǐng)輸入第一個(gè)數(shù)字："))
m = max(num1, num2)
n = min(num1, num2)
r = m % n
while r != 0:
    m = n
    n = r
    r = m % n
print(num1, "和", num2, "的最大公約數(shù)為", n)

• 統(tǒng)計(jì)不同字符個(gè)數(shù)

text = input('請(qǐng)輸入字符：')                       # 界面：讓用戶輸入字符 
zgeshu = ygeshu = sgeshu = qgeshu = kgeshu = 0    # 設(shè)置初始值，以便用于for in循環(huán)
for i in text:
    if 40869 >= ord(i) >= 19968:                  # 本處使用十進(jìn)制，簡單?；蛘呤褂檬M(jìn)制，再用ord('\u9fa5')轉(zhuǎn)換為十進(jìn)制的unicode編碼；
        zgeshu += 1
    elif 57 >= ord(i) >= 48:
        sgeshu += 1
    elif 122 >= ord(str.lower(i)) >= 97:          # 直接使用str.lower()函數(shù)，將英文字符統(tǒng)一為小寫，節(jié)省代碼；
        ygeshu += 1
    elif i == ' ':
        kgeshu += 1
    else:
        qgeshu += 1
print('中文字符個(gè)數(shù)為{}'.format(zgeshu), '\n'+'數(shù)字字符個(gè)數(shù)為{}'.format(sgeshu), '\n'+'英文字符個(gè)數(shù)為{}'.format(ygeshu), '\n'+'空格字符個(gè)數(shù)為{}'.format(kgeshu), '\n'+'其他字符個(gè)數(shù)為{}'.format(qgeshu))

• 羊車門問題

from random import *
change = unchange = 0
for i in range(1000):
    ans = randint(0,2)
    gus = randint(0,2)
    if ans == gus:
        unchange += 1
    else:
        change += 1
print('不換且成功的概率是：{}'.format(unchange/1000))
print('換且成功的概率是：{}'.format(change/1000))