Pagini recente » Cod sursa (job #1376602) | Cod sursa (job #1050765) | Borderou de evaluare (job #1569492) | Cod sursa (job #836415) | Cod sursa (job #1006513)
#include <fstream>
using namespace std;
ifstream is("inversmodular.in");
ofstream os("inversmodular.out");
long long a, n;
int Invm(long long a, long long n);
int main()
{
is >> a >> n;
os << Invm(a, n);
is.close();
os.close();
return 0;
}
int Invm(long long a, long long n)
{
for ( long long i = 1; i < n; ++i )
if ( a * i % n == 1 )
return i;
}