first_week_assignment

9 ^ -10   # 9的补码是0000 1001，-10的原码是1000 1010,补码是1111 0110
          # 0000 1001 ^ 1111 0110 = 1111 1111（补码）,补码是机器存放的形式，原码是展示给用户的
          # 补码的补码就是原码      1111 1111 的补码是  1000 0001  = decimal -1

#求圆的面积（area）和周长（girth）
import math
radius = int(input('Please input radius:'))

area = math.pi * radius ** 2
girth = 2 * math.pi * radius

print('area is ',area)
print('girth is ',girth)

# 两个数比较大小，并且升序输出
num1 = int(input('Please input first number:'))
num2 = int(input('Please input second number'))

if num1 > num2:
    print(num2,num1)
else:
    print(num1,num2)

#依次输出n个数字，并输出最大数
while True:
    num1 = input('Please input first number:')
    if not num1:
        break
    num2 = input('Please inpuut second nubmer:')
    if not num2:
        break
    num3 = input('Please input third number')
    if not num3:
        break
    
    num1 = int(num1)
    num2 = int(num2)
    num3 = int(num3)
    
    if num1 > num2 and num1 > num3:
        print(num1)
    if num2 > num3 and num2 > num3:
        print(num2)
    if num3 > num2 and num3 > num1:
        print(num3)

# 输入n个数，并且打印输入后的算数平均数

count = 0
summation = 0

while True:
    num = input('Please input a number:')
    if not num:
        print('NoneError')
        break
    num = int(num)
    count += 1
    summation += num
    average = summation / count
    print(average)

# 打印一个正方形

side = int(input('Please input the side of a square:'))

#方法一
# print(side * "*")

# for _ in range(side-2):
#     print('*' + (side - 2) * ' ' + '*')

# print(side * "*")

#方法二
# for i in range(0,side):
#     if i % (side-1) == 0:
#         print(side * '*')
#     else:
#         print('*' + (side-2) * ' ' + '*')

#方法三
if side % 2 == 0:
    space = (side - 1) * ' '
else:
    space = (side - 2) * " "
axis = side // 2

for i in range(-axis,axis+1):
    for j in range(-axis,axis+1):
        if abs(i) == axis or j == -axis:
            print('*',end='')
        elif j == axis:
            print(space + '*',end='')
    print()

# 求100以内的奇数之和
summation = 0
count = 0

for i in range(1,100,2):
    summation += i

print(summation)

# 判断学生的分数
score = int(input('Please input student\'s:'))

if score > 100 or score < 0:
    print('Score is Error')
else:
    if score >= 70:
        if score < 80:
            print('C')
        elif score < 90:
            print('B')
        else:
            print('A')
    else:
        if score >= 60:
            print('D')
        else:
            print('E')

# 求阶乘之和

num = int(input('>>>'))

sub = 1
summation = 0

for i in range(1,num+1):
    sub *= i
    summation += sub

print(summation)

# 判断一个数是否是素数

num = int(input('Please input a nubmer:'))
count = 0

if num == 2:
    print(num)
    count = 1
elif num % 2 == 0:
    print(num,'not\'s prime number')
    count = 1
else:
    for i in range(3,num,2):
        if num % i == 0:
            print(num,'not\'s prime number')
            break
        count += 1
    else:
        print(num,'is prime number')
print(count)

# 九九乘法表

for i in range(1,10):
    for j in range(1,10):
        if j > i:
            pass
        else:
            product = i * j
            if j == 2 and product < 10:
                tail = '  '
            else:
                tail = ' '
            print(str(j) + "*"+ str(i) + "=" + str(product) + tail,end='')
    print()

# 棱形

num = int(input('Please input a number:'))
# 方法一:
# axis = num // 2

# for i in range(-axis,axis+1):
#     print(abs(i) * " " + (num - 2 * abs(i)) * "*")

#方法二:
axis = num // 2

for i in range(-axis,axis+1):
    print(abs(i) * " ",end='')
    for j in range(-axis,axis+1):
        if abs(i) + abs(j) < 4:
            print('*',end='')
    print()

#Fibonacci sequence

#方法一
fib1 = 0
fib2 = 1
count = 0

while True:
    tmp = fib1 + fib2
    fib1 = fib2
    fib2 = tmp
    count += 1
    if fib2 <= 100:
        print(fib2)
    else:
        break
print(count)

# Fibonacci sequnence 第101项

fib1 = 0
fib2 = 1
count = 0

while True:
    fib1,fib2 = fib2,fib1+fib2
    count += 1
    if count == 101:
        print(fib1)
        break

# 求100000以内的所有素数

print(2)
count = 1
#方法一
# for i in range(3,1000,2):
#     for j in range(2,i//2+1):
#         if i % j == 0:
#             break
#     else:
#         count += 1
#         print(i,end=' ')
# print()
# print('The numbers of prime number is :',count)

lst = [2]
count = 1

for i in range(3,1000,2):  # 从2开始到自身开平方的数找一个能整除的
    for j in lst:
        if i % j == 0:
            break
    else:
        lst.append(i)
        count += 1
print('The numbers of prime number is:',count)
print(lst)

#计算杨辉三角前6行

tmp_lst = [1]
lst = []
for i in range(1,7):
    lst.append(tmp_lst * i)
    
for i in range(1,5):
    for j in range(i):
        lst[i+1][j+1] = lst[i][j] + lst[i][j+1]

print(lst)