[ADD] BOJ 2776 암기왕

- 자료구조

Author: tdm1223

acmicpc.net/README.md

@@ -742,7 +742,7 @@
 |  47  |  [안정적인 문자열](https://www.acmicpc.net/problem/4889)  | [cpp](source/4889.cpp)  |  48  | [서로 다른 부분 문자열의 개수](https://www.acmicpc.net/problem/11478) | [cpp](source/11478.cpp) |
 |  49  |      [평행선](https://www.acmicpc.net/problem/2358)       | [cpp](source/2358.cpp)  |  50  |        [괄호 끼워넣기](https://www.acmicpc.net/problem/11899)         | [cpp](source/11899.cpp) |
 |  51  | [천재 수학자 성필](https://www.acmicpc.net/problem/15815) | [cpp](source/15815.cpp) |  52  |          [파일 정리](https://www.acmicpc.net/problem/20291)           | [cpp](source/20291.cpp) |
-|  53  |  [Olympiad Pizza](https://www.acmicpc.net/problem/15235)  | [cpp](source/15235.cpp) |      |                                                                       |                         |
+|  53  |  [Olympiad Pizza](https://www.acmicpc.net/problem/15235)  | [cpp](source/15235.cpp) |  54  |            [암기왕](https://www.acmicpc.net/problem/2776)             | [cpp](source/2776.cpp)  |
 
 </details>
 

acmicpc.net/source/2776.cpp

@@ -0,0 +1,45 @@
+// 2776. 암기왕
+// 2022.03.13
+// 자료구조
+#include<iostream>
+#include<set>
+
+using namespace std;
+
+int main()
+{
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cout.tie(0);
+    int t;
+    cin >> t;
+
+    int n, m, k;
+    set<int> note;
+    while (t-- > 0)
+    {
+        note.clear();
+
+        cin >> n;
+        for (int i = 0; i < n; i++)
+        {
+            cin >> k;
+            note.insert(k);
+        }
+
+        cin >> m;
+        for (int i = 0; i < m; i++)
+        {
+            cin >> k;
+            if (note.find(k) == note.end())
+            {
+                cout << 0 << "\n";
+            }
+            else
+            {
+                cout << 1 << "\n";
+            }
+        }
+    }
+    return 0;
+}