余弦相似度，判断素数

#余弦相似度函数
# def cos_similarity(vector_A,vector_B):
#     a_b = 0
#     for i in range(len(vector_A)):
#         a_b += vector_A[i] * vector_B[i]
#     a_ = 0
#     for i in vector_A:
#         a_ += i ** 2
#     a_ = a_ ** 0.5
#     b_ = 0
#     for i in vector_B:
#         b_ += i ** 2
#     b_ = b_ ** 0.5
#     s_ab = a_b / (a_ * b_)
#     return s_ab
#
# vector_A=[3,5,2,8,7]
# vector_B=[1,6,4,2,9]
# vector_C=[2,4,1,7,6]
# vector_D=[0,1,0,2,1]
# a_b=cos_similarity(vector_A,vector_B)
# a_c=cos_similarity(vector_A,vector_C)
# a_d=cos_similarity(vector_A,vector_D)
# print(a_b,a_c,a_d)

#判断素数函数
# def is_prime(a):
#     if a == 1:
#         return False
#     else:
#         for i in range(2, a):
#             if a % i == 0:
#                 return False
#                 break
#         else:
#             return True
# count=0
# for i in range(1,1001):
#     if is_prime(i):
#         print(i,end='\t')
#         count+=1
#     if count==10:
#         print()
#         count=0

#计算机
def f(a,b,fu):
    if fu=='+':
        return a+b
    if fu=='-':
        return a-b
    if fu=='*':
        return a*b
    if fu=='/':
        if b==0:
            return False
        else:
            return a/b

print(f(1,2,'+'))
print(f(2,1,'-'))
print(f(4,2,'/'))
print(f(2,3,'*'))