Cod sursa(job #1348158)
| Utilizator | Data | 19 februarie 2015 15:44:04 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
var n,i,j,k,a,t:longint;
begin
assign(input,'ssnd.in');
assign(output,'ssnd.out');
reset(input);
rewrite(output);
read(n);
for i:=1 to n do begin
read(a);
k:=0;
t:=0;
for j:=1 to trunc(sqrt(a)) do
if a mod j=0 then begin
k:=k+j+(a div j);
inc(t,2);
end;
if frac(sqrt(a))=0 then begin
t:=t-1;
k:=k-trunc(sqrt(a));
end;
writeln(t,' ',k mod 9973);
end;
end.