Add problems from CF

Author: jhonber

codeforces/Codeforces Round #387 (Div. 2)/A.cpp

@@ -0,0 +1,27 @@
+// http://codeforces.com/contest/747/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;
+
+  int mm = INT_MAX;
+  int a, b;
+  for (int i = 1; i <= n ; ++i) {
+    if (n % i != 0) continue;
+    int other = n / i;
+    if (other - i < mm && other >= i) {
+      a = i;
+      b = other;
+      mm = b - a;
+    }
+  }
+
+  cout << a << " " << b << endl;
+  return 0;
+}

codeforces/Codeforces Round #387 (Div. 2)/B.cpp

@@ -0,0 +1,54 @@
+// http://codeforces.com/contest/747/problem/B
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+int main() {
+  int n;
+  string s;
+  cin >> n >> s;
+
+  if (n % 4 != 0) {
+    cout << "===" << endl;
+    return 0;
+  }
+
+  char v[] = {'A', 'C', 'G','T'};
+  int tot[] = {0, 0, 0, 0};
+  for (int i = 0; i < n; ++i) {
+    if (s[i] == v[0]) tot[0] ++;
+    if (s[i] == v[1]) tot[1] ++;
+    if (s[i] == v[2]) tot[2] ++;
+    if (s[i] == v[3]) tot[3] ++;
+  }
+
+  int len = n / 4;
+  for (int i = 0; i < 4; ++i) {
+    int t = len - tot[i];
+    for (int j = 0; j < n && t; ++j) {
+      if (s[j] == '?' && t) {
+        s[j] = v[i];
+        t --;
+      }
+    }
+  }
+
+  memset(tot, 0, sizeof tot);
+  for (int i = 0; i < n; ++i) {
+    if (s[i] == v[0]) tot[0] ++;
+    if (s[i] == v[1]) tot[1] ++;
+    if (s[i] == v[2]) tot[2] ++;
+    if (s[i] == v[3]) tot[3] ++;
+  }
+
+  bool ok = true;
+  for (int i = 0; i < 4; ++i) {
+    if (tot[i] != len) ok = false;
+  }
+
+  cout << (ok ? s : "===") << endl;
+  return 0;
+}

codeforces/Codeforces Round #387 (Div. 2)/C.cpp

@@ -0,0 +1,74 @@
+// http://codeforces.com/contest/747/problem/C
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+struct task {
+  int t, k, d;
+  task () {}
+  task (int a, int b, int c) {
+    t = a;
+    k = b;
+    d = c;
+  }
+};
+
+int main() {
+  int n, q;
+  cin >> n >> q;
+
+  vector<task> v(q);
+
+  int a, b, c;
+  for (int i = 0; i < q; ++i) {
+    cin >> a >> b >> c;
+    v[i] = task(a, b, c);
+  }
+
+  reverse(v.begin(), v.end());
+
+  vector<int> servers(n, 0);
+  for (int i = 1; i <= 1e6 + 3333; ++i) {
+    if (v.size()) {
+      task cur = v.back();
+      a = cur.t;
+      b = cur.k;
+      c = cur.d;
+
+      if (a == i) {
+        int free = 0;
+        for (int j = 0; j < servers.size(); ++j) {
+          if (!servers[j]) free ++;
+        }
+
+        int tot = b;
+        int sum = 0;
+        if (free >= b) {
+          for (int j = 0; j < servers.size() && tot > 0; ++j) {
+            if (servers[j] == 0) {
+              servers[j] = c;
+              sum += j + 1;
+              tot --;
+            }
+          }
+
+          cout << sum << endl;
+        }
+        else {
+          cout << -1 << endl;
+        }
+
+        v.pop_back();
+      }
+    }
+
+    for (int j = 0; j < servers.size(); ++j) {
+      if (servers[j] > 0) servers[j] --;
+    }
+  }
+
+  return 0;
+}

codeforces/data.db

@@ -922,4 +922,7 @@
 24132337
 24366846
 24374352
-24384579
+24384579
+24358027
+24357514
+24357587