實驗四 函式和異常處理應用編輯
阿新 • • 發佈:2022-05-09
def func(a,b,c,/,*,d,e,f): return([a,b,c,d,e,f]) print(func(1,2,3,d=4,e=5,f=6))
def solve(a,b,c): ''' 求解一元二次方程,返回方程的兩個根 :para:a,b,c:int方程係數 :return:tuple ''' delta=b*b-4*a*c delta_sqrt=abs(delta)**0.5 p1=-b/2/a; p2=delta_sqrt/2/a if delta>=0: root1=p1+p2 root2=p1-p2 else: root1=complex(p1,p2) root2=complex(p1,-p2) return root1,root2 print(solve.__doc__) while True: try: a,b,c=eval(input('Enter eqution coefficient:')) if a==0: raise except: print('invalidinput,or,aiszero') break else: root1,root2=solve(a,b,c) print(f'root1={root1:.2f},root2={root2:.2f}') print()
def list_generator(a,b,c=1): t=list() if c==int(c): for i in range(a,b+1,c): t.append(i) return(t) else: if 0<c<1: for i in range(a,b+1): t.append(i+c) return(t) else: for i in range(a,b+1,int(c)): t.append(i+c-int(c)) return(t) list1=list_generator(-5,5) print(list1) list1=list_generator(-5,5,2) print(list1) list1=list_generator(1,5,0.5) print(list1)
def is_prime(n): i=2 while(i<=n): if n%i!=0: i=i+1 else: if i==n: return True else: return False for i in range(2,21,2): for j in range(2,i): if is_prime(i-j) and is_prime(j): print(f'{i}={j}+{i-j}') break
def encoder(text:str): ans=[] for n in text: x=ord(n) if 65<=x<=90: ans.append(chr((x-60)%26+65)) elif 97<=x<=122: ans.append(chr((x-92)%26+97)) else: ans.append(n) return ''.join(ans) def decoder(text1): ans1=[] for n in text1: x1=ord(n) if 65 <= x1 <= 90: ans1.append(chr((x1 - 44) % 26 + 65)) elif 97 <= x1 <= 122: ans1.append(chr((x1 - 76) % 26 + 97)) else: ans1.append(n) return ''.join(ans1) text=input('輸入英文文字:') text1=encoder(text) print(f'編碼後的文字:{text1}') print(f'解碼後的文字:{decoder(text1)}')
def collatz(n): if n%2==0: return n/2 else: return 3*n+1 try: n=eval(input('Enter a positive integer:')) if type(n)!=int or n<=0: raise ValueError and NameError except ValueError and NameError: print('Error: must be a positive integer') else: list=[n] while n!=1: n=collatz(n) list.append(n) print(list)