Cod sursa(job #20388)
| Utilizator |  Rusu Robert asu_the_best |
Data | 21 februarie 2007 13:31:07 |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
var a,p,s:int64;
i,b:longint;
begin
assign(input,'sumdiv.in');reset(input);
assign(output,'sumdiv.out');rewrite(output);
read(a,b);p:=1;s:=0;
for i:=1 to b do p:=p*a;i:=1;
while p<>0 do begin
if p mod i=1 then begin s:=s+i;p:=p div i;end;inc(i);
end;
write(s mod 9901);
close(input);close(output);
end.