[프로그래머스 2레벨] 메뉴 리뉴얼 (C++)
#include #include #include #include using namespace std;map m;void cal(string order, string tmp, int idx, int target) { if (tmp.size() == target) { m[tmp]++; return; } for (int i = idx; i solution(vector orders, vector course) { vector answer; for (auto& order : orders) sort(order.begin(), order.end()); for (auto i : course) { m.clear(); ..
프로그래머스/2레벨
2025. 2. 26. 03:25