Cod sursa(job #1006510)
| Utilizator | Data | 7 octombrie 2013 10:30:36 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream is("inversmodular.in");
ofstream os("inversmodular.out");
int a, n;
int Invm(int a, int n);
int main()
{
is >> a >> n;
os << Invm(a, n);
is.close();
os.close();
return 0;
}
int Invm(long long a, long long n)
{
for ( long long i = 1; i < n; ++i )
if ( a * i % n == 1 )
return i;
}
