博客
关于我
C/C++_log2000_完美立方
阅读量:102 次
发布时间:2019-02-25

本文共 2012 字,大约阅读时间需要 6 分钟。

/*---------------------------------------------------------------- @copyright content:a^3=b^3+c^3+d^3;         1
<=N; b<=c<=d; input:N(N<=100); output:Cube=a, Triple=(b,c,d); if the result contains more than one 'a', then first print the answer with smaller 'b', etc. author:szetrov//----------------------------------------------------------------*)/*----------------------------------------------------------------* *---------------------version 1.0---------------------------------- #include
using namespace std; int main() { int a=0,b=0,c=0,d=0; int N=0; cin >> N; for(a=2; a<=N; a++) { for(d=2; d<=N; d++) { for(c=2; c<=d; c++) { for(b=2; b<=c; b++) { if((a*a*a) == ((b*b*b)+(c*c*c)+(d*d*d)) cout << "Cube=" << a << ", Triple=(" << b << "," << c << "," << d << ")"; } } } } } } *----------------------------------------------------------------* /*----------------------------------------------------------------* *---------------------version 2.0---------------------------------- improvement:shorten the range and change inner loop order from a-d-c-b to a-b-c-d; #include
using namespace std; int main() { int a=0,b=0,c=0,d=0; int N=0; cin >> N; for(a=2; a<=N; a++) { for(b=2; b<=a-1; b++) { for(c=b; c<=a-1; c++) { for(d=c; d<=a-1; d++) { if((a*a*a) == ((b*b*b)+(c*c*c)+(d*d*d)) cout << "Cube=" << a << ", Triple=(" << b << "," << c << "," << d << ")"; } } } } } *----------------------------------------------------------------*

??????????????????????????1.0?????????????a?b?c?d??????????a? = b? + c? + d?????

??2.0????????????????????????a?b??c??d??????????????????????????????

???????????????????????????????????????????????????

转载地址:http://nkv.baihongyu.com/

你可能感兴趣的文章
Qt笔记——布局管理三件套分割窗口、停靠窗口和堆栈窗口
查看>>
poj 3277 线段树
查看>>
POJ 3349 Snowflake Snow Snowflakes
查看>>
POJ 3411 DFS
查看>>
poj 3422 Kaka's Matrix Travels (费用流 + 拆点)
查看>>
Qt笔记——官方文档全局定义(二)Functions函数
查看>>
POJ 3468 A Simple Problem with Integers
查看>>
poj 3468 A Simple Problem with Integers 降维线段树
查看>>
poj 3468 A Simple Problem with Integers(线段树 插线问线)
查看>>
poj 3485 区间选点
查看>>
poj 3518 Prime Gap
查看>>
poj 3539 Elevator——同余类bfs
查看>>
Qt笔记——官方文档全局定义(三)Macros宏
查看>>
poj 3628 Bookshelf 2
查看>>
Qt笔记——官方文档全局定义(一)Types数据类型
查看>>
POJ 3670 DP LIS?
查看>>
POJ 3683 Priest John's Busiest Day (算竞进阶习题)
查看>>
POJ 3988 Selecting courses
查看>>
POJ 4020 NEERC John's inversion 贪心+归并求逆序对
查看>>
poj 4044 Score Sequence(暴力)
查看>>