Cod sursa(job #523441)

Utilizator PlayLikeNeverB4George Marcus PlayLikeNeverB4 Data 18 ianuarie 2011 01:02:26
Problema Suma divizorilor Scor 70
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.11 kb
#include <fstream>
using namespace std;
ifstream fin("sumdiv.in");
ofstream fout("sumdiv.out");

const int M=9901;
int i,A,B;
long long S=1;

void euclid(int a, int b, int &x, int &y)
{
	if(b==0)
	{
		x=1;
		y=0;
	}
	else
	{
		int x0,y0;
		euclid(b,a%b,x0,y0);
		x=y0;
		y=x0-(a/b)*y0;
	}
}

int put(int c, int p)
{
	int R=1;
	while(p>0)
	{
		if(p&1) { R=R*c; R%=M; }
		c=c*c;
		c%=M;
		p>>=1;
	}
	return R;
}

void rez()
{
	int p,x,y,p1,p2;
	for(i=2;i*i<=A;i++)
	{
		if(A%i>0) continue;
		p=0;
		while(A%i==0)
		{
			A/=i;
			p++;
		}
		if(i%M==1) S*=1LL*(p+1) % M;
		else
		{
		p1= ( put(i,p*B+1) - 1) + M;
		p1%=M;
		euclid(i-1,M,x,y);
		while(x<0) x+=M;
		p2=x % M;
		//p2= put(i-1,A-2) % M;
		S=S* 1LL * (p1 * p2);
		S%=M;
		}
	}
	if(A>1)
	{
		if(A % M == 1 )
			S*=1LL * (B % M + 1) % M;
		else
		{
		p1= ( put(A,B+1) - 1) + M;
		p1%=M;
		euclid(A-1,M,x,y);
		while(x<0) x+=M;
		p2=x % M;
		//p2=put(A-1,M-2) % M;
		S=(S* 1LL * (p1 * p2));
		S%=M;
		}
	}
}


int main()
{
	fin >> A >> B;
	rez();
	if(A==0) fout << "0";
	else fout << S;
}