Pagini recente » Diferente pentru problema/kc intre reviziile 2 si 3 | Cod sursa (job #1404545) | Cod sursa (job #2014245) | Cod sursa (job #525627) | Cod sursa (job #2369870)
#include <iostream>
#include <fstream>
#define ll long long
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
ll n, MOD;
ll lgput(ll n, ll p)
{
ll ans=1;
while(p)
{
if(p&1) ans=(1LL*ans*n)%MOD;
n=(1ll*n*n)%MOD;
p >>= 1;
}
return ans;
}
int main()
{
f >> n >> MOD;
g << lgput(n, MOD-2);
return 0;
}