Cod sursa(job #1478360)
| Utilizator | Data | 28 august 2015 14:41:37 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("inversmodular.in");
ofstream out("inversmodular.out");
int cmmdc(long a,long b)
{
int r;
r=a%b;
while(r!=0)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
long a,n,i=1,ct=0,nr;
fin>>a>>n;
for(i=1;i<n;i++)
if(cmmdc(i,n)==1)
ct++;
nr=round(pow(a,ct-1));
out<<nr%n;
fin.close();
out.close();
return 0;
}
