Pagini recente » Cod sursa (job #1178582) | Cod sursa (job #1561667) | Cod sursa (job #916523) | Cod sursa (job #2726359) | Cod sursa (job #2222332)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1;
y=0;
} else
{
int x0,y0;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
int a,n;
fin>>a>>n;
int x,y;
euclid(a,n,x,y);
while(x<0)
x+=n;
fout<<x;
return 0;
}