Pagini recente » Cod sursa (job #1527003) | Diferente pentru problema/culmi intre reviziile 2 si 1 | Cod sursa (job #1103259) | Cod sursa (job #1993148) | Cod sursa (job #1101493)
#include <fstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#define mod 1999999973
#define ll long long
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
ll N, P;
ll lgput(ll baza, ll exp)
{
ll res=1;
while (exp)
{
if (exp%2) res*=baza, res%=mod;
baza*=baza; baza%=mod;
exp/=2;
}
return res;
}
int main()
{
f>>N>>P;
g<<lgput(N, P)<<'\n';
return 0;
}