feat(cf): update with 957.f

codeforces/1003/b.cc

@@ -68,22 +68,12 @@ using vec = std::vector<T>;
 void solve() {
   string s;
   cin >> s;
-  vec<char> S;
-  for (auto e : s) {
-    if (!S.empty() && S.back() == e) {
-      S.pop_back();
-      S.push_back('*');
-    } else
-      S.push_back(e);
+  bool can = false;
+  for (int i = 1; i < sz<int>(s); ++i) {
+    if (s[i] == s[i - 1])
+      can = true;
   }
-
-  while (sz<int>(S) >= 2) {
-    if (S.back() == '*' || S[sz<int>(S) - 1] == '*')
-      S.pop_back();
-    else
-      break;
-  }
-  prln("{}", sz<int>(S));
+  prln("{}", can ? 1 : sz<int>(s));
 }
 
 // {{{

codeforces/1003/b.out

@@ -4,4 +4,4 @@
 4
 
 [code]: 0
-[time]: 11.9956 ms
+[time]: 12.0482 ms

codeforces/1003/f.out

@@ -4,4 +4,4 @@
 1001001000100
 
 [code]: 0
-[time]: 3.66259 ms
+[time]: 4.07124 ms

codeforces/957/a.out

@@ -2,4 +2,4 @@
 600
 
 [code]: 0
-[time]: 10.5841 ms
+[time]: 10.5841 ms

codeforces/957/b.out

@@ -4,4 +4,4 @@
 15
 
 [code]: 0
-[time]: 12.924 ms
+[time]: 12.924 ms

codeforces/957/e.cc

@@ -0,0 +1,116 @@
+//  {{{
+#include <bits/stdc++.h>
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+
+template <typename... Args>
+void pr(std::format_string<Args...> fmt, Args&&... args) {
+  std::print(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+void pr(std::format_string<Args...> fmt) {
+  std::print(fmt);
+}
+
+template <typename... Args>
+void prln(std::format_string<Args...> fmt, Args&&... args) {
+  std::println(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+void prln(std::format_string<Args...> fmt) {
+  std::println(fmt);
+}
+
+void prln() {
+  std::println();
+}
+
+void prln(auto const& t) {
+  std::println("{}", t);
+}
+
+using ll = long long;
+using ld = long double;
+template <typename T>
+using vec = std::vector<T>;
+
+#define ff first
+#define ss second
+#define eb emplace_back
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+//  }}}
+
+void solve() {
+  int n;
+  cin >> n;
+
+  string strn = to_string(n);
+  int lenn = sz<int>(strn);
+
+  vec<pair<int, int>> ans;
+
+  for (int a = 1; a <= 100000; ++a) {
+    // s =|n|a-b; na-b
+
+    // 1<=|n|a-b<=5
+    // b<=|n|a-1    |n|a-5<=b
+    int lo = max(1, lenn * a - 5);
+    int hi = min(10000, lenn * a - 1);
+
+    for (int b = lo; b <= hi; ++b) {
+      int cmp = 0;
+      for (int i = 0; i < lenn * a - b; ++i) {
+        cmp *= 10;
+        cmp += strn[i % lenn] - '0';
+      }
+      if (cmp == n * a - b) {
+        ans.eb(a, b);
+      }
+    }
+  }
+
+  prln("{}", sz<int>(ans));
+  for (auto& [a, b] : ans) {
+    prln("{} {}", a, b);
+  }
+}
+
+// {{{
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}

codeforces/957/e.in

@@ -0,0 +1,4 @@
+3
+2
+3
+10

codeforces/957/e.out

@@ -0,0 +1,11 @@
+3
+20 18
+219 216
+2218 2214
+1
+165 162
+1
+1262 2519
+
+[code]: 0
+[time]: 13.0446 ms

codeforces/957/f.cc

@@ -1,4 +1,5 @@
-#include <bits/stdc++.h>  // {{{
+//  {{{
+#include <bits/stdc++.h>
 
 // https://codeforces.com/blog/entry/96344
 
@@ -62,15 +63,55 @@ using vec = std::vector<T>;
 #define pb push_back
 #define all(x) (x).begin(), (x).end()
 #define rall(x) (x).rbegin(), (x).rend()
+//  }}}
+
+bitset<2 * 100000 + 5 + 1> used;
+vec<int> I;
 
 void solve() {
-  prln(5);
+  ll n, x;
+  cin >> n >> x;
+  vec<ll> a(n);
+  for (auto& e : a)
+    cin >> e;
+
+  used.reset();
+  I = {1};
+
+  ll ans = 1;
+
+  for (auto number : a) {
+    if (x % number)
+      continue;
+    vec<int> nxt;
+    for (auto i : I) {
+      if (i * number >= sz<ll>(used))
+        continue;
+      if (i * number == x) {
+        ++ans;
+        used.reset();
+        used[number] = true;
+        I.clear();
+        nxt = {1};
+        nxt.pb(number);
+        break;
+      }
+      if (!used[i * number]) {
+        nxt.pb(i * number);
+        used[i * number] = true;
+      }
+    }
+    I.insert(I.end(), all(nxt));
+  }
+
+  prln("{}", ans);
 }
 
-int main() {  // {{{
+// {{{
+int main() {
   cin.tie(nullptr)->sync_with_stdio(false);
 
-  int t = 1;
+  ll t = 1;
   cin >> t;
 
   while (t--) {
@@ -78,4 +119,5 @@ int main() {  // {{{
   }
 
   return 0;
-}  //}}}
+}
+// }}}

codeforces/957/f.out

@@ -1,11 +1,11 @@
-5
-5
-5
-5
-5
-5
-5
-5
+3
+2
+1
+1
+2
+1
+3
+3
 
 [code]: 0
-[time]: 12.038 ms
+[time]: 11.9431 ms

codeforces/957/x.cc

@@ -0,0 +1,86 @@
+//  {{{
+#include <bits/stdc++.h>
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+template <typename T>
+constexpr T MIN = std::numeric_limits<T>::min();
+
+template <typename T>
+constexpr T MAX = std::numeric_limits<T>::max();
+
+template <typename T>
+[[nodiscard]] static T sc(auto&& x) {
+  return static_cast<T>(x);
+}
+
+template <typename T>
+[[nodiscard]] static T sz(auto&& x) {
+  return static_cast<T>(x.size());
+}
+
+
+template <typename... Args>
+void pr(std::format_string<Args...> fmt, Args&&... args) {
+  std::print(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+void pr(std::format_string<Args...> fmt) {
+  std::print(fmt);
+}
+
+template <typename... Args>
+void prln(std::format_string<Args...> fmt, Args&&... args) {
+  std::println(fmt, std::forward<Args>(args)...);
+}
+
+template <typename... Args>
+void prln(std::format_string<Args...> fmt) {
+  std::println(fmt);
+}
+
+void prln() {
+  std::println();
+}
+
+void prln(auto const& t) {
+  std::println("{}", t);
+}
+
+using ll = long long;
+using ld = long double;
+template <typename T>
+using vec = std::vector<T>;
+
+#define ff first
+#define ss second
+#define eb emplace_back
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+//  }}}
+
+void solve() {
+  
+}
+
+// {{{
+int main() {
+  cin.tie(nullptr)->sync_with_stdio(false);
+
+  int t = 1;
+  cin >> t;
+
+  while (t--) {
+    solve();
+  }
+
+  return 0;
+}
+// }}}