Pagini recente » Diferente pentru problema/royfloyd intre reviziile 36 si 35 | Cod sursa (job #2682613) | Cod sursa (job #2430041) | Cod sursa (job #2340870) | Cod sursa (job #2640674)
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
long long mod=1999999973;
int lgput(int a, int b)
{
if ( b==0)
return 1;
int idk=lgput(a,b/2);
if ( b%2==0)
return 1LL*idk*idk%mod;
else
return ( 1LL* ((1LL * idk*idk)% mod)*a% mod)%mod;
}
int main()
{
int a,b;
in>>a>>b;
out<<lgput(a,b);
return 0;
}