test/math/binomial0.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

#include "../util.h"
#include <math/extendedEuclid.cpp>
#include <math/multInv.cpp>
constexpr ll mod = 1'394'633'899;
#include <math/binomial0.cpp>

void stress_test() {
	vector<ll> last = {1};
	ll queries = 0;
	for (ll i = 0; i < 10'000; i++) {
		for (ll j = 0; j <= i; j++) {
			ll got = binom(i, j);
			ll expected = last[j];
			if (got != expected) cerr << "binom(" << i << ", " << j << "), got: " << got << ", expected: " << expected << FAIL;
		}
		queries += ssize(last);

		last.push_back(1);
		for (ll j = i; j > 0; j--) {
			last[j] = (last[j] + last[j - 1]) % mod;
		}
	}
	cerr << "tested queries: " << queries << endl;
}

int main() {
	precalc();
	stress_test();
}