rename calc_binom() to binom()

4 files changed, 4 insertions, 4 deletions

diff --git a/content/math/binomial0.cpp b/content/math/binomial0.cpp
index f37aea5..8b436a2 100644
--- a/content/math/binomial0.cpp
+++ b/content/math/binomial0.cpp
@@ -8,7 +8,7 @@ void precalc() {
 	for (int i = lim - 1; i > 0; i--) inv[i-1] = inv[i] * i % mod;
 }
 
-ll calc_binom(ll n, ll k) {
+ll binom(ll n, ll k) {
 	if (n < 0 || n < k || k < 0) return 0;
 	return (fac[n] * inv[n-k] % mod) * inv[k] % mod;
 }
diff --git a/content/math/binomial1.cpp b/content/math/binomial1.cpp
index d0fce18..34f13ed 100644
--- a/content/math/binomial1.cpp
+++ b/content/math/binomial1.cpp
@@ -1,4 +1,4 @@
-ll calc_binom(ll n, ll k) {
+ll binom(ll n, ll k) {
 	if (k > n) return 0;
 	ll r = 1;
 	for (ll d = 1; d <= k; d++) { // Reihenfolge => Teilbarkeit
diff --git a/content/math/binomial2.cpp b/content/math/binomial2.cpp
index 4531505..bb6a035 100644
--- a/content/math/binomial2.cpp
+++ b/content/math/binomial2.cpp
@@ -20,7 +20,7 @@ ll binomPPow(ll n, ll k, ll p) {
 	return res;
 }
 
-ll calc_binom(ll n, ll k) {
+ll binom(ll n, ll k) {
 	if (k > n) return 0;
 	ll res = 1;
 	k = min(k, n - k);
diff --git a/content/math/binomial3.cpp b/content/math/binomial3.cpp
index 7a6ab4e..8a51dac 100644
--- a/content/math/binomial3.cpp
+++ b/content/math/binomial3.cpp
@@ -1,4 +1,4 @@
-ll calc_binom(ll n, ll k, ll p) {
+ll binom(ll n, ll k, ll p) {
 	assert(n < p); //wichtig: sonst falsch!
 	if (k > n) return 0;
 	ll x = k % 2 != 0 ? p-1 : 1;