Pagini recente » Cod sursa (job #956459) | Cod sursa (job #1943226) | Cod sursa (job #1233036) | Cod sursa (job #2933266) | Cod sursa (job #1364421)
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long int A,N;
long long int elog(long long int a,long long int n)
{
long long int p=a,s=1;
for (int i=0;i<32;++i)
{
if ((1ll<<i)&n)
s=(s*p)%(n+2);
p=p*p%(n+2);
}
return s;
}
int main()
{
f>>A>>N;
g<<elog(A,N-2);
return 0;
}