Ural1073-Square Country

#include <cstdio>
#include <algorithm>

const int maxn = 60000 + 5;
const int inf = maxn;

int dp[maxn];

int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = inf;
for (int j = 0; j * j <= i; j++) {
dp[i] = std::min(dp[i], dp[i-j*j] + 1);
}
}
printf("%d\n", dp
);
return 0;
}