feat(codeforces): more div. 3 as

This commit is contained in:
Barrett Ruth 2025-12-02 23:51:33 -05:00
parent c565027c13
commit cdf73b9909
136 changed files with 1155 additions and 1 deletions

5
1027/.clang-format Normal file
View file

@ -0,0 +1,5 @@
BasedOnStyle: Google
IndentWidth: 4
ColumnLimit: 100
BreakBeforeBraces: Allman
PointerAlignment: Left

71
1027/2114a.cc Normal file
View file

@ -0,0 +1,71 @@
#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;
u32 root = sqrt(n);
while (root * root < n) {
++root;
}
if (root * root == n) {
println("{} 0", root);
} else {
println("-1");
}
}
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;
}
// }}}

6
1027/io/2114a.1.cpin Normal file
View file

@ -0,0 +1,6 @@
5
0001
1001
1000
4900
2025

5
1027/io/2114a.1.cpout Normal file
View file

@ -0,0 +1,5 @@
0 1
-1
-1
34 36
20 25

13
1027/io/2114b.1.cpin Normal file
View file

@ -0,0 +1,13 @@
6
6 2
000000
2 1
01
4 1
1011
10 2
1101011001
10 1
1101011001
2 1
11

6
1027/io/2114b.1.cpout Normal file
View file

@ -0,0 +1,6 @@
NO
NO
YES
NO
YES
YES

13
1027/io/2114c.1.cpin Normal file
View file

@ -0,0 +1,13 @@
6
6
1 2 3 4 5 6
3
1 2 3
4
1 2 2 4
1
2
3
1 4 8
2
1 1

6
1027/io/2114c.1.cpout Normal file
View file

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

33
1027/io/2114d.1.cpin Normal file
View file

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

7
1027/io/2114d.1.cpout Normal file
View file

@ -0,0 +1,7 @@
3
32
1000000000000000000
1
6
4
8

14
1027/io/2114e.1.cpin Normal file
View file

@ -0,0 +1,14 @@
2
5
4 5 2 6 7
1 2
3 2
4 3
5 1
6
1000000000 500500500 900900900 9 404 800800800
3 4
5 1
2 5
1 6
6 4

2
1027/io/2114e.1.cpout Normal file
View file

@ -0,0 +1,2 @@
4 5 2 9 7
1000000000 1500500096 1701701691 199199209 404 800800800

9
1027/io/2114f.1.cpin Normal file
View file

@ -0,0 +1,9 @@
8
4 6 3
4 5 3
4 6 2
10 45 3
780 23 42
11 270 23
1 982800 13
1 6 2

8
1027/io/2114f.1.cpout Normal file
View file

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

17
1027/io/2114g.1.cpin Normal file
View file

@ -0,0 +1,17 @@
8
3 3
2 1 4
3 7
2 1 4
2 15
2 16
3 10
256 32 1
3 289
768 96 1
3 290
768 96 1
5 7
5 1 6 3 10
4 6
6 8 5 10

8
1027/io/2114g.1.cpout Normal file
View file

@ -0,0 +1,8 @@
YES
NO
YES
YES
YES
NO
YES
YES

View file

