백준 4690번: 완전 세제곱

https://www.acmicpc.net/problem/4690

1. 문제

2. 알고리즘

키워드 -  구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int f(int a) {
    return a * a * a;
}
 
int main() {
 
    /*cin.tie(0);
    std::ios::sync_with_stdio(false);
    */
    
    for (int i = 2; i <= 100; ++i) {
        for (int j = 2; j < i; ++j) {
            for (int k = j + 1; k < i; ++k) {
                for (int l = k + 1; l < i; ++l) {
                    if (f(i) == f(j) + f(k) + f(l)) {
                        printf("Cube = %d, Triple = (%d,%d,%d)\n",i,j,k,l);
                    }
                }
            }
        }
    }
 
    return 0;
}