Pagini recente » Cod sursa (job #1492730) | Cod sursa (job #2516730) | Cod sursa (job #2478353) | Cod sursa (job #1886357) | Cod sursa (job #1281534)
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
int R=1999999973;
int putere(int a,int n)
{
if(n==1) return a;
if(n%2==1) return (long long)a*putere((long long)a*a%R,n/2)%R;
return putere((long long)a*a%R,n/2);
}
int main()
{
int a,n;
f>>a>>n;
g<<putere(a,n);
return 0;
}
/*
a^n=(a^2)^n/2; daca n e par
a*(a^2)^(2n-1)/2
*/