Try

출처https://programmers.co.kr/learn/courses/30/lessons/42883?language=python3 소스 123456789101112131415161718192021222324252627282930313233def solution(number, k): answer = '' length = 0 length = len(number) cnt = 0 slen = 0 slen = k flag = 0 k = length - k while(1): for j in range (0, length): for m in range (1, slen+1): if number[j] >= number[j+m]: continue else: flag = 1 if flag: break if flag: ..

출처 https://programmers.co.kr/learn/courses/30/lessons/42883 소스 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include #include using namespace std; string solution(string number, int k) { string answer = ""; int length = 0; length = number.length(); int cnt = 0; int len = k; int flag = 0; k = length - k; while(1){ for(int j = 0; j = k){ return answer; } } } r..

출처https://programmers.co.kr/learn/courses/30/lessons/42885?language=python3 소스1234567891011121314151617181920212223242526def solution(p, limit): answer = 0 boat = 0 i = 0 j = len(p) - 1 p.sort() p.reverse() while(1): if i > j: break elif i == j: boat = boat+1 break if p[i] + p[j] > limit: i = i + 1 boat = boat+1 else: i = i + 1 j = j - 1 boat = boat+1 answer = boat return answercs

출처https://programmers.co.kr/learn/courses/30/lessons/42885 소스1234567891011121314151617181920212223242526272829303132333435#include #include using namespace std; int solution(vector p, int limit) { int answer = 0; int boat = 0; int i = 0; int j = p.size()-1; sort(p.begin(), p.end()); reverse(p.begin(), p.end()); while(1){ if(i > j){ break; } else if(i == j){ boat++; break; } if(p[i] + p[j] > limi..

출처https://programmers.co.kr/learn/courses/30/lessons/42746?language=cpp 소스 12345678910111213141516171819202122232425262728293031323334#include #include #include #include using namespace std; bool compare(string &a, string &b){ cout

출처 https://programmers.co.kr/learn/courses/30/lessons/12981 소스 12345678910111213141516171819202122232425262728293031def solution(n, words): answer = [] flag = 0 a = 0 b = 0 for i in range (1, len(words)): p1 = words[i-1] p2 = words[i] for j in range(0, i): if (words[j] == words[i]): flag = 1 break len_p1 = len(p1) if (p1[len_p1 -1] != p2[0]): flag = 1 if flag : a = (i % n) + 1 b = int(i / n) + 1..

출처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]