Nu aveti permisiuni pentru a descarca fisierul grader_test2.ok
Cod sursa(job #530227)
| Utilizator | Data | 7 februarie 2011 11:34:45 | |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int S=1,n,b;
const int mod=9901;
ifstream in("sumdiv.in");
ofstream out("sumdiv.out");
inline int pow(int x,int n)
{
if (!n)
return 1;
if (n==1)
return x%mod;
return pow(x*x%mod,n>>1)*pow(x,n&1)%mod;
}
inline void add(int x,int n)
{
S=S*(pow(x,n+1)+mod-1)%mod*pow(x-1,mod-2)%mod;
}
int main()
{
int i,p;
in>>n>>b;
for (i=2;i*i<=n;i++)
if (n%i==0)
{
for (p=0;n%i==0;p++,n/=i);
add(i,b*p);
}
if (n!=1)
add(n,b);
out<<S<<"\n";
return 0;
}
