题目1:算法训练 Torry的困惑(基本型)
解题思路:
代码
def is_prime(num):
for i in tmp:
if num % i == 0:
return False
return True
n = int(input())
tmp = [2]
ans = 2
i = 3
while True:
if len(tmp) >= n:
break
if is_prime(i):
ans *= i
tmp.append(i)
i += 1
print(ans % 50000)