1 2 3 4 5 6 7 8 9 10 11 | program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N div i do a[i*j]:=false; for i:=2 to N do if a[i] then write(i, ' '); end. |
cHJvZ3JhbSBtYXhmYWN0IChpbnB1dCxvdXRwdXQpOwogICAgdmFyIE4gLCBpLCBqICxtIDogaW50ZWdlcjsKICAgICAgICBhIDogYXJyYXkgWzEuLjUwMDAwMDBdIG9mIGJvb2xlYW47CmJlZ2luCiAgICByZWFkKE4pOwogICAgZm9yIGk6PTEgdG8gTiBkbyBhW2ldOj10cnVlOwogICAgbTo9dHJ1bmMoc3FydChOKSk7CiAgICBmb3IgaTo9MiB0byBtIGRvIAogICAgICBpZiBhW2ldIHRoZW4gZm9yIGo6PTIgdG8gTiBkaXYgaSBkbyBhW2kqal06PWZhbHNlOwogICAgZm9yIGk6PTIgdG8gTiBkbyBpZiBhW2ldIHRoZW4gd3JpdGUoaSwgJyAnKTsgICAgCmVuZC4=
-
upload with new input
-
result: Success time: 0.01s memory: 9000 kB returned value: 0
30
2 3 5 7 11 13 17 19 23 29
-
result: Success time: 0.01s memory: 9000 kB returned value: 0
42
2 3 5 7 11 13 17 19 23 29 31 37 41



