Cod sursa(job #1088038)
| Utilizator | Data | 20 ianuarie 2014 08:45:00 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
var f,g:text; i,t,n,k,s:longint;
Procedure SNDiv(n:longint; var k,s:longint);
begin
k:=0; s:=0;
for i:=1 to trunc(sqrt(n)) do
if n mod i=0 then
if i<>n div i then begin k:=k+2; s:=s+i+n div i end
else begin inc(k); s:=s+i; end;
s:=s mod 9973;
end;
begin
assign(f, 'ssnd.in');
assign(g, 'ssnd.out');
reset(f); rewrite(g);
readln(f, t);
while not eof(f) do
begin
readln(f, n);
SNDiv(n,k,s);
writeln(g, k, ' ', s);
end;
close(f); close(g);
end.
