Solved alot of problems :3

Author: AliOsm

CS Academy/82. City Break.cpp

@@ -0,0 +1,59 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int n, s;
+long long a[N];
+
+long long calc(int u, int v) {
+  if(u > v)
+    swap(u, v);
+  return min(a[v - 1] - a[u - 1], a[u - 1] + a[n] - a[v - 1]);
+}
+
+int main() {
+  scanf("%d %d", &n, &s);
+  for(int i = 1; i <= n; ++i)
+    scanf("%lld", a + i);
+  
+  for(int i = 1; i <= n; ++i)
+    a[i] += a[i - 1];
+  
+  int a = s - 1, b = s + 1;
+  if(a <= 0) a += n;
+  if(b > n) b -= n;
+  
+  long long x, y, sol = 0;
+  for(int i = 0; i < n; ++i) {
+    x = calc(s, a);
+    y = calc(s, b);
+    
+    if(x == y) {
+      if(a < b) {
+        s = a;
+        --a;
+      } else {
+        s = b;
+        ++b;
+      }
+      
+      sol += x;
+    } else if(x < y) {
+      s = a;
+      --a;
+      sol += x;
+    } else {
+      s = b;
+      ++b;
+      sol += y;
+    }
+    
+    if(a <= 0) a += n;
+    if(b > n) b -= n;
+  }
+  
+  printf("%lld\n", sol);
+  
+  return 0;
+}

CS Academy/83. Smallest Missing Numbers.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int n, m, a[N];
+long long t = 0;
+
+int main() {
+  scanf("%d %d", &n, &m);
+  for(int i = 0; i < n; ++i)
+    scanf("%d", a + i);
+  
+  sort(a, a + n);
+  for(int i = 0, cur; i < n; ++i) {
+    cur = 0;
+    while(i < n && a[i] <= m)
+      t += a[i], ++cur, ++i;
+    --i;
+    m += cur;
+    if(cur == 0)
+      break;
+  }
+  
+  printf("%lld\n", (1ll * m * (m + 1)) / 2 - t);
+  
+  return 0;
+}

CS Academy/86. Cookie Clicker.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, c, s, a[5], b[5], dp[100001][200];
+
+int rec(int cok, int msk, int add) {
+  if(cok >= c)
+    return 0;
+  
+  int &ret = dp[cok][msk];
+  if(ret != -1)
+    return ret;
+  ret = 1e9;
+  
+  ret = min(ret, rec(cok + s + add, msk, add) + 1);
+  
+  for(int i = 0; i < n; ++i)
+    if(((msk >> i) & 1) == 0 && cok >= a[i]) {
+      ret = min(ret, rec(cok - a[i] + s, msk | (1 << i), add + b[i]) + 1);
+      ret = min(ret, rec(cok - a[i], msk | (1 << i), add + b[i]));
+    }
+  
+  return ret;
+}
+
+int main() {
+  scanf("%d %d %d", &n, &c ,&s);
+  for(int i = 0; i < n; ++i)
+    scanf("%d %d", a + i, b + i);
+  
+  memset(dp, -1, sizeof dp);
+  printf("%d\n", rec(0, 0, 0));
+  
+  return 0;
+}

CS Academy/README.md

@@ -20,3 +20,6 @@
 - [79. Cats and Dogs](https://csacademy.com/contest/round-79/task/cats-and-dogs/)
 - [80. Digits Permutation](https://csacademy.com/contest/round-80/task/ioi-selection/)
 - [80. IOI Selection](https://csacademy.com/contest/round-80/task/digits-permutation/)
+- [82. City Break](https://csacademy.com/contest/round-82/task/city-break/)
+- [83. Smallest Missing Numbers](https://csacademy.com/contest/round-83/task/smallest-missing-numbers/)
+- [86. Cookie Clicker](https://csacademy.com/contest/round-86/task/cookie-clicker/)

SPOJ/README.md

@@ -62,4 +62,5 @@
 - [SUMFOUR - 4 values whose sum is 0](http://www.spoj.com/problems/SUMFOUR/)
 - [SUMITR - Sums in a Triangle](http://www.spoj.com/problems/SUMITR/)
 - [TOANDFRO - To and Fro](http://www.spoj.com/problems/TOANDFRO/)
+- [TRIP - Trip](https://www.spoj.com/problems/TRIP/)
 - [WEIRDFN - Weird Function](https://www.spoj.com/problems/WEIRDFN/)

SPOJ/TRIP - Trip.cpp

@@ -0,0 +1,84 @@
+/*
+  Idea:
+    - https://www.geeksforgeeks.org/print-longest-common-sub-sequences-lexicographical-order/
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e2 + 1;
+int t, len, l1, l2, dp[N][N];
+char s1[N], s2[N];
+string s;
+vector<string> sol;
+
+int rec(int i, int j) {
+  if(i == l1 || j == l2)
+    return 0;
+
+  int &ret = dp[i][j];
+  if(ret != -1)
+    return ret;
+  ret = 0;
+
+  if(s1[i] == s2[j])
+    return ret = rec(i + 1, j + 1) + 1;
+  ret = max(ret, rec(i + 1, j));
+  ret = max(ret, rec(i, j + 1));
+
+  return ret;
+}
+
+void print(int i, int j, int l) {
+  if(l == len) {
+    sol.push_back(s);
+    return;
+  }
+
+  if(i == l1 || j == l2)
+    return;
+
+  for(char c = 'a'; c <= 'z'; ++c) {
+    bool ok = false;
+    for(int ii = i; ii < l1; ++ii) {
+      if(s1[ii] == c) {
+        for(int jj = j; jj < l2; ++jj) {
+          if(s2[jj] == c && rec(ii, jj) == len - l) {
+            s += c;
+            print(ii + 1, jj + 1, l + 1);
+            s.pop_back();
+            ok = true;
+            break;
+          }
+        }
+      }
+      if(ok)
+        break;
+    }
+  }
+}
+
+int main() {
+  scanf("%d", &t);
+  while(t-- != 0) {
+    scanf("%s\n%s", s1, s2);
+    l1 = strlen(s1);
+    l2 = strlen(s2);
+
+    memset(dp, -1, sizeof dp);
+    len = rec(0, 0);
+
+    s = "";
+    sol.clear();
+    print(0, 0, 0);
+
+    for(int i = 0; i < sol.size(); ++i)
+      printf("%s\n", sol[i].c_str());
+
+    if(t)
+      puts("");
+  }
+
+  return 0;
+}