fork(11) download
copy 
  1. Program divisibilite_13;
  2. Var n,nb:integer;
  3. (**********************************)
  4. Function div_13 (n : integer ) : boolean;
  5. Begin
  6. While (n>99) do n := (n div 10) + 4 * (n mod 10);
  7. div_13:=(n mod 13 =0);
  8. End;
  9. (****************** P.P ****************)
  10. Begin
  11. Writeln('les nombres divisibles par 13 :');
  12. nb:=0;
  13. n:=0;
  14. Repeat
  15. If div_13(n) Then
  16. Begin
  17. writeln(n:5);
  18. nb:=nb+1;
  19. End;
  20. n:=n+1;
  21. Until nb=100;
  22. End.
Success #stdin #stdout 0s 288KB
comments (?)
stdin
copy 
22
stdout
copy 
les nombres divisibles par 13 :
    0   13   26   39   52   65   78   91  104  117  130  143  156  169  182  195  208  221  234  247  260  273  286  299  312  325  338  351  364  377  390  403  416  429  442  455  468  481  494  507  520  533  546  559  572  585  598  611  624  637  650  663  676  689  702  715  728  741  754  767  780  793  806  819  832  845  858  871  884  897  910  923  936  949  962  975  988 1001 1014 1027 1040 1053 1066 1079 1092 1105 1118 1131 1144 1157 1170 1183 1196 1209 1222 1235 1248 1261 1274 1287
https://ideone.com/eYDlpL
language:
Pascal (fpc 3.0.4)
created:
7 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!