Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
zad27-notoptimal
//fpc 3.0.0 program zad27; var x : array [1..30000] of byte; var res : longint; var i, j : integer; begin res:=0; for i:=1 to length(x) 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
dsds
урок 8 задача 5 символьный тип данных
Unicorn
Task 1
test29
Find the greatest integers - v1
t moche
Урок 4 задача 5
FRANCILENE PEIXOTO LOPES DA MATA 600621615
zadacha9