Pagini recente » Cod sursa (job #1722670) | Clasament test__ | Cod sursa (job #2919048) | Cod sursa (job #1449470) | Cod sursa (job #2659077)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
int putere(int a , int b)
{
int r = 1;
while(b)
{
if(b%2)
{
r=(1LL*r*a)%1999999973;
}
a=(1LL*a*a)%1999999973;
b/=2;
}
return r;
}
int main() {
int a , b;
f>>a>>b;
g<<putere(a,b);
return 0;
}