bdfgdfg

#include #include using namespace std; int memo[50][50]; int Combination(int n, int k) { // 0개를 선택하거나 5개의 공에서 5개를 선택하는 경우의 수는 1. if (k == 0 || n == k) return 1; if (memo[n][k] != -1) return memo[n][k]; // 한번도 구한적이 없다면 계산하고 저장. return memo[n][k] = Combination(n - 1, k) + Combination(n - 1, k - 1); } int main(void) { ::memset(memo, -1, sizeof(memo)); int count,west,east; cin >> count; for (int i =..

5543번 #include #include #include using namespace std; int main() { vector burgerPrice; vector drink; burgerPrice.resize(3); drink.resize(2); for (int i = 0; i > burgerPrice[i]; } for (int i = 0; i > drink[i]; } cout hour1 >> minute1 >> second1 >> hour2 >> minute2 >> second2; if (second2 - second1 >= 0) resSecond = second2 - second1; else { --minute2; if (minute2..

#include using namespace std; int main() { int hour, minute, second,timeSecond; cin >> hour >> minute >> second; cin >> timeSecond; while (true) { if (timeSecond < 3600) break; timeSecond -= 3600; hour += 1; if (hour == 24) hour = 0; } while (true) { if (timeSecond < 60) break; timeSecond -= 60; minute += 1; if (minute == 60) { hour += 1; if (hour == 24) hour = 0; minute = 0; } } second += timeS..

#include using namespace std; int main(void) { int a, b, c; cin >> a >> b >> c; if (a == b && b == c) { cout a >> b; cin >> time; if (time >= 60) { h = time / 60; m = time % 60; } else { h = 0; m = time; } a += h; b += m; if (b >= 60) { b = b - 60; a += 1; } if (a >= 24) { a = a - 24; } cout