题目描述
a^3 = b^3 + c^3 + d^3为完美立方等式。例如12^3 = 6^3 + 8^3 + 10^3 。
编写一个程序,对任给的正整数N (6≤N≤100),寻找所有的四元组(a, b, c, d),使得a^3 = b^3 + c^3 + d^3,其中1<a, b, c, d ≤N, 满足b≤c≤d。
输入格式
输入一个正整数N (N≤100)
输出格式
输出满足a, b, c, d ≤N的所有完美立方,每行输出一个完美立方。
按照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)
分类标签
此题属 枚举 纯纯暴力;
注:写这道题的时候 一定要把题目中范围看准了,其中1<a, b, c, d ≤N,是大于1 不等于1 ;
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
typedef long long LL;
int main()
{
int N;
cin >> N;
for (int a = 2;a <= N;a++)
{
for (int b = 2;b <= a;b++)
{
for (int c = b;c <= a;c++)//题中b<=c<=d 令c初始值为b即可保证b<=c
{
for (int d = c;d <= a;d++)//题中b<=c<=d 令d初始值为c即可保证c<=d
{
if (a * a * a == b * b * b + c * c * c + d * d * d)
{
cout << "Cube = " << a << ", Triple = (" << b << "," << c << "," << d << ")" << endl;
}
}
}
}
}
return 0;
}
一定要细心点看好题给的范围 即可;