Pagini recente » Cod sursa (job #670844) | Cod sursa (job #1661710) | Cod sursa (job #1908168) | Cod sursa (job #2413051) | Cod sursa (job #1637841)
#include <fstream>
using namespace std;
#define MOD 1999999973
ifstream is("lgput.in");
ofstream os("lgput.out");
long long lgput(long long n, long long p );
int main()
{
long long n, p;
is >> n >> p;
os << lgput(n, p);
is.close();
os.close();
return 0;
}
long long lgput(long long n, long long p )
{
long long sol = 1;
for ( int i = 0; (1<<i) <= p; ++i )
{
if ( (1<<i) & p )
sol = (sol * n) % MOD;
n = (n * n) % MOD;
}
return sol;
}