Pagini recente » Cod sursa (job #1766805) | Cod sursa (job #2263570) | Cod sursa (job #1206923) | Istoria paginii runda/amigoodenoughforojigim | Cod sursa (job #1648493)
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int a,n;
long long inv,ins;
void fn(long long &x, long long &y,int a, int b)
{
if(!b) {x=1;y=0;}
else { fn(x,y,b,a%b);
long long aux=x;
x=y;
y=aux-y*(a/b);
}
}
int main()
{
f>>a>>n;
fn(inv,ins,a,n);
if(inv<=0) inv=n+inv%n;
g<<inv;
f.close();g.close();return 0;
}