Add more questions

Author: Augusto Calaca

uri/uri1222.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+#include <vector>
+#include <map>
+
+#define f first
+#define s second
+#define pb push_back
+#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
+using namespace std;
+
+typedef long long ll;
+typedef unsigned long long ull;
+
+int main() {
+  FAST;
+
+  int n, l, c, sz, cfl, lfp, ans;
+  string str;
+
+  while(cin >> n >> l >> c) {
+    ans = cfl = 0;
+    lfp = 1;
+    for(int i = 0; i < n; i++) {
+      cin >> str;
+      sz = str.size();
+      if(cfl + sz <= c) cfl += sz + 1;
+      else {
+        lfp++;
+        cfl = sz + 1;
+      }
+      if(lfp == l) lfp = 0, ans++;
+    }
+    if(lfp > 0) ans++;
+    cout << ans << "\n";
+  }
+
+  return 0;
+}

uri/uri1228.cpp

@@ -13,25 +13,28 @@ using namespace std;
 typedef long long ll;
 typedef unsigned long long ull;
 
-int start[30], fini[30];
-int search(int n, int k) {
-  for(int i = 0; i < n; i++)
-    if(fini[i] == k) return i;
-}
+int start[30], fini[30], u[30];
 
 int main() {
   FAST;
 
   int n;
   while(cin >> n) {
     for(int i = 0; i < n; i++)
-      cin >> v[i];
+      cin >> start[i];
     for(int i = 0; i < n; i++)
       cin >> fini[i];
 
-    for(int i = 1; i < n; i++) {
-      int f = find(n, start[i]);
-      if(f < i) ans += (i - f);
+    int ans = 0;
+    for(int i = 0; i < n; i++) {
+      for(int j = 0; j < n; j++)
+        if(fini[j] == start[i]) {
+          u[i] = j;
+          break;
+        }
+      if(i < 1) continue;
+      for(int j = 0; j < i; j++)
+        if(u[j] > u[i]) ans++;
     }
 
     cout << ans << "\n";