AtCoder ABC303, Delete unusable files

Author: KHJcode

.idea/.gitignore

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+int main() {
+    int n, i;
+    bool res = true;
+    string s1, s2;
+    cin >> n;
+    cin >> s1 >> s2;
+    for (i = 0; i < n; i++) {
+        if (!(
+            (s1[i] == s2[i]) ||
+            (s1[i] == 'o' && s2[i] == '0') ||
+            (s1[i] == '0' && s2[i] == 'o') ||
+            (s1[i] == 'l' && s2[i] == '1') ||
+            (s1[i] == '1' && s2[i] == 'l')
+        )) {
+            res = false;
+            break;
+        }
+    }
+    cout << (res ? "Yes" : "No");
+    return 0;
+}

.idea/.name

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+int rec[51][51];
+ 
+int main() {
+    int n, m, i, j, k, a, b, c = 0, arr[51][51];
+    cin >> n >> m;
+    for (j = 0; j < m; j++) {
+        for (i = 0; i < n; i++) {
+            cin >> arr[j][i];
+        }
+    }
+    for (j = 0; j < m; j++) {
+        for (i = 0; i < n - 2; i++) {
+            for (k = i + 2; k < n; k++) {
+                a = min(arr[j][k], arr[j][i]);
+                b = max(arr[j][k], arr[j][i]);
+                rec[a][b] += 1;
+            }
+        }
+    }
+    for (j = 1; j <= n - 1; j++) {
+        for (i = j + 1; i <= n; i++) {
+            if (rec[j][i] == m) {
+                c += 1;
+            }
+        }
+    }
+    cout << c;
+    return 0;
+}

.idea/algorithm-study.iml

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+#define SALT 200001
+
+using namespace std;
+using ull = unsigned long long;
+
+unordered_map<ull, bool> items;
+
+ull key(ull x, ull y) {
+    return (x + SALT) * 1000000 + y + SALT;
+}
+
+int main() {
+    string s;
+    int n, m, h, k, i, x, y;
+    bool res = true;
+    cin >> n >> m >> h >> k >> s;
+    for (i = 0; i < m; i++) {
+        cin >> x >> y;
+        items[key(x, y)] = true;
+    }
+    x = 0;
+    y = 0;
+    for (i = 0; i < n; i++) {
+        if (s[i] == 'R') {
+            x += 1;
+        } else if (s[i] == 'L') {
+            x -= 1;
+        } else if (s[i] == 'U') {
+            y += 1;
+        } else {
+            y -= 1;
+        }
+        h -= 1;
+        if (h < 0) {
+            res = false;
+            break;
+        }
+        if (h < k && items[key(x, y)]) {
+            h = k;
+            items[key(x, y)] = false;
+        }
+    }
+    cout << (res ? "Yes" : "No");
+    return 0;
+}

.idea/misc.xml

@@ -9,6 +9,7 @@ Solve algorithm problems and write code.
 - [CodeUp](https://codeup.kr)
 - [Baekjoon Online Judge](https://www.acmicpc.net)
 - [LeetCode](https://leetcode.com/problemset/all)
+- [AtCoder](https://atcoder.jp)
 
 <br/>