Pagini recente » Cod sursa (job #529) | Cod sursa (job #2626322) | Cod sursa (job #2181573) | Cod sursa (job #538653) | Cod sursa (job #2848173)
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(long long a, long long b, long long&d, long long&x, long long&y);
long long n, a, b, d, i, x, y, c;
int main()
{
fin>>a>>b;
euclid(a, b, d, x, y);
while(x<0) x+=n;
fout<<x;
return 0;
}
void euclid(long long a, long long b, long long&d, long long&x, long long&y)
{
if(b==0) d=a, x=1, y=0;
else
{
long long x0, y0;
euclid(b, a%b, d, x0, y0);
x=y0;
y=x0-(a/b)*y0;
}
}