Pagini recente » Cod sursa (job #2353939) | Cod sursa (job #1434647) | Cod sursa (job #1824330) | Cod sursa (job #3269186) | Cod sursa (job #1656386)
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
void read(int &n, int &m)
{
scanf("%d %d", &n, &m);
}
long long int algoritm(int n, int m)
{
if(m%2==0)
algoritm(pow(n,2), m/2);
else if(m==1)
{
int rez = (n * m) % 1999999973;
return rez;
}
else
algoritm(n*(pow(n,2)), (m-1)/2);
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
int n, m;
read(n, m);
cout<<algoritm(n, m);
}