Pagini recente » Cod sursa (job #757089) | Atasamentele paginii Clasament ioi2014. | Cod sursa (job #1357025) | Cod sursa (job #118719) | Cod sursa (job #1281543)
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
int a, n;
const int R = 1999999973;
int putere (int a, int n)
{
if(n == 1) return a;
if(n % 2 == 1) return (long long)a*putere((long long)a*a%R, n/2)%R;
return putere((long long)a*a%R, n/2);
}
int main()
{
in >> a >> n;
out << putere(a,n);
return 0;
}