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

69
codeforces/552/a.cc Normal file
View file

@ -0,0 +1,69 @@
#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() {
vector<u32> a(4);
for (auto& e : a) cin >> e;
sort(begin(a), end(a));
u32 c = a[3] - a[2];
u32 b = a[1] - c;
u32 A = a[3] - (b + c);
println("{} {} {}", A, b, c);
}
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;
for (u32 t = 0; t < tc; ++t) {
solve();
}
return 0;
}
// }}}

View file

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

View file

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

View file

@ -0,0 +1 @@
40 40 40 60

View file

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

View file

@ -0,0 +1 @@
201 101 101 200

View file

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

View file

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

View file

@ -0,0 +1 @@
3

View file

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

View file

@ -0,0 +1 @@
3

View file

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

View file

@ -0,0 +1 @@
-1

View file

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

View file

@ -0,0 +1 @@
3

View file

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

View file

@ -0,0 +1 @@
4

View file

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

View file

@ -0,0 +1 @@
7

View file

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

View file

@ -0,0 +1 @@
3

View file

@ -0,0 +1 @@
30 20 10

View file

@ -0,0 +1 @@
39

View file

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

View file

@ -0,0 +1 @@
5

View file

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

View file

@ -0,0 +1 @@
3

View file

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

View file

@ -0,0 +1 @@
11111

View file

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

View file

@ -0,0 +1 @@
22111

View file

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

View file

@ -0,0 +1 @@
1121122

View file

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

View file

@ -0,0 +1 @@
21112

View file

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

View file

@ -0,0 +1 @@
7

View file

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

View file

@ -0,0 +1 @@
17

View file

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

View file

@ -0,0 +1 @@
17

View file

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

View file

@ -0,0 +1 @@
1 2

View file

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

View file

@ -0,0 +1 @@
2 4

View file

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

View file

@ -0,0 +1 @@
1 4