codeforces rounds

codeforces/1049/2140a.cc

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void solve() {
+  std::cout << "ho\n";
+}
+
+int main() {
+  std::cin.tie(nullptr)->sync_with_stdio(false);
+
+  int tc = 1;
+  std::cin >> tc;
+
+  for (int t = 0; t < tc; ++t) {
+    solve();
+  }
+
+  return 0;
+}

codeforces/1049/2140b.cc

@@ -0,0 +1,83 @@
+#include <bits/stdc++.h> // {{{
+
+#include <version>
+#ifdef __cpp_lib_ranges_enumerate
+#include <ranges>
+namespace rv = std::views;
+namespace rs = std::ranges;
+#endif
+
+// https://codeforces.com/blog/entry/96344
+
+#pragma GCC optimize("O2,unroll-loops")
+#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
+
+using namespace std;
+
+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();
+
+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());
+}
+#endif
+
+static void NO() { std::cout << "NO\n"; }
+
+static void YES() { std::cout << "YES\n"; }
+
+template <typename T> using vec = std::vector<T>;
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define ff first
+#define ss second
+
+#ifdef LOCAL
+#define db(...) std::print(__VA_ARGS__)
+#define dbln(...) std::println(__VA_ARGS__)
+#else
+#define db(...)
+#define dbln(...)
+#endif
+//  }}}
+
+void solve() {
+  int x;
+  cout << x << '\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;
+}
+// }}}

codeforces/1049/io/2140a.expected

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

codeforces/1049/io/2140a.in

@@ -0,0 +1,9 @@
+4
+3
+001
+4
+0110
+6
+110100
+6
+101011

codeforces/1049/io/2140a.out

@@ -0,0 +1,9 @@
+ho
+ho
+ho
+ho
+
+[code]: 0
+[time]: 2.76 ms
+[debug]: false
+[matches]: false

codeforces/1049/io/2140b.expected

@@ -0,0 +1,6 @@
+1
+12
+998
+7872
+8190
+174036

codeforces/1049/io/2140b.in

@@ -0,0 +1,7 @@
+6
+8
+42
+1000
+66666
+106344
+9876543

codeforces/1049/io/2140b.out

@@ -0,0 +1,11 @@
+0
+0
+0
+0
+0
+0
+
+[code]: 0
+[time]: 2.49 ms
+[debug]: false
+[matches]: false