MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / test

Function test

code/mathematics/primepi.test.cpp:1–28  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1void test() {
2 unordered_map<ll,ll> res;
3
4 ll n = 10000000000LL;
5 res = primepi(n);
6 assert_equal(455052511LL, res[n]);
7 assert_equal(50847534LL, res[n/10]);
8 assert_equal(5761455LL, res[n/100]);
9 assert_equal(1229LL, res[10000]);
10 assert_equal(4LL, res[10]);
11 assert_equal(0LL, res[1]);
12
13 n = 12397441;
14 res = primepi(n);
15 assert_equal(812443LL, res[n]);
16 assert_equal(425565LL, res[n/2]);
17 assert_equal(291869LL, res[n/3]);
18 assert_equal(1147LL, res[n/1337]);
19
20 // ll n = 1000000000;
21 // res = primepi(n);
22 // assert_equal(24739512092254535LL, res[n]);
23 // assert_equal(279209790387276LL, res[n/10]);
24 // assert_equal(3203324994356LL, res[n/100]);
25 // assert_equal(5736396LL, res[10000]);
26 // assert_equal(17LL, res[10]);
27 // assert_equal(0LL, res[1]);
28}
29// vim: cc=60 ts=2 sts=2 sw=2:

Callers

nothing calls this directly

Calls 2

primepiFunction · 0.85
assert_equalFunction · 0.50

Tested by

no test coverage detected