Cod sursa(job #2639675)
Utilizator | Data | 3 august 2020 14:01:56 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1999999973;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
ll put(ll n, ll p){
ll sol=1;
for(int i=0;(1<<i)<=p;i++)
{
if(((1<<i)& p) >0) sol=(sol*n)%mod;
n=(n*n)%mod;
}
return sol;
}
int main()
{
ll n; ll p;
fin>>n>>p;
fout<<put(n,p);
return 0;
}