传送门:http://acm.jlu.edu.cn/joj/showproblem.php?pid=1611
题意很清楚,就是以a为生序输出所有的符合式子的结果。
四层循环暴力可以轻松AC。
说一下另一个思想,二分:
也是把200内的3次方预处理出来.
a,b,c这三个位置依旧是枚举,d这个位置用二分查找是否存在,查找范围是c + 1到a - 1;
具体的看代码吧。
暴力代码:
#include<iostream>
using namespace std;
int main()
{
int num[201], i;
for (i = 2; i <= 200; ++i)
num[i] = i * i * i;
for (i = 6; i <= 200; ++i)
{
for (int j = 2; j < i; ++j)
{
for (int k = j; k < i; ++k)
{
for (int l = k; l < i; ++l)
{
if (num[i] == num[j] + num[k] + num[l])
cout << "Cube = " << i << ", Triple = (" << j << "," << k << "," << l << ")" << endl;
}
}
}
}
return 0;
}
二分代码:
#include <iostream>
#include <cstdio>
using namespace std;
int search(int a[], int low, int high, int key) //二分查找,low是查找区间的左端点,high是右端点,key是目标
{
int mid;
while (low <= high)
{
mid = (low + high) / 2; //中间项
if (a[mid] == key) return mid; //如果中间项符合,返回下标
else
if (a[mid] > key) //如果中间项比目标大,说明落在了左区间,反之落在右区间
high = mid - 1;
else
low = mid + 1;
}
return 0;
}
int main()
{
int cube[201];
int temp;
for (int i = 0; i <= 200; ++i)
cube[i] = i * i * i;
for (int r = 6; r <= 200; ++r) //枚举a
{
for (int s = 2; s < r; ++s) //枚举b
{
temp = cube[r] - cube[s]; //temp这时候是c^3 + d^3;
for (int t = s + 1; t < r; ++t) //枚举c
{
int v = search(cube, t + 1, r - 1, temp - cube[t]); //temp - cube[t]就是d^3了
if (v)
{
printf("Cube = %d, Triple = (%d,%d,%d)\n", r, s, t, v);
}
}
}
}
return 0;
}