Pagini recente » Cod sursa (job #2728601) | Cod sursa (job #1501378) | Cod sursa (job #169782) | Cod sursa (job #3158067) | Cod sursa (job #2166603)
#include <fstream>
#include <string.h>
using namespace std;
int phi(int x)
{
int nr=0;
bool fr[x+5];
memset(fr, 1, sizeof(fr));
for(int i=2; i<x; i++)
if(fr[i]==1)
{
nr++;
for(int j=2*i; j<x+5; j+=i)
fr[j]=0;
}
return nr;
}
int putere(int n, int put, int mod)
{
int nr=0, init=n;
while(put>1)
{
if(put%2!=0)
nr++;
put/=2;
n=(n*n)%mod;
}
for(int i=0; i<nr; i++)
n=(n*init)%mod;
return n;
}
int main()
{
int n, a;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
f>>a>>n;
g<<putere(a, phi(n)-1, n);
return 0;
}