update

codeforces/826/1741c.cc

@@ -1,90 +0,0 @@
-#include <bits/stdc++.h> // {{{
-
-#include <version>
-#ifdef __cpp_lib_ranges_enumerate
-#include <ranges>
-namespace rv = std::views;
-namespace rs = std::ranges;
-#endif
-
-#pragma GCC optimize("O2,unroll-loops")
-#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
-
-using namespace std;
-
-using i16 = int16_t;
-using u16 = uint16_t;
-using i32 = int32_t;
-using u32 = uint32_t;
-using i64 = int64_t;
-using u64 = uint64_t;
-using f64 = double;
-using f128 = long double;
-
-#if __cplusplus >= 202002L
-template <typename T> constexpr T MIN = std::numeric_limits<T>::min();
-
-template <typename T> constexpr T MAX = std::numeric_limits<T>::max();
-#endif
-
-#ifdef LOCAL
-#define db(...) std::print(__VA_ARGS__)
-#define dbln(...) std::println(__VA_ARGS__)
-#else
-#define db(...)
-#define dbln(...)
-#endif
-//  }}}
-
-void solve() {
-  u32 n;
-  cin >> n;
-  vector<u32> a(n);
-  for (u32 i = 0; i < n; ++i) {
-    cin >> a[i];
-  }
-
-  u32 ans = n;
-  u64 target = 0;
-
-  for (u32 i = 1; i <= n; ++i) {
-    target += a[i - 1];
-    u32 big_block = i;
-    u32 curlen = 0;
-    u64 total = 0;
-    for (u32 j = i + 1; j <= n; ++j) {
-      total += a[j - 1];
-      ++curlen;
-      if (total == target) {
-        big_block = max(big_block, curlen);
-        total = 0;
-        curlen = 0;
-      } else if (total > target) {
-        break;
-      }
-    }
-
-    if (total == 0)
-      ans = min(ans, big_block);
-  }
-
-  cout << ans << '\n';
-}
-
-int main() { // {{{
-  std::cin.exceptions(std::cin.failbit);
-#ifdef LOCAL
-  std::cerr.rdbuf(std::cout.rdbuf());
-  std::cout.setf(std::ios::unitbuf);
-  std::cerr.setf(std::ios::unitbuf);
-#else
-  std::cin.tie(nullptr)->sync_with_stdio(false);
-#endif
-  u32 tc = 1;
-  std::cin >> tc;
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
-  return 0;
-}
-// }}}