Cod sursa(job #2429157)
Utilizator | Arteni Cristi Arteni_Cristi | Data | 8 iunie 2019 00:44:59 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
var n,m,i,j,x,dv:longint;
begin
assign(input,'ssnd.in'); reset(input);
assign(output,'ssnd.out'); rewrite(output);
readln(n);
for i:=1 to n do
begin
readln(m);
x:=0; dv:=0;
for j:=1 to trunc(sqrt(m)) do
if m mod j=0 then
begin
inc(x,2);
inc(dv,j+m div j)
end;
if trunc(sqrt(n))=sqrt(n) then
begin
dec(x);
dec(dv,trunc(sqrt(m)))
end;
writeln(x,' ',dv)
end;
close(input);
close(output)
end.