Cod sursa(job #1190063)
Utilizator | Data | 24 mai 2014 13:43:21 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
program ssnd;
var
n,i,j,k,h,s:longint;
f1,f2:text;
begin
assign (f1,'ssnd.in');
assign (f2,'ssnd.out');
reset (f1);
rewrite (f2);
readln (f1,n);
for i:=1 to n do begin
readln (f1,h);
s:=0; k:=0;
for j:=1 to h div 2 do
if h mod j=0 then begin
k:=k+1; s:=s+j;
end;
writeln (f2,k+1,' ',s+h);
end;
close (f1);
close (f2);
end.