Pagini recente » Cod sursa (job #2922898) | Cod sursa (job #259375) | Cod sursa (job #935141) | Cod sursa (job #1226630) | Cod sursa (job #2080517)
#include<bits/stdc++.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
//constata la care se imparte
const unsigned long long x=1999999973;
//functia recursiva care ridica la putere logaritmic
unsigned long long lgput(unsigned long long n,unsigned long long p){
if(p==0) return 1; //cand p ajunge la finalul recursivitatii
if(p%2==0) return lgput((n*n)%x,p/2); //daca puterea e para
return ((lgput((n*n)%x,(p-1)/2))*n)%x; // daca puterea este impara
}
int main(){
unsigned long long n,p;f>>n>>p;
g<<lgput(n,p)%x;
return 0;
}