Pagini recente » Cod sursa (job #2807692) | Cod sursa (job #2833113) | Cod sursa (job #2856174) | Cod sursa (job #1595421) | Cod sursa (job #3214526)
#include <fstream>
#include <queue>
#include <iostream>
#include <bitset>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int lgput(int a, int b, int mod)
{
int p = 1;
while (b)
{
if (b % 2 == 1)
p =1LL* p * a % mod;
a = 1LL*a * a % mod;
b /= 2;
}
return p;
}
int main()
{
int a, b;
fin >> a >> b;
fout << lgput(a, b - 2, b);
return 0;
}