Pagini recente » Cod sursa (job #1082871) | Cod sursa (job #511037) | Cod sursa (job #1724066) | Cod sursa (job #2049841) | Cod sursa (job #2900743)
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
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 x1, y1;
euclid(b, a % b, d, x1, y1);
x = y1;
y = x1 - 1LL * (a / b) * y1;
}
}
int main()
{
long long a, n;
f >> a >> n;
long long d, x, y;
euclid(a, n, d, x, y);
while(x < 0)
x += n;
g << x;
return 0;
}