그랬었습니다

1234567891011121314151617181920212223242526272829303132#include using namespace std; void DFS(bool** connect, bool* arr, int size, int pos, int inf = 0) { for (int i = 1; i > T >> num; bool* arr = new bool[T + 1]{ false, }; bool** connect = new bool* [T + 1]; for (int i = 1; i com1 >> com2; connect[com1][com2] = true; connect[com2][com1] = true; } DFS(connect, arr, T, 1); for (int i = 1; i