Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
contar_divisores_de_N
//fpc 3.0.0 program contar_divisores_de_N; var n, cont_num_div, divisor : integer; begin read(n); cont_num_div := 0; divisor := 1; while ( divisor <= n ) do begin if (n mod divisor = 0) then cont_num_div := cont_num_div + 1; divisor := divisor + 1; end; write('La cantidad fe divisores exactos de ',n,' es ',cont_num_div); end.
run
|
edit
|
history
|
help
0
Сумма квадратов чисел = n
4 ariketa
practica 2 ejercicio 10
Huong11a2@
Project Euler 21 - Amicable numbers
Prodavnica
xFiles
http://rextester.com/UVQV94798
Светофор-графика
Naloga 8: 10.9.2008