Pagini recente » Cod sursa (job #510736) | Cod sursa (job #142603) | Cod sursa (job #555165) | Cod sursa (job #1444958) | Cod sursa (job #2494353)
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
///#define cin fin
///#define cout fout
using namespace std;
const int mod=1e9+7;
int a,n;
void invers(int a,int b,int &X,int &Y){
if(b==0){ X=1;Y=0;}
else{
invers(b,a%b,X,Y);
int tz=X;
X=Y;
Y=tz-(a/b)*Y;
}
}
int32_t main(){
//ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
fin >> a >> n;
int X0=0,Y0=0;
invers(a,n,X0,Y0);
X0=X0%n;
if(X0<0) X0+=n;
fout << X0 << '\n';
}