欧拉计划Problem 56

A googol (10¹⁰⁰) is a massive number: one followed by one-hundred zeros; 100¹⁰⁰ is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.

Considering natural numbers of the form, a^b, where a, b  100, what is the maximum digital sum?



#define N 100


int everydigit(int num[]);
int numpow(int num[],int a);


int numpow(int num[],int a)
{
int max = 0;
int d = 0;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
num[j] = num[j]*a;
}
for (j = 0,d = 0; j < N; j++)
{
int temp = num[j]+d;
num[j] = temp%10000;
d = temp/10000;
}
if (max < everydigit(num))
{
max = everydigit(num);
}
}
return max;
}


int everydigit(int num[])
{
for (int i = 0,n = 0; num[i] != 0 && i < N;i++)
{
int temp = num[i];
while (temp != 0)
{
n += temp%10;
temp /=10;
}
}
return n;
}
int main()
{
clock_t ts,te;
ts=clock();
int answer = 0;
int num[N] = {0};
int temp = 0;
for (int a = 2; a < N; a++)
{
memset(num,0,sizeof(num));
num[0] = 1;
temp = numpow(num,a);
if (answer < temp)
{
answer = temp;
}
}
printf("\nanswer %d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}