Pagini recente » Cod sursa (job #2687650) | Cod sursa (job #3289099) | Cod sursa (job #3004805) | Cod sursa (job #1802553) | Cod sursa (job #3132904)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
ll exp_log(ll x, ll n)
{
if(n == 0) return 1;
if(n%2) return x*exp_log(x*x%n, n/2)%n;
return exp_log(x*x%n, n/2);
}
ll phi(ll n)
{
ll result = n;
for(int i = 2; i*i <= n; i++)
{
if(n%i == 0)
{
while(n%i == 0)
n/=i;
result -= result/i;
}
}
if(n>1)
result -= result/n;
return result;
}
int main()
{
ll a, n;
in >> a >> n;
for(ll i = 1; i < n; i++)
if(a*i%n == 1)
{
out << i;
return 0;
}
return 0;
}