more stuff

codeforces/974/h.in

@@ -9,3 +9,4 @@
 1 2
 1 3
 4 5
+

codeforces/974/h.out

@@ -1,6 +1,9 @@
-NO
-NO
-YES
-NO
-NO
-YES
+no
+no
+yes
+no
+no
+yes
+
+[code]: 0
+[time]: 11.7841 ms

cses/increasing-array.cc

@@ -1,65 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T>
-using vec = std::vector<T>;
-template <typename T, size_t N>
-using arr = std::array<T, N>;
-
-#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() {
-  ll ans = 0;
-  int n;
-  cin >> n;
-  ll last = 0;
-  while (n--) {
-    ll x;
-    cin >> x;
-    if (last != 0 && last > x) {
-      ans += last - x;
-      x += last - x;
-    }
-    last = x;
-  }
-  cout << ans << endl;
-}
-
-int main() {  // {{{
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  solve();
-
-  return 0;
-}
-// }}}

cses/increasing-array.in

@@ -1,2 +0,0 @@
-10
-1000000000 1 1 1 1 1 1 1 1 1

cses/increasing-array.out

@@ -1,4 +0,0 @@
-8999999991
-
-[code]: 0
-[time]: 4.4868 ms

cses/increasing-array.txt

@@ -1,5 +0,0 @@
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL

cses/missing-number.cc

@@ -1,65 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T>
-using vec = std::vector<T>;
-template <typename T, size_t N>
-using arr = std::array<T, N>;
-
-#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;
-  vec<bool> seen(n + 1, false);
-  while (--n) {
-    int x;
-    cin >> x;
-    seen[x] = true;
-  }
-  for (int i = 1; i < sz<int>(seen); ++i) {
-    if (!seen[i]) {
-      cout << i << endl;
-      break;
-    }
-  }
-}
-
-int main() {  // {{{
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  solve();
-
-  return 0;
-}
-// }}}

cses/missing-number.in

@@ -1,2 +0,0 @@
-5
-2 3 1 5

cses/missing-number.out

@@ -1,4 +0,0 @@
-4
-
-[code]: 0
-[time]: 3.88908 ms

cses/missing-number.txt

@@ -1,6 +0,0 @@
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL
--std=c++20

cses/number-spiral.cc

@@ -1,62 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T>
-using vec = std::vector<T>;
-template <typename T, size_t N>
-using arr = std::array<T, N>;
-
-#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() {
-  ll x, y;
-  cin >> y >> x;
-  ll base = max(x, y);
-  ll ans = base * base;
-  if (ans & 1)
-    swap(x, y);
-  ans -= x - 1 + base - y;
-  cout << ans << endl;
-}
-
-int main() {  // {{{
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  int t;
-  cin >> t;
-  while (t--)
-    solve();
-
-  return 0;
-}
-// }}}

cses/number-spiral.in

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

cses/number-spiral.out

@@ -1,7 +0,0 @@
-8
-1
-15
-11
-
-[code]: 0
-[time]: 4.26793 ms

cses/number-spiral.txt

@@ -1,5 +0,0 @@
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL

cses/permutations.cc

@@ -1,76 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T>
-using vec = std::vector<T>;
-template <typename T, size_t N>
-using arr = std::array<T, N>;
-
-#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;
-  /*
-     n= 5;
-     1 4 2 5 3
-     1 4 2 5 3 6
-     1 7 2 6 3 5 4
-
-
-     41325
-     */
-
-  if (n == 1) {
-    cout << 1 << endl;
-  } else if (n <= 3) {
-    cout << "NO SOLUTION\n";
-  } else {
-    for (int cur = n & 1 ? n - 1 : n; cur > 4; cur -= 2) {
-      cout << cur << ' ';
-    }
-    cout << "2 4";
-    for (int cur = 1; cur <= n; cur += 2) {
-      cout << ' ' << cur;
-    }
-  }
-}
-
-int main() {  // {{{
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  solve();
-
-  return 0;
-}
-// }}}

cses/permutations.in

@@ -1 +0,0 @@
-1

cses/permutations.out

@@ -1,4 +0,0 @@
-1
-
-[code]: 0
-[time]: 4.06551 ms

cses/permutations.txt

@@ -1,5 +0,0 @@
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL

cses/repetitions.cc

@@ -1,60 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T> using vec = std::vector<T>;
-template <typename T, size_t N> using arr = std::array<T, N>;
-
-#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() {
-  string s;
-  cin >> s;
-
-  ll streak = 0, ans = 0;
-  char last = ' ';
-  for (auto c : s) {
-    if (last == ' ' || last == c) {
-      ++streak;
-      ans = max(ans, streak);
-    } else {
-      streak = 1;
-    }
-    last = c;
-  }
-  cout << ans << endl;
-}
-
-int main() { // {{{
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  solve();
-
-  return 0;
-}
-// }}}

cses/repetitions.in

@@ -1 +0,0 @@
-ABCDEF

cses/repetitions.out

@@ -1,4 +0,0 @@
-1
-
-[code]: 0
-[time]: 4.20523 ms

cses/repetitions.txt

@@ -1,5 +0,0 @@
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL

cses/script.bash

@@ -1,11 +0,0 @@
-#!/bin/bash
-
-for dir in */; do
-    dir_name="${dir%/}" # Remove trailing slash
-    
-    for file in "$dir"*.*; do
-        ext="${file##*.}"  # Extract extension
-        mv "$file" "./${dir_name}.$ext"
-    done
-
-done

cses/weird-algorithm.cc

@@ -1,64 +0,0 @@
-#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());
-}
-
-using ll = long long;
-using ld = long double;
-template <typename T>
-using vec = std::vector<T>;
-template <typename T, size_t N>
-using arr = std::array<T, N>;
-
-#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() {
-  ll n;
-  cin >> n;
-
-  while (n != 1) {
-    cout << n << ' ';
-    if (n & 1) {
-      n = n * 3 + 1;
-    } else {
-      n /= 2;
-    }
-  }
-  cout << 1 << endl;
-}
-
-// {{{
-int main() {
-  cin.tie(nullptr)->sync_with_stdio(false);
-
-  solve();
-
-  return 0;
-}
-// }}}

cses/weird-algorithm.in

@@ -1 +0,0 @@
-3

cses/weird-algorithm.out

@@ -1,4 +0,0 @@
-3 10 5 16 8 4 2 1
-
-[code]: 0
-[time]: 11.0214 ms

cses/weird-algorithm.txt

@@ -1,6 +0,0 @@
--std=c++23
--Wall
--Wextra
--Wpedantic
--Wshadow
--DLOCAL