본문 바로가기

백준 알고리즘/그리디 알고리즘8

백준 1049번 C++ #include #include using namespace std; int n, m; int minp = 1001; int mino = 1001; int main(void) { cin >> n >> m; int flag = 1; if (n % 6 == 0) flag = 0; for (int i = 0; i > x >> y; minp = min(minp, x); mino = min(mino, y); } int answer = 987654321; for (int i = 0; i * 6 2019. 10. 11.
대회 or 인턴 C++ #include #include using namespace std; int n, m, k; int answer = -1; void calmax(int girl, int boy, int i) { int value = min(girl / 2, boy); if (i == 0) { answer = max(answer, value); return; } else { if (value = boy) calmax(girl - 1, boy, i - 1); else calmax(girl, boy - 1, i - 1); } } int main(void) { cin >> n >> m >> k; calmax(n,m,k); cout 2019. 10. 11.
로프 C++ #include #include using namespace std; const int MAX = 100001; int n; int lope[MAX]; int main(void) { cin >> n; int answer = -1; for (int i = 0; i > lope[i]; sort(lope, lope + n); for (int j = 0; j < n; j++) { answer = max(answer, lope[j]*(n-j)); } cout 2019. 10. 10.
백준 1120번 C++ #include #include #include using namespace std; const int MAX = 51; string a, b; int mindiff(int k) { int answer = 0; for (int i = 0; i > a >> b; for (int i = (b.length() - a.length()); i >= 0; i--) { diff = min(diff,mindiff(i)); } cout 2019. 8. 28.

티스토리툴바