Perfect Cubes - 1543

Perfect Cubes
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 14448
Accepted: 7584

Description

For hundreds of years Fermat's Last Theorem, which stated simply that for n > 2 there exist no integers a, b, c > 1 such that a^n = b^n + c^n, has remained elusively unproven. (A recent proof is believed to be correct, though it is still undergoing scrutiny.) It is possible, however, to find integers greater than 1 that satisfy the "perfect cube" equation a^3 = b^3 + c^3 + d^3 (e.g. a quick calculation will show that the equation 12^3 = 6^3 + 8^3 + 10^3 is indeed true). This problem requires that you write a program to find all sets of numbers {a,b,c,d} which satisfy this equation for a <= N.

Input

One integer N (N <= 100).

Output

The output should be listed as shown below, one perfect cube per line, in non-decreasing order of a (i.e. the lines should be sorted by their a values). The values of b, c, and d should also be listed in non-decreasing order on the line itself. There do exist several values of a which can be produced from multiple distinct sets of b, c, and d triples. In these cases, the triples with the smaller b values should be listed first.

Sample Input

24

Sample Output

Cube = 6, Triple = (3,4,5)
Cube = 12, Triple = (6,8,10)
Cube = 18, Triple = (2,12,16)
Cube = 18, Triple = (9,12,15)
Cube = 19, Triple = (3,10,18)
Cube = 20, Triple = (7,14,17)
Cube = 24, Triple = (12,16,20)

Source

/***********************************************************************
    Copyright (c) 2015,wangzp
    All rights no reserved.
  
    Name: 《Perfect Cubes》In PEKING UNIVERSITY ACM
    ID:   PROBLEM 1543
    问题简述: a^3 = b^3 + c^3 + d^3,求满足条件的a,b,c,d。
	          其中a,b,c都大于1,注意b,c,d顺序需要递增才打印出来
    Date: Sep 25, 2015 
 
***********************************************************************/
#include
   
   
    
    
int main(void)
{
	int a,b,c,d;
	int i;
	scanf("%d",&a);
	for(i = 2;i <= a;i++)
	{
		for(b = 2;b < i;b++)
		{
			for(c = 2;c < i;c++)
			{
				for(d= 2;d < i;d++)
				{
					if((i*i*i == b*b*b + c*c*c + d*d*d)&& (b < c) && (c < d))
					{
						printf("Cube = %d, Triple = (%d,%d,%d)\n",i,b,c,d);
					}
				}
			}
		}
	}
	return 0;
}

   
   

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值