Cod sursa(job #3195076)
Utilizator | Data | 20 ianuarie 2024 08:51:17 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
long long n,k;
int put(long long n,long long b)
{
long long p=1;
while(b!=0)
{
if(b%2==1) p=p*n%k;
b/=2;
n=n*n%k;
}
return p;
}
int inv(long long n,long long k)
{
return put(n,k-2);
}
int main()
{
cin>>n>>k;
cout<<inv(n,k);
return 0;
}