Cod sursa(job #446845)
Utilizator | Anghel Daniel angdan | Data | 26 aprilie 2010 19:37:25 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 60 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
var
n,i,j:longint;
a,c,s:array[1..100] of int64;
f,g:text;
begin
assign(f,'ssnd.in'); reset(f);
assign(g,'ssnd.out'); rewrite(g);
read(f,n);
for i:=1 to n do
read(f,a[i]);
for i:=1 to n do
for j:=1 to trunc(sqrt(a[i])) do
if a[i] mod j=0 then
begin
s[i]:=s[i]+j+a[i] div j;
c[i]:=c[i]+2;
end;
for i:=1 to n do
writeln(g,c[i],' ',s[i] mod 9973);
close(f);
close(g);
end.