Pagini recente » Cod sursa (job #2785120) | Cod sursa (job #1090524) | Cod sursa (job #191184) | Infoarena Monthly 2014 - Solutii Runda 1 | Cod sursa (job #2711414)
#include <fstream>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <cmath>
///#define MOD 1000000007
using namespace std ;
ifstream cin ("inversmodular.in") ;
ofstream cout ("inversmodular.out") ;
long long MOD ;
long long fme(long long a, int n)
{
if(n == 0)return 1 ;
if(n == 1)return a ;
if(n == 2)return a * a % MOD ;
if(n % 2 == 0)return fme(fme(a, n / 2) % MOD, 2) % MOD ;
return a * fme(a, n - 1) % MOD ;
}
long long im(long long a)
{
return fme(a, MOD - 2) ;
}
int main()
{
long long a, b ;
cin >> a >> b ;
MOD = b ;
cout << im(a) << " " ;
return 0 ;
}