Cod sursa(job #2270521)
Utilizator | Data | 27 octombrie 2018 11:23:40 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
void euclid(long long a, long long n, long long k)
{
if((a * k) % n == 1)
g << k;
else euclid(a, n, k+1);
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long a, n;
f >> a >> n;
euclid(a, n, 0);
return 0;
}