[백준] 1699번 제곱수의 합

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

1699번: 제곱수의 합

#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> dp(n + 1, 1000000);
	for (int i = 1; i <= sqrt(n); i++) {
		dp[i * i] = 1;
	}
	for (int i = 2; i <= n; i++) {
		for(int j = 1; j * j < i; j++) {
			dp[i] = min(dp[i], 1 + dp[i - j * j]);
		}
	}
	/*for (int i = 1; i <= n; i++) {
		cout << setw(3) << i;
	}
	cout << endl;
	for (int i = 1; i <= n; i++) {
		cout << setw(3) << dp[i];
	}
	cout << endl;*/
	cout << dp[n];
	return 0;
}