fork download
  1. program ideone;
  2.  
  3. function isPrime(N : Integer) : Boolean;
  4. var
  5. D, dD : Integer;
  6. begin
  7. isPrime := (N > 1);
  8. if (N=2) or (N=3) or (N=5) then
  9. Exit;
  10. isPrime := isPrime and (N mod 2 <> 0) and (N mod 3 <> 0);
  11. if not isPrime then
  12. Exit;
  13. D := 5;
  14. dD := 2;
  15. while D <= (N div D) do
  16. if (N mod D) = 0 then
  17. begin
  18. isPrime := False;
  19. Exit;
  20. end
  21. else
  22. begin
  23. D += dD;
  24. dD := dD xor 6;
  25. end;
  26. end;
  27.  
  28. var
  29. i: Integer;
  30.  
  31. begin
  32. for i := 0 to 100 do
  33. begin
  34. if isPrime(i) then Write(i, ' ')
  35. end
  36. end.
Success #stdin #stdout 0s 4368KB
stdin
Standard input is empty
stdout
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97