Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
zad27-notoptimized
//fpc 3.0.0 program zad27; const N=30000; var x : array [1..N] of byte; var res : longint; var i, j : integer; begin res:=0; for i:=1 to N do begin x[i]:=i; if i>1 then for j:=1 to i-1 do begin if (((x[i]+x[j]) mod 2) = 1) and (((x[i]*x[j]) mod 3) = 0) then res:=res+1; end; end; writeln('result=',res); end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
pares entre a y b
09 ariketa
RENAN AZEREDO DA FONSECA 600618046
suduko solver
TanTai11A2@
Programa para calcular digito verificador de un RUT
Task 2
кристина
task 2
Circle
Please log in to post a comment.