Pagini recente » Istoria paginii runda/simulare_oji_2023_clasele_11_12_10_martie | Cod sursa (job #2885842) | Cod sursa (job #2935744) | Cod sursa (job #302596) | Cod sursa (job #1257844)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("inversmodular.in");
ofstream out ("inversmodular.out");
int q;
long long pow(int x,int y)
{ if(y==1)
return x;
long long val=pow(x,y/2);
if(y%2==1)
return val*val%q*x%q;
return val*val%q;
}
int main()
{
long long a,n,k;
in>>a>>n;
k=pow(a,n-2);
out<<k%n;
return 0;
}