Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
2 5 8
//fpc 3.0.0 Program example; Var x, y, z: integer; begin writeln (‘Введите три числа’); readln (x, y, z); repeat if x>y>z then x:=x mod y+z else y:=y mod x-z; until (x=0) or (y=0) or (z=0); writeln (‘НОД=’,x+y+z); readln end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
НОД всеми способами
AreaTriangulo.pas
Задача №3549. Замечательные числа - 5
Potenztabelle
Huong11a2@
nomer1
1
JESSICA GOMES DE SOUZA FERREIRA 600621634
Promo1
Project Euler 18 - Maximum path sum
Please log in to post a comment.