Problem p02990 (C++)

Buggy submission (status: Runtime Error):
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll nCr(ll n, ll r) {
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}

//-----------------------ここから-----------
ll factorial[201000];
ll invfactorial[201000];

ll extGCD(ll a, ll b, ll &x, ll &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }

  ll d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

ll nCrM(ll n, ll r) {
  ll ret = factorial[n];
  ret *= invfactorial[n - r];
  ret %= MOD;
  ret *= invfactorial[r];
  ret %= MOD;
  return ret;
}
int main(void) {
  ll n, k;
  cin >> n >> k;

  factorial[0] = 1;
  for (int i = 1; i <= n; i++) {
    factorial[i] = (factorial[i - 1] * i) % MOD;
  }
  for (int i = 0; i <= n; i++) {
    ll x, y;
    ll g = extGCD(factorial[i], MOD, x, y);
    while (x < 0)
      x += MOD;
    x %= MOD;
    invfactorial[i] = x;
  }

  for (ll i = 1; i <= k; i++) {
    if (n - k == 0 && i != 1) {
      cout << 0 << endl;
      continue;
    }
    ll ans = 1;
    ans *= nCrM(n - k + 1, i);
    ans %= MOD;
    ans *= nCrM(k - 1, i - 1);
    ans %= MOD;
    cout << ans << endl;
  }
}

Fixed submission:
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll nCr(ll n, ll r) {
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}

//-----------------------ここから-----------
ll factorial[201000];
ll invfactorial[201000];

ll extGCD(ll a, ll b, ll &x, ll &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }

  ll d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

ll nCrM(ll n, ll r) {
  ll ret = factorial[n];
  ret *= invfactorial[n - r];
  ret %= MOD;
  ret *= invfactorial[r];
  ret %= MOD;
  return ret;
}
int main(void) {
  ll n, k;
  cin >> n >> k;

  factorial[0] = 1;
  for (int i = 1; i <= n; i++) {
    factorial[i] = (factorial[i - 1] * i) % MOD;
  }
  for (int i = 0; i <= n; i++) {
    ll x, y;
    ll g = extGCD(factorial[i], MOD, x, y);
    while (x < 0)
      x += MOD;
    x %= MOD;
    invfactorial[i] = x;
  }

  for (ll i = 1; i <= k; i++) {
    if (n - k + 1 < i) {
      cout << 0 << endl;
      continue;
    }
    ll ans = 1;
    ans *= nCrM(n - k + 1, i);
    ans %= MOD;
    ans *= nCrM(k - 1, i - 1);
    ans %= MOD;
    cout << ans << endl;
  }
}