描述
a3 = b3 + c3 + d3为完美立方等式。例如123 = 63 + 83 + 103 。编写一个程序,对任给的正整数N (N≤100),寻找所有的四元组(a, b, c, d),使得a3 = b3 + c3 + d3,其中1<a, b, c, d ≤N。
输入
正整数N (N≤100)
输出
每行输出一个完美立方,按照a的值,从小到大依次输出。当两个完美立方等式中a的值相同,则依次按照b、c、d进行非降升序排列输出,即b值小的先输出、然后c值小的先输出、然后d值小的先输出。
样例输入
24
样例输出
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)
#include <iostream> using namespace std; int main() { int n,a,b,c,d; int a1,b1,c1,d1; cin>>n; for(a=2;a<=n;a++) { a1=a*a*a; for(b=2;b<n;b++) { b1=b*b*b; for(c=b;c<n;c++) { c1=c*c*c; for(d=c;d<n;d++) { d1=d*d*d; if(a1==(b1+c1+d1)) cout<<"Cube = "<<a<<", "<<"Triple = "<<"("<<b<<","<<c<<","<<d<<")"<<endl; } } } } return 0; }