개발자 꿈나무의 코딩방

https://www.acmicpc.net/problem/20920 #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}bool compare(pair n1, pair n2) { if (n1.second == n2.second) { if (n1.first.size() == n2.first.size()) { return n1.first (n2.first.size()); } return n1.second > n2.second;}int main(void) { CPP_INIT(); int input1, input2; string str;..

https://www.acmicpc.net/problem/26069 #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 input; int cnt = 0; string str1, str2; map m; cin >> input; m["ChongChong"] = true; for (int i = 0; i > str1 >> str2; if (m.find(str1) == m.end()) { m.insert({ str1, false }); } if (m.find(str2) == ..

https://www.acmicpc.net/problem/25192 #include #include using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); int input1; string str; int cnt = 0; unordered_map um; cin >> input1; for(int i = 0; i > str; if(str == "ENTER"){ cnt += um.size(); um = {}; cont..

https://www.acmicpc.net/problem/1037 #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; vector v; cin >> input1; for (int i = 0; i > input2; v.push_back(input2); } if (v.size() == 1) { cout

https://www.acmicpc.net/problem/1010 #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 in; cin >> in; for (int i = 0; i > input1 >> input2; double num = input2; double num1 = input1; if (input1 == 0) { cout  double 로 변수를 받고반올림 (round) 시킨 다음int로 다시 형변환 하여 해결 숫자가 큰 팩토리얼 문제에 유용할 듯

https://www.acmicpc.net/problem/24511 #include #define endl "\n"using namespace std;int qs[100002];void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); int input1, input2; int num; int result; deque dq; cin >> input1; for (int i = 0; i > num; qs[i] = num; } for (int i = 0; i > num; if (qs[i] == 0) dq.push_back(num); } cin >> input2; for ..

https://www.acmicpc.net/problem/2346 #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; deque> dq; cin >> input1; for (int i = 1; i > input2; dq.push_back({ i, input2 }); } for (int i = 0; i 0) { idx--; while (idx != 0) { dq.push_back(dq.front()); dq.pop_..

https://www.acmicpc.net/problem/28279 #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; deque dq; cin >> input1; for (int i = 0; i > input2; switch (input2) { case 1: cin >> num; dq.push_front(num); break; case 2: cin >> num; dq.push_back(num); break;..

https://www.acmicpc.net/problem/18258 #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 input; int num; string str; queue qu; cin >> input; for (int i = 0; i > str; if (str.find("push") != -1) { cin >> num; qu.push(num); } else if (str == "pop") { if (qu.empty()) cout

https://www.acmicpc.net/problem/12789 #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 input; int num; int s = 1; stack st; cin >> input; for (int i = 0; i > num; if (s != num) { if (!st.empty() && st.top() == num) { st.pop(); s++; } else st.push(num); } else { s++; } } w..