Solved problems 1016[A, B] from codeforces

Author: AliOsm

CodeForces/1016A. Death Note.cpp

@@ -0,0 +1,47 @@
+/*
+  Idea:
+    - Math, Implementation.
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 2e5 + 1;
+int n, m, a[N];
+
+int main() {
+  scanf("%d %d", &n, &m);
+  for(int i = 0; i < n; ++i)
+    scanf("%d", a + i);
+
+  int rem = m;
+  for(int d = 0; d < n; ++d) {
+    int cur = a[d], res = 0;
+    if(cur < rem)
+      rem -= cur;
+    else if(cur == rem)
+      ++res, rem = m;
+    else {
+      cur -= rem;
+      rem = m;
+      ++res;
+
+      if(cur < rem)
+        rem -= cur;
+      else if(cur == rem)
+        ++res, rem = m;
+      else {
+        res += cur / rem;
+        cur = cur % rem;
+        rem -= cur;
+      }
+    }
+
+    printf("%d ", res);
+  }
+
+  puts("");
+
+  return 0;
+}

CodeForces/1016B. Segment Occurrences.cpp

@@ -0,0 +1,45 @@
+/*
+  Idea:
+    - Brute force to find all occurrences of string `t` in `s`,
+      then use this information to answer the queries.
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e3 + 1;
+char s[N], t[N];
+int n, m, q;
+vector<int> all;
+
+int main() {
+  scanf("%d %d %d", &n, &m, &q);
+  scanf("%s\n%s", s, t);
+
+  int slen = strlen(s);
+  int tlen = strlen(t);
+
+  for(int i = 0; i + tlen - 1 < slen; ++i) {
+    bool ok = true;
+    for(int j = 0, k = i; j < tlen; ++j, ++k)
+      if(s[k] != t[j]) {
+        ok = false;
+        break;
+      }
+    if(ok)
+      all.push_back(i);
+  }
+
+  for(int i = 0, a, b; i < q; ++i) {
+    int res = 0;
+    scanf("%d %d", &a, &b);
+    --a, --b;
+    for(int j = 0; j < all.size(); ++j)
+      if(all[j] >= a && all[j] + tlen - 1 <= b)
+        ++res;
+    printf("%d\n", res);
+  }
+
+  return 0;
+}

CodeForces/README.md

@@ -538,3 +538,5 @@
 - [1015D. Walking Between Houses](http://codeforces.com/contest/1015/problem/D)
 - [1015E1. Stars Drawing (Easy Edition)](http://codeforces.com/contest/1015/problem/E1)
 - [1015E2. Stars Drawing (Hard Edition)](http://codeforces.com/contest/1015/problem/E2)
+- [1016A. Death Note](http://codeforces.com/contest/1016/problem/A)
+- [1016B. Segment Occurrences](http://codeforces.com/contest/1016/problem/B)