Cod sursa(job #3209921)
| Utilizator | Data | 3 martie 2024 21:06:21 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
#define TITLE "inversmodular"
#define MOD 7
ifstream f (TITLE".in");
ofstream g (TITLE".out");
long long binpow (long long a, long long b, long long mod)
{
long long answer=1;
while(b)
{
if(b%2==1)
answer*=a;
answer%=mod;
a*=a;
a%=mod;
b/=2;
}
return answer%mod;
}
//long long invmod (long long a)
//{
// return binpow(a,MOD-2);
//}
int main()
{
long long a,b;
f>>a>>b;
g<<binpow(a,b-2,b);
return 0;
}
