Pagini recente » Cod sursa (job #3198815) | Cod sursa (job #685309) | Cod sursa (job #277657) | Cod sursa (job #2680910) | Cod sursa (job #903023)
Cod sursa(job #903023)
#include <iostream>
#include <fstream>
const int mod=1999999973;
using namespace std;
long long n,p;
long putere(int n,int p,int mod)
{
long long r;
if (p==0) return 1;
if (p%2==0)
{
r=putere(n,p/2,mod);
return (r*r)%mod;
}
else
{
r=putere(n,p-1,mod);
return (r*n)%mod;
}
}
int main()
{
ifstream f("lgput.in");
ofstream g("lgput.out");
f>>n>>p;
g<<putere(n,p,mod);
return 0;
}