Pagini recente » Cod sursa (job #2366373) | Cod sursa (job #2778125) | Cod sursa (job #789387) | Cod sursa (job #2209434) | Cod sursa (job #3214523)
#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 = p * a % mod;
a = a * a % mod;
b /= 2;
}
return p;
}
int main()
{
int a, b;
fin >> a >> b;
fout << lgput(a, b - 2, b);
return 0;
}