Cod sursa(job #3162542)
Utilizator | Data | 29 octombrie 2023 13:13:09 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int M;
long long mod(long long a, int b)
{
long long p=1;
while(b)
{
if(b%2==1)
p=(1LL*((p%M)*(a%M)))%M;
a=(1LL*(a%M)*(a%M))%M;
b/=2;
}
return p;
}
int main()
{
long long n;
cin>>n>>M;
cout<<mod(n,M-2);
return 0;
}