Project Euler 56

最新推荐文章于 2020-12-13 18:30:14 发布

lushl9301

最新推荐文章于 2020-12-13 18:30:14 发布

阅读量290

点赞数

分类专栏： Project Euler 文章标签： c C Project Euler python Python

本文链接：https://blog.csdn.net/lushl9301/article/details/8248932

版权

Project Euler 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

这道题还是比较简单的~

本来想用快速幂……练习一下~结果上来先用python找到正确答案，就懒得想快速幂……毕竟高精乘不是那么简单的吧……

先来个高精练练吧……

上，两份代码~嘻嘻~

def main():
	maximun = xa = xb = 0
	for a in range(1, 100):
		for b in range(1, 100):
			sum_up = sum(int(i) for i in list(str(a**b)))
			if sum_up>maximun:
				maximun = sum_up
				xa = a
				xb = b
	print(maximun, xa, xb)

if __name__ == '__main__':
	main()

话说……我写的C真是瘦……

#include <stdio.h>
int f[1000];

int
init()
{
	int i;
	for (i=0; i<1000; i++)
		f[i] = 0;
}

int
main()
{
	int a, b;
	int l, sum, i, carry;
	int max=0, xa=0, xb=0;
	for (a=1; a<100; a++)
	{
		l = 1;
		init();
		f[0] = a;
		while (f[l]>9)
		{
			f[l] = f[l-1]/10;
			f[l-1] %= 10;
			l++;
		}
		for (b=1; b<99; b++)
		{
			sum = 0;
			carry = 0;
			for (i=0; i<l; i++)
			{
				f[i] = f[i]*a + carry;
				carry = f[i]/10;
				f[i] %= 10;
				sum += f[i];
			}
			while (carry>0)
			{
				f[l] += carry;
				carry = f[l]/10;
				f[l] %= 10;
				sum += f[l++];
			}

			if (sum>max)
			{
				max = sum;
				xa = a;
				xb = b;
			}
			
			//printf("%d %d\n", a, b);
			//for (i=l-1; i>=0; i--)
			//{
			//	printf("%d", f[i]);
			//}
			//printf("\n");
		}
	}

	printf("%d %d %d\n", max, xa, xb+1);

	return 0;
}