Cod sursa(job #414738)
Utilizator | Nociv Hasis ivanhoe | Data | 10 martie 2010 14:36:47 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
var
t:byte;
f,g:text;
n,x:longint;
y:double;
i:byte;
procedure divizori(nr:longint);
var
i:longint;
begin
x:=1;
y:=nr;
for I:=1 to nr div 2 do
if nr mod i=0
then
begin
x:=x+1;
y:=y+i;
end;
end;
begin
assign(f,'ssnd.in'); assign(g,'ssnd.out');
reset(f); rewrite(g);
readln(f,t);
for I:=1 to t do
begin
readln(f,n);
divizori(n);
writeln(g,x,' ',y:0:0);
end;
close(f);
close(g);
end.