Pagini recente » Cod sursa (job #1845580) | Cod sursa (job #3289311) | Cod sursa (job #3246237) | Istoria paginii preoni-2007/clasament/runda-2/9 | Cod sursa (job #3284870)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
void euclid(int a,int b,int &x, int &y)
{
if(b==0)
{ x=1;
y=1;
}
else
{
int x1,y1;
euclid(b,a%b,x1,y1);
x=y1;
y=x1-a/b*y1;
}
}
int main()
{
int a,b,x,y;
f>>a>>b;
euclid(a,b,x,y);
if(x<0)
{
while(x<0)
x+=b;
}
g<<x;
return 0;
}