Pagini recente » Cod sursa (job #2119233) | Cod sursa (job #2895407) | Cod sursa (job #1568304) | Cod sursa (job #2772616) | Cod sursa (job #2494371)
#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;
const int modp=1999999973;
int n,p;
int lgp(int a,int b){
int tz=a,sol=1;
for(int i=0;(1<<i)<=b;i++){
if(b&(1<<i)) sol=(sol*tz)%modp;
tz=(tz*tz)%modp;
}
return sol;
}
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("lgput.in");
ofstream fout("lgput.out");
fin >> n >> p;
fout << lgp(n,p);
}