[Week01] BOJ 1920: 수 찾기

Author: lsy1307

weekly/week01/BOJ_1920_수 찾기/lsy1307.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <unordered_set>
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    int N, num1, M, num2;
+    cin >> N;
+    unordered_set<int> numbers;
+    numbers.reserve(N);
+    while (N--) {
+        cin >> num1;
+        numbers.insert(num1);
+    }
+    cin >> M;
+    while (M--) {
+        cin >> num2;
+        if (numbers.find(num2) != numbers.end()) cout << 1 << "\n";
+        else cout << 0 << "\n";
+    }
+}