zoj1331
来源:互联网 发布:python简明教程pdf 编辑:程序博客网 时间:2024/06/06 04:30
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.
对网上的进行了一点优化
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,c,d;
for(a=2;a<=200;a++)
for(b=2;b<a;b++)
for(c=b;c<a;c++)
{
float s=pow(a,3)-pow(b,3)-pow(c,3);
/*此处为优化地方,判断s是否为整数*/
s=pow(s,1.0/3);
d=s;
s=s-(int)s;
if((s<=0.0)&&(d>=c)) printf("Cube = %d, Triple = (%d,%d,%d)\n",a,b,c,d);
}
return 0;
}
- zoj1331
- zoj1331
- zoj1331
- zoj1331
- [水]ZOJ1331
- Python--ZOJ1331
- zoj1331----------------Perfect Cubes
- MyActionListener监听按钮
- java 的Object的equals方法
- 基于Ubuntu交叉编译FFmpeg Windows SDK
- 兄弟郊游问题
- 一个app,多个入口图标,activity-alias实现多程序入口并显示指定view完成
- zoj1331
- Hibernate从入门到精通(四)基本映射 .
- android下使用Fragment实现左侧3级菜单+动画效果
- X.509定义的证书
- Python list 操作
- 【ArcGIS 10.2新特性】ArcGIS 10.2将PostgreSQL原生数据发布为要素服务
- ASP.NET页面跳转相关知识
- JSP技术模型(二)JSP页面生命周期
- 编辑距离、拼写检查与度量空间:一个有趣的数据结构(转)