Cod sursa(job #3227567)
Utilizator | Data | 1 mai 2024 23:30:01 | |
---|---|---|---|
Problema | Invers modular | Scor | 30 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
#include <stdlib.h>
int main() {
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
long long a, n;
scanf("%lld%lld", &a, &n);
for (long long i = 1; i <= n; i++) {
if ((a * i) % n == 1) {
printf("%lld\n", i);
return 0;
}
}
return 0;
}