Cod sursa(job #3291464)
Utilizator | Data | 4 aprilie 2025 19:07:12 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<bits/stdc++.h>
using namespace std;
long long a , n , p = 1,mod;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long fact(long long n)
{
if(n == 0)
return 1;
else
return n * fact(n-1);
}
long long exp (long long x,long long n)
{
while(n)
{
if(n % 2 == 1)
{
p *= x;
p %= mod;
}
x *= x;
x %= mod;
n /= 2;
}
return p;
}
int main()
{
cin >> a >> mod;
cout << exp(a,mod-2);
}