Pagini recente » Arhiva de probleme | Istoria paginii runda/5_martie_simulare_oji_2024_clasele_11_12 | Cod sursa (job #1547869) | Cod sursa (job #1567243) | Cod sursa (job #1650056)
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int MOD=1999999973;
inline long long Put(int x, int n,int MOD)
{
int p=1;
while (n>0)
{
if(n&1)
{
p=(1LL*p*x)%MOD;
n--;
}
x=(1LL*x*x)%MOD;
n=n/2;
}
return p ;
}
int main()
{
long long n,p;
f>>n>>p;
g<<Put(n,p,MOD)<<"\n";
return 0;
}