Pagini recente » Cod sursa (job #2809034) | Cod sursa (job #823169) | Cod sursa (job #2154786) | Cod sursa (job #2641933) | Cod sursa (job #1325983)
#include<cmath>
#include<fstream>
using namespace std;
ifstream f("puteri3.in");
ofstream g("puteri3.out");
const int mod=1999999973;
long n,k;
long long f(long long a, long long b)
{ if(b==0) return 1;
else
{ if(b%2==0)
return (f(a,b/2)%mod)*(f(a,b/2)%mod)%mod ;
else
return ((f(a,b/2)%mod)*(a%mod)%mod)*(f(a,b/2)%mod)%mod;
}
}
int main()
{ int s=0,i;
f>>n>>k;
for(i=1;i<=n;i++)
s=s+f(n,k);
g.close();
return 0;