summaryrefslogtreecommitdiff
path: root/test/math/divSum.cpp
blob: a366e539383fc9e75b8fb984c95a6700b60d8db9 (plain)
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
#include "../util.h"
#include <math/divSum.cpp>

ll naive(ll n, ll m, ll a, ll b){
	ll ans = 0;
	for(ll i = 0; i < n; i++){
		ans += (a*i+b)/m;
	}
	return ans;
}

void stress_test() {
	ll queries = 0;
	for (ll i = 0; i < 10'000; i++) {
		int n = Random::integer<int>(1, 100);
		int m = Random::integer<int>(1, 100);
		int a = Random::integer<int>(0, 100);
		int b = Random::integer<int>(0, 100);
		ll expected = naive(n, m, a, b);
		ll got = divSum(n, m, a, b);
		if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
		queries++;
	}
	cerr << "tested queries: " << queries << endl;
}

constexpr int N = 1'000'000;
void performance_test() {
	timer t;
	hash_t hash = 0;
	for (int operations = 0; operations < N; operations++) {
		ll n = Random::integer<ll>(1, 1'000'000'000);
		ll m = Random::integer<ll>(1, 1'000'000'000);
		ll a = Random::integer<ll>(0, 1'000'000'000);
		ll b = Random::integer<ll>(0, 1'000'000'000);
		t.start();
		hash += divSum(n, m, a, b);
		t.stop();
	}
	if (t.time > 750) cerr << "too slow: " << t.time << FAIL;
	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}

int main() {
	stress_test();
	if (!sanitize) performance_test();
}