다락방

3182 한동이는 공부가 하기 싫어! #include using namespace std; vector adj(1001); int visited[1001]; int ans; void dfs(int x) { visited[x] = 1; if (!visited[adj[x]]) { dfs(adj[x]); } } int main() { int test_case, max = 0, check, ans; cin >> test_case; for (int i = 1; i > tmp; adj[i] = tmp; } for (int i = 1; i

1012 유기농 배추 #include using namespace std; const int MAX = 51; int test_case, m,n,k; int board[MAX][MAX]; int visited[MAX][MAX]; int dy[] = { 0,0,-1,1 }; int dx[] = { -1,1,0,0 }; void DFS(int y, int x) { visited[y][x] = 1; for (int i = 0; i = m || ny = n) continue; if (board[ny][nx] == 1 && visited[ny][nx] == 0) { DF..

1260 DFS와 BFS #include using namespace std; vector adj[10002]; vector result_bfs; vector result_dfs; bool visited[1002]; void dfs(int x) { visited[x] = true; result_dfs.push_back(x); for (int i = 0; i < adj[x].size(); ++i) { if (!visited[adj[x][i]]) dfs(adj[x][i]); } } void bfs(int x) { queue q; q.push(x); visited[x] = true; while (!q.empty()) { int tmp = q.front(); q.pop(); result_bfs.push_back..

1620 나는야 포켓몬 마스터 이다솜 #include using namespace std; string name[100001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; map poket; for (int i = 0; i > tmp; poket.insert({ tmp,i }); name[i] = tmp; } for (int i = 0; i > tmp; if (65 > tmp[0]) cout

1003 피보나치 함수 #include using namespace std; int fibo(int num); int check_zero = 0, check_one=0; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test_case; cin >> test_case; for (int i = 0; i > tmp; fibo(tmp); cout

1654 랜선자르기 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int k, n; cin >> k >> n; vector arr(k); unsigned int right = 0, left = 1, mid, ans = 0; for (int i = 0; i > tmp; arr[i] = tmp; right = max(right, tmp); } while (left = n) { left = mid + 1; ans = max(mid, ans); } else right = mid - 1; } cout

10816 숫자 카드2 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector card_arr; int card_num; cin >> card_num; for (int i = 1; i > tmp; card_arr.push_back(tmp); } sort(card_arr.begin(), card_arr.end()); int m; cin >> m; for (int i = 0; i > tmp; cout

2164 카드2 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); queue card_arr; int card_num; cin >> card_num; for (int i = 1; i < card_num+1; ++i) { card_arr.push(i); } while (true) { if (1 == card_arr.size()) break; card_arr.pop(); card_arr.push(card_arr.front()); card_arr.pop(); } cout

9012 괄호 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int num_case; cin >> num_case; for (int i = 0; i > input; for (int j = 0; j < input.length(); ++j) { if (st.empty() || input[j] == '(') st.push_back(input[j]); else if (st.front() == '(') st.pop_back(); } if (st.empty()) cout

10773 제로 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector a; int num_case,sum = 0; cin >> num_case; for (int i = 0; i > tmp; if (tmp == 0 && a.size() > 0) a.pop_back(); else if (tmp != 0) { a.push_back(tmp); } } for (auto i : a) sum += i; cout