Cod sursa(job #443956)
Utilizator | Data | 18 aprilie 2010 22:59:19 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
var
n,i,j:integer;
a:array[1..100] of integer;
s,c:array[1..100] of integer;
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 a[i] do
if a[i] mod j=0 then
begin
s[i]:=s[i]+j;
c[i]:=c[i]+1;
end;
for i:=1 to n do
writeln(g,c[i],' ',s[i]);
close(f);
close(g);
end.