Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
zad27-optimized
//fpc 3.0.0 program zad27; const N=30000; var x : array [1..N] of byte; var res : longint; var kchet, knech, kchetdel, knechdel, i : integer; var ischet, isdel : boolean; begin kchet:=0; knech:=0; kchetdel:=0; knechdel:=0; res:=0; for i:=1 to N do begin x[i]:=i; ischet:=(x[i] mod 2) = 0; isdel:=(x[i] mod 3) = 0; if i>1 then begin if ischet then begin if isdel then res:=res+knech else res:=res+knechdel; end else begin if isdel then res:=res+kchet else res:=res+kchetdel; end; end; if ischet then begin kchet:=kchet+1; if isdel then kchetdel:=kchetdel+1; end else begin knech:=knech+1; if isdel then knechdel:=knechdel+1; end; end; writeln('result=',res); end.
run
|
edit
|
history
|
help
0
pretvarac u sekunde
Андреева Урок 6 задача 8 (1531)
TanTai11A2@
practica 9 ejercicio 3
practica 6 ejercicio 2
test25
test29
5 5
test27b
Сортировка массива цифр