Cod sursa(job #3369574)
| Utilizator | Data | 21 octombrie 2026 10:32:37 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
long long a,n,x,y;
long long mod(long long a,long long n,long long &x,long long &y)
{
if(n==0)
{
x=1;
y=0;
return a;
}
long long x1,y1;
long long d=mod(n,a%n,x1,y1);
x=y1;
y=x1-(a/n)*y1;
return d;
}
int main()
{
cin>>a>>n;
mod(a,n,x,y);
long long in=(x % n + n) % n;
cout<<in<<' ';
return 0;
}
