杭电 HDU ACM 1334 Perfect Cubes
来源:互联网 发布:在线教育直播平台源码 编辑:程序博客网 时间:2024/04/27 22:48
Perfect Cubes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2413 Accepted Submission(s): 1061
Problem 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 <= 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.
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.
注意输出格式!有空格!当时Cube打成Cude 硬是看不出来!!!
#include<iostream>using namespace std;int main(){int i,j,k,m;for(i=2;i<=200;i++)for(j=2;j<=i;j++)for(k=j+1;k<=i;k++)for(m=k+1;m<=i;m++){if((i*i*i)==(j*j*j+k*k*k+m*m*m)){printf("Cube = %d, Triple = (%d,%d,%d)\n",i,j,k,m);} }return 0;}
0 0
- 杭电 HDU ACM 1334 Perfect Cubes
- hdu 1334 Perfect Cubes
- HDU 1334 Perfect Cubes
- 【杭电oj】1334 - Perfect Cubes(水)
- HDU 1334 Perfect Cubes【穷举法】
- HDU 1334 Perfect Cubes
- HDOJ 1334 Perfect Cubes
- POJ 1543 && HDU 1334 Perfect Cubes(水~)
- HDOJ 1334 Perfect Cubes(暴力)
- Perfect Cubes
- Perfect Cubes
- Perfect Cubes
- poj 1543 & HDU 1334 & ZOJ 1331 Perfect Cubes(数学 暴力大法好)
- hdu 杭电acm 1002
- 杭电ACM HDU 1004
- 杭电ACM HDU 1002
- 杭电ACM HDU 1008
- 杭电ACM HDU 1013
- 计算机网络基础笔记1
- HDOJ 1532 Drainage Ditches
- Eclipse里面的快捷键小记
- 【ok】获取文件夹下所有文件(包括文件夹)
- 状态模式
- 杭电 HDU ACM 1334 Perfect Cubes
- Android 中WebView调用JS的跨域问题
- 编译烧写norflash的程序时keil的配置
- android跨进程事件注入(程序模拟用户输入,getevent与sendevent)
- 架构设计案例分析-高速公路收费运营管理平台
- 陕西省第四人民医院 骨科 王学艺
- MyEclipse的安装及破解全过程详解
- 黑马程序员--IOS入学学习--2-基本运算及流程控制(C语言)
- 《白手起家Win32SDK应用程序》(完整版+目录)