개발자 꿈나무의 코딩방

https://www.acmicpc.net/problem/25501 #include #define endl "\n"using namespace std;int cnt = 0;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int recursion(string& s, int l, int r) { cnt++; if (l >= r) return 1; else if (s[l] != s[r]) return 0; else return recursion(s, l + 1, r - 1);}int isPalindrome(string& s) { return recursion(s, 0, s.size() - 1);}int main(void..

https://www.acmicpc.net/problem/10870 #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int fibo(int n) { if (n == 0) return 0; else if (n == 1 || n == 2) return 1; else return fibo(n - 1) + fibo(n - 2);}int main(void) { CPP_INIT(); int input; cin >> input; cout

https://www.acmicpc.net/problem/11729 #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}void hanoi(int n, int from, int by, int to) { if (n == 1) { cout > input; cout

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;..

for (pair p : m) { cout

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 ..