Pagini recente » Cod sursa (job #2717618) | Cod sursa (job #2867296) | Cod sursa (job #76718) | Cod sursa (job #2589833) | Cod sursa (job #2638991)
#include <fstream>
using namespace std;
const long long int rest=1999999973;
int main()
{
ifstream f("lgput.in");
ofstream g("lgput.out");
long long int n,p;
long long int rez=1;
f>>n>>p;
int nrOp=0,i;
int operatii[1001];
rez=n;
while(p>1)
{
if(p%2==1)
{
p--;
nrOp++;
operatii[nrOp]=1;
}
else
{
p=p/2;
nrOp++;
operatii[nrOp]=2;
}
}
for(i=nrOp;i>=1;i--)
{
if(operatii[i]==2)
{
rez=rez*rez;
}
else
{
rez=rez*n;
}
}
g<<rez;
return 0;
}