Cod sursa(job #1409275)
| Utilizator | Data | 30 martie 2015 14:25:55 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
# include <fstream>
# include <algorithm>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int i,j,n,a;
void euclid (int a, int b, long long &x, long long &y)
{
if (b==0)
{
x=1; y=0;
return;
}
long long x0, y0;
euclid (b, a%b, x0, y0);
x=y0;
y=x0 - (a/b)*y0;
}
int main ()
{
f>>a>>n;
long long x, y;
euclid (a, n, x, y);
if (x<0) x=n+x%n;
g<<x<<"\n";
return 0;
}
