fork download
  1. program ideone;
  2.  
  3. {$MODE OBJFPC}{$LONGSTRINGS ON}
  4.  
  5. function IsPrimeNumber(ANumber: Integer): Boolean;
  6. var
  7. LDivider: Integer = 2;
  8. begin
  9. while (ANumber > LDivider) and (ANumber mod LDivider <> 0) do
  10. LDivider += 1;
  11.  
  12. Result := ANumber = LDivider;
  13. end;
  14.  
  15. function PrimeNumberByIndex(AIndex: Integer): Integer;
  16. begin
  17. Result := 1;
  18.  
  19. while AIndex >= 0 do
  20. begin
  21. Result += 1;
  22.  
  23. while not IsPrimeNumber(Result) do
  24. Result += 1;
  25.  
  26. AIndex -= 1;
  27. end;
  28. end;
  29.  
  30. var
  31. LIndex: Integer = 0;
  32. begin
  33. while LIndex < 20 do
  34. begin
  35. WriteLn(LIndex:2, ' - ', PrimeNumberByIndex(LIndex));
  36. LIndex += 1;
  37. end;
  38. end.
  39.  
Success #stdin #stdout 0s 288KB
stdin
Standard input is empty
stdout
 0 - 2
 1 - 3
 2 - 5
 3 - 7
 4 - 11
 5 - 13
 6 - 17
 7 - 19
 8 - 23
 9 - 29
10 - 31
11 - 37
12 - 41
13 - 43
14 - 47
15 - 53
16 - 59
17 - 61
18 - 67
19 - 71