-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1699.cpp
More file actions
47 lines (43 loc) · 896 Bytes
/
1699.cpp
File metadata and controls
47 lines (43 loc) · 896 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include<iostream>
#include<algorithm>
#include<math.h> // 백준에서 sqrt사용을 위해 (안쓰면 컴파일 에러)
using namespace std;
int dp[100001];
int main() {
int N;
cin >> N;
dp[0] = 0;
dp[1] = 1;
int tmp_min; // 필요없음
for (int i = 2; i <= N; i++) {
tmp_min = 123456789; // 필요없음
for (int j = 1; j <= sqrt(N); j++) {
int jj = j * j;
if (i - jj < 0) // 필요없음
break; // 필요없음
if (tmp_min > dp[i - jj]) {
tmp_min = dp[i - jj];
}
}
dp[i] = min(dp[i - 1] + 1, tmp_min + 1);
}
cout << dp[N];
}
// 개선안
#include<iostream>
#include<algorithm>
using namespace std;
int dp[100001];
int main() {
int N;
cin >> N;
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i <= N; i++) {
dp[i] = i; // dp[i] = 1^2 i개
for (int j = 1; j * j <= i; j++) {
dp[i] = min(dp[i], dp[i - (j * j)] + 1);
}
}
cout << dp[N];
}