[백준]1699-제곱수의 합(설명X, Dynamic Programming)

#include <iostream>
using namespace std;
 
int main()
{
    int n, tmp = 1;
    cin >> n;
    int* arr = new int[n + 1] {0, };
    for (size_t i = 1; i <= n; i++) {
        arr[i] = i;
        for (size_t j = 1; i >= j * j; j++)
            arr[i] = arr[i] > arr[i - j * j] + 1 ? arr[i - j * j] + 1 : arr[i];
    }
    cout << arr[n];
    return 0;
}