개발자 꿈나무의 코딩방

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

https://www.acmicpc.net/problem/28278 #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 select; int num; int n; stack st; cin >> input; for (int i = 0; i > select; switch (select) { case 1: cin >> num; st.push(num); break; case 2: if (st.empty()) { cout

https://www.acmicpc.net/problem/17103 #include #define endl "\n"using namespace std;int prime[1000002];void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); for (int i = 2; i > input; for (int i = 0; i > num; int a = num / 2; int b = num / 2; int cnt = 0; while (a > 1) { if (prime[a] + prime[b] == num) cnt++; a--; b++; } cout

https://www.acmicpc.net/problem/4948 #include #define endl "\n"using namespace std;int prime[250000];void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int main(void) { CPP_INIT(); for (int i = 2; i > num; if (num == 0) return 0; for (int i = num + 1; i

https://www.acmicpc.net/problem/13909 #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; cin >> input; cout

https://www.acmicpc.net/problem/4134 #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}bool prime(long long n) { int cnt = 0; for (long long i = 2; i > input1; for (long long i = 0; i > input2; if (input2 == 0 || input2 == 1) { cout  소수 확인은 그 수의 제곱근 이하의 약수만 확인하면 된다.

https://www.acmicpc.net/problem/2485 #include #define endl "\n"using namespace std;void CPP_INIT() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}int gcd(int n1, int n2){ if (n2 == 0) return n1; return gcd(n2, n1 % n2);}int main(void) { CPP_INIT(); int input1, input2; int cha; vector v; vector c; cin >> input1; for (int i = 0; i > input2; v.push_back(input2); if (i > 0) { c.pu..

https://www.acmicpc.net/problem/1735 #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 n, m, x, y; int mo, ja; cin >> n >> m >> x >> y; mo = m * y; ja = (n * y) + (m * x); if (mo > ja) { for (int i = 2; i

https://www.acmicpc.net/problem/1934 #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 num1, num2; cin >> input; for (int i = 0; i > num1 >> num2; int n1 = num1, n2 = num2; while (num1 != num2) { if (num1 > num2) num2 += n2; else num1 += n1; } cout

https://www.acmicpc.net/problem/11478 #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(); string str; int n, m, size; unordered_map um; cin >> str; for (int i = 0; i