Pagini recente » Cod sursa (job #2753841) | Cod sursa (job #890492) | Cod sursa (job #859319) | Cod sursa (job #1468613) | Cod sursa (job #1892786)
#include <fstream>
using namespace std;
long long a, n, d, x, y;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
void Euclid(long long a, long long b, long long &x, long long &y)
{
if(b==0)
{
x=1;
y=0;
return;
}
Euclid(b, a%b, x, y);
long long z=x;
x=y;
y=z-y*(a/b);
}
int main()
{
f>>a>>n;
Euclid(a, n, x, y);
if (x <= 0)
x=n+x%n;
g<<x;
return 0;
}