Algorithm/Bitmask (1) 썸네일형 리스트형 GRADUATE #include #include #include #include #define MAX_N 12 #define MAX_M 10 using namespace std; int INF = 987654321; int N, K, M, L; int before[MAX_N][MAX_N]; int semesters[MAX_M][MAX_N]; int cache[10][1 > caseNum; for (int cIter = 0; cIter > N >> K >> M >> L; #pragma region Input for (int i = 0; i > beforeNum; if (beforeNum == 0) { before.. 이전 1 다음