一些python编程题

最近的作业，就当复习下python了

#-- encoding:utf-8 --
import numpy as np
#辗转相除法
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b)

a= int(np.random.randint(100,201,size=1)[0])
b= int(np.random.randint(100,201,size=1)[0])
gcdd=gcd(a,b)
print(a,b)
print(gcdd)
lcm=int(a*b/gcdd)
print(lcm) 

import math

lis=[]
for i in range(2,1001):
    endd=int(i/2+1)
    sum=0
    for j in range(1,endd):
        #print(j)
        if i%j==0:
            sum=sum+j
    #print(i,sum)
    if sum==i:
        lis.append(i)

print(lis)
print(len(lis)) 

 

sum=0
lis=[1,2,3]
cnt=2
#print(lis[0],1)
while(lis[cnt]<2000):
    lis.append(lis[cnt]+lis[cnt-1]+lis[cnt-2])
    cnt=cnt+1
#print(lis[cnt-1],cnt)
print(lis[cnt],cnt+1)

 

# -- coding: utf-8 --
def factorial(num):#计算num!
    mul=1
    if num==0|num==1:
        return int(mul)

    for i in range(1,num+1):
        mul*=i
    return int(mul)
 
def monomial(x,n):#计算单项式
    #print(type(factorial(n)),factorial(n))
    mono=(x**n)/factorial(n)

    return mono
 
x=float(input())
n=0
while(monomial(x,n)>=1e-6):
    sum=0
    n=n+1
    for i in range(0,n):
        sum=sum+monomial(x,i)
        #print(i)
    #print(sum)
print("单项式数目:",n,"估值:",sum)

 

#-- encoding: utf-8 --
def iterative(xn,a):#迭代公式
    xnn=(xn+a/xn)/2
    return xnn

a=int(input())
xn=a
while True:
    xnn=iterative(xn,a)
    if abs(xnn-xn)<1e-6:#精确到小数点后六位
        print("%.6f"%(xnn))
        break
    else:
        xn=xnn

 

def judge(n):
    if int(n%3)!=0:
        return False
    else:
        while(n!=0):
            if int(n%10)==int(5):
                return True
            n=int(n/10)
        return False

i=1
while(i<1001):
    if judge(i):
        print(i)
    i=i+1

 

 

 

#-- encoding utf-8 --
def factorial(num):#计算num!
    mul=1
    if num==0|num==1:
            return mul
    for i in range(1,num+1):
        mul*=i
    return mul

def monomial(x,n):#计算单项式
    mono=((-1)**(n-1))*(x**(int(2*n-1)))/factorial(int(2*n-1))
    return mono

x=float(input())
n=1
while(abs(monomial(x,n))>=1e-10):#单项精确到小数点后十位时跳出
    n=n+1
sum=0
for i in range(1,n+1):
    sum=sum+monomial(x,i)
    print(i)
print("单项式数目:",n,"估值:",sum)

 

import math
def prime_judge(n):    
    if n==1|n==2:
        return True
    for i in range(2,int(math.sqrt(n)+1)):
        if int(n%i)==0:
            return False
    return True

n=int(input())
print(prime_judge(n))

 

def fabonacci_genarate(n):
    lis=[1,1]
    cur=1
    if n<2:
        print(1)
        return
    if n<3:
        print(1,1)
        return
    print(1,1,end=" ")
    while(cur<n):
        lis.append(lis[cur]+lis[cur-1])
        cur=cur+1
        print(lis[cur],end=" ")
    return 

n=int(input())
fabonacci_genarate(n-1)

 

 

def cal(n):
    sum=0
    if n==0:
        return 0
    elif n>0:
        while(n>0):
            sum=sum+int(n%10)
            n=int(n/10)
        return sum

n=int(input())
print(cal(n))