[성공] 1116_초중급_이진경(온라인)

11월16일/초중급/1971039_2246.cpp

@@ -0,0 +1,40 @@
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+
+    vector<pair<int, int>> condo(n);
+    for (int i = 0; i < n; i++) {
+        int a, b;
+        cin >> a >> b;
+        condo[i] = make_pair(a, b);
+    }
+
+    // sort(condo.begin(), condo.end());
+
+    int count = 0;
+    for (int i = 0; i < n; i++) { //기준
+        int check = true;
+        for (int j = 0; j < n; j++) {
+            if (j == i)
+                continue;
+
+            if (condo[j].first < condo[i].first && condo[i].second >= condo[j].second) {
+                check = false;
+                break;
+            }
+            if (condo[j].second < condo[i].second && condo[j].first <= condo[i].first) {
+                check = false;
+                break;
+            }
+        }
+        if (check)
+            count++;
+    }
+    cout << count;
+}

11월16일/초중급/1971039_4436.cpp

@@ -0,0 +1,28 @@
+#include <algorithm>
+#include <iostream>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    while (true) {
+        long long n; //반드시 long long으로 해야함 (아니면 19번째줄 연산시 형변환 필요)
+        cin >> n;
+        if (cin.eof() == true) {
+            break;
+        }
+
+        int i = 1;
+        set<int> s;
+        while (s.size() < 10) {
+            long long num = n * i; //반드시 long long으로 해야함
+            while (num != 0) {
+                s.insert(num % 10);
+                num /= 10;
+            }
+            i++;
+        }
+        cout << i - 1 << "\n";
+    }
+}