Cod sursa(job #279437)
| Utilizator |  Mihai Botezatu Catalin bota |
Data | 12 martie 2009 20:24:37 |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 20 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
var k,l:text;
c,s,p:qword;
i,a,b,j:longint;
begin
assign(k,'sumdiv.in');
reset(k);
assign(l,'sumdiv.out');
rewrite(l);
read(k,a,b);
p:=1;
for i:=1 to b do p:=p*a;
for j:=1 to p div 2 do
if p mod j=0 then s:=s+j;
s:=s+p;
c:=s mod 9901;
write(l,c);
close(k);
close(l);
end.
