nit

Author: lrvideckis

library/math/n_choose_k/grow.hpp

@@ -5,9 +5,8 @@ struct comb {
 };
 vector<comb> t(2);
 void grow(int n) {
-  while (sz(t) <= n) {
-    ll i = sz(t),
-       inv = mod - (mod / i) * t[mod % i].inv % mod;
+  rep(i, sz(t), n + 1) {
+    ll inv = mod - (mod / i) * t[mod % i].inv % mod;
     t.push_back({inv, i * t[i - 1].fact % mod,
       inv * t[i - 1].inv_fact % mod});
   }