Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
p1
var x: integer; begin readln(x); if x mod 2 =0 then writeln('DA') else writeln('NU'); end.
run
|
edit
|
history
|
help
0
Unicorn
Kim
the answer is the last result
zadacha1
Pokazivac-dinamicka alokacija memorije
yh
aaaaaaa
Project Euler 18 - Maximum path sum
Бассейн-8 count
Program summa