Pagini recente » Rezultatele filtrării | Borderou de evaluare (job #1421411) | Rezultatele filtrării | Atasamentele paginii Profil 8audreyc282gL0 | Cod sursa (job #1082055)
#include <fstream>
using namespace std;
#define MOD 1999999973
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n, p;
long long lgput(int x, int n)
{
if(n == 0)
{
return 1;
}
else if(n == 1)
{
return (x % MOD);
}
else if(n % 2 == 0)
{
return lgput(x*x % MOD, n/2) % MOD;
}
else if(n % 2 == 1)
{
return (lgput(x*x % MOD, (n-1)/2)*x) % MOD;
}
}
int main()
{
fin >> n >> p;
fout << lgput(n, p) % 1999999973;
}