Pagini recente » Borderou de evaluare (job #2163669) | Cod sursa (job #1205011) | Cod sursa (job #2733323) | Cod sursa (job #3237826) | Cod sursa (job #425160)
Cod sursa(job #425160)
#include <fstream.h>
#define prim 1999999973
int vector [1000];
long long putereeeeee(long long Baza, long long Putere)
{
long long rez = 1;
long long val = Baza ;
for( long long i = 1; i <= Putere; i <<= 1)
{
if( Putere & i )
rez = (rez * val)% prim;
val = val * val % prim;
}
return rez;
}
int main ()
{
ifstream f ("lgput.in");
ofstream g ("lgput.out");
long long N,P;
long long k;
f>>N>>P;
k=putereeeeee (N,P);
g<<k;
f.close();
g.close();
return 0;
}