Cod sursa(job #613503)
Utilizator | Data | 28 septembrie 2011 16:34:29 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream fin("invmod.in");
ofstream fout("invmod.out");
int a, n;
void InvMod(int a, int n);
int main()
{
fin >> a >> n;
InvMod(a, n);
fin.close();
fout.close();
return 0;
}
void InvMod(int a, int n)
{
for( int i = 1; i < n; ++i )
if( (a * i)%n == 1 )
{
fout << i;
return;
}
}