Pagini recente » Diferente pentru problema/funnygraph intre reviziile 11 si 10 | Borderou de evaluare (job #2511691) | Cod sursa (job #606945) | Borderou de evaluare (job #1599204) | Cod sursa (job #2134602)
#include <fstream>
#define M 1999999973
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int p,a,b;
int rec(int n,int o);
int main()
{
fin>>a>>b;
p=rec(a,b);
fout<<p<<'\n';
return 0;
}
int rec(int n,int o)
{
if(o==0)
return 1;
int x=rec(n,o/2)%M;
if(o%2)
return (((x*x)%M)*n)%M;
return (x*x)%M;
}