more contests

This commit is contained in:
Barrett Ruth 2025-12-13 18:27:59 -06:00
parent e371dd60e7
commit 5dac8c409f
284 changed files with 1076 additions and 0 deletions

View file

@ -0,0 +1,4 @@
BasedOnStyle: Google
IndentWidth: 2
ColumnLimit: 100
PointerAlignment: Left

73
codeforces/555/a.cc Normal file
View file

@ -0,0 +1,73 @@
#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() {
u64 n;
cin >> n;
u64 ans = 0;
set<u32> seen;
do {
++ans;
seen.insert(n);
++n;
while (n % 10 == 0) {
n /= 10;
}
} while (!seen.contains(n));
println("{}", ans);
}
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 @@
1098

View file

@ -0,0 +1 @@
20

View file

@ -0,0 +1 @@
10

View file

@ -0,0 +1 @@
19

View file

@ -0,0 +1,3 @@
4
1337
1 2 5 4 6 6 3 1 9

View file

@ -0,0 +1 @@
1557

View file

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

View file

@ -0,0 +1 @@
99999

View file

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

View file

@ -0,0 +1 @@
33

View file

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

View file

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

View file

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

View file

@ -0,0 +1,2 @@
7
LRLRLLL

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1,2 @@
6
LRLRRR

View file

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

View file

@ -0,0 +1,2 @@
1
R

View file

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

View file

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

View file

@ -0,0 +1 @@
26 6

View file

@ -0,0 +1,2 @@
YES
1 2 4 5 6 8

View file

@ -0,0 +1 @@
8 3

View file

@ -0,0 +1 @@
NO

View file

@ -0,0 +1 @@
1 1

View file

@ -0,0 +1,2 @@
YES
1

View file

@ -0,0 +1 @@
9 4

View file

@ -0,0 +1 @@
NO

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1,3 @@
YES
00
10

View file

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

View file

@ -0,0 +1,3 @@
YES
010
0000

View file

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

View file

@ -0,0 +1 @@
NO

View file

@ -0,0 +1 @@
1098

View file

@ -0,0 +1 @@
20

View file

@ -0,0 +1 @@
10

View file

@ -0,0 +1 @@
19

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1 @@
1