Add problems from CF

Author: jhonber

codeforces/Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)/A.cpp

@@ -0,0 +1,39 @@
+// http://codeforces.com/contest/765/problem/A
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+int main() {
+  int n;
+  cin >> n;
+
+  string h;
+  cin >> h;
+
+  map<string, int> mapa;
+  for (int i = 0; i < n; ++i) {
+    string s;
+    cin >> s;
+
+    string a, b;
+    a = s.substr(0, 3);
+    b = s.substr(5, 3);
+
+    if (a != h) mapa[b + a] ++;
+    else mapa[a + b] ++;
+  }
+
+  bool ok = true;
+  for (auto i: mapa) {
+    if (i.second % 2 != 0) {
+      ok = false;
+      break;
+    }
+  }
+
+  cout << (ok ? "home" : "contest") << endl;
+  return 0;
+}

codeforces/Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)/B.cpp

@@ -0,0 +1,36 @@
+// http://codeforces.com/contest/765/problem/B
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+int main() {
+  string s;
+  cin >> s;
+
+  bool ok = true;
+  int next = 0;
+  while (next < 26 && s.size() > 0) {
+    int cur = s[0] - 'a';
+    if (cur != next) {
+      ok = false;
+      break;
+    }
+
+    string s2;
+    for (int i = 0; i < s.size(); ++i) if ((int)(s[i] - 'a') != next) {
+      s2.push_back(s[i]);
+    }
+
+    s = s2;
+    next ++;
+  }
+
+  ok = !s.size();
+
+  cout << (ok ? "YES" : "NO") << endl;
+
+  return 0;
+}

codeforces/data.db

@@ -932,4 +932,6 @@
 24577323
 24578678
 24577407
-24578991
+24578991
+24681844
+24682004