Skip to content

Instantly share code, notes, and snippets.

@wataken44
Created February 3, 2021 07:43
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save wataken44/6b262fcbd590adf5d65b7b3533dae433 to your computer and use it in GitHub Desktop.
Save wataken44/6b262fcbd590adf5d65b7b3533dae433 to your computer and use it in GitHub Desktop.
import sys
def main():
n = int(sys.argv[1])
print(nth_prime(n))
def nth_prime(n):
primes = [2]
k = 3
while len(primes) < n:
is_prime = True
for p in primes:
if p * p > k:
break
if k % p == 0:
is_prime = False
break
if is_prime:
primes.append(k)
k += 2
return primes[-1]
if __name__ == "__main__":
main()
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment