Pagini recente » Cod sursa (job #2907326) | Cod sursa (job #783300) | Cod sursa (job #411797) | Cod sursa (job #1315171) | Cod sursa (job #1364408)
#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");
int A,N;
int elog(int a,int n)
{
int p=a,s;
for (int i=0;i<30;++i)
{
if ((1<<i)&n)
s=1ll*(s+p)%n;
p=1ll*a*a%n;
}
return s;
}
int main()
{
f>>A>>N;
g<<elog(A,N);
return 0;
}