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