Cod sursa(job #739018)
Utilizator | Data | 21 aprilie 2012 22:16:54 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
var f,g:text;t:byte;n,k,j,i,s:longint;
begin
assign(f,'ssnd.in');reset(f);
assign(g,'ssnd.out');rewrite(g);read(f,t);
for j:=1 to t do begin read(f,n);s:=n;k:=1;
for i:=1 to n div 2 do if n mod i=0 then begin inc(k);s:=s+i;end;
writeln(g,k,' ',s);end;close(f);close(g);end.