1 print(sum) 2 sum = 42 3 print(sum) 4 5 def inc(n): 6 sum = n + 1 7 print(sum) 8 return sum 9 10 sum = inc(7) + inc(7) 11 print(sum)
不是
line1作用域为line1
line2作用域为line2
line7作用域为line6
line11作用域为line10
1 def func1(a,b,c,d,e,f): 2 return[a,b,c,d,e,f] 3 def func2(a,b,c,*,d,e,f): 4 return[a,b,c,d,e,f] 5 def func3(a,b,c,/,d,e,f): 6 return[a,b,c,d,e,f] 7 8 9 print(func1(1,9,2,0,5,3)) 10 print(func1(a=1,b=9,c=2,d=0,e=5,f=3)) 11 print(func1(1,9,2,f=3,d=0,e=5)) 12 13 print(func2(11,99,22,d=0,e=55,f=33)) 14 print(func2(a=11,b=99,c=22,d=0,e=55,f=33)) 15 print(func2(11,99,22,0,55,33)) 16 17 print(func3(111,999,222,0,555,333)) 18 print(func3(111,999,222,d=0,e=555,f=333))
是
1 def func(a,b,c,/,*,d,e,f): 2 return([a,b,c,d,e,f]) 3 print(func(1,2,3,d=4,e=5,f=6)) 
1 def solve(a, b, c): 2 ''' 3 求解一元二次方程, 返回方程的两个根 4 :para: a,b,c: int 方程系数 5 :return: tuple 6 ''' 7 delta = b*b - 4*a*c 8 delta_sqrt = abs(delta)**0.5 9 p1 = -b/2/a; 10 p2 = delta_sqrt/2/a 11 12 if delta>=0: 13 root1 = p1 + p2 14 root2 = p1 - p2 15 else: 16 root1 = complex(p1, p2) 17 root2 = complex(p1, -p2) 18 19 return root1, root2 20 print(solve.__doc__) 21 22 while True: 23 try: 24 a,b,c = eval(input('Enter eqution coefficient: ')) 25 if a == 0: 26 raise 27 except: 28 print('invalid input, or, a is zero') 29 break 30 else: 31 root1, root2 = solve(a, b, c) 32 print(f'root1 = {root1:.2f}, root2 = {root2:.2f}') 33 print()
1 def list_generator(a, b, c = 1): 2 list = [] 3 n = a 4 while(n <= b): 5 list.append(n) 6 n = n + c 7 return list 8 9 10 list1 = list_generator(-5, 5) 11 print(list1) 12 13 list2 = list_generator(-5, 5, 2) 14 print(list2) 15 16 list3 = list_generator(1, 5, 0.5) 17 print(list3)
1 def is_prime(n): 2 try: 3 if not(type(n)==int and n>1): 4 raise ValueError 5 except ValueError: 6 print("Input must be a natural number and greater than 1!") 7 else: 8 for i in range(2,n): 9 if n%i==0: 10 return False;break 11 else: 12 return True 13 14 primes=[] 15 for i in range(2,21): 16 if is_prime(i): 17 primes.append(i) 18 for i in range(4,21,2): 19 #tag=0 20 for j in range(len(primes)): 21 for k in range(j,len(primes)): 22 if i==primes[j]+primes[k]: 23 print(f"{i} = {primes[j]} + {primes[k]}") 24 #tag=1 25 #if tag==1: 26 #break
1 def encoder(s): 2 try: 3 if type(s)!=str: 4 raise TypeError 5 except TypeError: 6 print("Input must be a string!") 7 else: 8 capital=tuple([chr(x) for x in range(ord('A'),ord('Z')+1)]) 9 lowercase=tuple([chr(x) for x in range(ord('a'),ord('z')+1)]) 10 S=list(s) 11 for i,j in enumerate(S): 12 for k in range(len(capital)): 13 if j==capital[k]: 14 S[i]=capital[(k+5)%26];break 15 elif j==lowercase[k]: 16 S[i]=lowercase[(k+5)%26];break 17 s="".join(S) 18 return s 19 20 def decoder(s): 21 try: 22 if type(s)!=str: 23 raise TypeError 24 except TypeError: 25 print("Input must be a string!") 26 else: 27 capital=tuple([chr(x) for x in range(ord('A'),ord('Z')+1)]) 28 lowercase=tuple([chr(x) for x in range(ord('a'),ord('z')+1)]) 29 S=list(s) 30 for i,j in enumerate(S): 31 for k in range(len(capital)): 32 if j==capital[k]: 33 S[i]=capital[(k-5)%26];break 34 elif j==lowercase[k]: 35 S[i]=lowercase[(k-5)%26];break 36 s="".join(S) 37 return s 38 39 s=input("Input a English text:") 40 print(f"Encoded text: {encoder(s)}") 41 print(f"Decoded text: {decoder(encoder(s))}")
1 def collatz(x): 2 if(x % 2 == 0): 3 x = int(x / 2) 4 else: 5 x = 3 * x + 1 6 return x 7 8 list = [] 9 10 try: 11 n = eval(input('Enter a positive integer: ')) 12 13 if(n <= 0): 14 raise 15 elif(int(n) != n): 16 raise 17 18 while True: 19 if(n == 1): 20 list.append(n) 21 break 22 else: 23 list.append(int(n)) 24 n = collatz(n) 25 26 print(list) 27 28 except: 29 print('Error: must be a positive integer')
