ZOJ 1331 Perfect Cubes

关注

原创最新推荐文章于 2026-07-15 11:19:40 发布 393 阅读 AI 写同款· GEO 优化 ›

ASC超算竞赛及基本思路目录题目组成 1、设计超算集群 2、性能测试 3、数字图像处理 4、CESM 参考文献题目组成设计超算集群（看参考文献做设计）对超算集群进行性能测试（一般来讲的测试工具就是用HPL，找到最适合的参数，达到最优秀的计算能力）数字图像处理（通常代码量较大，代码优化较为困难，优化偏重于编译参数，运行参数和数学库BLAS的重新链接，对于热点可以考虑并行(读写)算法... 阅读详情

Perfect Cubes

Time Limit: 10 Seconds Memory Limit: 32768 KB

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 <= 200.

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.

The first part of the output is shown here:

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)

Note: The programmer will need to be concerned with an efficient implementation. The official time limit for this problem is 2 minutes, and it is indeed possible to write a solution to this problem which executes in under 2 minutes on a 33 MHz 80386 machine. Due to the distributed nature of the contest in this region, judges have been instructed to make the official time limit at their site the greater of 2 minutes or twice the time taken by the judge's solution on the machine being used to judge this problem.

题意：就是一个数的立方等于其他3个数立方之和，就输出。

注意：不要调用pow会出现时间超时

代码：

#include<stdio.h>
#include<math.h>

int main()
{
int a,b,c,d;

for(a=5;a<=200;a++)
for(b=2;b<=a-3;b++)
for(c=b+1;c<=a-2;c++)
for(d=c+1;d<=a-1;d++)
{
if(a*a*a==b*b*b+c*c*c+d*d*d)
printf("Cube = %d, Triple = (%d,%d,%d)\n",a,b,c,d);
}
return 0;
}