fixes

Author: lrvideckis

library/math/count_paths/count_paths_rectangle.hpp

@@ -12,7 +12,7 @@ array<vl, 2> get_right_and_top(vl left, vl bottom) {
   for (vl& res : ret) {
     {
       vl tr(sz(left));
-      rep(i, 0, sz(tr)) tr[i] = C(i + sz(bottom) - 1, i);
+      rep(i, 0, sz(tr)) tr[i] = ch(i + sz(bottom) - 1, i);
       res = conv(left, tr);
       res.resize(sz(left));
     }

tests/library_checker_aizu_tests/math/n_choose_k.test.cpp

@@ -13,16 +13,16 @@ int main() {
   while (num_tests--) {
     int n, k;
     cin >> n >> k;
-    cout << C(n, k) << '\n';
+    cout << ch(n, k) << '\n';
     if (n > 0) {
-      assert(C(-n, k) == 0);
-      assert(C(-n, -k) == 0);
-      assert(C(k, -n) == 0);
-      assert(C(-k, -n) == 0);
+      assert(ch(-n, k) == 0);
+      assert(ch(-n, -k) == 0);
+      assert(ch(k, -n) == 0);
+      assert(ch(-k, -n) == 0);
     }
     if (k > 0) {
-      assert(C(n, -k) == 0);
-      assert(C(-k, n) == 0);
+      assert(ch(n, -k) == 0);
+      assert(ch(-k, n) == 0);
     }
   }
   for (int i = 0; i < sz(t); i++) {