Cod sursa(job #229190)
| Utilizator |  Boicescu Theodor Boicescu_Theodor |
Data | 9 decembrie 2008 17:48:09 |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 30 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.33 kb |
var a,b:0..50000000;
p:real;
i,s,p1:0..900000000;
f,g:text;
const x=9901;
begin
assign(f,'sumdiv.in');reset(f);
assign(g,'sumdiv.out');rewrite(g);
read(f,a,b);
p:=exp(b*ln(a));
p1:=trunc(p);
for i:=1 to trunc(p1/2) do
if p1 mod i=0 then s:=s+i;
s:=s+p1;
write(g,s mod x);
close(f);
close(g);
end.
