from math import sqrt
def primo(n):
if n <= 1: # 1 não é primo (e estou ignorando o zero e os negativos)
return False
if n == 2 or n == 3: # tem que estar se é 2 (o único número par que é primo)
return True
if n % 2 == 0 or n % 3 == 0:
return False
i = 5
limite = int(sqrt(n)) + 1
while i < limite:
if n % i == 0 or n % (i + 2) == 0:
return False
i += 6
return True
for i in range(100):
if primo(i):
print(i)
ZnJvbSBtYXRoIGltcG9ydCBzcXJ0CgpkZWYgcHJpbW8obik6CiAgICBpZiBuIDw9IDE6ICMgMSBuw6NvIMOpIHByaW1vIChlIGVzdG91IGlnbm9yYW5kbyBvIHplcm8gZSBvcyBuZWdhdGl2b3MpCgkgICAgcmV0dXJuIEZhbHNlCiAgICBpZiBuID09IDIgb3IgbiA9PSAzOiAjIHRlbSBxdWUgZXN0YXIgc2Ugw6kgMiAobyDDum5pY28gbsO6bWVybyBwYXIgcXVlIMOpIHByaW1vKQogICAgICAgIHJldHVybiBUcnVlCiAgICBpZiBuICUgMiA9PSAwIG9yIG4gJSAzID09IDA6CiAgICAgICAgcmV0dXJuIEZhbHNlCiAgICBpID0gNQogICAgbGltaXRlID0gaW50KHNxcnQobikpICsgMQogICAgd2hpbGUgaSA8IGxpbWl0ZToKICAgICAgICBpZiBuICUgaSA9PSAwIG9yIG4gJSAoaSArIDIpID09IDA6CiAgICAgICAgICAgIHJldHVybiBGYWxzZQogICAgICAgIGkgKz0gNgoKICAgIHJldHVybiBUcnVlCgpmb3IgaSBpbiByYW5nZSgxMDApOgoJaWYgcHJpbW8oaSk6CgkJcHJpbnQoaSk=