定理H机器证明

[CHAD]

截图：

#include <stdio.h>

int fj(int n) //递归求解
{
	int j = 0;

	printf("%d",j+=n%10);
	n=n/10;

	while(n>=1)
	{
		j += n%10;
		printf("+%d",n%10);
		n = n/10;
	}

	printf(" = %d\n",j);

	if(j/10<1)
		return j;

	fj(j);
}

void PrintN()
{
	int num = 0,rn = 0;
	char tmp[10][30] = {
		"(14-14)*5*1","1^5+1^4-1^4","1^4+1^4*1^5",
		"1+1*4-5-1+4","1*1*4+5-1-4","1*1+4+5-1-4",
		"(1+1+4)*(5/(1+4))","1*5+1^4+1^4",
		"1*4+1*4*1^5","1*1*4+1^5+4"
	};

	while(1){
		printf("输入你想要论证的数，输入负数退出:\n");
		scanf("%d",&num);

		if(num < 0) return ;

		putchar('\n');
		rn = fj(num);
		printf("\n%d = %s\n  = 114514\n",rn,tmp[rn]);
		putchar('\n');
	}
}

int main(void)
{
	PrintN();
	return 0;
}

本站链接：
https://magictea.cc/topic/215/数字论证的绝招-一切数皆可推出114514/15

只证明了最基础的正整数论证法，其余大同小异，还待各位有心人完善（心虚）

[老用户]

你真了不得

[CHAD]

@accelery_017 搜到有

[涼风青叶]

高级神触

[InfectedZer]

过于有能，支持力

[花茶香]

printf("输入你想要论证的数，输入114514退出:\n");
if(num = 114514) return ;
if(num < 0) num = abs(num) ;

脑洞一下

[CHAD]

@花茶香

 if(num == 114514) printf("1919");