feat: bunch of div3 as

This commit is contained in:
Barrett Ruth 2025-11-30 21:19:11 -05:00
parent a624bf812d
commit c565027c13
459 changed files with 1893 additions and 0 deletions

77
codeforces/496/1005a.cc Normal file
View file

@ -0,0 +1,77 @@
#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];
}
a.push_back(0);
u32 count = 0;
vector<u32> ans;
for (u32 i = 1; i <= n; ++i) {
if (a[i] <= a[i - 1]) {
ans.push_back(a[i - 1]);
}
}
println("{}", ans.size());
for (auto& e : ans) print("{} ", e);
println();
}
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;
}
// }}}

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1,2 @@
test
west

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
codeforces
yes

View file

@ -0,0 +1 @@
9

View file

@ -0,0 +1,2 @@
test
yes

View file

@ -0,0 +1 @@
7

View file

@ -0,0 +1,2 @@
b
ab

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,2 @@
6
4 7 1 5 4 9

View file

@ -0,0 +1 @@
1

View file

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

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
1
16

View file

@ -0,0 +1 @@
1

View file

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

View file

@ -0,0 +1 @@
0

View file

@ -0,0 +1 @@
3121

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1 @@
6

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1 @@
1000000000000000000000000000000000

View file

@ -0,0 +1 @@
33

View file

@ -0,0 +1 @@
201920181

View file

@ -0,0 +1 @@
4

View file

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

View file

@ -0,0 +1 @@
4

View file

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

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,2 @@
15 8
1 15 2 14 3 13 4 8 12 5 11 6 10 7 9

View file

@ -0,0 +1 @@
48

View file

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

View file

@ -0,0 +1 @@
8

View file

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

View file

@ -0,0 +1 @@
6

View file

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

View file

@ -0,0 +1 @@
97

View file

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

View file

@ -0,0 +1,3 @@
2
1110
1011

View file

@ -0,0 +1,7 @@
4 6 3
1 2
2 3
1 4
4 3
2 4
1 3

View file

@ -0,0 +1,2 @@
1
101001

View file

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

View file

@ -0,0 +1,3 @@
2
111100
110110