개발자 꿈나무의 코딩방

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

https://www.acmicpc.net/problem/1269 #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; unordered_map um; cin >> input1 >> input2; for (int i = 0; i > num; if (um[num] != true) um[num] = true; else um.erase(num); } cout

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

vector v;v = { 1,2,3,4,5 };//lower_bound : 3보다 크거나 같은 인덱스 위치 : 2cout  배열 원소 값 중 Key 값을 찾는데 유용하다.

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