@ -74,7 +74,6 @@ void solve() {
++since; ++since;
if (since > x && door == 1) if (since > x && door == 1)
ok = false; ok = false;
-std=c++23
} }
if (ok) { if (ok) {

View file

@ -0,0 +1,5 @@
BasedOnStyle: Google
IndentWidth: 4
ColumnLimit: 100
BreakBeforeBraces: Allman
PointerAlignment: Left

70
codeforces/1042/2131a.cc Normal file
View file

@ -0,0 +1,70 @@
#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;
u32 ans = 0;
vector<i32> a(n), b(n);
for (auto& e : a) cin >> e;
for (auto& e : b) cin >> e;
for (u32 i = 0; i < n; ++i) {
ans += max(0, a[i] - b[i]);
}
println("{}", ans + 1);
}
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,13 @@
4
2
7 3
5 6
3
3 1 4
3 1 4
1
10
1
6
1 1 4 5 1 4
1 9 1 9 8 1

View file

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

View file

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

View file

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

View file

@ -0,0 +1,16 @@
5
1 3
1
2
1 8
4
12
3 5
6 2 9
8 4 11
2 7
2 8
2 9
3 2
0 1 0
1 0 1

View file

@ -0,0 +1,5 @@
YES
YES
YES
NO
NO

View file

@ -0,0 +1,22 @@
4
4
1 2
1 3
2 4
2
2 1
4
1 2
2 3
2 4
11
1 2
1 3
2 4
3 5
3 8
5 6
5 7
7 9
7 10
5 11

View file

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

View file

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

View file

@ -0,0 +1,7 @@
YES
NO
NO
NO
YES
NO
NO

View file

@ -0,0 +1,10 @@
3
2
11
00
2
01
01
4
1010
1101

View file

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

View file

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

View file

@ -0,0 +1,4 @@
3
24
118143737
576

View file

@ -0,0 +1,11 @@
5
4 15
4 7 9 15
4 10
1 2 4 8
5 15
6 10 11 12 15
5 15
6 10 11 14 15
6 10000
30 238 627 1001 1495 7429

View file

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

79
codeforces/1043/2132a.cc Normal file
View file

@ -0,0 +1,79 @@
#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, m;
string a, b, c;
cin >> n;
cin >> a;
cin >> m;
cin >> b >> c;
for (u32 i = m; i >= 1; --i) {
if (c[i - 1] == 'V') {
print("{}", b[i - 1]);
}
}
print("{}", a);
for (u32 i = 0; i < m; ++i) {
if (c[i] == 'D') {
print("{}", b[i]);
}
}
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,21 @@
4
2
ot
2
ad
DV
3
efo
7
rdcoecs
DVDVDVD
3
aca
4
bbaa
DVDV
3
biz
4
abon
VVDD

View file

@ -0,0 +1,4 @@
dota
codeforces
abacaba
babizon

View file

@ -0,0 +1,6 @@
5
1111
12
55
999999999999999999
1000000000000000000

View file

@ -0,0 +1,8 @@
2
11 101
0
1
5
3
999999999 999000999000999 90909090909090909
0

View file

@ -0,0 +1,8 @@
7
1
3
8
2
10
20
260010000

View file

@ -0,0 +1,7 @@
3
10
26
6
36
72
2250964728

View file

@ -0,0 +1,9 @@
8
1 1
3 3
8 3
2 4
10 10
20 14
3 2
9 1

View file

@ -0,0 +1,8 @@
3
9
-1
6
30
63
10
33

View file

@ -0,0 +1,7 @@
6
5
10
13
29
1000000000
1000000000000000

View file

@ -0,0 +1,6 @@
15
46
48
100
4366712386
4441049382716054

View file

@ -0,0 +1,27 @@
4
3 4 5
10 20 30
1 2 3 4
0 0 0
3 4 7
3 4 4
1 4 4
2 2 4
5 5 2
500000000 300000000 100000000 900000000 700000000
800000000 400000000 1000000000 600000000 200000000
1 4 3
5 2 6
4 4 1
100 100 20 20
100 100 20 20
4 4 5
3 3 6
2 363 711
286 121 102
1 1 1
3 1 1
1 2 0
1 3 2
0 1 0
3 3 3

View file

@ -0,0 +1,14 @@
0
70
64
39
57
2700000000
4200000000
420
711
711
0
997
0
1360

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1,21 @@
6
2 3
hey
hey
3 3
abc
def
ghi
3 2
af
fa
te
1 1
x
3 3
uoe
vbe
mbu
2 3
hyh
kop

View file

@ -0,0 +1,6 @@
4
16
2
0
11
3

View file

@ -0,0 +1,5 @@
BasedOnStyle: Google
IndentWidth: 4
ColumnLimit: 100
BreakBeforeBraces: Allman
PointerAlignment: Left

64
codeforces/1047/2137a.cc Normal file
View file

@ -0,0 +1,64 @@
#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 k, x;
cin >> k >> x;
println("{}", (1ll << k) * x);
}
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,4 @@
3
1 4
1 5
5 4

View file

@ -0,0 +1,3 @@
1
10
21

View file

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

View file

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

View file

@ -0,0 +1,8 @@
7
8 1
1 8
7 7
2 6
9 16
1 6
4 6

View file

@ -0,0 +1,7 @@
-1
6
50
8
74
-1
14

View file

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

View file

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

View file

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

View file

@ -0,0 +1,5 @@
3
1
8
25
0

View file

@ -0,0 +1,19 @@
6
3
5 3 1
4 2 1
5
1 2 3 4 5
1 2 3 4 5
6
7 1 12 10 5 8
9 2 4 3 6 5
1
1
2
6
5 1 2 6 3 4
3 1 6 5 2 4
2
2 2
1 1

View file

@ -0,0 +1,6 @@
5
35
26
0
24
1

View file

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

View file

@ -0,0 +1,8 @@
YES
NO
YES
NO
NO
YES
YES
YES

View file

@ -0,0 +1,5 @@
BasedOnStyle: Google
IndentWidth: 4
ColumnLimit: 100
BreakBeforeBraces: Allman
PointerAlignment: Left

68
codeforces/1059/2162a.cc Normal file
View file

@ -0,0 +1,68 @@
#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;
u32 ans = 0, a;
for (u32 i = 0; i < n; ++i) {
cin >> a;
ans = max(ans, a);
}
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,3 @@
1
4
3 3 3 3

View file

@ -0,0 +1 @@
3

View file

@ -0,0 +1,3 @@
1
5
7 1 6 9 9

View file

@ -0,0 +1 @@
9

View file

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

View file

@ -0,0 +1 @@
4

View file

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

View file

@ -0,0 +1 @@
0

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1,3 @@
1
8
11010011

View file

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

View file

@ -0,0 +1,3 @@
1
6
100101

View file

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

View file

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

View file

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

View file

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

View file

@ -0,0 +1 @@
0

View file

@ -0,0 +1,2 @@
1
292 929

View file

@ -0,0 +1 @@
-1

View file

@ -0,0 +1,2 @@
1
405 400

View file

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

View file

@ -0,0 +1,2 @@
1
998 244

View file

@ -0,0 +1,2 @@
2
25 779

View file

@ -0,0 +1,2 @@
1
244 353

View file

@ -0,0 +1 @@
-1

Some files were not shown because too many files have changed in this diff Show more