Cod sursa(job #2335915)
Utilizator | Data | 4 februarie 2019 17:11:14 | |
---|---|---|---|
Problema | Invers modular | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
int main()
{
long long N,M;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%lld %lld\n",&N,&M);
for(long long i = 1;i <= M; ++i)
{
if (((long long) N * i) % M == 1) {printf("%lld\n",i);return 0;}
}
return 0;
}