Cod sursa(job #3001267)
| Utilizator | Data | 13 martie 2023 14:13:46 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int n, a;
void gcd(long long &x, long long &y, int a, int b){
if(!b){
x = 1, y = 0;
}
else{
gcd(x, y, b, a % b);
long long aux = x;
x = y;
y = aux - y * (a / b);
}
}
int main()
{
long long inv = 0, ins;
in >> a >> n;
gcd(inv, ins, a, n);
if(inv <= 0){
inv = n + inv % n;
}
out << inv;
return 0;
}
