fork download
  1. def primo(p):
  2. c = p
  3. for x in range(2, p):
  4. if p%x == 0:
  5. c = 0
  6. return c
  7.  
  8. def mayor(n):
  9. c = 3
  10. while c < n//2:
  11. r = primo(c)
  12. c += 1
  13. return r
  14. print(mayor(100))
Success #stdin #stdout 0.02s 9144KB
stdin
Standard input is empty
stdout
0