unordered_map메모리시간43828KB488ms#include #include #include using namespace std;int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N; cin >> N; unordered_map numbers; while (N--) { int i; cin >> i; numbers[i]++; } int M; cin >> M; while (M--) { int check; cin >> check; cout  이진탐색메모리시간5936..

브루트 포스시간을 줄이려고 666이 포함되어 있는 숫자만 골라내도록 했음#include #include using namespace std;int check(int N){ int count = 0; int number = 666; while (true) { if (to_string(number).find("666") != string::npos) { count++; if (count == N) { return number; } } number++; }}int main(){ int N; cin >> N; cout

단순 구현#include #include #include using namespace std;int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N, M; cin >> N >> M; unordered_map sites; while (N--) { string site, password; cin >> site >> password; sites[site] = password; } while (M--) { string find_site; cin >> find_site; if (sites..

단순 구현#include #include #include #include using namespace std;int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N; cin >> N; vector times; for (int i = 0; i > t; times.push_back(t); } sort(times.begin(), times.end()); int total = 0; int hap = 0; for (int t : times) { hap += t; total += hap; } cout

단순 구현#include #include #include #include using namespace std;int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N, M; cin >> N >> M; unordered_set names; vector ans; int count = 0; for (int i = 0; i > unheard_name; names.insert(unheard_name); } for (int i = 0; i > unseened_name; if (names.count(unseened_name)) {..

2가지 방법문제에서 s 배열의 크기가 한정되어 있으므로 배열을 사용해서 해결비트마스크배열#include using namespace std;int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);int M;cin >> M;int s[21] = {0}; while (M--){ string cmd; int x = 0; cin >> cmd; if (cmd == "add") { cin >> x; s[x] = 1; } else if (cmd == "remove") { cin >> x; s[x] = 0; } else if (cmd ==..