Pagini recente » Cod sursa (job #1526787) | Cod sursa (job #937276) | Cod sursa (job #443042) | Istoria paginii runda/preoji_11-12/clasament | Cod sursa (job #1176485)
#include <iostream>
#include<fstream>
using namespace std;
long long s;
long long power (long long x, int n )
{
if(n==0) return 1;
if(n==1)return x%s;
if(n%2==0) return power((x*x)%s,n/2)%s;
else ((x%s)*power((x*x)%s,(n-1)/2))%s;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long x, n;
f>>x>>n;
s=n;//g<<x<<n;
g<<power(x,n-2)%s;
return 0;
}