value_type = std::uint64_t;
24std::vector<value_type> known{1, 1};
26value_type compute_next() {
27 returnstd::transform_reduce(known.begin(), known.end(), known.rbegin(),
28 static_cast<value_type
>(0), std::plus<>(),
32 voidadd() { known.push_back(this->compute_next()); }
39value_type
get(std::size_t n) {
40 while(known.size() <= n) {
47voidtest_catalan_numbers_up_to_20() {
50assert(cn.
get(0) == 1ULL);
51assert(cn.
get(1) == 1ULL);
52assert(cn.
get(2) == 2ULL);
53assert(cn.
get(3) == 5ULL);
54assert(cn.
get(4) == 14ULL);
55assert(cn.
get(5) == 42ULL);
56assert(cn.
get(6) == 132ULL);
57assert(cn.
get(7) == 429ULL);
58assert(cn.
get(8) == 1430ULL);
59assert(cn.
get(9) == 4862ULL);
60assert(cn.
get(10) == 16796ULL);
61assert(cn.
get(11) == 58786ULL);
62assert(cn.
get(12) == 208012ULL);
63assert(cn.
get(13) == 742900ULL);
64assert(cn.
get(14) == 2674440ULL);
65assert(cn.
get(15) == 9694845ULL);
66assert(cn.
get(16) == 35357670ULL);
67assert(cn.
get(17) == 129644790ULL);
68assert(cn.
get(18) == 477638700ULL);
69assert(cn.
get(19) == 1767263190ULL);
70assert(cn.
get(20) == 6564120420ULL);
73voidtest_catalan_numbers_25() {
76assert(cn.
get(25) == 4861946401452ULL);
80test_catalan_numbers_up_to_20();
81test_catalan_numbers_25();
computes and caches Catalan numbers
value_type get(std::size_t n)
computes the n-th Catalan number and updates the cache.
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4