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