Pagini recente » Cod sursa (job #1153238) | Cod sursa (job #441456) | Cod sursa (job #402057) | Cod sursa (job #1763400) | Cod sursa (job #1653743)
#include <fstream>
#define w 200000001
using namespace std;
unsigned int phi[w],n;
long long po(long long a,long long b)
{
long long rez=1;
while (b)
{
if (b%2) rez=(rez*a)%n;
a=(a*a)%n;
b/=2;
}
return rez;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
unsigned int i,j,a;
f>>a>>n;
for (i=2;i<=n/2;i++)
{
phi[2*i]++;
for (j=3*i;j<=n;j+=i)
phi[j]+=phi[j-i];
}
long long x=po(a,n-2-phi[n]);
g<<x%n<<'\n';
f.close();
g.close();
return 0;
}