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

View file

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

73
codeforces/515/1066a.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() {
u32 L, v, l, r;
cin >> L >> v >> l >> r;
l = ((l + v - 1) / v) * v;
r = (r / v) * v;
u32 ans = L / v;
if (l <= r) {
ans -= (r - l) / v + 1;
}
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,5 @@
4
10 2 3 7
100 51 51 51
1234 1 100 199
1000000000 1 1 1000000000

View file

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

View file

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

View file

@ -0,0 +1 @@
3

View file

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

View file

@ -0,0 +1 @@
2

View file

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

View file

@ -0,0 +1 @@
-1

View file

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

View file

@ -0,0 +1 @@
3

View file

@ -0,0 +1,9 @@
8
L 1
R 2
R 3
? 2
L 4
? 1
L 5
? 1

View file

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

View file

@ -0,0 +1,11 @@
10
L 100
R 100000
R 123
L 101
? 123
L 10
R 115
? 100
R 110
? 115

View file

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

View file

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

View file

@ -0,0 +1 @@
4

View file

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

View file

@ -0,0 +1 @@
1

View file

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

View file

@ -0,0 +1 @@
5

View file

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

View file

@ -0,0 +1 @@
12

View file

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

View file

@ -0,0 +1 @@
11

View file

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

View file

@ -0,0 +1 @@
15

View file

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

View file

@ -0,0 +1 @@
9