Cod sursa(job #630222)
Utilizator | Data | 4 noiembrie 2011 22:44:05 | |
---|---|---|---|
Problema | Invers modular | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<cstdio>
using namespace std;
long long n, a;
int main() {
long long i;
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
scanf("%lld %lld", &a, &n);
for(i = 1; i <= n; i++)
if(a * i % n == 1) {
printf("%lld\n", i);
return 0;
}
return 0;
}