Pagini recente » Cod sursa (job #1875543) | Cod sursa (job #2643746) | Cod sursa (job #1066443) | Cod sursa (job #1346145) | Cod sursa (job #74480)
Cod sursa(job #74480)
#include<fstream.h>
#include<math.h>
long long a[500000],b[500000];
int main(){
ifstream fin("sumdiv.in");
ofstream fout("sumdiv.out");
long A,B;
fin>>A>>B;
for (long f=1;f<=A/f;f++)
if (A%f==0){
b[f]=1;
b[A/f]=1;}
long p=1,max=-1;
for (long i=0;i<=A;i++)
if (b[i]==1)
for (long v=1;v<=B;v++)
for (long j=0;j<=A;j++){
p=i;
if (b[j]==1){
for (long y=1;y<v;y++)
p*=j;
a[p]=1;
if (p>max)
max=p;}}
long S=0;
for (long h=0;h<=max;h++)
if (a[h]==1)
S+=h;
fout<<S%9901;
fin.close();
fout.close();
return 0;
}