Cod sursa(job #229339)
Utilizator | Data | 9 decembrie 2008 22:09:09 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.27 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;
}