개발자 꿈나무의 코딩방

https://www.acmicpc.net/problem/7785 #include #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}bool compare(string a, string b) { return a > b;}int main(void) { CPP_INIT(); int input; string str, str2; unordered_map um; vector v; cin >> input; for (int i = 0; i > str >> str2; um[str] = str2; v.push_back(str); } sort(v.b..

https://www.acmicpc.net/problem/14425 #include #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); int input1, input2; int cnt = 0; string str; unordered_map um; cin >> input1 >> input2; for (int i = 0; i > str; um[str] = true; } for (int i = 0; i > str; if (um[str]) cnt++; } cout

https://www.acmicpc.net/problem/10815 #include #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); int input1, input2; int num; vector v; unordered_map um; cin >> input1; for (int i = 0; i > num; um.insert({ num, 1 }); } cin >> input2; for (int i = 0; i > num; v.push_back(num); } for (int i = 0..

https://www.acmicpc.net/problem/19532 #include #define endl "\n"using namespace std;int main(void) { /************** C++ Init **************/ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); /************** C++ Init **************/ int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; // x cout

https://www.acmicpc.net/problem/1193 #include #define endl "\n"using namespace std;int main(void) { /************** C++ Init **************/ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); /************** C++ Init **************/ int input; int n = 1; int k = 1; int mo, ja; cin >> input; while (input > n) { if (input

https://www.acmicpc.net/problem/1541 #include #define endl "\n"using namespace std;int main(void) { /************** C++ Init **************/ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); /************** C++ Init **************/ string str; string num; int sum = 0; bool minus = false; cin >> str; for (int i = 0; i

https://www.acmicpc.net/problem/1927 #include #define endl "\n"using namespace std;int main(void) { /************** C++ Init **************/ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); /************** C++ Init **************/ int input1, input2; priority_queue, greater> pq; cin >> input1; for (int i = 0; i > input2; if (input2 == 0) { if (pq.empty()) cout  우선순위 큐 내림차순 (기본값)pri..

https://www.acmicpc.net/problem/1260 #include #define endl "\n"using namespace std;pair vertex[1002];vector> edge;vector v;queue bfschk;void dfs(int start) { if (vertex[start].second == true) { v.push_back(start); vertex[start].second = false; for (int i = 0; i 0) { int num = bfschk.front(); bfschk.pop(); bfs(num); }}bool compare(pair x, pair y) { if (x.first == y.first) return x.second ..

https://www.acmicpc.net/problem/1012 #include #define endl "\n"using namespace std;int farm[52][52];int cnt;void find(int x, int y) { if (farm[x + 1][y] == 1) { farm[x + 1][y] = -1; find(x + 1, y); } if (farm[x][y + 1] == 1) { farm[x][y+1] = -1; find(x, y + 1); } if (x > 0) { if (farm[x - 1][y] == 1) { farm[x - 1][y] = -1; find(x - 1, y); } } if (y > 0) { if (farm[x][y - 1] == 1){ f..

https://www.acmicpc.net/problem/17626 #include #define endl "\n"using namespace std;int main(void) { /************** C++ Init **************/ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); /************** C++ Init **************/ int input1; vector v; v.push_back(0); cin >> input1; for (int i = 1; i