Cod sursa(job #2043841)
Utilizator | Data | 20 octombrie 2017 17:11:27 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
using namespace std;
int main()
{
long long a, b, i, x, y;
cin >> a >> b;
for (i = 1; i <= a - 1; i++)
{
x = a % b;
y = i % b;
if ((x * y) % b == 1){
cout << i;
return 0;
}
}
return 0;
}