博客
关于我
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 1125Stockbroker Grapevine(最短路)
查看>>
poj 1151 (未完成) 扫描线 线段树 离散化
查看>>
POJ 1151 / HDU 1542 Atlantis 线段树求矩形面积并
查看>>
poj 1163 数塔
查看>>
POJ 1177 Picture(线段树:扫描线求轮廓周长)
查看>>
POJ 1182 食物链(并查集拆点)
查看>>
POJ 1185 炮兵阵地 (状态压缩DP)
查看>>
POJ 1195 Mobile phones
查看>>
POJ 1228 Grandpa's Estate (稳定凸包)
查看>>
poj 1236(强连通分量分解模板题)
查看>>
poj 1258 Agri-Net
查看>>
poj 1286 Necklace of Beads
查看>>
POJ 1321 棋盘问题
查看>>
poj 1321(回溯)
查看>>
Qt读取注册表默认值
查看>>
poj 1679 判断MST是不是唯一的 (次小生成树)
查看>>
POJ 1703 Find them, Catch them
查看>>
POJ 1703 Find them, Catch them 并查集
查看>>
POJ 1738 An old Stone Game(石子合并)
查看>>
POJ 1740 A New Stone Game(博弈)题解
查看>>