Cod sursa(job #2164623)
| Utilizator | Data | 13 martie 2018 08:50:57 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <string.h>
using namespace std;
int ciur(int x)
{
int nr=0;
bool fr[x+5];
memset(fr, 1, x+4);
for(int i=2; i<x+1; i++)
{
if(fr[i]==1)
{
nr++;
for(int j=i*2; j<x+1; j+=i)
fr[j]=0;
}
}
return nr;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int n, a, phi;
f>>a>>n; phi=ciur(n-1);
g<<(a*phi)%n;
return 0;
}