Hello World!

https://www.acmicpc.net/problem/25516코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);#define MAX 100001int n, k, ans;vector v[MAX];int cnt[MAX];void dfs(int now, int ncnt) { if (ncnt > k) return; ans += cnt[now]; for (int i = 0; i > n >> k; for (int i = 0, s, e; i > s >> e; v[s].push_back(e); } for (int i = 0; i > cnt[i]; dfs(0, 0); cout 설명트리를 생..

https://www.acmicpc.net/problem/1245코드#include #include using namespace std;#define MAX 101#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);typedef pair pi;int arr[MAX][MAX]; bool visit[MAX][MAX]; int dx[8] = { 1, -1, 0, 0, 1, 1, -1, -1 }; int dy[8] = { 0, 0, 1, -1, 1, -1, 1, -1 };int n, m, ans; void bfs(int x, int y) { queue q; q.push({ x, y }); visit[x][y] = true; bo..

https://www.acmicpc.net/problem/11000 코드#include #include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef pair pi;vector v;priority_queue, greater> pq;int n;int main() { FASTIO; cin >> n; v.resize(n); for (int i = 0, s, e; i > s >> e; v[i] = { s, e }; } sort(v.begin(), v.end()); pq.push(v[0].second); for (int i = 1; i = pq.top()) pq.pop();..