Try

출처https://programmers.co.kr/learn/courses/30/lessons/12981 소스12345678910111213141516171819202122232425262728293031323334353637383940#include #include #include using namespace std; vector solution(int n, vector words) { int flag = 0; int a = 0; int b = 0; vector answer; for(int i = 1; i

출처https://programmers.co.kr/learn/courses/30/lessons/12982?language=python3 소스 1234567891011def solution(d, budget): answer = 0 sum = 0 d.sort() for i in range (0, len(d)): sum += d[i] if sum > budget: break else: answer += 1 return answercs

출처https://programmers.co.kr/learn/courses/30/lessons/12982 소스 123456789101112131415161718192021222324#include #include #include #include #include using namespace std; int solution(vector d, int budget) { int answer, sum = 0; sort(d.begin(), d.end()); for (int i = 0; i budget){ break; } else{ answer++; } } return answer;}Colored by Color Scriptercs

123456789101112131415def solution(bridge_length, weight, truck): answer = 0 queue = [0] * bridge_length seconds = 0 while queue: seconds += 1 queue.pop(0) if truck: if sum(queue) + truck[0]

1234567891011121314def solution(prices): answer = [] length = len(prices) for i in range(0, length): count = 0 for j in range(i, length-1): if prices[i] >prices[j]: break else: count +=1 answer.append(count) return answercs 출처https://programmers.co.kr/learn/courses/30/lessons/42584?language=python3