/
fused_operations.test.cpp
143 lines (121 loc) · 5.5 KB
/
fused_operations.test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0000"
#include <cassert>
#include <climits>
#include <limits>
#include <random>
#include <type_traits>
#include "utility/macro/assert_eq.cpp"
#include "integer/fused_operations.cpp"
#include "test/mini/qq.cpp"
// test_mul_add();
// test_mul_min();
// test_add_mod();
// test_mul_mod();
std::mt19937_64 rng;
template <typename Tp>
static constexpr Tp min_v = std::numeric_limits<Tp>::min();
template <typename Tp>
static constexpr Tp max_v = std::numeric_limits<Tp>::max();
template <typename Tp>
int test_add_mod(int rep) {
using large_type = typename std::conditional<std::is_signed_v<Tp>, __int128, unsigned __int128>::type;
std::uniform_int_distribution<Tp> u(min_v<Tp>, max_v<Tp>);
int neg = 0, pos = 0;
for (int i = 0; i < rep; ++i) {
Tp x = u(rng);
Tp y = u(rng);
Tp z = u(rng);
if (z == 0) continue;
Tp w = (large_type(x) + large_type(y)) % large_type(z);
if (w != 0 && ((w < 0) != (z < 0))) w += z;
std::cerr << __PRETTY_FUNCTION__ << '\n';
std::cerr << "fused_add_mod(" << x << ", " << y << ", " << z << "): " << w << '\n';
assert_eq(fused_add_mod(x, y, z), w);
++((y < 0)? neg: pos);
}
assert(pos > 0 && (std::is_unsigned_v<Tp> || neg > 0));
return neg + pos;
}
void test_add_mod() {
fprintf(stderr, "%d tests passed.\n", test_add_mod<signed int>(10000));
fprintf(stderr, "%d tests passed.\n", test_add_mod<unsigned int>(10000));
fprintf(stderr, "%d tests passed.\n", test_add_mod<signed long>(10000));
fprintf(stderr, "%d tests passed.\n", test_add_mod<unsigned long>(10000));
}
template <typename Tp>
int test_mul_mod(int rep) {
using large_type = typename std::conditional<std::is_signed_v<Tp>, __int128, unsigned __int128>::type;
std::uniform_int_distribution<Tp> u(min_v<Tp>, max_v<Tp>);
int neg = 0, pos = 0;
for (int i = 0; i < rep; ++i) {
Tp x = u(rng);
Tp y = u(rng);
Tp z = u(rng);
if (z == 0) continue;
Tp w = (large_type(x) * large_type(y)) % large_type(z);
if (w != 0 && ((w < 0) != (z < 0))) w += z;
std::cerr << __PRETTY_FUNCTION__ << '\n';
std::cerr << "fused_mul_mod(" << x << ", " << y << ", " << z << "): " << w << '\n';
assert_eq(fused_mul_mod(x, y, z), w);
++((y < 0)? neg: pos);
}
assert(pos > 0 && (std::is_unsigned_v<Tp> || neg > 0));
return neg + pos;
}
void test_mul_mod() {
fprintf(stderr, "%d tests passed.\n", test_mul_mod<signed int>(10000));
fprintf(stderr, "%d tests passed.\n", test_mul_mod<unsigned int>(10000));
fprintf(stderr, "%d tests passed.\n", test_mul_mod<signed long>(10000));
fprintf(stderr, "%d tests passed.\n", test_mul_mod<unsigned long>(10000));
}
int main() {
assert_eq(fused_mul_add(65536, 32768, -1), 2147483647);
assert_eq(fused_add_mod(1000, 1000, 900), 200);
assert_eq(fused_add_mod(2000000000, 2000000000, 2100000000), 1900000000);
assert_eq(fused_mul_mod(1000000, 1000000, 998244353), 757402647);
assert_eq(fused_mul_add(65536u, 32768u, -1u), 2147483647u);
assert_eq(fused_add_mod(1000u, 1000u, 900u), 200u);
assert_eq(fused_add_mod(2000000000u, 2000000000u, 2100000000u), 1900000000u);
assert_eq(fused_mul_mod(1000000u, 1000000u, 998244353u), 757402647u);
assert_eq(fused_add_mod(1, 3, -3), -2);
assert_eq(fused_add_mod(1, -3, 3), 1);
assert_eq(fused_mul_mod(+1000000000, +1000000000, +1000000007), 49);
assert_eq(fused_mul_mod(+1000000000, +1000000000, -1000000007), -999999958);
assert_eq(fused_mul_mod(+1000000000, -1000000000, +1000000007), 999999958);
assert_eq(fused_mul_mod(+1000000000, -1000000000, -1000000007), -49);
assert_eq(fused_mul_mod(-1000000000, +1000000000, +1000000007), 999999958);
assert_eq(fused_mul_mod(-1000000000, +1000000000, -1000000007), -49);
assert_eq(fused_mul_mod(-1000000000, -1000000000, +1000000007), 49);
assert_eq(fused_mul_mod(-1000000000, -1000000000, -1000000007), -999999958);
assert_eq(fused_mul_mod(+1000000000u, +1000000000u, +1000000007u), 49u);
assert_eq(fused_mul_mod(+1000000000u, +1000000000u, -1000000007u), 1609396939u);
assert_eq(fused_mul_mod(+1000000000u, -1000000000u, +1000000007u), 935229096u);
assert_eq(fused_mul_mod(+1000000000u, -1000000000u, -1000000007u), 410065422u);
assert_eq(fused_mul_mod(-1000000000u, +1000000000u, +1000000007u), 935229096u);
assert_eq(fused_mul_mod(-1000000000u, +1000000000u, -1000000007u), 410065422u);
assert_eq(fused_mul_mod(-1000000000u, -1000000000u, +1000000007u), 711885781u);
assert_eq(fused_mul_mod(-1000000000u, -1000000000u, -1000000007u), 49u);
assert_eq(fused_add_mod(2, 3, +5), 0);
assert_eq(fused_add_mod(2, 3, -5), 0);
assert_eq(fused_mul_mod(+3, +4, +2), 0);
assert_eq(fused_mul_mod(+3, +4, -2), 0);
assert_eq(fused_mul_mod(+3, -4, +2), 0);
assert_eq(fused_mul_mod(+3, -4, -2), 0);
assert_eq(fused_mul_mod(-3, +4, +2), 0);
assert_eq(fused_mul_mod(-3, +4, -2), 0);
assert_eq(fused_mul_mod(-3, -4, +2), 0);
assert_eq(fused_mul_mod(-3, -4, -2), 0);
assert_eq(fused_mul_mod(INT_MIN, -1, -1), 0);
assert_eq(fused_mul_mod(INT_MIN, +1, -1), 0);
assert_eq(fused_mul_mod(INT_MIN, -1, +1), 0);
assert_eq(fused_mul_mod(INT_MIN, +1, +1), 0);
assert_eq(fused_mul_min(1000000000, 1000000000, 2000000000), 2000000000);
assert_eq(fused_mul_min(1000, 1000, 2000000000), 1000000);
assert_eq(fused_mul_min(100, -100, 0), -10000);
assert_eq(fused_mul_min(-100, -100, 0), 0);
assert_eq(fused_mul_mod(1000000000000000000L, 1000000000000000000L, 2305843009213693951L),
1824060670036424877L);
test_add_mod();
test_mul_mod();
qq(); // dummy
}