목록분류 전체보기 (304)
웅재의 코딩세상

풀이 #include #include #include using namespace std; string day[] = {"FRI", "SAT", "SUN", "MON", "TUE", "WED", "THU"}; int month[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string solution(int a, int b) { int sum =0; for(int i=0; i

풀이 #include #include using namespace std; string solution(vector cards1, vector cards2, vector goal) { string answer = ""; int i=0,j=0; while(i+j < goal.size()){ if (i < cards1.size() && cards1[i] == goal[i + j]) i++; else if (j < cards2.size() && cards2[j] == goal[i + j]) j++; else return "No"; } return "Yes"; }

풀이 #include #include #include using namespace std; vector solution(vector name, vector yearning, vector photo) { vector answer; map mp; for(int i=0; i

풀이 #include #include #include using namespace std; vector solution(vector numbers) { vector answer; for(int i=0; i

풀이 #include #include using namespace std; int solution(int a, int b, int n) { int answer = 0; while(n >= a){ answer += (n/a)*b; int num = n%a; n = (n/a)*b + num; } return answer; }