Description:
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。
Input:
正整数N (N≤100)
Output:
每行输出一个完美立方,按照a的值,从小到大依次输出。当两个完美立方等式中a的值相同,则依次按照b、c、d进行非降升序排列输出,即b值小的先输出、然后c值小的先输出、然后d值小的先输出。
Sample Input:
24
Sample Output:
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)
Note:
本题由旧版NOJ导入,来源:POJ
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <climits>
#include <stdio.h>
#include <iomanip>
#include <math.h>
#include <list>
#include <tuple>
#include <stack>
#include <string.h>
using namespace std;
bool mycmp(const tuple<int,int,int>& a, const tuple<int,int,int>& b)
{
if(std::get<0>(a) < std::get<0>(b))
{
return true;
}
else if(std::get<0>(a) > std::get<0>(b))
{
return false;
}
if(std::get<1>(a) < std::get<1>(b))
{
return true;
}
else if(std::get<1>(a) > std::get<1>(b))
{
return false;
}
if(std::get<2>(a) < std::get<2>(b))
{
return true;
}
else if(std::get<2>(a) > std::get<2>(b))
{
return false;
}
return false;
}
int main()
{
map<int, vector<tuple<int,int,int>>> mymap;
int n;
cin >> n;
for(int i = 2; i <= n; i++)
{
for(int j = i + 1; j <= n; j++)
{
for(int k = j + 1; k <= n; k++)
{
unsigned long long a = pow(i,3);
unsigned long long b = pow(j,3);
unsigned long long c = pow(k,3);
unsigned long long mysum = a + b + c;
for(int m = k + 1; m <= n; m++)
{
if(pow(m,3) == mysum)
{
mymap[m].push_back(make_tuple(i, j, k));
break;
}
}
}
}
}
for(auto it = mymap.begin(); it != mymap.end(); it++)
{
sort(it->second.begin(), it->second.end(), mycmp);
//cout << it->first << " := " << endl;
for(int i = 0; i < it->second.size(); i++)
{
// cout << std::get<0>(it->second[i])<<" ";
// cout << std::get<1>(it->second[i])<<" ";
// cout << std::get<2>(it->second[i])<<endl;
cout << "Cube = " << it->first << ", Triple = (" << std::get<0>(it->second[i]) << "," << std::get<1>(it->second[i]) << "," << std::get<2>(it->second[i]) << ")" << endl;;
}
//cout <<endl;
}
return 0;
}