Problem Solving (152) 썸네일형 리스트형 Power of Four class Solution { public: bool isPowerOfFour(int n) { if(n == 0) return false; if(ceil(log(n) / log(4)) == floor(log(n) / log(4))) return true; else return false; } }; Lemonade Change class Solution { public: bool lemonadeChange(vector& bills) { int bills5 = 0; int bills10 = 0; int bills20 = 0; for(int i = 0; i 0) { bills10--; bills5--; } else { bills5 -= 3; bills20++; } } if(bills5 Add Digits class Solution { public: int addDigits(int num) { return num != 0 && num % 9 == 0 ? 9 : num % 9; } }; 핸드폰 요금 #include using namespace std; int main() { int N; int arr[20]; int M = 0, Y = 0; cin >> N; for(int i = 0; i > arr[i]; M += (arr[i] / 60 + 1) * 15; Y += (arr[i] / 30 + 1) * 10; } if(M == Y) cout 플러그 #include using namespace std; int main() { int answer = 0; int N, sum; cin >> N; for(int i = 0; i > sum; answer += sum -1; } cout 지능형 기차 #include using namespace std; int main() { int maximum = 0; int now = 0; int g_in, g_out; for(int i = 0; i > g_in >> g_out; now += (g_out - g_in); maximum = max(maximum, now); } cout 숫자의 개수 #include using namespace std; int main() { int A, B, C; int answer[10] = {0,}; cin >> A >> B >> C; int Mul = A * B * C; string a = to_string(Mul); for(int i = 0; i 보물 #include using namespace std; int main() { int N; cin >> N; vector arr1(N); vector arr2(N); int answer = 0; for(int i = 0; i > arr1[i]; } for(int i = 0; i > arr2[i]; } sort(arr1.begin(), arr1.end()); sort(arr2.begin(), arr2.end(), greater()); for(int i = 0; i 이전 1 ··· 14 15 16 17 18 19 다음