Cod sursa(job #2104736)
Utilizator | Data | 12 ianuarie 2018 10:49:26 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | arhivacre | Marime | 0.38 kb |
/// invers modular
#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#define NMax 2000000001
#define f cin
#define g cout
using namespace std;
long long A, N;
int main()
{
f >> A >> N;
for(long long i = 1; i < N; ++i)
if((A*i) % N == 1)
{
g << i << '\n';
break;
}
return 0;
}