defis_prime(num):for i in tmp:if num % i ==0:returnFalsereturnTrue
n =int(input())
tmp =[2]
ans =2
i =3whileTrue:iflen(tmp)>= n:breakif is_prime(i):
ans *= i
tmp.append(i)
i +=1print(ans %50000)
题目1:算法训练 Torry的困惑(基本型)解题思路:一个质数肯定不会被小于它的质数除尽代码def is_prime(num): for i in tmp: if num % i == 0: return False return Truen = int(input())tmp = [2]ans = 2i = 3while True: if len(tmp) >= n: break if