[INIT] Topic Specific Programming Problems

Author: mustaquenadim

.replit

@@ -0,0 +1,4 @@
+run = "cowsay Configure me!"
+
+[nix]
+channel = "stable-22_11"

Prefix Sum/CSUMQ.cpp

@@ -0,0 +1,35 @@
+/**
+  * Platform: Sphere Online Judge
+  * Problem: https://www.spoj.com/problems/CSUMQ/
+  * Solved by mustaquenadim
+  */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int N, Q;
+    cin >> N;
+    int arr[N], sum[N];
+    for(int i = 0; i < N; i++) {
+        cin >> arr[i];
+        if(i == 0) {
+            sum[i] = arr[i];
+        } else {
+            sum[i] = sum[i - 1] + arr[i];
+        }
+    }
+    cin >> Q;
+    while(Q--) {
+        int i, j, res;
+        cin >> i >> j;
+        if(i == 0) {
+            res = sum[j];
+        } else {
+            res = sum[j] - sum[i - 1];
+        }
+        cout << res << endl;
+    }
+    return 0;
+}

Prefix Sum/CodeForces - 816B - Karen and Coffee.cpp

@@ -0,0 +1,50 @@
+/**
+  * Platform: CodeForces
+  *	Problem: https://codeforces.com/contest/816/problem/B
+  */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define MAX_TEMP 200001
+
+int main() {
+    int n, k, q;
+    cin >> n >> k >> q;
+    int arr[MAX_TEMP] = {0}, prefix[MAX_TEMP];
+    while (n--) {
+        int l, r;
+        cin >> l >> r;
+        arr[l]++;
+        arr[r + 1]--;
+    }
+    prefix[0] = arr[0];
+    for(int i = 1; i < MAX_TEMP; i++) {
+        prefix[i] = prefix[i - 1] + arr[i];
+        // if(prefix[i] > 0) {
+        //     cout << i << " = " << prefix[i] << endl;
+        // }
+    }
+    for(int i = 0; i < MAX_TEMP; i++) {
+        if(prefix[i] >= k) {
+            prefix[i] = 1;
+        } else {
+            prefix[i] = 0;
+        }
+    }
+    prefix[0] = prefix[0];
+    for(int i = 1; i < MAX_TEMP; i++) {
+        prefix[i] = prefix[i - 1] + prefix[i];
+    }
+    while(q--) {
+        int a, b, kount = 0;
+        cin >> a >> b;
+        if(a == 0) {
+            kount = prefix[b];
+        } else {
+            kount = prefix[b] - prefix[a - 1];
+        }
+        cout << kount << endl;
+    }
+    return 0;
+}

Prefix Sum/README.md

@@ -0,0 +1,21 @@
+# Prefix Sum
+
+
+## Problems
+
+1. [CodeForces - 816B — Karen and coffee](https://codeforces.com/contest/816/problem/B)
+2. [CodeForces - 296C](https://codeforces.com/contest/296/problem/C)
+3. [CodeForces - 479E](https://codeforces.com/contest/479/problem/E)
+4. [CodeForces - 433B](https://codeforces.com/contest/433/problem/B)
+5. [CodeForces - 610B](https://codeforces.com/contest/610/problem/B)
+6. [CodeForces - 1237B](https://codeforces.com/contest/1237/problem/B)
+7. [CodeForces - 486D](https://codeforces.com/contest/486/problem/D)
+8. [CodeForces - 835C](https://codeforces.com/contest/835/problem/C)
+9. [CodeForces - 1043E](https://codeforces.com/contest/1043/problem/E)
+10. [CodeChef - Snake Eating](https://www.codechef.com/problems/SNAKEEAT)
+11. [UVa - 108 - Maximum Sum](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=44)
+12. [SPOJ - CSUMQ - Cumulative Sum Query](https://www.spoj.com/problems/CSUMQ/)
+13. [UVa - 983 - Localized Summing for Blurring](https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=924)
+14. [UVa - 11951](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=3102)
+15. [UVa - 10533](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1474)
+16. [Hackerrank - KJ and street lights](https://www.hackerrank.com/contests/ab-yeh-kar-ke-dikhao/challenges/kj-and-street-lights/problem)

replit.nix

@@ -0,0 +1,5 @@
+{ pkgs }: {
+    deps = [
+        pkgs.cowsay
+    ];
+}