In [1]:

    

#tiaozhan
i=0
for m in range(5,86):
    for n in range(5,86):
        for k in range(5,86):
            if m+n+k==100:
                i=i+1
print('totally has',i,'ways')


    

    




totally has 3696 ways

In [3]:

    

#yuxian
def COS(x,y):
    if len(x) == len(y):
        r1 = 0
        r2 = 0
        r3 = 0
        for i in range(len(x)):
            r1+=x[i]*y[i]
            r2+=x[i]**2
            r3+=y[i]**2
        print('result is :',str(r1/((r2*r3)**0.5)))
COS([3,5],[2,6])


    

    




result is : 0.9761870601839528

In [ ]:

    

#fanhuiweizhihuozhe-1
def location():
    numbers=[]
    a = int(input('enter an element'))
    
    for i in range(x):
        a = int(input('enter element'))
        list.append(a)
        b=int(input('jiance'))
    
        if b in numbers:
            posation = x.index(i)
            print('posation is',posation)
        else:  print(-1)
location()


    

In [1]:

    

#fanhuizuixiao
def mini():
    numbers=[]
    n=int(input('请输入数字个数。'))
    for i in range(n):
        n=int(input('请输入一个数字'))
        numbers.append(n)
    for n in numbers:
        return(min(numbers))
    print(min(n))
        
mini()


    

    




请输入数字个数。2
请输入一个数字3
请输入一个数字3






    
Out[1]:





3

In [2]:

    

#fanhuihe
def SUM():
    
    numbers=[]
    a=int(input('个数:'))
    total=0
    
    for i in range(a):
        number=int(input('整数:'))
        numbers.append(number)
        
    for number in numbers:
        total+=number
    print(total)
        
SUM()


    

    




个数:5
整数:5
整数:4
整数:3
整数:3
整数:2
17