Pagini recente » Cod sursa (job #1004204) | Cod sursa (job #2376371) | Diferente pentru problema/cautbin intre reviziile 50 si 49 | Cod sursa (job #2903146) | Cod sursa (job #1364439)
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int n,m,i,j,b,c;
long long int d,a=1;
int main()
{
f>>n>>m;
b=m-2;d=n;
for(i=0;(1<<i)<=b;i++,d=d*d%m)
if((1<<i)&b)
a=(a*d)%m;
g<<a%m;
return 0;
}