Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
buscar_numero_V2_divisible_5
//fpc 3.0.0 program buscar_numero_V2; var n, nuevo : integer; encontrado: boolean; begin read(n); encontrado := false; nuevo := n + 1; while (not encontrado) do begin if (nuevo mod 5 = 0) then encontrado := true else nuevo := nuevo + 1; end; write('numero mas cercano y superior a ',n,' divisible por 5 es ',nuevo); end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
codigo
test20
Calculatrice 1.0
cond basico 1
String compare
звёздное небо с подсчётом двойных звёзд
hit or miss
09
НОД не по ЕВКЛИДУ но без массивов
sort-bubble (begin;main;end)
stackse - search stackoverflow differently
Please log in to post a comment.