Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Решето Эратосфена
const dig = 55; var primes, sieve : set of 2..dig; count, i : integer; begin primes := [2..dig]; sieve := []; for count := 2 to dig do if count in primes then begin sieve := sieve + [count]; for i := 1 to dig div count do primes := primes - [count * i] end; writeln (sieve); end.
run
|
edit
|
history
|
help
0
P170808B
Test
RENAN AZEREDO DA FONSECA 600618046
Angles
test2
1
6
Huong11a2@
nomer8
Potenztabelle