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
144
145
146
147
148
149
150
151
152
153
|
#include "../util.h"
#include <math/shortModInv.cpp>
constexpr ll mod = 1'394'633'899;
#include <math/polynomial.cpp>
poly randomPoly(int deg) {
poly p;
p.data = Random::integers<ll>(deg + 1, 0, mod);
return p;
}
ll eval(const vector<ll>& p, ll x) {
ll res = 0;
for (ll i = 0, j = 1; i < ssize(p); i++, j = (j * x) % mod) {
res += j * p[i];
res %= mod;
}
return res;
}
void test_eval() {
int queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int deg = Random::integer<int>(1, 30);
vector<ll> tmp = Random::integers<ll>(deg + 1, 0, mod);
poly p(deg);
for (int i = 0; i <= deg; i++) p[i] = tmp[i];
for (int i = 0; i <= deg + 7; i++) {
ll x = Random::integer<ll>(0, mod);
ll got = p(x);
ll expected = eval(tmp, x);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
queries += deg + 1;
}
cerr << "tested eval: " << queries << endl;
}
void test_add() {
int queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int n = Random::integer<int>(1, 30);
int m = Random::integer<int>(1, 30);
auto a = randomPoly(n);
auto b = randomPoly(m);
auto c = a;
c += b;
if (ssize(c) > ssize(a) && ssize(c) > ssize(b)) cerr << "error: wrong degree" << FAIL;
for (int i = 0; i <= n + m + 7; i++) {
ll x = Random::integer<ll>(0, mod);
ll got = c(x);
ll expected = (a(x) + b(x)) % mod;
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
queries += n + m;
}
cerr << "tested add: " << queries << endl;
}
void test_mul() {
int queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int n = Random::integer<int>(1, 30);
int m = Random::integer<int>(1, 30);
auto a = randomPoly(n);
auto b = randomPoly(m);
auto c = a * b;
if (ssize(c) > ssize(a) + ssize(b) - 1) cerr << "error: wrong degree" << FAIL;
for (int i = 0; i <= n + m + 7; i++) {
ll x = Random::integer<ll>(0, mod);
ll got = c(x);
ll expected = (a(x) * b(x)) % mod;
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
queries += n + m;
}
cerr << "tested mul: " << queries << endl;
}
void test_shift() {
int queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int n = Random::integer<int>(1, 30);
int m = Random::integer<int>(1, 30);
auto a = randomPoly(n);
auto b = a << m;
if (ssize(b) > ssize(a)) cerr << ssize(a) << " " << ssize(b) << endl;
if (ssize(b) > ssize(a)) cerr << "error: wrong degree" << FAIL;
for (int i = 0; i <= n + 7; i++) {
ll x = Random::integer<ll>(0, mod);
ll got = b(x);
ll expected = a((x + m) % mod);
if (got != expected) {
for (ll y : b.data) cerr << y << " ";
cerr << endl;
}
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
queries += n;
}
cerr << "tested shift: " << queries << endl;
}
void test_divmod() {
int queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int n = Random::integer<int>(1, 30);
int m = Random::integer<int>(1, 30);
auto a = randomPoly(n);
auto b = randomPoly(m);
auto [div, rem] = a.divmod(b);
if (ssize(rem) > ssize(b)) cerr << "error: wrong degree (rem)" << FAIL;
if (ssize(div) > 1 + max<ll>(0, ssize(a) - ssize(b))) cerr << "error: wrong degree (div)" << FAIL;
for (int i = 0; i <= n + m; i++) {
ll x = Random::integer<ll>(0, mod);
ll d = multInv(b(x), mod);
ll got = (div(x) + rem(x) * d) % mod;
ll expected = (a(x) * d) % mod;
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
queries += n + m;
}
cerr << "tested divmod: " << queries << endl;
}
int main() {
test_eval();
test_add();
test_mul();
test_shift();
test_divmod();
}
|
