Cod sursa(job #1401276)
| Utilizator | Data | 25 martie 2015 19:04:19 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
struct EuclidResult {
int x,y,gcd;
};
EuclidResult euclid(int a, int b) {
if(b==0) {
return {1,0,a};
}
else {
EuclidResult last = euclid(b,a%b);
return {last.y,last.x-(a/b)*last.y,last.gcd};
}
}
int main() {
int a,n;
in >> a >> n;
EuclidResult res = euclid(a,n);
while(res.x < 0) res.x +=n;
out << res.x << '\n';
return 0;
}