博客
关于我
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/

你可能感兴趣的文章
POJ 2019 Cornfields (二维RMQ)
查看>>
poj 2057 The Lost House 贪心思想在动态规划上的应用
查看>>
poj 2057 树形DP,数学期望
查看>>
poj 2112 最优挤奶方案
查看>>
Qt编写自定义控件12-进度仪表盘
查看>>
poj 2186 Popular Cows :求能被有多少点是能被所有点到达的点 tarjan O(E)
查看>>
POJ 2186:Popular Cows Tarjan模板题
查看>>
POJ 2229 Sumsets(递推,找规律)
查看>>
poj 2236
查看>>
POJ 2243 Knight Moves
查看>>
POJ 2262 Goldbach's Conjecture
查看>>
POJ 2362 Square DFS
查看>>
poj 2386 Lake Counting(BFS解法)
查看>>
poj 2387 最短路模板题
查看>>
POJ 2391 多源多汇拆点最大流 +flody+二分答案
查看>>
POJ 2403
查看>>
poj 2406 还是KMP的简单应用
查看>>
POJ 2431 Expedition 优先队列
查看>>
Qt笔记——获取位置信息的相关函数
查看>>
POJ 2484 A Funny Game(神题!)
查看>>