Pagini recente » Cod sursa (job #2086960) | Cod sursa (job #744234) | Cod sursa (job #911619) | Cod sursa (job #1657890) | Cod sursa (job #1033026)
# include <fstream>
# define ll long long
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int A,N;
void euclid( ll &x , ll &y , int a , int b )
{
if( b == 0 )
x = 1 , y = 0;
else
{
euclid(x,y,b,a%b);
ll aux = x;
x = y;
y = aux - y*(a/b);
}
}
int main()
{
ll X,Y;
fin >> A >> N;
euclid(X,Y,A,N);
if( X <= 0 ) X = N + X%N;
fout << (ll)X;
fin.close();
fout.close();
return 0;
}