Cod sursa(job #1896550)
Utilizator | Data | 28 februarie 2017 19:13:27 | |
---|---|---|---|
Problema | Invers modular | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
unsigned long long a,b,nr=1,copie;
unsigned long i;
int main()
{
f>>a>>b;
int ok=1;
copie=b;
for(int k=2;k<=sqrt(b)&&ok;k++)
if(b%k==0) ok=0;
b--;
if(ok) b--;
for(nr=1,i=(1<<31);i;i>>=1)
{
nr*=nr;
//nr%=copie;
if(i&b) nr*=a;
nr%=copie;
}
g<<nr%copie;
return 0;
}