Pagini recente » Borderou de evaluare (job #2247244) | Clasament happy-birthday-infoarena-2014 | Borderou de evaluare (job #443313) | Borderou de evaluare (job #144707) | Cod sursa (job #2165674)
#include <bits/stdc++.h>
using namespace std;
FILE *fin, *fout;
long long n;
long long putere(long long nr, long long p){
if(p<=1) return nr%n;
if(p%2==1) return nr*putere(nr*nr, p/2)%n;
return putere(nr*nr, p/2)%n;
}
int main()
{
fin=fopen("inversmodular.in", "r");
fout=fopen("inversmodular.out", "w");
long long a,i,phi;
fscanf(fin, "%lld %lld", &a, &n);
for(i=2, phi=n; i*i<=n; i++){
if(n%i==0){
phi/=i;
phi*=(i-1);
while(n%i==0)
n/=i;
}
}
if(n==phi) phi--;
fprintf(fout, "%lld", putere(a,phi-1));
return 0;
}