Added problems from CF

Author: jhonber

codeforces/Educational Codeforces Round 33 (Rated for Div. 2)/A.cpp

@@ -0,0 +1,37 @@
+// http://codeforces.com/contest/893/problem/A
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) <<  endl;
+
+int main() {
+#ifdef ONLINEJUDGE
+  ios_base::sync_with_stdio(0); cin.tie(0);
+#endif
+
+  int n;
+  cin >> n;
+
+  bool ok = true;
+  vector<int> v = {1, 1, 0};
+  for (int i = 0; i < n; ++i) {
+    int x;
+    cin >> x; x--;
+
+    if (!v[x]) ok = false;
+
+    v[x] ++;
+    for (int j = 0; j < 3; ++j) {
+      if (!v[j]) {
+        v[j] = v[x];
+      }
+    }
+
+    for (int i = 0; i < 3; ++i) v[i] --;
+  }
+
+  cout << (ok ? "YES" : "NO") << endl;
+
+  return 0;
+}

codeforces/Educational Codeforces Round 33 (Rated for Div. 2)/B.cpp

@@ -0,0 +1,31 @@
+// http://codeforces.com/contest/893/problem/B
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) <<  endl;
+
+int main() {
+#ifdef ONLINEJUDGE
+  ios_base::sync_with_stdio(0); cin.tie(0);
+#endif
+
+  int n;
+  cin >> n;
+
+  long long ans = 0;
+  int i = 1;
+  while (true) {
+    long long a = (1LL << i) - 1;
+    long long b = 1LL << (i - 1);
+    if (a * b > n) break;
+    if (n % (a * b) == 0) {
+      ans = max(ans, a * b);
+    }
+
+    i ++;
+  }
+
+  cout << ans << endl;
+  return 0;
+}

codeforces/Educational Codeforces Round 33 (Rated for Div. 2)/C.cpp

@@ -0,0 +1,56 @@
+// http://codeforces.com/contest/893/problem/C
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) <<  endl;
+
+const int MX = 1e5 + 100;
+vector<int> G[MX];
+vector<long long> v(MX);
+vector<int> visited(MX, 0);
+long long mm;
+
+void dfs (int cur) {
+  if (!visited[cur]) {
+    mm = min(v[cur], mm);
+    visited[cur] = true;
+    for (int i = 0; i < G[cur].size(); ++i) {
+      int next = G[cur][i];
+      mm = min(mm, v[next]);
+      dfs(next);
+    }
+
+  }
+}
+
+int main() {
+#ifdef ONLINEJUDGE
+  ios_base::sync_with_stdio(0); cin.tie(0);
+#endif
+
+  int n, m;
+  while (cin >> n >> m) {
+    for (int i = 1; i <= n; ++i) cin >> v[i];
+
+    for (int i = 0; i < m; ++i) {
+      int a, b;
+      cin >> a >> b;
+      G[a].push_back(b);
+      G[b].push_back(a);
+    }
+
+    long long ans = 0;
+    for (int i = 1; i <= n; ++i) {
+      if (!visited[i]) {
+        mm = INT_MAX;
+        dfs(i);
+        ans += mm;
+      }
+    }
+
+    cout << ans << endl;
+  }
+
+  return 0;
+}

codeforces/data.db

@@ -1066,4 +1066,5 @@
 32302138
 32161457
 31878123
-31910741
+31910741
+32605600