cgy12306

# https://www.acmicpc.net/problem/1094 # 막대기 data = int(input()) cnt = 0 while data > 0: if data % 2 != 0: cnt += 1 data = data//2 print(cnt)

#https://www.acmicpc.net/problem/9935 #문자열폭발 import sys s = sys.stdin.readline()[:-1] bomb = sys.stdin.readline()[:-1] stack = [] for ch in s: stack.append(ch) if stack[-1] == bomb[-1] and "".join(stack[-len(bomb):]) == bomb: del stack[-len(bomb):] answer = "".join(stack) if answer == "": print("FRULA") else: print(answer)

#include #include #include #include using namespace std; vector solution(vector progresses, vector speeds) { vector answer; queue q; for(int i=0;i

// https://www.acmicpc.net/problem/5052 // 전화번호 목록 #include #include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T, N; cin >> T; for (int t = 0; t > N; vector v; bool flag = false; for (int n = 0; n > s; v.push_back(s); } sort(v.begin(), v.end()); for (int i = 0; i < v.size() - 1; i++) {..

// https://acmicpc.net/problem/10546 // 배부른 마라토너 #include #include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector participant; vector completion; unordered_map um; string answer = ""; int N; cin >> N; for (int i = 0; i > s; participant.push_back(s); } for (int i = 0; i < N - 1; i++) { string s; cin..

#include #include #include #include using namespace std; string solution(string new_id) { string answer = new_id; int size; //#1 for(int i=0;i='A' && answer[i]

// https://www.acmicpc.net/problem/2156 // 포도주 시식 #include #include using namespace std; int arr[10001], dp[10001]; int N; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N; for (int i = 3; i > arr[i]; } int sum = 0; for (int i = 3; i < N + 3; i++) { dp[i] = max(dp[i - 2] + arr[i], dp[i - 3] + arr[i - 1] + arr[i]); dp[i] = max(dp[i], dp[i - 1]..

// https://www.acmicpc.net/problem/1932 // 정수 삼각형 #include #include using namespace std; int arr[501][501], dp[502][502]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, res = 0; cin >> N; for (int i = 1; i arr[i][j]; } } dp[1][1] = arr[1][1]; for (int i = 2; i