Cod sursa(job #1234434)
Utilizator | Data | 27 septembrie 2014 13:33:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#define modulo 1999999973
using namespace std;
int main()
{
long long n,p,x;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
fin>>n>>x;
p=1;
while(x!=0)
{
if (x%2==1)
{
x--;
p=(p*n)%modulo;
}
n=(n*n)%modulo;
x/=2;
}
fout<<p<<"\n";
fin.close();
fout.close();
return 0;
}