Cod sursa(job #2711079)
Utilizator | Dragomir Daria dariadragomir23 | Data | 23 februarie 2021 17:30:07 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long a, n;
pair <long long, long long> euclid(long long x, long long y)
{
if(y==0)
return {1, 0};
auto p=euclid(y, x%y);
return {p.second, p.first-(x/y)*p.second};
}
int main()
{
f>>a>>n;
long long rez=euclid(a, n).first;
while(rez<0)
rez+=n;
rez=rez%n;
g<<rez;
return 0;
}