Pagini recente » Cod sursa (job #1848476) | Diferente pentru problema/dk intre reviziile 62 si 2 | Cod sursa (job #1895852) | Cod sursa (job #1902123) | Cod sursa (job #2930753)
#include <bits/stdc++.h>
using namespace std;
#define nmax 100000
ifstream f("lgput.in");
ofstream g("lgput.out");
const int mod=1999999973;
long long putere(long long n,long long p){
long long rez=1;
while(p){
if(p%2==1)rez=rez%mod*n%mod;
n=n%mod*n%mod;
p/=2;
}
return rez%mod;
}
int main()
{
long long n,p;
f>>n>>p;
g<<putere(n,p);
}