fork download
  1. def is_prime(n):
  2. """
  3. Return True if n is a prime number, otherwise False
  4.  
  5. example:
  6. is_prime(19)
  7. # True
  8. """
  9. if n < 2:
  10. return False
  11.  
  12. i = 2
  13. while i * i <= n:
  14. if n % i == 0:
  15. return False
  16. i += 1
  17.  
  18. return True
  19.  
  20. # ===== Provided by the TA. Do not modify. =====
  21. def main() -> None:
  22. n = int(input())
  23. print(is_prime(n))
  24.  
  25.  
  26. main()
Success #stdin #stdout 0.06s 14196KB
stdin
45
stdout
False