Cod sursa(job #705045)
Utilizator | Data | 2 martie 2012 23:51:06 | |
---|---|---|---|
Problema | Invers modular | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<cstdio>
using namespace std;
int main() {
int i, x, y, max;
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
scanf("%d %d", &x, &y);
max = (x*(y-1)-1)/y;
for(i = (x-1)/y; i <= max; i++)
if((i*y+1) % x == 0)
printf("%d", (i*y+1)/x), i = max;
return 0;
}