Cod sursa(job #3369632)
| Utilizator | Data | 21 octombrie 2026 11:14:53 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
vector <long long> prim;
long long baza,n,a,b;
void euclid(long long a, long long b, long long &x, long long &y)
{
if (b==0)
{
x=1;
y=0;
}
else
{
long long x0,y0;
euclid(b,a%b,x0,y0); ///& (ampersantul) imi calculeaza val lui x0,y0
x=y0; ///formula de recurenta
y=x0-a/b*y0;
}
}
int main()
{cin>>baza>>n;
euclid(baza,n,a,b);
a=a+((abs(a)/n+1)*n);
cout<<a;
return 0;
}
