Cod sursa(job #2848185)
| Utilizator | Data | 12 februarie 2022 10:52:26 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#define NMAX 260
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long int d,x,y,i,n,m,a,b,c;
void euclid(long long int a, long long int b, long long int& d, long long int&x, long long int&y){
if(b==0)
{
d=a;
x=1;
y=0;
}
else
{
long long int x0,y0;
euclid(b,a%b,d,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
fin>>a>>b;
euclid(a,b,d,x,y);
if(x>1 && x<b-1)
{
fout<<x;
}
else
{
while(x<0)
{
x+=b;
}
fout<<x;
}
return 0;
}
