Pagini recente » Cod sursa (job #48589) | Cod sursa (job #350022) | Cod sursa (job #2154116) | Cod sursa (job #3166375) | Cod sursa (job #1214395)
#include<fstream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int a,n,x,y,d;
void euclid(int a,int b,int &d,int &x,int &y)
{
if(b==0)
{
d=a;
x=1;
y=0;
}
else
{
int x0,y0;
euclid(b,a%b,d,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
f>>a>>n;
euclid(a,n,d,x,y);
if(x<=0)
x=n+x%n;
g<<x;
return 0;
}