泉州信息工程学院python的pta程序控制结构--循环结构

7-3 百马挑百担

cont = 0
for i in range(100,1,-1):
    for j in range(100,1,-1):
        for k in range(100,1,-1):
            if 100 == i*3+j*2+k*0.5 and 100 == i+j+k:
                print(f"{i} {j} {k}")
                cont +=1
print(f"共有{cont}种组合")

7-4 打印*号三角形

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

7-5 a+aa+aaa+...前n项和

s = input()
s = s.split(',')
sum = 0
sum1=0
a,n =map(int,s)
for i in range(1,n+1):
    sum += a
    a *= 10
    sum1 += sum
    if i == n:
        print(f"{sum}",end='')
    else:
        print(f"{sum}",end='+')
print(f"={sum1}",end='')

7-6 1-2/3+3/5-4/7+5/9-6/11+...

n = int(input())
sum = 0
for i in range(1,n+1):
    if i == 1:
        sum += 1
    elif i % 2==0:
        sum -= i / (i+(i-1))
    else:
        sum += i / (i+(i-1))
print("{:0.3f}".format(sum))

7-7 计算“厉害数”

n=int(input())
for i in range(1,10**n):
    j=i
    sum=0
    while(j>0):
        sum+=(j%10)**5
        j=j//10
    if(sum==i):
        print(i)

7-8 sdut-猴子吃桃问题

n = int(input())
total = 1  
for d in range(n-1, 0, -1): 
    total = (total + 1) * 2  
print(f'{total}')  

7-9 完全数

a = []
def ws(n):
    s = 0
    for i in range(1,n):
        if n % i == 0 and  n > i:
            s += i
            a.append(i)
    if s == n:
        print(f"{n}={a[0]}",end="")
        for i in range (1,len(a)):
            print(f"+{a[i]}",end="")
        return True
    else:
        print(f"{n}不是完全数")
    return False
s1 = '*'
n = int(input())
if n != 0:
    if(ws(n)):
        print()
        for i in range(1,len(a)+1):
            print(f'{s1*i}')

else:
    print(f"{n}不是完全数")

7-10 打印数字图形

n = int(input())
s = " "
for i in range(1,n+1):
    j = 0
    print(f'{s*(n-i)}',end="")
    while(j < i):
        print(f'{i}',end="")
        j += 1
    print()

7-1 打印特殊三角形

n=int(input())
l=[]
m=1
for i in range(n):
    ls=[]
    for j in range(n-i):
        ls.append(m)
        m+=1
    l.append(ls)
for i in range(n):
    for j in range(n-i):
        if j<n-i-1:
            print('%-3d'%l[j][i],end='')
        else:
            print(l[j][i])

7-2 水仙花数

while True:
    try:
        x, y = input().split(' ')
        x = int(x)
        y = int(y)
        k = 0
        for i in range(x, y + 1):
            if ((i % 10) ** 3) + ((i // 100) ** 3) + (((i % 100 - i % 10) // 10) ** 3) == i:
                print("%d=%d*%d*%d+%d*%d*%d+%d*%d*%d" % (i, i // 100, i // 100, i // 100, ((i % 100 - i % 10) // 10), ((i % 100 - i % 10) // 10),((i % 100 - i % 10) // 10), i % 10, i % 10, i % 10))
                k = 1
        if k == 0:
            print("none")
    except Exception:
        break

7-11 计算n项序列和

n = int(input())
sum = 0
for i in range(1,n+1):
    if i % 2 == 0:
        sum -= (1 / i)
    else:
        sum += (1 / i)
print("{:.4f}".format(sum))

7-12 zust-sl6-1求1到n的阶乘和

def f(x):
    f = 1
    for i in range(1,x+1):
        f *= i
    return f

n = int(input(""))
print( f"n={n},s={sum(map(f,range(1,n+1)))}")

7-13 zust-sy6-10最大公约数和最小公倍数

def hu(n1,n2):
    if n1 < n2:
        n1,n2 = n2,n1
    while n2:
        n1,n2 = n2,n1%n2
    return n1

def min(n1,n2):
    if n1 < n2:
        n1,n2 = n2,n1
    x = n1 * n2
    while n2:
        n1,n2 = n2,n1%n2
    return x//n1

a,b = map(int,input().split(" "))

print(f"{hu(a,b)} {min(a,b)}")