problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
long long mod = 1000000007;
long long mypow(long long x, long long y) {
if (y == 1)
return x;
long long z = mypow(x, y / 2) % mod;
if (y % 2 == 0) {
return (z * z) % mod;
} else {
return ((z * z) % mod * x) % mod;
}
}
long long choose(long long l, long long r) {
long long u = 1, d = 1;
for (int i = l; i > l - r; i--) {
u = (u * i) % mod;
}
for (int i = r; i >= 1; i--) {
d = (d * i) % mod;
}
d = mypow(d, mod - 2);
return (u * d) % mod;
}
long long kaijo(long long x) {
if (x <= 1)
return 1;
return (kaijo(x - 1) * x) % mod;
}
void solve() {
long long n, k, sum = 0;
cin >> n >> k;
vector<long long> ans(k, 0);
for (int i = 0; i <= n - k; i++) {
long long x = choose(k - 1, i), y, z, w, rn = n - k - i, g = i + 2;
/*y = kaijo(rn + g - 1);
z = kaijo(rn);
w = kaijo(g - 1);
z = mypow(z, mod - 2);
w = mypow(w, mod - 2);*/
y = choose(rn + g - 1, rn);
ans[i] = (x * y) % mod;
// ans[i] = (((y * z) % mod * w) % mod * x) % mod;
}
for (int i = 0; i < k; i++) {
cout << ans[i] << endl;
}
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
long long mod = 1000000007;
long long mypow(long long x, long long y) {
if (y == 1)
return x;
long long z = mypow(x, y / 2) % mod;
if (y % 2 == 0) {
return (z * z) % mod;
} else {
return ((z * z) % mod * x) % mod;
}
}
long long choose(long long l, long long r) {
long long u = 1, d = 1;
for (int i = l; i > l - r; i--) {
u = (u * i) % mod;
}
for (int i = r; i >= 1; i--) {
d = (d * i) % mod;
}
d = mypow(d, mod - 2);
return (u * d) % mod;
}
long long kaijo(long long x) {
if (x <= 1)
return 1;
return (kaijo(x - 1) * x) % mod;
}
void solve() {
long long n, k, sum = 0;
cin >> n >> k;
vector<long long> ans(k, 0);
for (int i = 0; i <= min(n - k, k - 1); i++) {
long long x = choose(k - 1, i), y, z, w, rn = n - k - i, g = i + 2;
/*y = kaijo(rn + g - 1);
z = kaijo(rn);
w = kaijo(g - 1);
z = mypow(z, mod - 2);
w = mypow(w, mod - 2);*/
y = choose(rn + g - 1, rn);
ans[i] = (x * y) % mod;
// ans[i] = (((y * z) % mod * w) % mod * x) % mod;
}
for (int i = 0; i < k; i++) {
cout << ans[i] << endl;
}
return;
}
int main() {
solve();
return 0;
}
| replace | 44 | 45 | 44 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
int read() {
int a;
scanf("%lld", &a);
return a;
}
const int mod = 1e9 + 7;
ll inv[200010];
ll fac[200010], fac_inv[200010];
ll C(int n, int k) {
return ((fac[n] * fac_inv[k] % mod) * fac_inv[n - k]) % mod;
}
void comb_init() {
int N = 200005;
inv[1] = 1;
for (int i = 2; i <= N; ++i) {
inv[i] = mod - (mod / i) * inv[mod % i] % mod;
}
fac[0] = fac_inv[0] = 1;
for (int i = 1; i <= N; ++i) {
fac[i] = (fac[i - 1] * i) % mod;
fac_inv[i] = (fac_inv[i - 1] * inv[i]) % mod;
}
}
int N, K;
signed main() {
cin >> N >> K;
comb_init();
int r = N - K, b = K;
for (int i = 1; i <= b; ++i) {
if (r + 1 > i or b - 1 > i - 1)
cout << 0 << endl;
else
cout << C(r + 1, i) * C(b - 1, i - 1) % mod << endl;
}
}
| #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rep1(i, n) for (int i = 1; i <= (int)n; ++i)
#define all(a) begin(a), end(a)
#define fst first
#define scd second
#define PB emplace_back
#define PPB pop_back
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
bool chmin(int &a, int b) { return a > b ? (a = b, true) : false; }
bool chmax(int &a, int b) { return a < b ? (a = b, true) : false; }
int read() {
int a;
scanf("%lld", &a);
return a;
}
const int mod = 1e9 + 7;
ll inv[200010];
ll fac[200010], fac_inv[200010];
ll C(int n, int k) {
return ((fac[n] * fac_inv[k] % mod) * fac_inv[n - k]) % mod;
}
void comb_init() {
int N = 200005;
inv[1] = 1;
for (int i = 2; i <= N; ++i) {
inv[i] = mod - (mod / i) * inv[mod % i] % mod;
}
fac[0] = fac_inv[0] = 1;
for (int i = 1; i <= N; ++i) {
fac[i] = (fac[i - 1] * i) % mod;
fac_inv[i] = (fac_inv[i - 1] * inv[i]) % mod;
}
}
int N, K;
signed main() {
cin >> N >> K;
comb_init();
int r = N - K, b = K;
for (int i = 1; i <= b; ++i) {
if (r + 1 < i or b - 1 < i - 1)
cout << 0 << endl;
else
cout << C(r + 1, i) * C(b - 1, i - 1) % mod << endl;
}
}
| replace | 70 | 71 | 70 | 71 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
Int inv[3000];
Int fact[3000];
Int invfact[3000];
Int comb(Int n, Int r) {
return (fact[n] * (invfact[n - r] * invfact[r] % MOD)) % MOD;
}
int main(void) {
int N, K;
cin >> N >> K;
inv[1] = 1;
fact[0] = fact[1] = 1;
invfact[0] = invfact[1] = 1;
for (int i = 2; i <= N; i++) {
fact[i] = i * fact[i - 1] % MOD;
inv[i] = MOD - (MOD / i) * inv[MOD % i] % MOD;
invfact[i] = invfact[i - 1] * inv[i] % MOD;
}
for (Int i = 1; i <= K; i++) {
Int sum = 0;
sum = comb(N - K + 1, i) * comb(K - 1, i - 1) % MOD;
cout << sum << endl;
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
Int inv[3000];
Int fact[3000];
Int invfact[3000];
Int comb(Int n, Int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fact[n] * (invfact[n - r] * invfact[r] % MOD) % MOD;
}
int main(void) {
int N, K;
cin >> N >> K;
inv[1] = 1;
fact[0] = fact[1] = 1;
invfact[0] = invfact[1] = 1;
for (int i = 2; i <= N; i++) {
fact[i] = i * fact[i - 1] % MOD;
inv[i] = MOD - (MOD / i) * inv[MOD % i] % MOD;
invfact[i] = invfact[i - 1] * inv[i] % MOD;
}
for (Int i = 1; i <= K; i++) {
Int sum = 0;
sum = comb(N - K + 1, i) * comb(K - 1, i - 1) % MOD;
cout << sum << endl;
}
return 0;
}
| replace | 26 | 27 | 26 | 31 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
ll frac[3000];
ll fracinv[3000];
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
void init() {
frac[0] = 1;
fracinv[0] = 1;
FOR(i, 1, 3000) {
frac[i] = (i * frac[i - 1]) % MOD;
fracinv[i] = inv(frac[i], MOD);
}
}
ll comb(ll n, ll k) {
ll tmp = (frac[n] * fracinv[k]) % MOD;
return (tmp * fracinv[n - k]) % MOD;
}
int main() {
init();
ll n, k;
cin >> n >> k;
FOR(i, 1, k + 1) {
ll res = (comb(n - k + 1, i) * comb(k - 1, i - 1)) % MOD;
cout << res << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
constexpr ll MOD = 1000000007;
ll frac[3000];
ll fracinv[3000];
// a^-1 mod p
ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
void init() {
frac[0] = 1;
fracinv[0] = 1;
FOR(i, 1, 3000) {
frac[i] = (i * frac[i - 1]) % MOD;
fracinv[i] = inv(frac[i], MOD);
}
}
ll comb(ll n, ll k) {
ll tmp = (frac[n] * fracinv[k]) % MOD;
return (tmp * fracinv[n - k]) % MOD;
}
int main() {
init();
ll n, k;
cin >> n >> k;
FOR(i, 1, k + 1) {
if (n - k + 1 < i) {
cout << 0 << endl;
continue;
}
ll res = (comb(n - k + 1, i) * comb(k - 1, i - 1)) % MOD;
cout << res << endl;
}
return 0;
}
| insert | 35 | 35 | 35 | 39 | 0 | |
p02990 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
// Combination MOD
const ll MOD = INF + 7;
vector<ll> fac(300000);
vector<ll> fac_inv(300000);
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = fac_inv[a - b] * fac_inv[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
int n, k;
cin >> n >> k;
fac[0] = 1;
fac_inv[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
fac_inv[i + 1] = fac_inv[i] * mpow(i + 1, MOD - 2) % MOD;
}
int l = n - k;
rep(i, k) {
ll res = comb(k - 1, i) % MOD * comb(2 + l + i - 1, l) % MOD;
cout << res << endl;
l--;
}
}
| #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
// Combination MOD
const ll MOD = INF + 7;
vector<ll> fac(300000);
vector<ll> fac_inv(300000);
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = fac_inv[a - b] * fac_inv[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
int n, k;
cin >> n >> k;
fac[0] = 1;
fac_inv[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
fac_inv[i + 1] = fac_inv[i] * mpow(i + 1, MOD - 2) % MOD;
}
int l = n - k;
rep(i, k) {
ll res = comb(k - 1, i) % MOD * comb(2 + l + i - 1, l) % MOD;
cout << res << endl;
l--;
}
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
ll po(ll x, int a) {
if (x == 0)
return 0;
if (a == 0)
return 1;
if (a == 1)
return x;
ll tmp = po(x, a / 2);
if (a % 2 == 0)
return tmp * tmp % mod;
return tmp * tmp % mod * x % mod;
}
ll inv(ll x) { return po(x, (int)mod - 2); }
ll beki[2010];
ll cb(int a, int b) {
return beki[a] * inv(beki[b]) % mod * inv(beki[a - b]) % mod;
}
int main() {
int n, k;
cin >> n >> k;
beki[0] = 1;
rep(i, n) beki[i + 1] = beki[i] * (i + 1) % mod;
rep(j, k) {
int i = j + 1;
cout << cb(k - 1, i - 1) * cb(n - k + 1, i) % mod << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
ll po(ll x, int a) {
if (x == 0)
return 0;
if (a == 0)
return 1;
if (a == 1)
return x;
ll tmp = po(x, a / 2);
if (a % 2 == 0)
return tmp * tmp % mod;
return tmp * tmp % mod * x % mod;
}
ll inv(ll x) { return po(x, (int)mod - 2); }
ll beki[2010];
ll cb(int a, int b) {
if (a < b)
return 0;
return beki[a] * inv(beki[b]) % mod * inv(beki[a - b]) % mod;
}
int main() {
int n, k;
cin >> n >> k;
beki[0] = 1;
rep(i, n) beki[i + 1] = beki[i] * (i + 1) % mod;
rep(j, k) {
int i = j + 1;
cout << cb(k - 1, i - 1) * cb(n - k + 1, i) % mod << endl;
}
} | insert | 27 | 27 | 27 | 29 | 0 | |
p02990 | C++ | Runtime Error | // abc132d.cpp : Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define upto(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define oute(x) cout << (x) << endl
const ll MOD = 1000000007;
ll c[2001][2001];
void init(int N) {
rep(i, N + 1) rep(j, N - i) c[i][j] =
(i == 0 || j == 0) ? 1 : (c[i][j - 1] + c[i - 1][j]) % MOD;
}
ll comb(int n, int r) {
if (n < 0)
return 0;
return c[n - r][r];
}
int main() {
int N, K;
cin >> N >> K;
int red = N - K, blue = K;
init(N + 1);
upto(i, 1, blue + 1, 1)
oute((comb(red + 1, i) * comb(blue - 1, i - 1)) % MOD);
} | // abc132d.cpp : Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define upto(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define oute(x) cout << (x) << endl
const ll MOD = 1000000007;
ll c[2001][2001];
void init(int N) {
rep(i, N + 1) rep(j, N - i) c[i][j] =
(i == 0 || j == 0) ? 1 : (c[i][j - 1] + c[i - 1][j]) % MOD;
}
ll comb(int n, int r) {
if (n < r)
return 0;
return c[n - r][r];
}
int main() {
int N, K;
cin >> N >> K;
int red = N - K, blue = K;
init(N + 1);
upto(i, 1, blue + 1, 1)
oute((comb(red + 1, i) * comb(blue - 1, i - 1)) % MOD);
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD (ll)(1e9 + 7)
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll c[2010][2010];
ll comb(int a, int b) {
if (c[a][b] != 0)
return c[a][b];
if (a == b || b == 0)
return c[a][b] = 1;
return c[a][b] = (comb(a - 1, b - 1) + comb(a - 1, b)) % MOD;
}
int main(void) {
int n, k;
cin >> n >> k;
REP(i, k) { pr((comb(n - k + 1, i + 1) * comb(k - 1, i)) % MOD); }
} | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD (ll)(1e9 + 7)
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll c[2010][2010];
ll comb(int a, int b) {
if (a < b || b < 0)
return 0;
if (c[a][b] != 0)
return c[a][b];
if (a == b || b == 0)
return c[a][b] = 1;
return c[a][b] = (comb(a - 1, b - 1) + comb(a - 1, b)) % MOD;
}
int main(void) {
int n, k;
cin >> n >> k;
REP(i, k) { pr((comb(n - k + 1, i + 1) * comb(k - 1, i)) % MOD); }
} | insert | 49 | 49 | 49 | 51 | 0 | |
p02990 | C++ | Runtime Error | #define DEBUG(...)
/* Strip me down and go to town */
/* Lick me over upside down */
/* Pound and pound and pound and pound */
/* Baby make me make that sound */
/* Aaah, aaah, aaah, aaah, aaaaaaaaaaaaaaaaaah! */
#include <stdio.h>
typedef long long int LL;
const LL MOD = 1000000007;
LL fac[4005];
LL ifac[4005];
LL fexpo(LL base, int p) {
LL ret = 1;
while (p) {
if (p % 2) {
ret = ret * base % MOD;
}
base = base * base % MOD;
p /= 2;
}
return ret;
}
LL comb(int a, int b) { return (fac[a] * ifac[b] % MOD) * ifac[a - b] % MOD; }
int main() {
int n, k;
scanf("%d %d", &n, &k);
fac[0] = 1;
ifac[0] = 1;
for (int i = 1; i < 4005; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = fexpo(fac[i], MOD - 2);
}
for (int i = 1; i <= k; i++) {
LL red = comb(n - k + 1, i);
LL blue = comb(k - 1, i - 1);
DEBUG(printf("%lld %lld\n", red, blue);)
printf("%lld\n", red * blue % MOD);
}
return 0;
} | #define DEBUG(...)
/* Strip me down and go to town */
/* Lick me over upside down */
/* Pound and pound and pound and pound */
/* Baby make me make that sound */
/* Aaah, aaah, aaah, aaah, aaaaaaaaaaaaaaaaaah! */
#include <stdio.h>
typedef long long int LL;
const LL MOD = 1000000007;
LL fac[4005];
LL ifac[4005];
LL fexpo(LL base, int p) {
LL ret = 1;
while (p) {
if (p % 2) {
ret = ret * base % MOD;
}
base = base * base % MOD;
p /= 2;
}
return ret;
}
LL comb(int a, int b) {
if (a < b)
return 0;
return (fac[a] * ifac[b] % MOD) * ifac[a - b] % MOD;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
fac[0] = 1;
ifac[0] = 1;
for (int i = 1; i < 4005; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = fexpo(fac[i], MOD - 2);
}
for (int i = 1; i <= k; i++) {
LL red = comb(n - k + 1, i);
LL blue = comb(k - 1, i - 1);
DEBUG(printf("%lld %lld\n", red, blue);)
printf("%lld\n", red * blue % MOD);
}
return 0;
} | replace | 27 | 28 | 27 | 32 | 0 | |
p02990 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll fact[2010];
// a^b % MOD を計算して返す
ll power(ll a, ll b) {
if (b == 0) {
return 1;
} else {
ll ans = power(a, b / 2);
ans = ans * ans;
ans = ans % MOD;
if (b % 2 == 1)
ans = ans * a;
ans = ans % MOD;
return ans;
}
}
// nCr % MOD を計算して返す
ll choose(ll n, ll r) {
ll ans = fact[n];
ans = fact[n] * power(fact[r], MOD - 2);
ans = ans % MOD;
ans = ans * power((fact[n - r] + MOD) % MOD, MOD - 2);
ans = ans % MOD;
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
fact[0] = 1;
for (int i = 0; i < 2005; ++i) {
fact[i + 1] = fact[i] * (i + 1) % MOD;
}
for (int i = 1; i <= k; ++i) {
ll ans = choose(n - k + 1, i) * choose(k - 1, i - 1) % MOD;
cout << ans << endl;
}
}
| #include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll fact[2010];
// a^b % MOD を計算して返す
ll power(ll a, ll b) {
if (b == 0) {
return 1;
} else {
ll ans = power(a, b / 2);
ans = ans * ans;
ans = ans % MOD;
if (b % 2 == 1)
ans = ans * a;
ans = ans % MOD;
return ans;
}
}
// nCr % MOD を計算して返す
ll choose(ll n, ll r) {
ll ans = fact[n];
ans = fact[n] * power(fact[r], MOD - 2);
ans = ans % MOD;
ans = ans * power((fact[n - r] + MOD) % MOD, MOD - 2);
ans = ans % MOD;
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
fact[0] = 1;
for (int i = 0; i < 2005; ++i) {
fact[i + 1] = fact[i] * (i + 1) % MOD;
}
for (int i = 1; i <= k; ++i) {
if (i > n - k + 1) {
cout << 0 << endl;
continue;
}
ll ans = choose(n - k + 1, i) * choose(k - 1, i - 1) % MOD;
cout << ans << endl;
}
}
| insert | 41 | 41 | 41 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
REP(i, 40001) {
REP(j, i + 1) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
mint f2(int n, int k) { return comb(n + k - 1, k - 1); }
mint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (n < 1)
return 0;
return f2(n - k, k);
}
int main() {
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
mint blue = f(k, i);
mint red = 0;
{
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
}
mint ans = blue * red;
cout << ans.x << endl;
}
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
REP(i, 4001) {
REP(j, i + 1) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
mint f2(int n, int k) { return comb(n + k - 1, k - 1); }
mint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (n < 1)
return 0;
return f2(n - k, k);
}
int main() {
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
mint blue = f(k, i);
mint red = 0;
{
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
}
mint ans = blue * red;
cout << ans.x << endl;
}
}
| replace | 43 | 44 | 43 | 44 | -11 | |
p02990 | C++ | Runtime Error | #include <stdio.h>
long long p = 1000000007;
long long n, k;
long long rui(long long a, long long b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % p;
if (b % 2)
return (rui(rui(a, b / 2), 2) * a % p);
return rui(rui(a, b / 2), 2);
}
long long inv(long long a) { return rui(a, p - 2); }
long long kai[5000];
long long ans;
int main() {
scanf("%lld%lld", &n, &k);
kai[0] = 1;
for (int i = 1; i < 5000; i++) {
kai[i] = kai[i - 1] * i % p;
}
for (long long i = 1; i <= k; i++) {
if (n - k - i + 1 < 0)
ans = 0;
else
ans = 1;
ans *= kai[k - 1];
ans %= p;
ans *= inv(kai[k - i]);
ans %= p;
ans *= inv(kai[i - 1]);
ans %= p;
ans *= kai[n - k + 1];
ans %= p;
ans *= inv(kai[n - k + 1 - i]);
ans %= p;
ans *= inv(kai[i]);
ans %= p;
printf("%lld\n", ans);
}
} | #include <stdio.h>
long long p = 1000000007;
long long n, k;
long long rui(long long a, long long b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % p;
if (b % 2)
return (rui(rui(a, b / 2), 2) * a % p);
return rui(rui(a, b / 2), 2);
}
long long inv(long long a) { return rui(a, p - 2); }
long long kai[5000];
long long ans;
int main() {
scanf("%lld%lld", &n, &k);
kai[0] = 1;
for (int i = 1; i < 5000; i++) {
kai[i] = kai[i - 1] * i % p;
}
for (long long i = 1; i <= k; i++) {
if (n - k - i + 1 < 0)
ans = 0;
else
ans = 1;
ans *= kai[k - 1];
ans %= p;
ans *= inv(kai[k - i]);
ans %= p;
ans *= inv(kai[i - 1]);
ans %= p;
ans *= kai[n - k + 1];
ans %= p;
if (ans)
ans *= inv(kai[n - k + 1 - i]);
ans %= p;
ans *= inv(kai[i]);
ans %= p;
printf("%lld\n", ans);
}
} | replace | 36 | 37 | 36 | 38 | 0 | |
p02990 | C++ | Runtime Error | // review
#include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int N, K;
ll dp[2100];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % MOD;
}
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll nCr(ll n, ll r) {
return (dp[n] * mod_inv(dp[r]) % MOD) * mod_inv(dp[n - r]) % MOD;
}
void solve() {
dp[0] = dp[1] = 1;
for (int i = 2; i < 2100; i++) {
dp[i] = i * dp[i - 1] % MOD;
}
for (int i = 1; i <= K; i++) {
ll sum = nCr(K - 1, i - 1) * nCr(N - K + 1, i) % MOD;
cout << sum << endl;
}
}
int main() {
cin >> N >> K;
solve();
}
| // review
#include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int N, K;
ll dp[2100];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % MOD;
}
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll nCr(ll n, ll r) {
if (n < r) {
return 0;
}
return (dp[n] * mod_inv(dp[r]) % MOD) * mod_inv(dp[n - r]) % MOD;
}
void solve() {
dp[0] = dp[1] = 1;
for (int i = 2; i < 2100; i++) {
dp[i] = i * dp[i - 1] % MOD;
}
for (int i = 1; i <= K; i++) {
ll sum = nCr(K - 1, i - 1) * nCr(N - K + 1, i) % MOD;
cout << sum << endl;
}
}
int main() {
cin >> N >> K;
solve();
}
| insert | 25 | 25 | 25 | 28 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
ll nCr(ll n, ll r, ll p) {
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
ll count(ll n, ll r, ll a, ll p) {
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[a], p) % p) % p;
}
ll m = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
for (ll z = 1; z <= k; z++) {
cout << (nCr(n - k + 1, z, m) * count(k - 1, k - z, z - 1, m)) % m << endl;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
ll nCr(ll n, ll r, ll p) {
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
ll count(ll n, ll r, ll a, ll p) {
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[a], p) % p) % p;
}
ll m = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
for (ll z = 1; z <= k; z++) {
if (z > n - k + 1)
cout << 0 << endl;
else
cout << (nCr(n - k + 1, z, m) * count(k - 1, k - z, z - 1, m)) % m
<< endl;
}
} | replace | 63 | 64 | 63 | 68 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1000000007;
int add(int a, int b) { return (a += b) < mod ? a : a - mod; }
int sub(int a, int b) { return (a -= b) >= 0 ? a : a + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void adds(int &a, int b) { a = add(a, b); }
void subs(int &a, int b) { a = sub(a, b); }
void muls(int &a, int b) { a = mul(a, b); }
void maxs(int &a, int b) { a = max(a, b); }
void mins(int &a, int b) { a = min(a, b); }
int pwr(int a, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mul(a, pwr(a, p - 1));
return pwr(mul(a, a), p / 2);
}
int inv(int a) { return pwr(a, mod - 2); }
const int maxn = 1000000;
int f[maxn + 1], fi[maxn + 1];
int ncr(int n, int r) { return mul(f[n], mul(fi[r], fi[n - r])); }
void precompute() {
f[0] = 1;
for (int i = 1; i <= maxn; ++i)
f[i] = mul(f[i - 1], i);
fi[maxn] = inv(f[maxn]);
for (int i = maxn - 1; i >= 0; --i)
fi[i] = mul(fi[i + 1], i + 1);
}
int n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
precompute();
for (int i = 1; i <= k; ++i)
cout << mul(ncr(n - k + 1, i), ncr(k - 1, i - 1)) << '\n';
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1000000007;
int add(int a, int b) { return (a += b) < mod ? a : a - mod; }
int sub(int a, int b) { return (a -= b) >= 0 ? a : a + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void adds(int &a, int b) { a = add(a, b); }
void subs(int &a, int b) { a = sub(a, b); }
void muls(int &a, int b) { a = mul(a, b); }
void maxs(int &a, int b) { a = max(a, b); }
void mins(int &a, int b) { a = min(a, b); }
int pwr(int a, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mul(a, pwr(a, p - 1));
return pwr(mul(a, a), p / 2);
}
int inv(int a) { return pwr(a, mod - 2); }
const int maxn = 1000000;
int f[maxn + 1], fi[maxn + 1];
int ncr(int n, int r) {
if (r > n)
return 0;
return mul(f[n], mul(fi[r], fi[n - r]));
}
void precompute() {
f[0] = 1;
for (int i = 1; i <= maxn; ++i)
f[i] = mul(f[i - 1], i);
fi[maxn] = inv(f[maxn]);
for (int i = maxn - 1; i >= 0; --i)
fi[i] = mul(fi[i + 1], i + 1);
}
int n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
precompute();
for (int i = 1; i <= k; ++i)
cout << mul(ncr(n - k + 1, i), ncr(k - 1, i - 1)) << '\n';
}
| replace | 28 | 29 | 28 | 33 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cerr << v[i][j] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
// #define mp make_pair
// #define endl '\n'
int main() {
int n, k;
cin >> n >> k;
vll dp(n + 1, vl(n + 1));
dp[0][0] = 1;
rep(i, n) {
rep(j, n + 1) {
if (j == n)
continue;
(dp[i + 1][j + 1] += dp[i][j]) %= MOD;
}
rep(j, n) { (dp[i + 1][j + 1] += dp[i + 1][j]) %= MOD; }
}
// DEBUG_MAT(dp);
rep1(i, k) {
ll ans = 0;
for (int j = -1; j <= 1; j++) {
int b = i;
int r = b + j;
(ans += dp[b][k] * dp[r][n - k] % MOD) %= MOD;
if (j == 0) {
(ans += dp[b][k] * dp[r][n - k] % MOD) %= MOD;
}
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cerr << v[i][j] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
// #define mp make_pair
// #define endl '\n'
int main() {
int n, k;
cin >> n >> k;
vll dp(n + 1, vl(n + 1));
dp[0][0] = 1;
rep(i, n) {
rep(j, n + 1) {
if (j == n)
continue;
(dp[i + 1][j + 1] += dp[i][j]) %= MOD;
}
rep(j, n) { (dp[i + 1][j + 1] += dp[i + 1][j]) %= MOD; }
}
// DEBUG_MAT(dp);
rep1(i, k) {
ll ans = 0;
for (int j = -1; j <= 1; j++) {
int b = i;
int r = b + j;
if (r > n - k)
continue;
(ans += dp[b][k] * dp[r][n - k] % MOD) %= MOD;
if (j == 0) {
(ans += dp[b][k] * dp[r][n - k] % MOD) %= MOD;
}
}
cout << ans << endl;
}
}
| insert | 102 | 102 | 102 | 104 | 0 | |
p02990 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
#define lli long long int
lli bigmod = 1000000007, memo[2010][2010];
lli dp(lli x, lli y) {
if ((y == 0) || (x == y))
return 1;
if (memo[x][y] == -1)
memo[x][y] = (dp(x - 1, y) + dp(x - 1, y - 1)) % bigmod;
return memo[x][y];
}
int main() {
lli n, k, ans;
scanf("%lld %lld", &n, &k);
memset(memo, -1, sizeof memo);
for (lli i = 1; i <= k; i++) {
ans = (dp(k - 1, i - 1) * dp(n - k + 1, i)) % bigmod;
printf("%lld\n", ans);
}
return 0;
} | #include <stdio.h>
#include <string.h>
#define lli long long int
lli bigmod = 1000000007, memo[2010][2010];
lli dp(lli x, lli y) {
if (x < y)
return 0;
if ((y == 0) || (x == y))
return 1;
if (memo[x][y] == -1)
memo[x][y] = (dp(x - 1, y) + dp(x - 1, y - 1)) % bigmod;
return memo[x][y];
}
int main() {
lli n, k, ans;
scanf("%lld %lld", &n, &k);
memset(memo, -1, sizeof memo);
for (lli i = 1; i <= k; i++) {
ans = (dp(k - 1, i - 1) * dp(n - k + 1, i)) % bigmod;
printf("%lld\n", ans);
}
return 0;
} | insert | 8 | 8 | 8 | 10 | 0 | |
p02990 | Python | Runtime Error | from math import factorial
N, K = [int(_) for _ in input().split()]
# N = 10
MOD = 10**9 + 7
kaijo = [0] * (N + 1)
kaijo[0] = kaijo[1] = 1
for i in range(2, N + 1):
kaijo[i] = (kaijo[i - 1] * i) % MOD
gyaku = [0] * (N + 1)
gyaku[0] = gyaku[1] = 1
for i in range(2, N + 1):
# gyaku[i] = (gyaku[i - 1] * pow(i, MOD - 2, MOD)) % MOD
gyaku[i] = pow(kaijo[i], MOD - 2, MOD)
def calc(n, k):
# return (kaijo[n] * gyaku[n - k] * gyaku[k]) % MOD
return factorial(n) // (factorial(n - k) * factorial(k))
def solve():
for i in range(1, K + 1):
n = N - K + 1
k = i
print((calc(n, k) * calc(K - 1, i - 1)) % MOD)
solve()
| from math import factorial
N, K = [int(_) for _ in input().split()]
# N = 10
MOD = 10**9 + 7
kaijo = [0] * (N + 1)
kaijo[0] = kaijo[1] = 1
for i in range(2, N + 1):
kaijo[i] = (kaijo[i - 1] * i) % MOD
gyaku = [0] * (N + 1)
gyaku[0] = gyaku[1] = 1
for i in range(2, N + 1):
# gyaku[i] = (gyaku[i - 1] * pow(i, MOD - 2, MOD)) % MOD
gyaku[i] = pow(kaijo[i], MOD - 2, MOD)
def calc(n, k):
# return (kaijo[n] * gyaku[n - k] * gyaku[k]) % MOD
return factorial(n) // (factorial(n - k) * factorial(k))
def solve():
for i in range(1, K + 1):
n = N - K + 1
k = i
if k <= n:
print((calc(n, k) * calc(K - 1, i - 1)) % MOD)
else:
print(0)
solve()
| replace | 28 | 29 | 28 | 32 | 0 | |
p02990 | Python | Runtime Error | from math import factorial as fac
N, K = map(int, input().split())
def func(n, k, r):
return (
fac(k - 1)
* fac(n - k + 1)
// (fac(k - r) * fac(r - 1) * fac(n - k - r + 1) * fac(r))
)
for i in range(1, K + 1):
print(func(N, K, i) % (10**9 + 7))
| from math import factorial as fac
N, K = map(int, input().split())
def func(n, k, r):
return (
fac(k - 1)
* fac(n - k + 1)
// (fac(k - r) * fac(r - 1) * fac(n - k - r + 1) * fac(r))
)
for i in range(1, K + 1):
if N - K + 1 >= i:
print(func(N, K, i) % (10**9 + 7))
else:
print(0)
| replace | 14 | 15 | 14 | 18 | 0 | |
p02990 | Python | Runtime Error | # パスカルの三角形
N, K = map(int, input().split())
n = max(K - 1, N - K + 1)
c = [[0] * (n + 1) for _ in range(n + 1)]
c[0][0] = 1
for i in range(1, n + 1):
ci = c[i]
ci1 = c[i - 1]
ci[0] = 1
for j in range(1, i + 1):
ci[j] = (ci1[j - 1] + ci1[j]) % 1000000007
result = []
for i in range(1, K + 1):
result.append(c[K - 1][i - 1] * c[N - K + 1][i] % 1000000007)
print("\n".join(str(i) for i in result))
| # パスカルの三角形
N, K = map(int, input().split())
n = max(K, N - K + 1)
c = [[0] * (n + 1) for _ in range(n + 1)]
c[0][0] = 1
for i in range(1, n + 1):
ci = c[i]
ci1 = c[i - 1]
ci[0] = 1
for j in range(1, i + 1):
ci[j] = (ci1[j - 1] + ci1[j]) % 1000000007
result = []
for i in range(1, K + 1):
result.append(c[K - 1][i - 1] * c[N - K + 1][i] % 1000000007)
print("\n".join(str(i) for i in result))
| replace | 3 | 4 | 3 | 4 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long m = 1000000007;
int main() {
int n, k;
cin >> n >> k;
long a[n + 1][k + 1];
for (int i = 0; i < n + 1; i++) {
a[i][0] = 1;
}
for (int i = 0; i < k + 1; i++) {
a[i][i] = 1;
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j <= i; j++) {
a[i][j] = (a[i - 1][j] + a[i - 1][j - 1]) % m;
}
}
for (int i = 1; i <= k; i++) {
cout << a[n - k + 1][i] * a[k - 1][i - 1] % m << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const long m = 1000000007;
int main() {
int n, k;
cin >> n >> k;
long a[2002][2002];
for (int i = 0; i < n + 1; i++) {
a[i][0] = 1;
}
for (int i = 0; i < k + 1; i++) {
a[i][i] = 1;
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j <= i; j++) {
a[i][j] = (a[i - 1][j] + a[i - 1][j - 1]) % m;
}
}
for (int i = 1; i <= k; i++) {
cout << a[n - k + 1][i] * a[k - 1][i - 1] % m << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define Cerr(x) cerr << (x) << endl
#define fi first
#define se second
#define P pair<ll, ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll, ll>
ll n, cnt, ans, a, b, c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
ld doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};
// int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
int to, cost;
};
//-------------------------↓↓↓↓↓↓------------------------
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
using mint = modint<MOD>;
cin >> n >> k;
vector<mint> fa(ohara);
fa[0] = 1;
rrep(i, 1, ohara) { fa[i] = fa[i - 1] * i; }
const auto comb = [&fa](int n, int r) { return fa[n] / fa[r] / fa[n - r]; };
rep(i, k) { Cout((comb(n - k + 1, i + 1) * comb(k - 1, i)).value()); }
return 0;
}
| #include <bits/stdc++.h>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define Cerr(x) cerr << (x) << endl
#define fi first
#define se second
#define P pair<ll, ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll, ll>
ll n, cnt, ans, a, b, c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
ld doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};
// int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
int to, cost;
};
//-------------------------↓↓↓↓↓↓------------------------
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
using mint = modint<MOD>;
cin >> n >> k;
vector<mint> fa(ohara);
fa[0] = 1;
rrep(i, 1, ohara) { fa[i] = fa[i - 1] * i; }
const auto comb = [&fa](int n, int r) { return fa[n] / fa[r] / fa[n - r]; };
rep(i, k) {
if (n - k + 1 < i + 1) {
Cout(0);
} else {
Cout((comb(n - k + 1, i + 1) * comb(k - 1, i)).value());
}
}
return 0;
}
| replace | 103 | 104 | 103 | 110 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
ll mpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
// 階乗,factで初期化
vector<ll> tfact(1e7 + 1);
void fact(ll n) {
for (ll i = 0; i <= n; i++) {
if (i == 0) {
tfact[i] = 1;
} else {
tfact[i] = tfact[i - 1] * i % mod;
}
}
}
// nCk 繰り返し高速
ll comb(ll n, ll k) {
return tfact.at(n) * mpow(tfact.at(k), mod - 2) % mod *
mpow(tfact.at(n - k), mod - 2) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
fact(n + 1);
ll temp = 0;
for (ll i = 1; i <= k; i++) {
cout << comb(n - k + 1, i) % mod * comb(k + i - 1 - i, i - 1) % mod << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
ll mpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
// 階乗,factで初期化
vector<ll> tfact(1e7 + 1);
void fact(ll n) {
for (ll i = 0; i <= n; i++) {
if (i == 0) {
tfact[i] = 1;
} else {
tfact[i] = tfact[i - 1] * i % mod;
}
}
}
// nCk 繰り返し高速
ll comb(ll n, ll k) {
return tfact.at(n) * mpow(tfact.at(k), mod - 2) % mod *
mpow(tfact.at(n - k), mod - 2) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
fact(n + 1);
ll temp = 0;
for (ll i = 1; i <= k; i++) {
if (n - k + 1 >= i) {
cout << comb(n - k + 1, i) % mod * comb(k + i - 1 - i, i - 1) % mod
<< endl;
} else {
cout << 0 << endl;
}
}
} | replace | 43 | 44 | 43 | 49 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll fact[200200];
ll invfact[200200];
inline ll take_mod(ll a) { return (a % mod + mod) % mod; }
inline ll add(ll a, ll b) { return take_mod(a + b); }
inline ll sub(ll a, ll b) { return take_mod(a - b); }
inline ll mul(ll a, ll b) { return take_mod(a * b); }
inline ll pow(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = mul(res, x);
x = mul(x, x);
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return pow(x, mod - 2); }
void make_fact(ll n) {
fact[0] = 1;
ll res = 1;
for (int i = 1; i <= n; i++) {
fact[i] = res;
res = mul(res, i + 1);
}
}
void make_invfact(ll n) {
invfact[0] = 1;
invfact[n] = mod_inv(fact[n]);
for (int i = n - 1; i >= 1; i--) {
invfact[i] = mul(invfact[i + 1], i + 1);
}
}
ll perm(ll n, ll k) { return mul(fact[n], invfact[n - k]); }
ll comb(ll n, ll k) { return mul(mul(fact[n], invfact[n - k]), invfact[k]); }
int main() {
ll N, K;
cin >> N >> K;
#ifdef DEBUG
cout << "N=" << N << ", K=" << K << endl;
#endif
make_fact(4000);
make_invfact(4000);
for (ll i = 1; i <= K; ++i) {
ll bbnum = K - i;
ll bsnum = i - 1;
ll rbnum = N - K - i + 1;
ll rsnum = i;
// cout << "b i=" << i << endl;
// cout << bbnum << endl;
// cout << bsnum << endl;
// cout << comb(bbnum + bsnum, bsnum) << endl;
// cout << "r i=" << i << endl;
// cout << rbnum << endl;
// cout << rsnum << endl;
// cout << comb(rbnum + rsnum, rsnum) << endl;
cout << mul(comb(bbnum + bsnum, bsnum), comb(rbnum + rsnum, rsnum)) << endl;
}
return 0;
}
| #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll fact[200200];
ll invfact[200200];
inline ll take_mod(ll a) { return (a % mod + mod) % mod; }
inline ll add(ll a, ll b) { return take_mod(a + b); }
inline ll sub(ll a, ll b) { return take_mod(a - b); }
inline ll mul(ll a, ll b) { return take_mod(a * b); }
inline ll pow(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = mul(res, x);
x = mul(x, x);
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return pow(x, mod - 2); }
void make_fact(ll n) {
fact[0] = 1;
ll res = 1;
for (int i = 1; i <= n; i++) {
fact[i] = res;
res = mul(res, i + 1);
}
}
void make_invfact(ll n) {
invfact[0] = 1;
invfact[n] = mod_inv(fact[n]);
for (int i = n - 1; i >= 1; i--) {
invfact[i] = mul(invfact[i + 1], i + 1);
}
}
ll perm(ll n, ll k) { return mul(fact[n], invfact[n - k]); }
ll comb(ll n, ll k) { return mul(mul(fact[n], invfact[n - k]), invfact[k]); }
int main() {
ll N, K;
cin >> N >> K;
#ifdef DEBUG
cout << "N=" << N << ", K=" << K << endl;
#endif
make_fact(4000);
make_invfact(4000);
for (ll i = 1; i <= K; ++i) {
ll bbnum = K - i;
ll bsnum = i - 1;
ll rbnum = N - K - i + 1;
ll rsnum = i;
// cout << "b i=" << i << endl;
// cout << bbnum << endl;
// cout << bsnum << endl;
// cout << comb(bbnum + bsnum, bsnum) << endl;
// cout << "r i=" << i << endl;
// cout << rbnum << endl;
// cout << rsnum << endl;
// cout << comb(rbnum + rsnum, rsnum) << endl;
if (rbnum >= 0) {
cout << mul(comb(bbnum + bsnum, bsnum), comb(rbnum + rsnum, rsnum))
<< endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| replace | 97 | 99 | 97 | 103 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void comb(vector<vector<long long>> &vec) {
for (size_t i = 0; i < vec.size(); i++) {
vec[i][0] = 1;
vec[i][i] = 1;
}
for (size_t i = 1; i < vec.size(); i++) {
for (size_t j = 1; j < i; j++) {
vec[i][j] = vec[i - 1][j - 1] + vec[i - 1][j];
vec[i][j] %= mod;
}
}
}
int main() {
long long n, k;
cin >> n >> k;
vector<vector<long long>> vec(n - k + 2, vector<long long>(n - k + 2, 0));
comb(vec);
for (int i = 1; i <= k; i++) {
cout << (vec[n - k + 1][i] * vec[k - 1][i - 1]) % mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void comb(vector<vector<long long>> &vec) {
for (size_t i = 0; i < vec.size(); i++) {
vec[i][0] = 1;
vec[i][i] = 1;
}
for (size_t i = 1; i < vec.size(); i++) {
for (size_t j = 1; j < i; j++) {
vec[i][j] = vec[i - 1][j - 1] + vec[i - 1][j];
vec[i][j] %= mod;
}
}
}
int main() {
long long n, k;
cin >> n >> k;
vector<vector<long long>> vec(2005, vector<long long>(2005, 0));
comb(vec);
for (int i = 1; i <= k; i++) {
cout << (vec[n - k + 1][i] * vec[k - 1][i - 1]) % mod << endl;
}
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define line cout << __LINE__;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define decimal_digits cout << fixed << setprecision(15);
#define dbg2(a, b) cerr << #a << " = " << a << " " << #b << " = " << b << '\n';
#define debug(x) cerr << __LINE__ << ' ' << #x << " = " << x << '\n';
#define dln cerr << '\n';
#define dsp cerr << ' ';
#define pln cout << '\n';
#define psp cout << ' ';
typedef unordered_map<int, int> umi;
typedef unordered_map<ll, ll> uml;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
clock_t time_p = clock();
void ktj() {
time_p = clock() - time_p;
cerr << "Time elapsed : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
const ll mod = 1e9 + 7;
const ll N = 2000 + 5;
ll f[N];
inline ll add(ll a, ll b) { return (a % mod + b % mod) % mod; }
inline ll sub(ll a, ll b) { return (a % mod - b % mod + mod) % mod; }
inline ll mul(ll a, ll b) { return (a % mod * b % mod) % mod; }
inline ll modexpo(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res % mod * a % mod) % mod;
a = (a % mod * a % mod) % mod;
b >>= 1;
}
return res;
}
inline ll modinv_Fermat(ll a) { return modexpo(a, mod - 2); }
inline ll divide(ll a, ll b) {
return (a % mod * modexpo(b, mod - 2) % mod) % mod;
}
int main() {
fastio;
ll n, k;
ll i, j, ans = 0;
cin >> n >> k;
f[0] = 1;
forn(1, N, i) { f[i] = mul(i, f[i - 1]); }
forn(1, k + 1, i) {
ll blue = f[k - 1];
blue = divide(blue, f[i - 1]);
blue = divide(blue, f[k - i]);
ll red = f[n - k + 1];
red = divide(red, f[i]);
red = divide(red, f[n - k + 1 - i]);
ans = mul(red, blue);
cout << ans << '\n';
}
ktj();
}
| #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define line cout << __LINE__;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define decimal_digits cout << fixed << setprecision(15);
#define dbg2(a, b) cerr << #a << " = " << a << " " << #b << " = " << b << '\n';
#define debug(x) cerr << __LINE__ << ' ' << #x << " = " << x << '\n';
#define dln cerr << '\n';
#define dsp cerr << ' ';
#define pln cout << '\n';
#define psp cout << ' ';
typedef unordered_map<int, int> umi;
typedef unordered_map<ll, ll> uml;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
clock_t time_p = clock();
void ktj() {
time_p = clock() - time_p;
cerr << "Time elapsed : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
const ll mod = 1e9 + 7;
const ll N = 2000 + 5;
ll f[N];
inline ll add(ll a, ll b) { return (a % mod + b % mod) % mod; }
inline ll sub(ll a, ll b) { return (a % mod - b % mod + mod) % mod; }
inline ll mul(ll a, ll b) { return (a % mod * b % mod) % mod; }
inline ll modexpo(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res % mod * a % mod) % mod;
a = (a % mod * a % mod) % mod;
b >>= 1;
}
return res;
}
inline ll modinv_Fermat(ll a) { return modexpo(a, mod - 2); }
inline ll divide(ll a, ll b) {
return (a % mod * modexpo(b, mod - 2) % mod) % mod;
}
int main() {
fastio;
ll n, k;
ll i, j, ans = 0;
cin >> n >> k;
f[0] = 1;
forn(1, N, i) { f[i] = mul(i, f[i - 1]); }
forn(1, k + 1, i) {
ll blue = f[k - 1];
blue = divide(blue, f[i - 1]);
blue = divide(blue, f[k - i]);
ll red;
if (n - k + 1 >= i) {
red = f[n - k + 1];
red = divide(red, f[i]);
red = divide(red, f[n - k + 1 - i]);
} else {
red = 0;
}
ans = mul(red, blue);
cout << ans << '\n';
}
ktj();
}
| replace | 95 | 98 | 95 | 103 | 0 | Time elapsed : 0.000158
|
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int C[3000][3000];
int c(int x, int y) {
if (y == 0 || x == y)
return 1;
else if (C[x][y] > 0)
return C[x][y];
else
return C[x][y] = (c(x - 1, y - 1) + c(x - 1, y)) % mod;
}
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i) {
cout << (c(n - k + 1, i + 1) * c(k - 1, i)) % mod << endl;
}
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int C[3000][3000];
int c(int x, int y) {
if (y == 0 || x == y)
return 1;
else if (C[x][y] > 0)
return C[x][y];
else
return C[x][y] = (c(x - 1, y - 1) + c(x - 1, y)) % mod;
}
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i) {
if (n - k < i) {
cout << 0 << endl;
continue;
}
cout << (c(n - k + 1, i + 1) * c(k - 1, i)) % mod << endl;
}
}
| insert | 21 | 21 | 21 | 25 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(cnt, e) for (ll cnt = 0; cnt < e; cnt++)
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const ll INF = INT64_MAX;
ll i, j, k;
ll kaijou[2000 + 1];
ll gyakugen[2000 + 1];
long long ruijou(long long x, long long y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return ruijou(x * x % mod, y / 2);
else
return x * ruijou(x, y - 1) % mod;
}
ll combination(ll n, ll c) {
return ((kaijou[n] * gyakugen[c]) % mod) * gyakugen[n - c] % mod;
}
ll mo(ll x) {
ll ans = x % mod;
if (x >= 0)
return ans;
return ans + mod;
}
int main() {
ll N, K;
cin >> N >> K;
V kaisuu(K);
rep(i, N + 1) {
if (i == 0)
kaijou[i] = 1;
else
kaijou[i] = (kaijou[i - 1] * i) % mod;
}
rep(i, N + 1) {
if (i == 0)
gyakugen[i] = 1;
else
gyakugen[i] = (gyakugen[i - 1] * ruijou(i, mod - 2)) % mod;
}
rep(i, K) {
cout << mo(combination(N - K + 1, i + 1) * combination(K - 1, i)) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(cnt, e) for (ll cnt = 0; cnt < e; cnt++)
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const ll INF = INT64_MAX;
ll i, j, k;
ll kaijou[2000 + 1];
ll gyakugen[2000 + 1];
long long ruijou(long long x, long long y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return ruijou(x * x % mod, y / 2);
else
return x * ruijou(x, y - 1) % mod;
}
ll combination(ll n, ll c) {
if (n < c)
return 0;
return ((kaijou[n] * gyakugen[c]) % mod) * gyakugen[n - c] % mod;
}
ll mo(ll x) {
ll ans = x % mod;
if (x >= 0)
return ans;
return ans + mod;
}
int main() {
ll N, K;
cin >> N >> K;
V kaisuu(K);
rep(i, N + 1) {
if (i == 0)
kaijou[i] = 1;
else
kaijou[i] = (kaijou[i - 1] * i) % mod;
}
rep(i, N + 1) {
if (i == 0)
gyakugen[i] = 1;
else
gyakugen[i] = (gyakugen[i - 1] * ruijou(i, mod - 2)) % mod;
}
rep(i, K) {
cout << mo(combination(N - K + 1, i + 1) * combination(K - 1, i)) << endl;
}
}
| insert | 22 | 22 | 22 | 24 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define llint long long int
#define LNUM 1000000007
#define MULT(x, y) (((x % LNUM) * (y % LNUM)) % LNUM)
#define SUM(x, y) (((x % LNUM) + (y % LNUM)) % LNUM)
llint combi_val[2002][2002];
void init() {
for (int i = 0; i < 2002; i++) {
for (int j = 0; j < 2002; j++) {
combi_val[i][j] = -1;
}
}
}
llint combi(int n, int k) {
if (combi_val[n][k] == -1) {
if (n == k || k == 0)
combi_val[n][k] = 1;
else
combi_val[n][k] = SUM(combi(n - 1, k - 1), combi(n - 1, k));
}
return combi_val[n][k];
}
int main(void) {
init();
int n, k;
std::cin >> n >> k;
for (int i = 1; i <= k; i++) {
std::cout << MULT(combi(n - k + 1, i), combi(k - 1, i - 1)) << std::endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define llint long long int
#define LNUM 1000000007
#define MULT(x, y) (((x % LNUM) * (y % LNUM)) % LNUM)
#define SUM(x, y) (((x % LNUM) + (y % LNUM)) % LNUM)
llint combi_val[2002][2002];
void init() {
for (int i = 0; i < 2002; i++) {
for (int j = 0; j < 2002; j++) {
combi_val[i][j] = -1;
}
}
}
llint combi(int n, int k) {
if (combi_val[n][k] == -1) {
if (n == k || k == 0)
combi_val[n][k] = 1;
else
combi_val[n][k] = SUM(combi(n - 1, k - 1), combi(n - 1, k));
}
return combi_val[n][k];
}
int main(void) {
init();
int n, k;
std::cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k + 1 < i)
std::cout << 0 << std::endl;
else
std::cout << MULT(combi(n - k + 1, i), combi(k - 1, i - 1)) << std::endl;
}
return 0;
} | replace | 37 | 38 | 37 | 41 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e7 + 10;
int n, k;
int fac[N], inv[N];
template <typename T> inline void read(T &x) {
T flg = 1;
x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
flg = -flg;
ch = getchar();
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
x *= flg;
}
template <typename T> inline void write(T x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline int ksm(int b, int p) {
int ans = 1;
while (p) {
if (p & 1)
ans = ans * b % MOD;
b = b * b % MOD;
p >>= 1;
}
return ans;
}
inline void get_inv() {
fac[0] = 1;
inv[0] = 1;
for (register int i = 1; i <= n; ++i)
fac[i] = fac[i - 1] * i % MOD;
inv[n] = ksm(fac[n], MOD - 2);
for (register int i = n - 1; i >= 1; --i)
inv[i] = inv[i + 1] % MOD * (i + 1) % MOD;
}
inline int C(int n, int m) {
return fac[n] % MOD * inv[m] % MOD * inv[n - m] % MOD;
}
signed main() {
read(n);
read(k);
get_inv();
for (register int i = 1; i <= k; ++i)
write(C(n - k + 1, i) * C(k - 1, i - 1) % MOD), puts("");
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e7 + 10;
int n, k;
int fac[N], inv[N];
template <typename T> inline void read(T &x) {
T flg = 1;
x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
flg = -flg;
ch = getchar();
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
x *= flg;
}
template <typename T> inline void write(T x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline int ksm(int b, int p) {
int ans = 1;
while (p) {
if (p & 1)
ans = ans * b % MOD;
b = b * b % MOD;
p >>= 1;
}
return ans;
}
inline void get_inv() {
fac[0] = 1;
inv[0] = 1;
for (register int i = 1; i <= n; ++i)
fac[i] = fac[i - 1] * i % MOD;
inv[n] = ksm(fac[n], MOD - 2);
for (register int i = n - 1; i >= 1; --i)
inv[i] = inv[i + 1] % MOD * (i + 1) % MOD;
}
inline int C(int n, int m) {
if (m > n)
return 0;
if (m == n)
return 1;
return fac[n] % MOD * inv[m] % MOD * inv[n - m] % MOD;
}
signed main() {
read(n);
read(k);
get_inv();
for (register int i = 1; i <= k; ++i)
write(C(n - k + 1, i) * C(k - 1, i - 1) % MOD), puts("");
return 0;
} | insert | 47 | 47 | 47 | 51 | -11 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 7;
const int maxm = 2e6 + 7;
const ll mod = 1e9 + 7;
int n, m, k;
ll f[maxn], inv[maxn], sinv[maxn];
ll cc(ll a, ll b) {
if (a == b || b == 0)
return 1;
return f[a] * sinv[a - b] % mod * sinv[b] % mod;
}
int main() {
scanf("%d%d", &n, &k);
m = n - k;
f[0] = 1;
for (int i = 1; i < maxn; i++)
f[i] = f[i - 1] * i % mod;
inv[0] = inv[1] = 1;
for (int i = 2; i < maxn; i++)
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
sinv[0] = 1;
for (int i = 1; i < maxn; i++)
sinv[i] = sinv[i - 1] * inv[i] % mod;
for (int i = 1; i < maxn; i++)
assert(f[i] * sinv[i] % mod == 1);
for (int i = 1; i <= k; i++) {
printf("%lld\n", cc(m + 1, i) * cc(k - 1, i - 1) % mod);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 7;
const int maxm = 2e6 + 7;
const ll mod = 1e9 + 7;
int n, m, k;
ll f[maxn], inv[maxn], sinv[maxn];
ll cc(ll a, ll b) {
if (a < b)
return 0;
if (a == b || b == 0)
return 1;
return f[a] * sinv[a - b] % mod * sinv[b] % mod;
}
int main() {
scanf("%d%d", &n, &k);
m = n - k;
f[0] = 1;
for (int i = 1; i < maxn; i++)
f[i] = f[i - 1] * i % mod;
inv[0] = inv[1] = 1;
for (int i = 2; i < maxn; i++)
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
sinv[0] = 1;
for (int i = 1; i < maxn; i++)
sinv[i] = sinv[i - 1] * inv[i] % mod;
for (int i = 1; i < maxn; i++)
assert(f[i] * sinv[i] % mod == 1);
for (int i = 1; i <= k; i++) {
printf("%lld\n", cc(m + 1, i) * cc(k - 1, i - 1) % mod);
}
return 0;
}
| insert | 10 | 10 | 10 | 12 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll dev = (ll)(1e9) + 7;
vector<ll> fac(2001); // n!(mod M)
vector<ll> ifac(2001); // k!^{M-2} (mod M)
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % dev;
x = x * x % dev;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % dev;
return tmp * fac[a] % dev;
}
int main() {
int n, k;
cin >> n;
cin >> k;
ll ret = 0;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 2001; i++) {
fac[i + 1] = fac[i] * (i + 1) % dev; // n!(mod M)
ifac[i + 1] = ifac[i] * mpow(i + 1, dev - 2) %
dev; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
for (size_t i = 1; i <= k; ++i) {
ll co = comb(n - k + 1, i);
ll rem = comb(k - 1, i - 1);
ret = (co * rem) % dev;
cout << ret << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll dev = (ll)(1e9) + 7;
vector<ll> fac(10000); // n!(mod M)
vector<ll> ifac(10000); // k!^{M-2} (mod M)
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % dev;
x = x * x % dev;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % dev;
return tmp * fac[a] % dev;
}
int main() {
int n, k;
cin >> n;
cin >> k;
ll ret = 0;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 2001; i++) {
fac[i + 1] = fac[i] * (i + 1) % dev; // n!(mod M)
ifac[i + 1] = ifac[i] * mpow(i + 1, dev - 2) %
dev; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
for (size_t i = 1; i <= k; ++i) {
ll co = comb(n - k + 1, i);
ll rem = comb(k - 1, i - 1);
ret = (co * rem) % dev;
cout << ret << endl;
}
return 0;
} | replace | 11 | 13 | 11 | 13 | -6 | free(): invalid size
|
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
const int MOD = 1000000007;
long long N, K;
cin >> N >> K;
vector<long long> kaijou(2010, 1);
for (int i = 1; i <= 2000; i++)
kaijou.at(i) = kaijou.at(i - 1) * i % MOD;
for (int i = 1; i <= K; i++) {
long long bunbo = kaijou.at(N - K + 1) * kaijou.at(K - 1) % MOD;
long long bunshi = kaijou.at(N - K + 1 - i) * kaijou.at(i) % MOD *
kaijou.at(K - i) % MOD * kaijou.at(i - 1) % MOD;
cout << bunbo * modinv(bunshi, MOD) % MOD << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
const int MOD = 1000000007;
long long N, K;
cin >> N >> K;
vector<long long> kaijou(2010, 1);
for (int i = 1; i <= 2000; i++)
kaijou.at(i) = kaijou.at(i - 1) * i % MOD;
for (int i = 1; i <= K; i++) {
if (N - K + 1 < i) {
cout << 0 << endl;
continue;
}
long long bunbo = kaijou.at(N - K + 1) * kaijou.at(K - 1) % MOD;
long long bunshi = kaijou.at(N - K + 1 - i) * kaijou.at(i) % MOD *
kaijou.at(K - i) % MOD * kaijou.at(i - 1) % MOD;
cout << bunbo * modinv(bunshi, MOD) % MOD << endl;
}
}
| insert | 28 | 28 | 28 | 32 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint rhs) {
x += rhs.x;
while (x >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint rhs) {
x -= rhs.x;
while (x < 0)
x += mod;
return *this;
}
mint &operator*=(const mint rhs) {
(x *= rhs.x) %= mod;
return *this;
}
mint operator+(const mint rhs) const {
mint res(*this);
return res += rhs;
}
mint operator-(const mint rhs) const {
mint res(*this);
return res -= rhs;
}
mint operator*(const mint rhs) const {
mint res(*this);
return res *= rhs;
}
bool operator<(const ll rhs) const { return x < rhs; }
bool operator>(const ll rhs) const { return x > rhs; }
friend ostream &operator<<(ostream &os, const mint rhs) {
os << rhs.x;
return os;
}
};
#define rep(index, num) for (int index = 0; index < num; ++index)
mint memo[2005][2005];
mint comb(int n, int m) {
if (memo[n][m] > 0)
return memo[n][m];
if (m == 0 || m == n) {
memo[n][m] = 1;
return 1;
} else {
memo[n][m] = comb(n - 1, m) + comb(n - 1, m - 1);
return memo[n][m];
}
}
int main() {
int N, K;
std::cin >> N >> K;
rep(i, 2005) rep(j, 2005) memo[i][j] = 0;
for (int i = 1; i <= K; i++) {
cout << comb(N - K + 1, i) * comb(K - 1, i - 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint rhs) {
x += rhs.x;
while (x >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint rhs) {
x -= rhs.x;
while (x < 0)
x += mod;
return *this;
}
mint &operator*=(const mint rhs) {
(x *= rhs.x) %= mod;
return *this;
}
mint operator+(const mint rhs) const {
mint res(*this);
return res += rhs;
}
mint operator-(const mint rhs) const {
mint res(*this);
return res -= rhs;
}
mint operator*(const mint rhs) const {
mint res(*this);
return res *= rhs;
}
bool operator<(const ll rhs) const { return x < rhs; }
bool operator>(const ll rhs) const { return x > rhs; }
friend ostream &operator<<(ostream &os, const mint rhs) {
os << rhs.x;
return os;
}
};
#define rep(index, num) for (int index = 0; index < num; ++index)
mint memo[2005][2005];
mint comb(int n, int m) {
if (m > n)
return 0;
if (memo[n][m] > 0)
return memo[n][m];
if (m == 0 || m == n) {
memo[n][m] = 1;
return 1;
} else {
memo[n][m] = comb(n - 1, m) + comb(n - 1, m - 1);
return memo[n][m];
}
}
int main() {
int N, K;
std::cin >> N >> K;
rep(i, 2005) rep(j, 2005) memo[i][j] = 0;
for (int i = 1; i <= K; i++) {
cout << comb(N - K + 1, i) * comb(K - 1, i - 1) << endl;
}
return 0;
}
| insert | 62 | 62 | 62 | 64 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
ll factx[22222];
ll factxx[22222];
ll xxcal(ll n, ll x) {
if (x == 0)
return 1;
return x % 2 == 0 ? xxcal((n * n) % mod, x / 2) : (n * xxcal(n, x - 1) % mod);
}
ll ncr(ll n, ll r) {
ll a = factx[n];
a *= factxx[r];
a %= mod;
a *= factxx[n - r];
a %= mod;
return a;
}
int main() {
factx[0] = 1;
factxx[0] = xxcal(factx[0], mod - 2);
for (ll i = 1; i <= 2222; i++) {
factx[i] = i * factx[i - 1] % mod;
factxx[i] = xxcal(factx[i], mod - 2);
}
long long int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
cout << (ncr(k - 1, i) * ncr(n - k + 1, i + 1)) % mod << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod 1000000007
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
ll factx[22222];
ll factxx[22222];
ll xxcal(ll n, ll x) {
if (x == 0)
return 1;
return x % 2 == 0 ? xxcal((n * n) % mod, x / 2) : (n * xxcal(n, x - 1) % mod);
}
ll ncr(ll n, ll r) {
if (n < r)
return 0;
ll a = factx[n];
a *= factxx[r];
a %= mod;
a *= factxx[n - r];
a %= mod;
return a;
}
int main() {
factx[0] = 1;
factxx[0] = xxcal(factx[0], mod - 2);
for (ll i = 1; i <= 2222; i++) {
factx[i] = i * factx[i - 1] % mod;
factxx[i] = xxcal(factx[i], mod - 2);
}
long long int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
cout << (ncr(k - 1, i) * ncr(n - k + 1, i + 1)) % mod << endl;
}
return 0;
}
| insert | 21 | 21 | 21 | 23 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) { return (!b ? a : gcd(b, a % b)); }
bool cmp(int a, int b) { return a > b; }
const ll N = 5e5 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (ll i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
ll inv(ll a) { return binpow(a, mod - 2); }
ll A(ll n, ll m) { return fac[n] * inv(fac[n - m]) % mod; }
ll C(ll n, ll m) { return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod; }
// const ll mod = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
const ld pi = 3.141592653589793;
void solve() {
ll n, k;
cin >> n >> k;
init();
for (ll i = 1; i <= k; i++) {
ll ans = C(n - k + 1, i) * C(k - 1, i - 1);
ans %= mod;
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) { return (!b ? a : gcd(b, a % b)); }
bool cmp(int a, int b) { return a > b; }
const ll N = 5e5 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (ll i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
ll inv(ll a) { return binpow(a, mod - 2); }
ll A(ll n, ll m) { return fac[n] * inv(fac[n - m]) % mod; }
ll C(ll n, ll m) { return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod; }
// const ll mod = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
const ld pi = 3.141592653589793;
void solve() {
ll n, k;
cin >> n >> k;
init();
for (ll i = 1; i <= k; i++) {
if (n - k + 1 < i) {
cout << 0 << endl;
continue;
}
ll ans = C(n - k + 1, i) * C(k - 1, i - 1);
ans %= mod;
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
} | insert | 51 | 51 | 51 | 55 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int INF = 1 << 30;
int comb[2010][2010];
void comb_table(int n) {
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % int(1e9 + 7);
}
}
}
}
int main() {
int n, k;
cin >> n >> k;
comb_table(2005);
for (int m = 1; m <= k; m++) {
ll red = ((comb[n - k - 1][m - 1] * 2) % int(1e9 + 7) +
(comb[n - k - 1][m - 2] + comb[n - k - 1][m]) % int(1e9 + 7)) %
int(1e9 + 7);
ll blue = (comb[k - 1][m - 1]) % int(1e9 + 7);
ll ans = (red * blue) % int(1e9 + 7);
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int INF = 1 << 30;
int comb[2010][2010];
void comb_table(int n) {
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % int(1e9 + 7);
}
}
}
}
int main() {
int n, k;
cin >> n >> k;
comb_table(2005);
if (n == k) {
for (int m = 1; m <= k; m++) {
if (m == 1)
cout << 1 << endl;
else
cout << 0 << endl;
}
} else {
for (int m = 1; m <= k; m++) {
ll red;
if (m == 1) {
red = ((comb[n - k - 1][m - 1] * 2) % int(1e9 + 7) +
(comb[n - k - 1][m]) % int(1e9 + 7)) %
int(1e9 + 7);
} else {
red = ((comb[n - k - 1][m - 1] * 2) % int(1e9 + 7) +
(comb[n - k - 1][m - 2] + comb[n - k - 1][m]) % int(1e9 + 7)) %
int(1e9 + 7);
}
ll blue = (comb[k - 1][m - 1]) % int(1e9 + 7);
ll ans = (red * blue) % int(1e9 + 7);
cout << ans << endl;
}
}
} | replace | 22 | 29 | 22 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
vector<i64> f(4010, 1);
for (i64 i = 2; i < 4010; i++)
f[i] = f[i - 1] * i % MOD;
i64 n, k;
cin >> n >> k;
for (i64 i = 1; i <= k; i++) {
i64 b = k - i, r = n - k - (i - 1);
cerr << b << " " << r << " " << f[b + i - 1] / f[b] / f[i - 1] << " "
<< f[r + i] / f[r] / f[i] << endl;
cout << (((f[b + i - 1] * modinv((f[b] * f[i - 1]) % MOD, MOD)) % MOD) *
((f[r + i] * modinv((f[r] * f[i]) % MOD, MOD)) % MOD)) %
MOD
<< endl;
}
return 0;
}
| #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
vector<i64> f(4010, 1);
for (i64 i = 2; i < 4010; i++)
f[i] = f[i - 1] * i % MOD;
i64 n, k;
cin >> n >> k;
for (i64 i = 1; i <= k; i++) {
i64 b = k - i, r = n - k - (i - 1);
if (0 <= r)
cout << (((f[b + i - 1] * modinv((f[b] * f[i - 1]) % MOD, MOD)) % MOD) *
((f[r + i] * modinv((f[r] * f[i]) % MOD, MOD)) % MOD)) %
MOD
<< endl;
else
cout << 0 << endl;
}
return 0;
}
| replace | 30 | 36 | 30 | 37 | 0 | 2 2 1 3
1 1 2 3
0 0 1 1
|
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ZERO_IQ \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define debug(x, y) \
cerr << (#x) << " " << (#y) << " is " << (x) << " " << (y) << endl
#define debug2(x, y, z) \
cerr << (#x) << " " << (#y) << " " << (#z) << " is " << (x) << " " << (y) \
<< " " << (z) << endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
const ll mod = 1e9 + 7;
vector<ll> fact(2003), inv(2003);
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
void calcFacAndInv(ll n) {
fact[0] = inv[0] = 1;
for (ll i = 1; i <= n; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (n < r)
return 0;
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
calcFacAndInv(2003);
for (int i = 1; i <= k; ++i) {
cout << 1LL * ((ncr(n - k + 1, i) * ncr(k - 1, i - 1)) % mod) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ZERO_IQ \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define debug(x, y) \
cerr << (#x) << " " << (#y) << " is " << (x) << " " << (y) << endl
#define debug2(x, y, z) \
cerr << (#x) << " " << (#y) << " " << (#z) << " is " << (x) << " " << (y) \
<< " " << (z) << endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
const ll mod = 1e9 + 7;
vector<ll> fact(2004), inv(2004);
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
void calcFacAndInv(ll n) {
fact[0] = inv[0] = 1;
for (ll i = 1; i <= n; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (n < r)
return 0;
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
calcFacAndInv(2003);
for (int i = 1; i <= k; ++i) {
cout << 1LL * ((ncr(n - k + 1, i) * ncr(k - 1, i - 1)) % mod) << endl;
}
return 0;
} | replace | 16 | 17 | 16 | 17 | -11 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
ll fac[MAXN];
ll inv(ll x) { return qpow(x, mod - 2, mod); }
ll cal(int n, int m) {
if (m < n)
return 0;
return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i <= 200000; ++i) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
ll res = 1;
res *= cal(k - 1, i - 1);
res %= mod;
res *= cal(n - k + 1, i);
res %= mod;
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
ll fac[MAXN];
ll inv(ll x) { return qpow(x, mod - 2, mod); }
ll cal(int n, int m) {
if (m > n)
return 0;
return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i <= 200000; ++i) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
ll res = 1;
res *= cal(k - 1, i - 1);
res %= mod;
res *= cal(n - k + 1, i);
res %= mod;
cout << res << endl;
}
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= _n; --i)
#define debug(x) cout << #x << " = " << x << endl
const int Mod = 1e9 + 7;
int n, k;
long long f[5005];
long long Pow(long long a, int b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
long long C(int m, int n) {
return 1LL * f[n] * Pow(f[m], Mod - 2) % Mod * Pow(f[n - m], Mod - 2) % Mod;
}
int main() {
f[0] = 1;
rep(i, 1, 3000) f[i] = f[i - 1] * i % Mod;
scanf("%d%d", &n, &k);
rep(i, 1, k) { printf("%lld\n", C(i - 1, k - 1) * C(i, n - k + 1) % Mod); }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= _n; --i)
#define debug(x) cout << #x << " = " << x << endl
const int Mod = 1e9 + 7;
int n, k;
long long f[5005];
long long Pow(long long a, int b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
long long C(int m, int n) {
if (n < m)
return 0;
return 1LL * f[n] * Pow(f[m], Mod - 2) % Mod * Pow(f[n - m], Mod - 2) % Mod;
}
int main() {
f[0] = 1;
rep(i, 1, 3000) f[i] = f[i - 1] * i % Mod;
scanf("%d%d", &n, &k);
rep(i, 1, k) { printf("%lld\n", C(i - 1, k - 1) * C(i, n - k + 1) % Mod); }
return 0;
}
| insert | 26 | 26 | 26 | 28 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using point = complex<double>;
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const double EPS = 1e-8;
const long long mod = 1e9 + 7;
const int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int N = 5e3 + 5;
const long long INF = 1e18;
int add(int a, int b) { return (a + b) % mod; }
int mul(int a, int b) { return (1ll * a * b) % mod; }
int fp(int b, int p) {
int ret = 1;
while (p) {
if (p & 1)
ret = mul(ret, b);
b = mul(b, b);
p >>= 1;
}
return ret;
}
int f[N];
int inv[N];
void init() {
f[0] = 1;
inv[0] = 1;
for (int i = 1; i < N; ++i) {
f[i] = mul(i, f[i - 1]);
inv[i] = fp(f[i], mod - 2);
}
}
int nCr(int n, int r) { return mul(f[n], mul(inv[n - r], inv[r])); }
/*
int dp[2005][2005][4];
int solve(int blue, int red,int lstBlue){
if(blue < 0 || red < 0)
return 0;
if(blue == 0 and red == 0)
return 1;
int &ret = dp[blue][red][lstBlue];
if(~ret)
return ret;
ret = 0;
if(lstBlue == 2){ // didn't put any ball yet
ret = add(ret, solve(blue - 1,red,1));
ret = add(ret, solve(blue,red - 1,0));
}else if(lstBlue == 1){ // last ball was blue
ret = add(ret,solve(blue,red - 1,0));
}else{ // last ball was red
ret = add(ret, solve(blue , red - 1,0));
ret = add(ret, solve(blue - 1,red,1));
}
return ret;
}*/
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
cout << mul(nCr(n - k + 1, i), nCr(k - 1, i - 1)) << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using point = complex<double>;
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const double EPS = 1e-8;
const long long mod = 1e9 + 7;
const int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int N = 5e3 + 5;
const long long INF = 1e18;
int add(int a, int b) { return (a + b) % mod; }
int mul(int a, int b) { return (1ll * a * b) % mod; }
int fp(int b, int p) {
int ret = 1;
while (p) {
if (p & 1)
ret = mul(ret, b);
b = mul(b, b);
p >>= 1;
}
return ret;
}
int f[N];
int inv[N];
void init() {
f[0] = 1;
inv[0] = 1;
for (int i = 1; i < N; ++i) {
f[i] = mul(i, f[i - 1]);
inv[i] = fp(f[i], mod - 2);
}
}
int nCr(int n, int r) { return mul(f[n], mul(inv[n - r], inv[r])); }
/*
int dp[2005][2005][4];
int solve(int blue, int red,int lstBlue){
if(blue < 0 || red < 0)
return 0;
if(blue == 0 and red == 0)
return 1;
int &ret = dp[blue][red][lstBlue];
if(~ret)
return ret;
ret = 0;
if(lstBlue == 2){ // didn't put any ball yet
ret = add(ret, solve(blue - 1,red,1));
ret = add(ret, solve(blue,red - 1,0));
}else if(lstBlue == 1){ // last ball was blue
ret = add(ret,solve(blue,red - 1,0));
}else{ // last ball was red
ret = add(ret, solve(blue , red - 1,0));
ret = add(ret, solve(blue - 1,red,1));
}
return ret;
}*/
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
if (n - k + 1 >= i and k >= i)
cout << mul(nCr(n - k + 1, i), nCr(k - 1, i - 1)) << '\n';
else
cout << 0 << '\n';
}
return 0;
}
| replace | 97 | 98 | 97 | 101 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1e9 + 7;
long long factrial[10000];
long long Repeat(long long a, long long cnt) {
if (cnt == 0)
return 1LL;
if (cnt % 2 == 1) {
long long x = Repeat(a, cnt / 2);
return (((a * x) % MOD) * x) % MOD;
} else {
long long x = Repeat(a, cnt / 2);
return (x * x) % MOD;
}
}
long long fact(long long a) {
if (a == 0)
return 1LL;
else if (factrial[a] != 0)
return factrial[a];
else
return factrial[a] = (a * fact(a - 1)) % MOD;
}
long long comb(long long a, long long b) {
long long fa, fb, fab;
fa = fact(a);
fb = fact(b);
fab = fact(a - b);
fb = Repeat(fb, MOD - 2);
fab = Repeat(fab, MOD - 2);
return (((fa * fb) % MOD) * fab) % MOD;
}
int main() {
ll N, K;
cin >> N >> K;
for (ll i = 1; i <= K; i++) {
cout << comb(K - 1, i - 1) * comb(N - K + 1, i) % MOD << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1e9 + 7;
long long factrial[10000];
long long Repeat(long long a, long long cnt) {
if (cnt == 0)
return 1LL;
if (cnt % 2 == 1) {
long long x = Repeat(a, cnt / 2);
return (((a * x) % MOD) * x) % MOD;
} else {
long long x = Repeat(a, cnt / 2);
return (x * x) % MOD;
}
}
long long fact(long long a) {
if (a == 0)
return 1LL;
else if (factrial[a] != 0)
return factrial[a];
else
return factrial[a] = (a * fact(a - 1)) % MOD;
}
long long comb(long long a, long long b) {
long long fa, fb, fab;
fa = fact(a);
fb = fact(b);
fab = fact(a - b);
fb = Repeat(fb, MOD - 2);
fab = Repeat(fab, MOD - 2);
return (((fa * fb) % MOD) * fab) % MOD;
}
int main() {
ll N, K;
cin >> N >> K;
for (ll i = 1; i <= K; i++) {
if (N - K + 1 >= i)
cout << comb(K - 1, i - 1) * comb(N - K + 1, i) % MOD << endl;
else
cout << 0 << endl;
}
return 0;
} | replace | 41 | 42 | 41 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int MOD = 1000000007;
int N, K;
cin >> N >> K;
unordered_map<int, vector<long long int>> comb;
comb[1].push_back(1LL);
comb[1].push_back(1LL);
for (int i = 2; i <= max(N - K + 1, K - 1); i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i].push_back(1LL);
} else {
long long int value = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
comb[i].push_back(value);
}
}
}
// for (int i = 1; i <= N; i++) {
// auto vec = comb[i];
// for (auto v: vec) {
// cout << v << ", ";
// }
// cout << endl;
// }
long long int ans;
for (int l = 1; l <= K; l++) {
if (l > N - K + 1) {
ans = 0;
} else {
// N-K+1_C_l * (K + l - 1)_C_K
ans = comb[N - K + 1][l] * comb[K - 1][l - 1] % MOD;
}
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int MOD = 1000000007;
int N, K;
cin >> N >> K;
unordered_map<int, vector<long long int>> comb;
comb[0].push_back(1LL);
comb[1].push_back(1LL);
comb[1].push_back(1LL);
for (int i = 2; i <= max(N - K + 1, K - 1); i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i].push_back(1LL);
} else {
long long int value = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
comb[i].push_back(value);
}
}
}
// for (int i = 1; i <= N; i++) {
// auto vec = comb[i];
// for (auto v: vec) {
// cout << v << ", ";
// }
// cout << endl;
// }
long long int ans;
for (int l = 1; l <= K; l++) {
if (l > N - K + 1) {
ans = 0;
} else {
// N-K+1_C_l * (K + l - 1)_C_K
ans = comb[N - K + 1][l] * comb[K - 1][l - 1] % MOD;
}
cout << ans << endl;
}
return 0;
}
| insert | 12 | 12 | 12 | 13 | 0 | |
p02990 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define ll long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES\n")
#define Yes puts("Yes\n")
#define NO puts("NO\n")
#define No puts("No\n")
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// ax+by=1の解
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// a^k mod p
int modpow(int a, int k, int p) {
int ans = 1;
while (k > 0) {
if (k % 2 == 1) {
ans *= a;
ans %= p;
}
a = (a * a) % p;
k = k / 2;
}
return ans;
}
// mod mでのaの逆数
ll mod_inverse(ll a, ll m) {
return modpow(a, m - 2, m);
// ll x, y;
// extgcd(a, m, x, y);
// return (m + x % m) % m;
}
int fac[20001];
// nCr mod p
ll combination(int n, int r, int p) {
if (r == 0 || r == n)
return 1;
// if (r > n / 2) r = n - r;
return (fac[n] * mod_inverse(fac[r], p) % p) * mod_inverse(fac[n - r], p) % p;
}
signed main() {
fac[0] = fac[1] = 1;
for (int i = 2; i <= 20000; i++)
fac[i] = (fac[i - 1] * i) % mod;
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cout << combination(N - K + 1, i, mod) * combination(K - 1, i - 1, mod) %
mod
<< endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define int long long
#define ll long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES\n")
#define Yes puts("Yes\n")
#define NO puts("NO\n")
#define No puts("No\n")
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// ax+by=1の解
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// a^k mod p
int modpow(int a, int k, int p) {
int ans = 1;
while (k > 0) {
if (k % 2 == 1) {
ans *= a;
ans %= p;
}
a = (a * a) % p;
k = k / 2;
}
return ans;
}
// mod mでのaの逆数
ll mod_inverse(ll a, ll m) {
return modpow(a, m - 2, m);
// ll x, y;
// extgcd(a, m, x, y);
// return (m + x % m) % m;
}
int fac[20001];
// nCr mod p
ll combination(int n, int r, int p) {
if (r == 0 || r == n)
return 1;
if (n < r)
return 0;
// if (r > n / 2) r = n - r;
return (fac[n] * mod_inverse(fac[r], p) % p) * mod_inverse(fac[n - r], p) % p;
}
signed main() {
fac[0] = fac[1] = 1;
for (int i = 2; i <= 20000; i++)
fac[i] = (fac[i - 1] * i) % mod;
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cout << combination(N - K + 1, i, mod) * combination(K - 1, i - 1, mod) %
mod
<< endl;
}
return 0;
}
| insert | 58 | 58 | 58 | 60 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define pii pair<int, int>
const int N = 2005, mod = 1e9 + 7;
int fact[N] = {1}, inv[N] = {1};
int pow_mod(int a, int b) {
if (b == 0) {
return 1;
}
int nesf = pow_mod(a, b / 2);
if (b % 2 == 0) {
return (nesf * nesf) % mod;
} else {
return a * nesf % mod * nesf % mod;
}
}
int comb(int n, int k) { return fact[n] * inv[k] % mod * inv[n - k] % mod; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
for (int i = 1; i < N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
inv[i] = pow_mod(fact[i], mod - 2);
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << comb(n - k + 1, i) * comb(k - 1, i - 1) % mod << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define pii pair<int, int>
const int N = 2005, mod = 1e9 + 7;
int fact[N] = {1}, inv[N] = {1};
int pow_mod(int a, int b) {
if (b == 0) {
return 1;
}
int nesf = pow_mod(a, b / 2);
if (b % 2 == 0) {
return (nesf * nesf) % mod;
} else {
return a * nesf % mod * nesf % mod;
}
}
int comb(int n, int k) {
if (k > n)
return 0ll;
return fact[n] * inv[k] % mod * inv[n - k] % mod;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
for (int i = 1; i < N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
inv[i] = pow_mod(fact[i], mod - 2);
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << comb(n - k + 1, i) * comb(k - 1, i - 1) % mod << "\n";
}
} | replace | 21 | 22 | 21 | 26 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef unsigned long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) { return ModPow(base, mod - 2, mod); }
ll Comb(ll n, ll r, ll fct[][4001]) {
assert(n > 2000);
return fct[0][n] * (fct[1][r] * fct[1][n - r] % MOD) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ll fct[2][4001];
fct[0][0] = fct[0][1] = 1;
for (ll i = 2; i <= n; fct[0][i] %= MOD, i++)
fct[0][i] = fct[0][i - 1] * (i % MOD);
for (ll i = 0; i <= n; i++)
fct[1][i] = ModPow(fct[0][i], MOD - 2, MOD);
for (ll i = 0; i < k; i++)
cout << (Comb(k - 1, i, fct) * Comb(n - k + 1, i + 1, fct)) % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef unsigned long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) { return ModPow(base, mod - 2, mod); }
ll Comb(ll n, ll r, ll fct[][4001]) {
assert(n <= 2000);
return fct[0][n] * (fct[1][r] * fct[1][n - r] % MOD) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ll fct[2][4001];
fct[0][0] = fct[0][1] = 1;
for (ll i = 2; i <= n; fct[0][i] %= MOD, i++)
fct[0][i] = fct[0][i - 1] * (i % MOD);
for (ll i = 0; i <= n; i++)
fct[1][i] = ModPow(fct[0][i], MOD - 2, MOD);
for (ll i = 0; i < k; i++)
cout << (Comb(k - 1, i, fct) * Comb(n - k + 1, i + 1, fct)) % MOD << endl;
return 0;
} | replace | 23 | 24 | 23 | 24 | -6 | 375b590f-a758-40ff-a7de-439594b70553.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02990/C++/s246491631.cpp:25: ll Comb(ll, ll, ll (*)[4001]): Assertion `n>2000' failed.
|
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(var, n) for (int var = 0; var < (n); ++var)
const ll MOD = 1e9 + 7;
ll fct[2001], inv[2001], fill[1000];
inline ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
inline void Fct(ll N) {
fct[0] = fct[1] = 1;
for (ll i = 2; i <= N; fct[i] %= MOD, i++)
fct[i] = fct[i - 1] * (i % MOD);
}
inline void ModInv(ll N) {
Fct(N);
inv[N] = ModPow(fct[N], MOD - 2, MOD);
for (ll i = N - 1; i >= 0; inv[i] %= MOD, i--)
inv[i] = inv[i + 1] * (i + 1);
}
inline ll Comb(ll n, ll r) {
return fct[n] * (inv[r] * inv[n - r] % MOD) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ModInv(n);
rep(i, k) cout << (Comb(k - 1, i) * Comb(n - k + 1, i + 1)) % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(var, n) for (int var = 0; var < (n); ++var)
const ll MOD = 1e9 + 7;
ll fct[2001], inv[2001], fill[2000];
inline ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
inline void Fct(ll N) {
fct[0] = fct[1] = 1;
for (ll i = 2; i <= N; fct[i] %= MOD, i++)
fct[i] = fct[i - 1] * (i % MOD);
}
inline void ModInv(ll N) {
Fct(N);
inv[N] = ModPow(fct[N], MOD - 2, MOD);
for (ll i = N - 1; i >= 0; inv[i] %= MOD, i--)
inv[i] = inv[i + 1] * (i + 1);
}
inline ll Comb(ll n, ll r) {
return fct[n] * (inv[r] * inv[n - r] % MOD) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ModInv(n);
rep(i, k) cout << (Comb(k - 1, i) * Comb(n - k + 1, i + 1)) % MOD << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02990 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll MOD = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 5000100;
// max=({});
// 条件式が真ならwhileの中身を回し続ける
// printf("%d\n", ans);
// pairの入力
// vector<pair<ll, ll>>work(n);
// rep(i, n) {
// ll a, b;
// cin >> a >> b;
// work[i] = make_pair(a, b);
// for(auto p:mp)(mapの探索)
// printf("%.10f\n",なんちゃら)
// 最大公約数
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)
return 0;
return (x / gcd(x, y) * y);
}
// 組み合わせの余りを求める
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll dx[4] = {0, 0, -1, 1};
ll dy[4] = {-1, 1, 0, 0};
ll dp[101010];
// union-find木について
ll par[101010];
ll rank2[101010];
void init(ll n) {
rep(i, n) {
par[i] = i;
rank2[i] = 0;
}
}
ll find(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank2[x] < rank2[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank2[x] == rank2[y]) {
rank2[x]++;
}
}
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// long longしか使わない
// 素数は1より大きい
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; ++i) {
COMinit();
ll ans = COM(n - k + 1, i);
ans %= MOD;
if (i != 1 && i != k)
ans *= COM(k - 1, i - 1);
ans %= MOD;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll MOD = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 5010;
// max=({});
// 条件式が真ならwhileの中身を回し続ける
// printf("%d\n", ans);
// pairの入力
// vector<pair<ll, ll>>work(n);
// rep(i, n) {
// ll a, b;
// cin >> a >> b;
// work[i] = make_pair(a, b);
// for(auto p:mp)(mapの探索)
// printf("%.10f\n",なんちゃら)
// 最大公約数
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)
return 0;
return (x / gcd(x, y) * y);
}
// 組み合わせの余りを求める
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll dx[4] = {0, 0, -1, 1};
ll dy[4] = {-1, 1, 0, 0};
ll dp[101010];
// union-find木について
ll par[101010];
ll rank2[101010];
void init(ll n) {
rep(i, n) {
par[i] = i;
rank2[i] = 0;
}
}
ll find(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank2[x] < rank2[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank2[x] == rank2[y]) {
rank2[x]++;
}
}
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// long longしか使わない
// 素数は1より大きい
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; ++i) {
COMinit();
ll ans = COM(n - k + 1, i);
ans %= MOD;
if (i != 1 && i != k)
ans *= COM(k - 1, i - 1);
ans %= MOD;
cout << ans << endl;
}
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
ll binpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
b /= 2;
}
return ans;
}
ll fact[2001];
void calcFactorial(ll n) {
fact[0] = 1;
for (ll i = 1; i <= n; ++i) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
}
ll ncr(ll n, ll r) {
ll ans = fact[n];
// cout<<fact[n]<<" ";
ll inverse = (fact[r] * fact[n - r]) % mod;
ans *= binpow(inverse, mod - 2);
// ans+=mod;
ans %= mod;
// cout<<ans<<endl;
return ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "w", stdout);
#endif
fast ll n, k;
cin >> n >> k;
calcFactorial(2000);
for (ll i = 1; i <= k; ++i) {
if (n - k + 1 < i) {
cout << 0 << endl;
continue;
}
ll ans = (ncr(n - k + 1, i) * ncr(k - 1, i - 1)) % mod;
cout << ans << endl;
}
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
ll binpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
b /= 2;
}
return ans;
}
ll fact[2001];
void calcFactorial(ll n) {
fact[0] = 1;
for (ll i = 1; i <= n; ++i) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
}
ll ncr(ll n, ll r) {
ll ans = fact[n];
// cout<<fact[n]<<" ";
ll inverse = (fact[r] * fact[n - r]) % mod;
ans *= binpow(inverse, mod - 2);
// ans+=mod;
ans %= mod;
// cout<<ans<<endl;
return ans;
}
int main() {
fast ll n, k;
cin >> n >> k;
calcFactorial(2000);
for (ll i = 1; i <= k; ++i) {
if (n - k + 1 < i) {
cout << 0 << endl;
continue;
}
ll ans = (ncr(n - k + 1, i) * ncr(k - 1, i - 1)) % mod;
cout << ans << endl;
}
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| replace | 40 | 44 | 40 | 41 | TLE | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int N = 5005;
namespace Modop {
ll modAdd(ll a, ll b) { return (a + b) % MOD; }
ll modSub(ll a, ll b) { return (((a - b) % MOD) + MOD) % MOD; }
ll modMul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
ll modInv(ll a) { return modExp(a, MOD - 2); }
ll modDiv(ll a, ll b) { return modMul(a, modInv(b)); }
} // namespace Modop
using namespace Modop;
int n, k;
ll fac[N], inv[N];
void pre() {
fac[1] = inv[1] = 1;
for (int i = 2; i < N; i++) {
fac[i] = modMul(fac[i - 1], i);
inv[i] = modInv(fac[i]);
}
}
ll combo(int n, int k) {
ll t = fac[n + k - 1];
ll b = modMul(inv[k], inv[n - 1]);
return max(modMul(t, b), 1ll);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
pre();
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << modMul(combo(i, k - i), combo(i + 1, n - k - (i - 1))) << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int N = 5005;
namespace Modop {
ll modAdd(ll a, ll b) { return (a + b) % MOD; }
ll modSub(ll a, ll b) { return (((a - b) % MOD) + MOD) % MOD; }
ll modMul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
ll modInv(ll a) { return modExp(a, MOD - 2); }
ll modDiv(ll a, ll b) { return modMul(a, modInv(b)); }
} // namespace Modop
using namespace Modop;
int n, k;
ll fac[N], inv[N];
void pre() {
fac[1] = inv[1] = 1;
for (int i = 2; i < N; i++) {
fac[i] = modMul(fac[i - 1], i);
inv[i] = modInv(fac[i]);
}
}
ll combo(int n, int k) {
ll t = fac[n + k - 1];
ll b = modMul(inv[k], inv[n - 1]);
return max(modMul(t, b), 1ll);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
pre();
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k - (i - 1) < 0)
cout << 0 << '\n';
else
cout << modMul(combo(i, k - i), combo(i + 1, n - k - (i - 1))) << '\n';
}
}
| replace | 59 | 60 | 59 | 63 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll pw(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1)
res = res * x % M;
x = x * x % M;
y >>= 1;
}
return res;
}
ll n, m, d[2005], in[2005];
ll cm(ll x, ll y) { return d[x] * in[x - y] % M * in[y] % M; }
int main(void) {
cin >> n >> m;
d[0] = 1, in[0] = 1;
for (ll i = 1; i <= 2004; i++)
d[i] = d[i - 1] * i % M, in[i] = pw(d[i], M - 2);
for (ll i = 1; i <= m; i++) {
cout << cm(m - 1, i - 1) * cm(n - m + 1, i) % M << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll pw(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1)
res = res * x % M;
x = x * x % M;
y >>= 1;
}
return res;
}
ll n, m, d[2005], in[2005];
ll cm(ll x, ll y) { return d[x] * in[x - y] % M * in[y] % M; }
int main(void) {
cin >> n >> m;
d[0] = 1, in[0] = 1;
for (ll i = 1; i <= 2004; i++)
d[i] = d[i - 1] * i % M, in[i] = pw(d[i], M - 2);
for (ll i = 1; i <= m; i++) {
if (n - m + 1 < i)
cout << 0 << endl;
else
cout << cm(m - 1, i - 1) * cm(n - m + 1, i) % M << endl;
}
}
| replace | 28 | 29 | 28 | 32 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
#define INF 999999999
#define itn ll
#define ednl endl
using namespace std;
typedef long long ll;
template <typename Typell> Typell G_C_D(Typell a, Typell b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return a;
}
template <typename Typell> Typell G_C_D(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = G_C_D(a, list[i]);
}
return a;
}
template <typename Typell> Typell L_C_M(Typell a, Typell b) {
if (a == 0 && b == 0)
return 0;
return a / G_C_D(a, b) * b;
}
template <typename Typell> Typell L_C_M(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = L_C_M(a, list[i]);
}
return a;
}
const int mod = 1000000007;
long long inv[9999999], fact[9999999], ifact[9999999];
long long comb(ll n, ll k) {
return fact[n] * ifact[k] % mod * ifact[n - k] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
inv[1] = fact[0] = fact[1] = ifact[0] = ifact[1] = 1;
for (int i = 2; i < 9999999; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
fact[i] = fact[i - 1] * i % mod;
ifact[i] = ifact[i - 1] * inv[i] % mod;
}
ll N, K;
cin >> N >> K;
ll B = K;
ll A = N - K;
for (int i = 1; i <= K; i++) {
ll ans = 0;
ans = comb(A + 1, i) * comb(B - 1, i - 1);
ans %= mod;
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
#define INF 999999999
#define itn ll
#define ednl endl
using namespace std;
typedef long long ll;
template <typename Typell> Typell G_C_D(Typell a, Typell b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
while (b != 0) {
a %= b;
if (a == 0)
return b;
b %= a;
}
return a;
}
template <typename Typell> Typell G_C_D(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = G_C_D(a, list[i]);
}
return a;
}
template <typename Typell> Typell L_C_M(Typell a, Typell b) {
if (a == 0 && b == 0)
return 0;
return a / G_C_D(a, b) * b;
}
template <typename Typell> Typell L_C_M(const std::vector<Typell> &list) {
Typell a = list[0];
for (size_t i = 1; i < list.size(); ++i) {
a = L_C_M(a, list[i]);
}
return a;
}
const int mod = 1000000007;
long long inv[9999999], fact[9999999], ifact[9999999];
long long comb(ll n, ll k) {
return fact[n] * ifact[k] % mod * ifact[n - k] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
inv[1] = fact[0] = fact[1] = ifact[0] = ifact[1] = 1;
for (int i = 2; i < 9999999; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
fact[i] = fact[i - 1] * i % mod;
ifact[i] = ifact[i - 1] * inv[i] % mod;
}
ll N, K;
cin >> N >> K;
ll B = K;
ll A = N - K;
for (int i = 1; i <= K; i++) {
ll ans = 0;
if (A + 1 >= i && B - 1 >= i - 1) {
ans = comb(A + 1, i) * comb(B - 1, i - 1);
} else
ans = 0;
ans %= mod;
cout << ans << endl;
}
} | replace | 70 | 71 | 70 | 74 | -11 | |
p02990 | C++ | Runtime Error | // A modular inverse based solution to
// compute nCr % p
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll fac[200000];
/* Iterative Function to calculate (x^y)%p
in O(log y) */
ll fact(int n) {
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % 1000000007;
return fac[n];
}
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
// Returns nCr % p using Fermat's little
// theorem.
ll nCrModPFermat(ll n, ll r, ll p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fact(n) * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
// Driver program
int main() {
ll a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++)
cout << (nCrModPFermat(a - b + 1, i, 1000000007) *
nCrModPFermat(b - 1, i - 1, 1000000007)) %
1000000007
<< endl;
return 0;
}
| // A modular inverse based solution to
// compute nCr % p
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll fac[200000];
/* Iterative Function to calculate (x^y)%p
in O(log y) */
ll fact(int n) {
fac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % 1000000007;
return fac[n];
}
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
// Returns nCr % p using Fermat's little
// theorem.
ll nCrModPFermat(ll n, ll r, ll p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fact(n) * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
// Driver program
int main() {
ll a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++)
if (a - b + 1 >= i)
cout << (nCrModPFermat(a - b + 1, i, 1000000007) *
nCrModPFermat(b - 1, i - 1, 1000000007)) %
1000000007
<< endl;
else
cout << 0 << endl;
return 0;
}
| replace | 56 | 61 | 56 | 63 | 0 | |
p02990 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MAX = 51000000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
COMinit();
ll ans = 0;
for (ll i = 1; i <= k; i++) {
cout << (COM(n - k + 1, i) % MOD) * (COM(k - 1, i - 1) % MOD) % MOD << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const ll INF = 1e18;
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << endl;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MAX = 10000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
COMinit();
ll ans = 0;
for (ll i = 1; i <= k; i++) {
cout << (COM(n - k + 1, i) % MOD) * (COM(k - 1, i - 1) % MOD) % MOD << endl;
}
return 0;
} | replace | 34 | 35 | 34 | 35 | MLE | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint table[2020];
void init() {
table[0] = table[1] = 1;
for (ll i = 2; i < 2020; i++) {
table[i] = table[i - 1] * i;
}
}
int main() {
int n, k;
cin >> n >> k;
init();
for (int c = 1; c <= k; c++) {
mint ans = 0;
mint b = table[k - 1] / table[c - 1] / table[k - 1 - (c - 1)];
mint a = table[n - k + 1] / table[n - k + 1 - c] / table[c];
ans = a * b;
cout << ans.x << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint table[2020];
void init() {
table[0] = table[1] = 1;
for (ll i = 2; i < 2020; i++) {
table[i] = table[i - 1] * i;
}
}
int main() {
int n, k;
cin >> n >> k;
init();
for (int c = 1; c <= k; c++) {
if (n - k + 1 - c < 0) {
cout << 0 << '\n';
continue;
}
mint ans = 0;
mint b = table[k - 1] / table[c - 1] / table[k - 1 - (c - 1)];
mint a = table[n - k + 1] / table[n - k + 1 - c] / table[c];
ans = a * b;
cout << ans.x << '\n';
}
return 0;
} | insert | 81 | 81 | 81 | 85 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
const ll MOD = 1000000007;
ll modInv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCrModFermat(ll n, ll r, ll mod) {
if (r == 0)
return 1;
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++) {
fac[i] = fac[i - 1] * i % mod;
}
return (fac[n] * modInv(fac[r], mod) % mod * modInv(fac[n - r], mod) % mod) %
mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, k;
cin >> n >> k;
ll c = n - k + 1;
for (ll i = 1; i <= k; i++) {
cout << nCrModFermat(c, i, MOD) * nCrModFermat(k - 1, i - 1, MOD) % MOD
<< endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
const ll MOD = 1000000007;
ll modInv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCrModFermat(ll n, ll r, ll mod) {
if (r == 0)
return 1;
ll fac[n + 1];
fac[0] = 1;
for (ll i = 1; i <= n; i++) {
fac[i] = fac[i - 1] * i % mod;
}
return (fac[n] * modInv(fac[r], mod) % mod * modInv(fac[n - r], mod) % mod) %
mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, k;
cin >> n >> k;
ll c = n - k + 1;
for (ll i = 1; i <= k; i++) {
if (n - k + 1 >= i)
cout << nCrModFermat(c, i, MOD) * nCrModFermat(k - 1, i - 1, MOD) % MOD
<< endl;
else {
cout << 0 << endl;
}
}
}
| replace | 45 | 47 | 45 | 51 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b % 2)
ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
const int N = 2e5 + 11;
const LL mod = 1e9 + 7;
int n, k, f[N], g[N];
void P() {
f[0] = 1;
for (int i = 1; i <= 2000; i++)
f[i] = (1ll * f[i - 1] * i) % mod;
g[2000] = powmod(f[2000], mod - 2, mod);
for (int i = 1999; i >= 0; i--)
g[i] = (1ll * g[i + 1] * (i + 1)) % mod;
}
int get(int x, int y) {
// if(x<=y)return 0;
return 1ll * f[x] * g[y] % mod * g[x - y] % mod;
}
int main() {
ios::sync_with_stdio(false);
P();
cin >> n >> k;
for (int i = 1; i <= k; i++)
cout << 1ll * get(k - 1, i - 1) * get(n - k + 1, i) % mod << endl;
return 0;
} | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b % 2)
ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
const int N = 2e5 + 11;
const LL mod = 1e9 + 7;
int n, k, f[N], g[N];
void P() {
f[0] = 1;
for (int i = 1; i <= 2000; i++)
f[i] = (1ll * f[i - 1] * i) % mod;
g[2000] = powmod(f[2000], mod - 2, mod);
for (int i = 1999; i >= 0; i--)
g[i] = (1ll * g[i + 1] * (i + 1)) % mod;
}
int get(int x, int y) {
if (x < y)
return 0;
return 1ll * f[x] * g[y] % mod * g[x - y] % mod;
}
int main() {
ios::sync_with_stdio(false);
P();
cin >> n >> k;
for (int i = 1; i <= k; i++)
cout << 1ll * get(k - 1, i - 1) * get(n - k + 1, i) % mod << endl;
return 0;
} | replace | 34 | 35 | 34 | 36 | 0 | |
p02990 | C++ | Runtime Error | // sept 17,2020
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int mod = 1e9 + 7;
const int MOD = 2019;
// to check if a no is prime or not?
bool isPrime(int n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
// minimum subaaray sum of size k-sliding window approach
int findSubarray(int arr[], int n, int k) {
int window_sum = 0;
int min_window = INT_MAX;
int last = 0;
for (int i = 0; i < n; i++) {
window_sum += arr[i];
if (i + 1 >= k) {
if (min_window > window_sum) {
min_window = window_sum;
last = i;
}
window_sum -= arr[i + 1 - k];
}
}
int sum = 0;
for (int i = last - k + 1; i <= last; i++) {
sum += arr[i];
}
return sum;
}
// finds the next permutation to given sequence of nos
int nextpermutation(vi v) {
vi t = v;
sort(all(t));
int x = 0;
while (true) {
x++;
if (t == v) {
return x;
}
next_permutation(all(t));
}
}
vector<int> factors(int n) {
// Note that this loop runs till square root
vi ans;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n == i * i)
ans.pb(i);
else {
ans.pb(i);
if (i != n / i)
ans.pb(n / i);
}
}
}
sort(all(ans));
return ans;
}
// Recursive C++ program to check if a string is subsequence of another string
bool isSubSequence(char str1[], char str2[], int m, int n) {
// Base Cases
if (m == 0)
return true;
if (n == 0)
return false;
// If last characters of two strings are matching
if (str1[m - 1] == str2[n - 1])
return isSubSequence(str1, str2, m - 1, n - 1);
// If last characters are not matching
return isSubSequence(str1, str2, m, n - 1);
}
void findDivisors(int n) {
int div[n + 1];
memset(div, 0, sizeof div);
for (int i = 1; i <= n; i++) {
for (int j = 1; j * i <= n; j++)
div[i * j]++;
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans += i * div[i];
cout << ans << endl;
}
int power(int x, int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
int modInverse(int n, int p) { return power(n, p - 2, p); }
// Returns nCr % p using Fermat's little
// theorem.
int nCr(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
int fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (fac[i - 1] * i) % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
double dist(int x1, int y1, int x2, int y2) {
double a = (x1 - x2) * (x1 - x2);
double b = (y1 - y2) * (y1 - y2);
return sqrt(a + b);
}
int maxSubArraySum(vi a, int size) {
int max_so_far = INT_MIN, max_ending_here = 0;
for (int i = 0; i < size; i++) {
max_ending_here = max_ending_here + a[i];
if (max_so_far < max_ending_here)
max_so_far = max_ending_here;
if (max_ending_here < 0)
max_ending_here = 0;
}
return max_so_far;
}
int min_modulo(int l, int r) {
if (r - l >= MOD)
return 0;
else {
int ans = MOD - 1;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % MOD);
}
}
return ans;
}
}
int digitSum(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return (res);
}
bool isPerfectSquare(double x) {
// Find floating point value of
// square root of x.
double sr = sqrt(x);
// If square root is an integer
return ((sr - floor(sr)) == 0);
}
signed main() {
fastio;
cout << fixed << setprecision(12);
int T;
T = 1;
// cin>>T;
f(tc, T) {
// cout<<"Case "<<tc+1<<":";
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
int a = nCr(n - k + 1, i, mod);
int b = nCr(k - 1, i - 1, mod);
int ans = (a * b) % mod;
print(ans)
}
}
return 0;
}
| // sept 17,2020
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int mod = 1e9 + 7;
const int MOD = 2019;
// to check if a no is prime or not?
bool isPrime(int n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
// minimum subaaray sum of size k-sliding window approach
int findSubarray(int arr[], int n, int k) {
int window_sum = 0;
int min_window = INT_MAX;
int last = 0;
for (int i = 0; i < n; i++) {
window_sum += arr[i];
if (i + 1 >= k) {
if (min_window > window_sum) {
min_window = window_sum;
last = i;
}
window_sum -= arr[i + 1 - k];
}
}
int sum = 0;
for (int i = last - k + 1; i <= last; i++) {
sum += arr[i];
}
return sum;
}
// finds the next permutation to given sequence of nos
int nextpermutation(vi v) {
vi t = v;
sort(all(t));
int x = 0;
while (true) {
x++;
if (t == v) {
return x;
}
next_permutation(all(t));
}
}
vector<int> factors(int n) {
// Note that this loop runs till square root
vi ans;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n == i * i)
ans.pb(i);
else {
ans.pb(i);
if (i != n / i)
ans.pb(n / i);
}
}
}
sort(all(ans));
return ans;
}
// Recursive C++ program to check if a string is subsequence of another string
bool isSubSequence(char str1[], char str2[], int m, int n) {
// Base Cases
if (m == 0)
return true;
if (n == 0)
return false;
// If last characters of two strings are matching
if (str1[m - 1] == str2[n - 1])
return isSubSequence(str1, str2, m - 1, n - 1);
// If last characters are not matching
return isSubSequence(str1, str2, m, n - 1);
}
void findDivisors(int n) {
int div[n + 1];
memset(div, 0, sizeof div);
for (int i = 1; i <= n; i++) {
for (int j = 1; j * i <= n; j++)
div[i * j]++;
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans += i * div[i];
cout << ans << endl;
}
int power(int x, int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
int modInverse(int n, int p) { return power(n, p - 2, p); }
// Returns nCr % p using Fermat's little
// theorem.
int nCr(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
int fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (fac[i - 1] * i) % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
double dist(int x1, int y1, int x2, int y2) {
double a = (x1 - x2) * (x1 - x2);
double b = (y1 - y2) * (y1 - y2);
return sqrt(a + b);
}
int maxSubArraySum(vi a, int size) {
int max_so_far = INT_MIN, max_ending_here = 0;
for (int i = 0; i < size; i++) {
max_ending_here = max_ending_here + a[i];
if (max_so_far < max_ending_here)
max_so_far = max_ending_here;
if (max_ending_here < 0)
max_ending_here = 0;
}
return max_so_far;
}
int min_modulo(int l, int r) {
if (r - l >= MOD)
return 0;
else {
int ans = MOD - 1;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % MOD);
}
}
return ans;
}
}
int digitSum(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return (res);
}
bool isPerfectSquare(double x) {
// Find floating point value of
// square root of x.
double sr = sqrt(x);
// If square root is an integer
return ((sr - floor(sr)) == 0);
}
signed main() {
fastio;
cout << fixed << setprecision(12);
int T;
T = 1;
// cin>>T;
f(tc, T) {
// cout<<"Case "<<tc+1<<":";
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
int a = 0;
int b = 0;
if (i <= n - k + 1)
a = nCr(n - k + 1, i, mod);
if (i - 1 <= k - 1)
b = nCr(k - 1, i - 1, mod);
int ans = (a * b) % mod;
print(ans)
}
}
return 0;
}
| replace | 223 | 225 | 223 | 229 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
int64_t fact[4013];
int64_t add_mod(int64_t a, int64_t b, int64_t m) { return (a + b) % m; }
int64_t sub_mod(int64_t a, int64_t b, int64_t m) { return (a - b + m) % m; }
int64_t mul_mod(int64_t a, int64_t b, int64_t m) { return (a * b) % m; }
int64_t pow_mod(int64_t a, int64_t b, int64_t m) {
int64_t res = 1, t = a;
while (b) {
if (b & 1)
res = mul_mod(res, t, m);
t = mul_mod(t, t, m);
b >>= 1;
}
return res;
}
int64_t div_mod(int64_t a, int64_t b, int64_t m) {
return mul_mod(a, pow_mod(b, m - 2, m), m);
}
int64_t ncr_mod(int64_t n, int64_t k, int64_t m) {
return div_mod(fact[n], mul_mod(fact[n - k], fact[k], m), m);
}
void precalc(int64_t m) {
fact[0] = 1;
for (int64_t i = 1; i < 4013; ++i)
fact[i] = mul_mod(fact[i - 1], i, m);
}
signed main() {
precalc(mod);
int64_t n, k;
cin >> n >> k;
for (int64_t moves = 1; moves <= k; ++moves)
cout << mul_mod(ncr_mod(k - 1, moves - 1, mod),
ncr_mod(n + 1 - k, moves, mod), mod)
<< '\n';
}
| #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
int64_t fact[4013];
int64_t add_mod(int64_t a, int64_t b, int64_t m) { return (a + b) % m; }
int64_t sub_mod(int64_t a, int64_t b, int64_t m) { return (a - b + m) % m; }
int64_t mul_mod(int64_t a, int64_t b, int64_t m) { return (a * b) % m; }
int64_t pow_mod(int64_t a, int64_t b, int64_t m) {
int64_t res = 1, t = a;
while (b) {
if (b & 1)
res = mul_mod(res, t, m);
t = mul_mod(t, t, m);
b >>= 1;
}
return res;
}
int64_t div_mod(int64_t a, int64_t b, int64_t m) {
return mul_mod(a, pow_mod(b, m - 2, m), m);
}
int64_t ncr_mod(int64_t n, int64_t k, int64_t m) {
return div_mod(fact[n], mul_mod(fact[n - k], fact[k], m), m);
}
void precalc(int64_t m) {
fact[0] = 1;
for (int64_t i = 1; i < 4013; ++i)
fact[i] = mul_mod(fact[i - 1], i, m);
}
signed main() {
precalc(mod);
int64_t n, k;
cin >> n >> k;
for (int64_t moves = 1; moves <= k; ++moves) {
if (moves <= n + 1 - k)
cout << mul_mod(ncr_mod(k - 1, moves - 1, mod),
ncr_mod(n + 1 - k, moves, mod), mod)
<< '\n';
else
cout << "0\n";
}
}
| replace | 42 | 46 | 42 | 50 | 0 | |
p02990 | C++ | 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;
}
} | /*
これを入れて実行
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;
}
} | replace | 105 | 106 | 105 | 106 | 0 | |
p02990 | C++ | Runtime Error | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll n, K, f[5000];
const ll MOD = 1e9 + 7;
ll qexp(ll x, ll e) {
if (e == 0)
return 1;
ll half = qexp(x, e / 2);
half *= half;
half %= MOD;
if (e & 1)
half *= x, half %= MOD;
return half;
}
ll mul_inv(ll x) { return qexp(x, MOD - 2); }
ll choose(ll n, ll k) {
if (n < k)
return 0;
return f[n] * mul_inv(f[k]) % MOD * mul_inv(f[n - k]) % MOD;
}
int main() {
FAST cin >> n >> K;
f[0] = f[1] = 1;
FOR(i, 2, 5000) f[i] = f[i - 1] * i % MOD;
FOR(k, 1, K + 1) {
ll b = K - k;
ll r = n - K - k + 1;
cout << (choose(k + b - 1, b) * choose(k + 1 + r - 1, r)) % MOD << '\n';
}
}
| #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll n, K, f[5000];
const ll MOD = 1e9 + 7;
ll qexp(ll x, ll e) {
if (e == 0)
return 1;
ll half = qexp(x, e / 2);
half *= half;
half %= MOD;
if (e & 1)
half *= x, half %= MOD;
return half;
}
ll mul_inv(ll x) { return qexp(x, MOD - 2); }
ll choose(ll n, ll k) {
if (n < k)
return 0;
return f[n] * mul_inv(f[k]) % MOD * mul_inv(f[n - k]) % MOD;
}
int main() {
FAST cin >> n >> K;
f[0] = f[1] = 1;
FOR(i, 2, 5000) f[i] = f[i - 1] * i % MOD;
FOR(k, 1, K + 1) {
ll b = K - k;
ll r = n - K - k + 1;
if (r < 0) {
cout << 0 << '\n';
continue;
}
cout << (choose(k + b - 1, b) * choose(k + 1 + r - 1, r)) % MOD << '\n';
}
}
| insert | 106 | 106 | 106 | 110 | 0 | |
p02990 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4001][4001];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4002][4002];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| replace | 88 | 89 | 88 | 89 | -11 | |
p02990 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4000][4000];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4030][4030];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| replace | 88 | 89 | 88 | 89 | -11 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll const INF = 1000000000000000000;
int const I_MAX = 2147483647;
ll const MOD = 1e9 + 7;
int const POW_MAX = 1e5;
int const N_MAX = 1e5;
// nCr
ll po[POW_MAX + 2];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll comb(int n, int r) {
if (!po[n]) {
po[0] = 1;
FOR(i, 1, n + 1) po[i] = po[i - 1] * i % MOD;
}
return (((po[n] * mod_inv(po[r])) % MOD) * mod_inv(po[n - r])) % MOD;
}
// greatest common divisor
ll gcd(ll a, ll b) {
while (a % b != 0) {
ll tmp = a;
a = b;
b = tmp % b;
}
return b;
}
int N, K;
int main() {
scanf("%d %d", &N, &K);
int boxes = N - K + 1;
for (int i = 1; i < K + 1; i++) {
ll x = comb(boxes, i);
ll y = comb(K - 1, i - 1);
printf("%lld\n", x * y % MOD);
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll const INF = 1000000000000000000;
int const I_MAX = 2147483647;
ll const MOD = 1e9 + 7;
int const POW_MAX = 1e5;
int const N_MAX = 1e5;
// nCr
ll po[POW_MAX + 2];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll comb(int n, int r) {
if (!po[n]) {
po[0] = 1;
FOR(i, 1, n + 1) po[i] = po[i - 1] * i % MOD;
}
return (((po[n] * mod_inv(po[r])) % MOD) * mod_inv(po[n - r])) % MOD;
}
// greatest common divisor
ll gcd(ll a, ll b) {
while (a % b != 0) {
ll tmp = a;
a = b;
b = tmp % b;
}
return b;
}
int N, K;
int main() {
scanf("%d %d", &N, &K);
int boxes = N - K + 1;
for (int i = 1; i < K + 1; i++) {
if (i > boxes) {
printf("0\n");
continue;
}
ll x = comb(boxes, i);
ll y = comb(K - 1, i - 1);
printf("%lld\n", x * y % MOD);
}
}
| insert | 65 | 65 | 65 | 69 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define SIZE 2001
#define MOD 1000000007
using namespace std;
long long dp[SIZE][SIZE];
void makePasTri(int n) {
dp[0][0] = 1;
for (int i = 1; i <= n + 1; i++) {
dp[i][0] = 1;
for (int j = 1; j <= i; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
makePasTri(N);
for (int i = 1; i <= K; i++) {
cout << dp[N - K + 1][i] * dp[K - 1][i - 1] % MOD << endl;
}
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define SIZE 2001
#define MOD 1000000007
using namespace std;
long long dp[SIZE][SIZE];
void makePasTri(int n) {
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][0] = 1;
for (int j = 1; j <= i; j++) {
dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
makePasTri(N);
for (int i = 1; i <= K; i++) {
cout << dp[N - K + 1][i] * dp[K - 1][i - 1] % MOD << endl;
}
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define repb(i, n) for (lli i = n - 1; i >= 0; i--)
#define pb push_back
#define mp make_pair
#define bg() begin()
#define en() end()
#define ft first
#define sc second
#define vect_lli_it vector<lli>::iterator
#define set_lli_it set<lli>::iterator
#define inf 1e18
#define all(X) X.begin(), X.end()
#define iterate(X) for (it = X.begin(); it != X.end(); it++)
#define mod 1000000007
lli combi(lli n, lli k) {
lli ans = 1;
k = k > n - k ? n - k : k;
lli j = 1;
for (; j <= k; j++, n--) {
if (n % j == 0) {
ans *= n / j;
} else if (ans % j == 0) {
ans = ans / j * n;
} else {
ans = (ans * n) / j;
}
}
return ans;
}
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli findlcm(vector<lli> arr, lli n) {
lli ans = arr[0];
for (lli i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
return ans;
}
lli power(lli x, lli y) {
lli res = 1; // Initialize result
x = x % mod; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % mod;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % mod;
}
return res;
}
// Returns n^(-1) mod p
lli modInverse(lli n) { return power(n, mod - 2); }
// Returns nCr % p using Fermat's little
// theorem.
lli fac[4001];
lli nCrModPFermat(lli n, lli r) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (((fac[n] * modInverse(fac[r])) % mod) * modInverse(fac[n - r]) %
mod) %
mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n, k;
cin >> n >> k;
fac[0] = 1;
for (lli i = 1; i <= n + k; i++) {
fac[i] = (fac[i - 1] * i) % mod;
// cout<<fac[i]<<" ";
}
// cout<<"\n";
lli red = n - k;
lli blue = k;
lli now = (red + 1);
cout << now << "\n";
for (lli mov = 2; mov <= k; mov++) {
lli red_b = red - (mov - 1);
now = ((nCrModPFermat(blue - mov + mov - 1, mov - 1)) *
(nCrModPFermat(red_b + mov + 1 - 1, mov))) %
mod;
cout << now << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define repb(i, n) for (lli i = n - 1; i >= 0; i--)
#define pb push_back
#define mp make_pair
#define bg() begin()
#define en() end()
#define ft first
#define sc second
#define vect_lli_it vector<lli>::iterator
#define set_lli_it set<lli>::iterator
#define inf 1e18
#define all(X) X.begin(), X.end()
#define iterate(X) for (it = X.begin(); it != X.end(); it++)
#define mod 1000000007
lli combi(lli n, lli k) {
lli ans = 1;
k = k > n - k ? n - k : k;
lli j = 1;
for (; j <= k; j++, n--) {
if (n % j == 0) {
ans *= n / j;
} else if (ans % j == 0) {
ans = ans / j * n;
} else {
ans = (ans * n) / j;
}
}
return ans;
}
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli findlcm(vector<lli> arr, lli n) {
lli ans = arr[0];
for (lli i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (gcd(arr[i], ans)));
return ans;
}
lli power(lli x, lli y) {
lli res = 1; // Initialize result
x = x % mod; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % mod;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % mod;
}
return res;
}
// Returns n^(-1) mod p
lli modInverse(lli n) { return power(n, mod - 2); }
// Returns nCr % p using Fermat's little
// theorem.
lli fac[4001];
lli nCrModPFermat(lli n, lli r) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (((fac[n] * modInverse(fac[r])) % mod) * modInverse(fac[n - r]) %
mod) %
mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n, k;
cin >> n >> k;
fac[0] = 1;
for (lli i = 1; i <= n + k; i++) {
fac[i] = (fac[i - 1] * i) % mod;
// cout<<fac[i]<<" ";
}
// cout<<"\n";
lli red = n - k;
lli blue = k;
lli now = (red + 1);
cout << now << "\n";
for (lli mov = 2; mov <= k; mov++) {
if (mov <= n - k + 1) {
lli red_b = red - (mov - 1);
now = ((nCrModPFermat(blue - mov + mov - 1, mov - 1)) *
(nCrModPFermat(red_b + mov + 1 - 1, mov))) %
mod;
cout << now << "\n";
} else
cout << "0\n";
}
return 0;
}
| replace | 97 | 102 | 97 | 105 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 10000;
using namespace std;
clock_t time_p = clock();
void dem() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
ll fac[N];
ll mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll fastExp(ll base, ll pow) {
ll res = 1;
while (pow > 0) {
if (pow & 1)
res = mul(res, base);
base = mul(base, base);
pow >>= 1;
}
return res;
}
ll Inv(ll base) { return fastExp(base, MOD - 2); }
void fact() {
fac[0] = 1;
for (int i = 1; i < N; ++i)
fac[i] = mul(fac[i - 1], i);
}
ll nCr(ll n, ll r) {
ll C = fac[n];
C = mul(C, Inv(fac[r]));
C = mul(C, Inv(fac[n - r]));
return C;
}
int main() {
fast_io();
fact();
int n, blue;
cin >> n >> blue;
int red = n - blue;
ll res = 0;
for (int i = 1; i <= blue; ++i) {
res = mul(nCr(red + 1, i), nCr(blue - 1, i - 1));
cout << res;
br
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 10000;
using namespace std;
clock_t time_p = clock();
void dem() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
ll fac[N];
ll mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll fastExp(ll base, ll pow) {
ll res = 1;
while (pow > 0) {
if (pow & 1)
res = mul(res, base);
base = mul(base, base);
pow >>= 1;
}
return res;
}
ll Inv(ll base) { return fastExp(base, MOD - 2); }
void fact() {
fac[0] = 1;
for (int i = 1; i < N; ++i)
fac[i] = mul(fac[i - 1], i);
}
ll nCr(ll n, ll r) {
ll C = fac[n];
C = mul(C, Inv(fac[r]));
C = mul(C, Inv(fac[n - r]));
return C;
}
int main() {
fast_io();
fact();
int n, blue;
cin >> n >> blue;
int red = n - blue;
ll res = 0;
for (int i = 1; i <= blue; ++i) {
if (n - blue - i + 1 < 0) {
cout << "0";
br continue;
}
res = mul(nCr(red + 1, i), nCr(blue - 1, i - 1));
cout << res;
br
}
return 0;
}
| insert | 60 | 60 | 60 | 64 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>> dp;
ll aCb(ll a, ll b) {
if (dp[a][b] != -1) {
return dp[a][b];
}
if (a == b) {
return 1;
} else if (b == 0) {
return 1;
} else if (b == 1) {
return a;
} else {
return dp[a][b] = (aCb(a - 1, b - 1) + aCb(a - 1, b)) % 1000000007;
}
}
int main() {
ll n, k;
cin >> n >> k;
ll ANS = 0;
dp.assign(n, vector<ll>(n, -1));
for (ll i = 1; i <= k; i++) {
if (n == k) {
if (i == 1) {
ANS = 1;
} else {
ANS = 0;
}
} else if (i == 1) {
ANS = n - k + 1;
} else {
ANS = aCb(k - 1, i - 1);
ANS %= 1000000007;
ANS *= aCb(n - k + 1, i);
ANS %= 1000000007;
}
cout << ANS << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>> dp;
ll aCb(ll a, ll b) {
if (dp[a][b] != -1) {
return dp[a][b];
}
if (a == b) {
return 1;
} else if (b == 0) {
return 1;
} else if (b == 1) {
return a;
} else {
return dp[a][b] = (aCb(a - 1, b - 1) + aCb(a - 1, b)) % 1000000007;
}
}
int main() {
ll n, k;
cin >> n >> k;
ll ANS = 0;
dp.assign(n, vector<ll>(n, -1));
for (ll i = 1; i <= k; i++) {
if (n == k) {
if (i == 1) {
ANS = 1;
} else {
ANS = 0;
}
} else if (i == 1) {
ANS = n - k + 1;
} else if (n - k + 1 < i) {
ANS = 0;
} else {
ANS = aCb(k - 1, i - 1);
ANS %= 1000000007;
ANS *= aCb(n - k + 1, i);
ANS %= 1000000007;
}
cout << ANS << endl;
}
}
| insert | 35 | 35 | 35 | 37 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long comb(long long m, long long r, vector<vector<long long>> &history) {
if (history[m][r] != -1) {
return history[m][r];
} else if (r == 0 || r == m) {
history[m][r] = 1;
return 1;
} else {
history[m][r] =
(comb(m - 1, r - 1, history) + comb(m - 1, r, history)) % 1000000007;
return history[m][r];
}
}
int main() {
long long n, k;
cin >> n >> k;
vector<vector<long long>> history(max(n - k + 2, k),
vector<long long>(k + 1, -1));
for (long long i = 1; i <= k; i++) {
cout << ((comb(n - k + 1, i, history) % 1000000007) *
(comb(k - 1, i - 1, history) % 1000000007)) %
1000000007
<< endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long comb(long long m, long long r, vector<vector<long long>> &history) {
if (r > m) {
return 0;
} else if (history[m][r] != -1) {
return history[m][r];
} else if (r == 0 || r == m) {
history[m][r] = 1;
return 1;
} else {
history[m][r] =
(comb(m - 1, r - 1, history) + comb(m - 1, r, history)) % 1000000007;
return history[m][r];
}
}
int main() {
long long n, k;
cin >> n >> k;
vector<vector<long long>> history(max(n - k + 2, k),
vector<long long>(k + 1, -1));
for (long long i = 1; i <= k; i++) {
cout << ((comb(n - k + 1, i, history) % 1000000007) *
(comb(k - 1, i - 1, history) % 1000000007)) %
1000000007
<< endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 7 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
class Pascal {
vector<vector<int>> C;
public:
Pascal() {}
Pascal(int n) {
n = n * 2 + 10;
C = vector<vector<int>>(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
}
}
int nCr(int n, int r) {
if (r < 0)
return 0;
return C[n][r];
}
int nrC(int n, int r) { return C[n + r][n]; }
};
int main() {
int n, K;
cin >> n >> K;
Pascal pas(n * 2);
for (int i = 1; i <= K; i++) {
if (n - K < i - 1) {
puts("0");
} else {
ll a = pas.nCr(K - 1, i - 1);
ll b =
(pas.nCr(n - K - 1, i) + pas.nCr(n - K - 1, i - 1) * 2 % MOD) % MOD +
pas.nCr(n - K - 1, i - 2);
b %= MOD;
printf("%lld\n", a * b % MOD);
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
class Pascal {
vector<vector<int>> C;
public:
Pascal() {}
Pascal(int n) {
n = n * 2 + 10;
C = vector<vector<int>>(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
}
}
int nCr(int n, int r) {
if (r < 0)
return 0;
return C[n][r];
}
int nrC(int n, int r) { return C[n + r][n]; }
};
int main() {
int n, K;
cin >> n >> K;
if (n == K) {
for (int i = 1; i <= K; i++) {
if (i == 1)
puts("1");
else
puts("0");
}
return 0;
}
Pascal pas(n * 2);
for (int i = 1; i <= K; i++) {
if (n - K < i - 1) {
puts("0");
} else {
ll a = pas.nCr(K - 1, i - 1);
ll b =
(pas.nCr(n - K - 1, i) + pas.nCr(n - K - 1, i - 1) * 2 % MOD) % MOD +
pas.nCr(n - K - 1, i - 2);
b %= MOD;
printf("%lld\n", a * b % MOD);
}
}
} | insert | 36 | 36 | 36 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'
template <typename T> using pq = priority_queue<T>;
template <typename T> using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
constexpr int MOD = 1e9 + 7;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vec>;
using ll = long long;
template <typename T1, typename T2>
ostream &operator<<(ostream &stream, const pair<T1, T2> &p) {
return stream << p.first << " " << p.second;
}
template <typename T> void print(const vector<vector<T>> matrix) {
repall(vec, matrix) print(vec);
}
template <typename T> void print(const vector<T> vec) {
unsigned int len = vec.size();
rep(i, len - 1) cout << vec[i] << ' ';
cout << vec[len - 1] << '\n';
}
template <typename Arg> void print(const Arg arg) { cout << arg << '\n'; }
template <typename Head, typename... Args>
void print(const Head head, const Args... args) {
cout << head << " ";
print(args...);
}
template <typename T> T sum_(vector<T> vec, T init = 0) {
return std::accumulate(all(vec), T(init));
}
void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }
template <typename T> void init(vector<T> &v) { rep(i, v.size()) cin >> v[i]; }
template <typename T, typename U> void init(vector<T> &v, vector<U> &w) {
assert(v.size() == w.size());
rep(i, v.size()) cin >> v[i] >> w[i];
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
class ModuloCombination {
using ll = long long;
ll mod, len;
std::vector<ll> f, rf;
ll inv(ll x);
public:
ModuloCombination(long long mod_ = 1000000007);
ll c(int n, int k);
ll getMod() { return mod; }
};
ll ModuloCombination::inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = y * y % mod;
k /= 2;
}
return res;
}
ModuloCombination::ModuloCombination(ll mod_)
: mod(mod_), len(101010), f(std::vector<ll>(len)),
rf(std::vector<ll>(len)) {
f[0] = 1;
for (int i = 0; i < len - 1; i++)
f[i + 1] = f[i] * (i + 1) % mod;
for (int i = 0; i < len; i++)
rf[i] = inv(f[i]);
}
ll ModuloCombination::c(int n, int k) {
ll a = f[n];
ll b = rf[n - k];
ll c = rf[k];
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >
signed main() {
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ModuloCombination com;
For(i, 1, k) { print((com.c(n - k + 1, i) * com.c(k - 1, i - 1)) % MOD); }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto &i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'
template <typename T> using pq = priority_queue<T>;
template <typename T> using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
constexpr int MOD = 1e9 + 7;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vec>;
using ll = long long;
template <typename T1, typename T2>
ostream &operator<<(ostream &stream, const pair<T1, T2> &p) {
return stream << p.first << " " << p.second;
}
template <typename T> void print(const vector<vector<T>> matrix) {
repall(vec, matrix) print(vec);
}
template <typename T> void print(const vector<T> vec) {
unsigned int len = vec.size();
rep(i, len - 1) cout << vec[i] << ' ';
cout << vec[len - 1] << '\n';
}
template <typename Arg> void print(const Arg arg) { cout << arg << '\n'; }
template <typename Head, typename... Args>
void print(const Head head, const Args... args) {
cout << head << " ";
print(args...);
}
template <typename T> T sum_(vector<T> vec, T init = 0) {
return std::accumulate(all(vec), T(init));
}
void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }
template <typename T> void init(vector<T> &v) { rep(i, v.size()) cin >> v[i]; }
template <typename T, typename U> void init(vector<T> &v, vector<U> &w) {
assert(v.size() == w.size());
rep(i, v.size()) cin >> v[i] >> w[i];
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
class ModuloCombination {
using ll = long long;
ll mod, len;
std::vector<ll> f, rf;
ll inv(ll x);
public:
ModuloCombination(long long mod_ = 1000000007);
ll c(int n, int k);
ll getMod() { return mod; }
};
ll ModuloCombination::inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = y * y % mod;
k /= 2;
}
return res;
}
ModuloCombination::ModuloCombination(ll mod_)
: mod(mod_), len(101010), f(std::vector<ll>(len)),
rf(std::vector<ll>(len)) {
f[0] = 1;
for (int i = 0; i < len - 1; i++)
f[i + 1] = f[i] * (i + 1) % mod;
for (int i = 0; i < len; i++)
rf[i] = inv(f[i]);
}
ll ModuloCombination::c(int n, int k) {
ll a = f[n];
ll b = rf[n - k];
ll c = rf[k];
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >
signed main() {
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ModuloCombination com;
For(i, 1, k) {
if (n - k + 1 < i)
print(0);
else
print((com.c(n - k + 1, i) * com.c(k - 1, i - 1)) % MOD);
}
return 0;
}
| replace | 110 | 111 | 110 | 116 | 0 | |
p02990 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
vector<long long> fc(300001);
vector<long long> ifc(300001);
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < 100000; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod;
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod;
}
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*ここから*/
int main() {
ll K, N;
cin >> N >> K;
ll Red = N - K;
for (int i = 1; i <= Red + 1; i++) {
ull ans =
(Combination(Red + 1, i) % mod) * (Combination(K - 1, i - 1) % mod);
ans %= mod;
cout << ans << endl;
if (i == K) {
break;
}
}
if (Red + 1 < K) {
for (int i = 0; i < K - Red - 1; i++) {
cout << 0 << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
vector<long long> fc(300001);
vector<long long> ifc(300001);
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < 10000; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod;
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod;
}
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*ここから*/
int main() {
ll K, N;
cin >> N >> K;
ll Red = N - K;
for (int i = 1; i <= Red + 1; i++) {
ull ans =
(Combination(Red + 1, i) % mod) * (Combination(K - 1, i - 1) % mod);
ans %= mod;
cout << ans << endl;
if (i == K) {
break;
}
}
if (Red + 1 < K) {
for (int i = 0; i < K - Red - 1; i++) {
cout << 0 << endl;
}
}
return 0;
} | replace | 95 | 96 | 95 | 96 | TLE | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll moP(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
moC(res, *, x);
moC(x, *, x);
n >>= 1;
}
return res;
}
ll fa[2020], rfa[2020];
ll C(ll n, ll k) {
if (k == 0)
return 1;
if (n == k)
return 1;
return fa[n] * rfa[n - k] % MOD * rfa[k] % MOD;
}
int main(void) {
ll N, K;
cin >> N >> K;
ll i;
fa[0] = 1;
rfa[0] = 1;
for (i = 1; i <= 2000; i++) {
fa[i] = i * fa[i - 1] % MOD;
rfa[i] = moP(fa[i], MOD - 2);
}
for (i = 1; i <= K; i++) {
pt(C(N - K + 1, i) * C(K - 1, i - 1) % MOD);
}
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 1e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll moP(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
moC(res, *, x);
moC(x, *, x);
n >>= 1;
}
return res;
}
ll fa[2020], rfa[2020];
ll C(ll n, ll k) {
if (n < k)
return 0;
if (k < 0)
return 0;
if (k == 0)
return 1;
if (n == k)
return 1;
return fa[n] * rfa[n - k] % MOD * rfa[k] % MOD;
}
int main(void) {
ll N, K;
cin >> N >> K;
ll i;
fa[0] = 1;
rfa[0] = 1;
for (i = 1; i <= 2000; i++) {
fa[i] = i * fa[i - 1] % MOD;
rfa[i] = moP(fa[i], MOD - 2);
}
for (i = 1; i <= K; i++) {
pt(C(N - K + 1, i) * C(K - 1, i - 1) % MOD);
}
}
| insert | 41 | 41 | 41 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
ll fact[N], inv_fact[N];
const ll mod = 1e9 + 7;
ll mul(ll a, ll b) { return (a * b) % mod; }
ll fp(ll base, ll pw) {
if (pw == 1)
return base;
if (base == 0)
return 0;
if (pw == 0)
return 1;
ll x = fp(base, pw / 2);
x = mul(x, x);
if (pw & 1)
x = mul(x, base);
return x;
}
void build() {
fact[0] = inv_fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(i, fact[i - 1]);
inv_fact[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
ll A = fact[n];
ll B = mul(inv_fact[r], inv_fact[n - r]);
return mul(A, B);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
build();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++)
cout << mul(ncr(n - k + 1, i), ncr(k - 1, i - 1)) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
ll fact[N], inv_fact[N];
const ll mod = 1e9 + 7;
ll mul(ll a, ll b) { return (a * b) % mod; }
ll fp(ll base, ll pw) {
if (pw == 1)
return base;
if (base == 0)
return 0;
if (pw == 0)
return 1;
ll x = fp(base, pw / 2);
x = mul(x, x);
if (pw & 1)
x = mul(x, base);
return x;
}
void build() {
fact[0] = inv_fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(i, fact[i - 1]);
inv_fact[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (r > n)
return 0;
ll A = fact[n];
ll B = mul(inv_fact[r], inv_fact[n - r]);
return mul(A, B);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
build();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++)
cout << mul(ncr(n - k + 1, i), ncr(k - 1, i - 1)) << '\n';
return 0;
} | insert | 28 | 28 | 28 | 30 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
//-------------------------------------------
ll mod = 1000000007; // mod1000000007を扱うケース
//-------------------------------------------
//--------------------------------------------
// 逆元の計算 フェルマーの小定理の利用,繰り返し二乗法
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (
k) { // 2進数表記に直して累乗を計算する（繰り返し二乗法）
if (k & 1)
res = (res * y) % mod; //& ビットAnd、左辺と右辺のビットを合成し、互いに 1
//のビットを 1 とする。
// 11111111 と 10101010
// (16進数で、FFとAA),11111111 & 10101010
// は、10101010
y = (y * y) % mod;
k /= 2; // 2進数の桁をずらすことに対応している
// 2^0の後は2^1,2^2...といった具合
}
return res;
}
//-----------------------------------------------
// 階乗の累積和を計算しておく。fの要素の数は問題によって変えよう。
// 逆元もあらかじめ計算してしまうことで高速化できる。
// 逆元を求める関数を呼び出す回数を1回に抑えてより高速化
ll f[2010], rf[2010];
void init() {
f[0] = 1;
rep(i, 1, 2010) f[i] = (f[i - 1] * i) % mod;
rf[2010 - 1] = inv(f[2010 - 1]);
rrep(i, 2010 - 2, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;
}
//-------------------------------------------------
// nCrを求める関数
ll C(int n, int k) {
ll a = f[n]; //=n!
ll b = rf[n - k]; //=(n-k)!
ll c = rf[k]; //=k!
ll bc = (b * c) % mod;
return (a * bc) % mod; // 割り算ではなく逆元を用いてる（modの処理のため）
}
int main() {
init();
int n, k;
ll ans;
cin >> n >> k;
rep(i, 1, k + 1) {
if (k == n && i == 1)
ans = 1;
else {
if (k == n && i != 1)
ans = 0;
else {
ans = C(k - 1, i - 1) * C(n - k + 1, i) % mod;
}
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
//-------------------------------------------
ll mod = 1000000007; // mod1000000007を扱うケース
//-------------------------------------------
//--------------------------------------------
// 逆元の計算 フェルマーの小定理の利用,繰り返し二乗法
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (
k) { // 2進数表記に直して累乗を計算する（繰り返し二乗法）
if (k & 1)
res = (res * y) % mod; //& ビットAnd、左辺と右辺のビットを合成し、互いに 1
//のビットを 1 とする。
// 11111111 と 10101010
// (16進数で、FFとAA),11111111 & 10101010
// は、10101010
y = (y * y) % mod;
k /= 2; // 2進数の桁をずらすことに対応している
// 2^0の後は2^1,2^2...といった具合
}
return res;
}
//-----------------------------------------------
// 階乗の累積和を計算しておく。fの要素の数は問題によって変えよう。
// 逆元もあらかじめ計算してしまうことで高速化できる。
// 逆元を求める関数を呼び出す回数を1回に抑えてより高速化
ll f[2010], rf[2010];
void init() {
f[0] = 1;
rep(i, 1, 2010) f[i] = (f[i - 1] * i) % mod;
rf[2010 - 1] = inv(f[2010 - 1]);
rrep(i, 2010 - 2, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;
}
//-------------------------------------------------
// nCrを求める関数
ll C(int n, int k) {
ll a = f[n]; //=n!
ll b = rf[n - k]; //=(n-k)!
ll c = rf[k]; //=k!
ll bc = (b * c) % mod;
return (a * bc) % mod; // 割り算ではなく逆元を用いてる（modの処理のため）
}
int main() {
init();
int n, k;
ll ans;
cin >> n >> k;
rep(i, 1, k + 1) {
if (k == n && i == 1)
ans = 1;
else {
if (i > n - k + 1)
ans = 0;
else {
ans = C(k - 1, i - 1) * C(n - k + 1, i) % mod;
}
}
cout << ans << endl;
}
}
| replace | 61 | 62 | 61 | 62 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll fact[2005];
ll inv[2005];
ll inv2[2005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
fact[0] = 1;
for (int i = 1; i < 2005; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
}
inv[1] = 1;
inv2[0] = 1;
inv2[1] = 1;
for (int i = 2; i <= 2000; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
inv2[i] = inv2[i - 1] * inv[i] % mod;
}
for (int i = 1; i <= k; i++) {
ll x = fact[k - 1] * inv2[i - 1];
x %= mod;
x = x * inv2[k - i];
x %= mod;
ll y = fact[n - k + 1] * inv2[i];
y %= mod;
y = y * inv2[n - k + 1 - i];
y %= mod;
ll res = x * y;
res %= mod;
cout << res << endl;
}
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll fact[2005];
ll inv[2005];
ll inv2[2005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
fact[0] = 1;
for (int i = 1; i < 2005; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
}
inv[1] = 1;
inv2[0] = 1;
inv2[1] = 1;
for (int i = 2; i <= 2000; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
inv2[i] = inv2[i - 1] * inv[i] % mod;
}
for (int i = 1; i <= k; i++) {
ll x;
if (k < i)
x = 0;
else {
x = fact[k - 1] * inv2[i - 1];
x %= mod;
x = x * inv2[k - i];
x %= mod;
}
ll y = 0;
if (n - k + 1 >= i) {
y = fact[n - k + 1] * inv2[i];
y %= mod;
y = y * inv2[n - k + 1 - i];
y %= mod;
}
ll res = x * y;
res %= mod;
cout << res << endl;
}
return 0;
}
| replace | 41 | 49 | 41 | 58 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 2e9;
const int MOD = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) { (this->x = (x + MOD)) %= MOD; }
mint &operator+=(const mint a) {
if ((this->x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((this->x += MOD - a.x) >= MOD)
this->x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(this->x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
rep(i, 0, 4000) {
rep(j, 0, i + 1) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
mint f2(int n, int k) { return comb(n + k - 1, k - 1); }
mint f(int n, int k) {
if (n < k)
return 0;
return f2(n - k, k);
}
int main() {
init();
int n, k;
cin >> n >> k;
rep(i, 1, k + 1) {
mint blue = f(k, i);
mint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
mint ans = blue * red;
printf("%lld\n", ans.x);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 2e9;
const int MOD = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) { (this->x = (x + MOD)) %= MOD; }
mint &operator+=(const mint a) {
if ((this->x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((this->x += MOD - a.x) >= MOD)
this->x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(this->x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
rep(i, 0, 4000) {
rep(j, 0, i + 1) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
mint f2(int n, int k) { return comb(n + k - 1, k - 1); }
mint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
init();
int n, k;
cin >> n >> k;
rep(i, 1, k + 1) {
mint blue = f(k, i);
mint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
mint ans = blue * red;
printf("%lld\n", ans.x);
}
return 0;
} | insert | 85 | 85 | 85 | 89 | -11 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define N (1000000000 + 7)
typedef long long ll;
using namespace std;
struct edge {
ll to;
};
ll kaijo[100010];
void init() {
kaijo[0] = 1;
for (ll i = 1; i <= 100000; i++)
kaijo[i] = (kaijo[i - 1] * i) % N;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % N;
y = ((y % N) * (y % N)) % N;
k /= 2;
}
return res;
}
ll Comb(ll n, ll k) {
// if (n < 0 || k < 0 || (n - k) < 0)return 0;
ll b = kaijo[n];
ll c = kaijo[n - k];
ll d = kaijo[k];
ll cd = (c * d) % N;
return ((b % N) * (inv(cd)) % N) % N;
}
int main(void) {
ll n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
if (i == 1) {
cout << n - k + 1 << endl;
} else {
if (i == k) {
cout << Comb(n - k + 1, k) << endl;
} else
cout << (((Comb(n - k - 1 + 2, i) * Comb((k - 1), i)) % N) * kaijo[i]) %
N
<< endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define N (1000000000 + 7)
typedef long long ll;
using namespace std;
struct edge {
ll to;
};
ll kaijo[100010];
void init() {
kaijo[0] = 1;
for (ll i = 1; i <= 100000; i++)
kaijo[i] = (kaijo[i - 1] * i) % N;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % N;
y = ((y % N) * (y % N)) % N;
k /= 2;
}
return res;
}
ll Comb(ll n, ll k) {
// if (n < 0 || k < 0 || (n - k) < 0)return 0;
ll b = kaijo[n];
ll c = kaijo[n - k];
ll d = kaijo[k];
ll cd = (c * d) % N;
return ((b % N) * (inv(cd)) % N) % N;
}
int main(void) {
ll n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
if (i == 1) {
cout << n - k + 1 << endl;
} else {
if (i == k) {
if (n - k + 1 >= k)
cout << Comb(n - k + 1, k) << endl;
else
cout << 0 << endl;
} else {
if (n - k + 1 >= i)
cout << (Comb(n - k - 1 + 2, i) * Comb((k - 1), i - 1)) % N << endl;
else
cout << 0 << endl;
}
}
}
return 0;
} | replace | 49 | 54 | 49 | 59 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod =
1000000007; // 出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
#define N_MAX 201010
ll f[N_MAX], rf[N_MAX];
ll pow(ll x, ll n) { // xのn乗 (mod m)
ll res = 1;
if (n > 0) {
res = pow(x, n / 2);
if (n % 2 == 0) {
res = (res * res) % mod;
} else {
res = (((res * res) % mod) * x) % mod;
}
}
return res;
}
void init() {
f[0] = 1;
for (int i = 1; i < N_MAX; i++) {
f[i] = (i * f[i - 1]) % mod;
}
for (int i = 0; i < N_MAX; i++) {
rf[i] = pow(f[i], mod - 2);
}
}
ll com(ll n, ll k) {
ll a = f[n];
ll b = rf[k];
ll c = rf[n - k];
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans = com(n - k + 1, i) * com(k - 1, i - 1);
ans %= mod;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod =
1000000007; // 出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 1152921504606846976
#define N_MAX 201010
ll f[N_MAX], rf[N_MAX];
ll pow(ll x, ll n) { // xのn乗 (mod m)
ll res = 1;
if (n > 0) {
res = pow(x, n / 2);
if (n % 2 == 0) {
res = (res * res) % mod;
} else {
res = (((res * res) % mod) * x) % mod;
}
}
return res;
}
void init() {
f[0] = 1;
for (int i = 1; i < N_MAX; i++) {
f[i] = (i * f[i - 1]) % mod;
}
for (int i = 0; i < N_MAX; i++) {
rf[i] = pow(f[i], mod - 2);
}
}
ll com(ll n, ll k) {
ll a = f[n];
ll b = rf[k];
ll c = rf[n - k];
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main() {
ll n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans;
if (n - k + 1 >= i) {
ans = com(n - k + 1, i) * com(k - 1, i - 1);
} else {
ans = 0;
}
ans %= mod;
cout << ans << endl;
}
} | replace | 53 | 54 | 53 | 59 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
const int M = 2005;
const int MO = 1e9 + 7;
int inv[M], fa[M], ifa[M];
int add(int x, int y) {
x += y;
if (x >= MO)
x -= MO;
return x;
}
int mul(int x, int y) { return 1LL * x * y % MO; }
void init() {
fa[0] = ifa[0] = 1;
inv[1] = fa[1] = ifa[1] = 1;
for (int i = 2; i < M; i++) {
fa[i] = mul(fa[i - 1], i);
inv[i] = mul(MO - MO / i, inv[MO % i]);
ifa[i] = mul(inv[i], ifa[i - 1]);
}
}
int qp(int x, int n) {
int ans = 1;
while (n) {
if (n & 1)
ans = mul(ans, x);
x = mul(x, x);
n >>= 1;
}
return ans;
}
int C(int n, int m) { return mul(mul(fa[n], ifa[m]), ifa[n - m]); }
int main() {
init();
int n, k;
scanf("%d%d", &n, &k);
n -= k;
for (int i = 1; i <= k; i++) {
int ans = C(k - 1, i - 1);
ans = mul(ans, C(n + 1, i));
printf("%d\n", ans);
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
const int M = 2005;
const int MO = 1e9 + 7;
int inv[M], fa[M], ifa[M];
int add(int x, int y) {
x += y;
if (x >= MO)
x -= MO;
return x;
}
int mul(int x, int y) { return 1LL * x * y % MO; }
void init() {
fa[0] = ifa[0] = 1;
inv[1] = fa[1] = ifa[1] = 1;
for (int i = 2; i < M; i++) {
fa[i] = mul(fa[i - 1], i);
inv[i] = mul(MO - MO / i, inv[MO % i]);
ifa[i] = mul(inv[i], ifa[i - 1]);
}
}
int qp(int x, int n) {
int ans = 1;
while (n) {
if (n & 1)
ans = mul(ans, x);
x = mul(x, x);
n >>= 1;
}
return ans;
}
int C(int n, int m) {
if (n < m)
return 0;
return mul(mul(fa[n], ifa[m]), ifa[n - m]);
}
int main() {
init();
int n, k;
scanf("%d%d", &n, &k);
n -= k;
for (int i = 1; i <= k; i++) {
int ans = C(k - 1, i - 1);
ans = mul(ans, C(n + 1, i));
printf("%d\n", ans);
}
return 0;
} | replace | 38 | 39 | 38 | 43 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int f[12001];
int fi[12001];
int n, k;
int m(int a, int b) { return (a * b) % mod; }
int fp(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
int iv(int x) { return fp(x, mod - 2); }
int c(int x, int y) { return m(f[y], m(fi[x], fi[y - x])); }
int ck(int x, int y) { return c(y - 1, x + y - 1); }
signed main() {
cin >> n >> k;
f[0] = 1;
for (int i = 1; i <= 10000; i++)
f[i] = m(f[i - 1], i);
fi[10000] = iv(f[10000]);
for (int i = 9999; i >= 0; i--)
fi[i] = m(fi[i + 1], (i + 1));
// cout << "db\n";
// cout << ck(3,1) << endl;
// cout << c(0,3) << endl;
// cout << "edb\n";
for (int i = 1; i <= k; i++) {
// if(n - k - (i + 1 - 2) < 0) cout << "0\n";
cout << m(ck(k - i, i), ck(n - k - (i + 1 - 2), i + 1)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int f[12001];
int fi[12001];
int n, k;
int m(int a, int b) { return (a * b) % mod; }
int fp(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
int iv(int x) { return fp(x, mod - 2); }
int c(int x, int y) { return m(f[y], m(fi[x], fi[y - x])); }
int ck(int x, int y) { return c(y - 1, x + y - 1); }
signed main() {
cin >> n >> k;
f[0] = 1;
for (int i = 1; i <= 10000; i++)
f[i] = m(f[i - 1], i);
fi[10000] = iv(f[10000]);
for (int i = 9999; i >= 0; i--)
fi[i] = m(fi[i + 1], (i + 1));
// cout << "db\n";
// cout << ck(3,1) << endl;
// cout << c(0,3) << endl;
// cout << "edb\n";
for (int i = 1; i <= k; i++) {
if (n - k - (i + 1 - 2) < 0)
cout << "0\n";
else
cout << m(ck(k - i, i), ck(n - k - (i + 1 - 2), i + 1)) << endl;
}
} | replace | 36 | 38 | 36 | 40 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll c[30010][3010];
void init_triangle() {
c[0][0] = 1;
rep(i, 3000) rep(j, 3000) {
if (j > i)
break;
c[i + 1][j] = (c[i + 1][j] + c[i][j]) % MOD;
c[i + 1][j + 1] = (c[i + 1][j + 1] + c[i][j]) % MOD;
}
}
ll f(int n, int m) {
if (n < m)
return 0;
return c[n - 1][m - 1];
}
int main() {
init_triangle();
int n, k;
cin >> n >> k;
int num_blue = k;
int num_red = n - k;
rep(i, k + 1) {
if (i == 0)
continue;
ll blue = f(num_blue, i);
int res = 0;
res = (res + blue * f(num_red, i - 1 + 0)) % MOD;
res = (res + blue * f(num_red, i - 1 + 1)) % MOD;
res = (res + blue * f(num_red, i - 1 + 1)) % MOD;
res = (res + blue * f(num_red, i - 1 + 2)) % MOD;
cout << res << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll c[30010][3010];
void init_triangle() {
c[0][0] = 1;
rep(i, 3000) rep(j, 3000) {
if (j > i)
break;
c[i + 1][j] = (c[i + 1][j] + c[i][j]) % MOD;
c[i + 1][j + 1] = (c[i + 1][j + 1] + c[i][j]) % MOD;
}
}
ll f(int n, int m) {
if (n < m)
return 0;
if (n == 0 and m == 0)
return 1;
return c[n - 1][m - 1];
}
int main() {
init_triangle();
int n, k;
cin >> n >> k;
int num_blue = k;
int num_red = n - k;
rep(i, k + 1) {
if (i == 0)
continue;
ll blue = f(num_blue, i);
int res = 0;
res = (res + blue * f(num_red, i - 1 + 0)) % MOD;
res = (res + blue * f(num_red, i - 1 + 1)) % MOD;
res = (res + blue * f(num_red, i - 1 + 1)) % MOD;
res = (res + blue * f(num_red, i - 1 + 2)) % MOD;
cout << res << endl;
}
} | insert | 22 | 22 | 22 | 24 | -11 | |
p02990 | C++ | Runtime Error | #include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
long long fanc[2009], inv_fanc[2009];
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
void fanc_list() {
fanc[0] = 1;
fanc[1] = 1;
inv_fanc[0] = 1;
inv_fanc[1] = 1;
for (int i = 2; i <= 2000; i++) {
fanc[i] = (i * fanc[i - 1]) % MOD;
inv_fanc[i] = modinv(fanc[i], MOD);
}
}
long long combi(long long n, long long k) {
return ((fanc[n] * inv_fanc[n - k]) % MOD) * inv_fanc[k] % MOD;
}
int main() {
long long n, k;
cin >> n >> k;
fanc_list();
for (long long i = 1; i <= k; i++) {
cout << (combi(k - 1, i - 1) * combi(n - k + 1, i)) % MOD << endl;
}
} | #include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
long long fanc[2009], inv_fanc[2009];
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
void fanc_list() {
fanc[0] = 1;
fanc[1] = 1;
inv_fanc[0] = 1;
inv_fanc[1] = 1;
for (int i = 2; i <= 2000; i++) {
fanc[i] = (i * fanc[i - 1]) % MOD;
inv_fanc[i] = modinv(fanc[i], MOD);
}
}
long long combi(long long n, long long k) {
if (n < k)
return 0;
return ((fanc[n] * inv_fanc[n - k]) % MOD) * inv_fanc[k] % MOD;
}
int main() {
long long n, k;
cin >> n >> k;
fanc_list();
for (long long i = 1; i <= k; i++) {
cout << (combi(k - 1, i - 1) * combi(n - k + 1, i)) % MOD << endl;
}
} | insert | 34 | 34 | 34 | 36 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c = (c * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return c;
}
bool cmp(double x, double y) { return x > y; }
ll vim[2003], ly[2003];
ll C(int a, int b) {
if (b == 0 || a == b)
return 1;
return vim[a] * ly[b] % mod * ly[a - b] % mod;
}
void dd() {
vim[0] = 1;
for (int i = 1; i <= 2000; i++)
vim[i] = vim[i - 1] * i % mod, ly[i] = kc(vim[i], mod - 2);
}
int main() {
ios::sync_with_stdio(false);
dd();
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cout << C(m - 1, i - 1) % mod * C(n - m + 1, i) % mod << endl;
}
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c = (c * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return c;
}
bool cmp(double x, double y) { return x > y; }
ll vim[2003], ly[2003];
ll C(int a, int b) {
if (b == 0 || a == b)
return 1;
if (a < b)
return 0;
return vim[a] * ly[b] % mod * ly[a - b] % mod;
}
void dd() {
vim[0] = 1;
for (int i = 1; i <= 2000; i++)
vim[i] = vim[i - 1] * i % mod, ly[i] = kc(vim[i], mod - 2);
}
int main() {
ios::sync_with_stdio(false);
dd();
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cout << C(m - 1, i - 1) % mod * C(n - m + 1, i) % mod << endl;
}
}
| insert | 26 | 26 | 26 | 28 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
vector<int64_t> f(2001), fi(2001);
int64_t pw(int64_t x, int64_t y) {
int64_t z;
if (y == 0)
return 1;
else {
z = pw(x, y / 2) * pw(x, y / 2) % mod;
if (y % 2 == 1)
z = z * x % mod;
return z;
}
}
int64_t cmb(int64_t x, int64_t y) {
int64_t z;
z = f.at(x) * fi.at(y) % mod;
z = z * fi.at(x - y) % mod;
return z;
}
int main() {
int64_t n, k, i, ans = 0;
cin >> n >> k;
f.at(0) = 1;
fi.at(0) = 1;
for (i = 1; i <= n; i++) {
f.at(i) = f.at(i - 1) * i % mod;
fi.at(i) = fi.at(i - 1) * pw(i, mod - 2) % mod;
}
for (i = 1; i <= k; i++)
cout << cmb(k - 1, i - 1) * cmb(n - k + 1, i) % mod << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
vector<int64_t> f(2001), fi(2001);
int64_t pw(int64_t x, int64_t y) {
int64_t z;
if (y == 0)
return 1;
else {
z = pw(x, y / 2) * pw(x, y / 2) % mod;
if (y % 2 == 1)
z = z * x % mod;
return z;
}
}
int64_t cmb(int64_t x, int64_t y) {
int64_t z;
z = f.at(x) * fi.at(y) % mod;
z = z * fi.at(x - y) % mod;
return z;
}
int main() {
int64_t n, k, i, ans = 0;
cin >> n >> k;
f.at(0) = 1;
fi.at(0) = 1;
for (i = 1; i <= n; i++) {
f.at(i) = f.at(i - 1) * i % mod;
fi.at(i) = fi.at(i - 1) * pw(i, mod - 2) % mod;
}
for (i = 1; i <= k; i++) {
if (i <= n - k + 1)
cout << cmb(k - 1, i - 1) * cmb(n - k + 1, i) % mod << endl;
else
cout << 0 << endl;
}
} | replace | 30 | 32 | 30 | 36 | TLE | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
vector<LL> fact(1e5), finv(1e5), inv(1e5);
void ComInit(int N) {
// fact = vector<LL>(N + 1);
// inv = vector<LL>(N + 1);
// finv = vector<LL>(N + 1);
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= N; i++) {
fact[i] = fact[i - 1] * i % kMod;
inv[i] = kMod - inv[kMod % i] * (kMod / i) % kMod;
finv[i] = finv[i - 1] * inv[i] % kMod;
}
}
LL nCr(int n, int r) {
LL numerator = fact[n];
LL denominator = finv[r] * finv[n - r] % kMod;
return (numerator * denominator) % kMod;
}
int main() {
int N, K;
std::cin >> N >> K;
ComInit(5e4);
for (int k = 1; k <= K; ++k) {
std::cout << nCr(N - K + 1, k) * nCr(K - 1, k - 1) % kMod << std::endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
constexpr int kMax = 1e5;
LL fact[kMax], finv[kMax], inv[kMax];
void ComInit(int N) {
// fact = vector<LL>(N + 1);
// inv = vector<LL>(N + 1);
// finv = vector<LL>(N + 1);
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= N; i++) {
fact[i] = fact[i - 1] * i % kMod;
inv[i] = kMod - inv[kMod % i] * (kMod / i) % kMod;
finv[i] = finv[i - 1] * inv[i] % kMod;
}
}
LL nCr(int n, int r) {
LL numerator = fact[n];
LL denominator = finv[r] * finv[n - r] % kMod;
return (numerator * denominator) % kMod;
}
int main() {
int N, K;
std::cin >> N >> K;
ComInit(5e4);
for (int k = 1; k <= K; ++k) {
std::cout << nCr(N - K + 1, k) * nCr(K - 1, k - 1) % kMod << std::endl;
}
}
| replace | 18 | 19 | 18 | 20 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
using namespace std;
ll f[N];
ll ksm(ll a, ll b) {
ll ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
void fac(int n) {
f[0] = 1;
f[1] = 1;
for (int i = 2; i <= n; i++)
f[i] = f[i - 1] * i % mod;
}
ll C(ll a, ll b) {
return f[a] * ksm(f[b], mod - 2) % mod * ksm(f[a - b], mod - 2) % mod;
}
int main() {
fac(2100);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (i > n - k + 1)
cout << 0 << endl;
cout << C(n - k + 1, i) * ksm(i, k - i) % mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
using namespace std;
ll f[N];
ll ksm(ll a, ll b) {
ll ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
void fac(int n) {
f[0] = 1;
f[1] = 1;
for (int i = 2; i <= n; i++)
f[i] = f[i - 1] * i % mod;
}
ll C(ll a, ll b) {
return f[a] * ksm(f[b], mod - 2) % mod * ksm(f[a - b], mod - 2) % mod;
}
int main() {
fac(2100);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (i > n - k + 1)
cout << 0 << endl;
else {
cout << C(n - k + 1, i) * C(k - 1, i - 1) % mod << endl;
}
}
return 0;
}
| replace | 30 | 31 | 30 | 33 | 0 | |
p02990 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac[2005];
ll rfac[2005];
ll P(ll a, ll x) {
ll res = 1;
while (x > 0) {
if (x & 1)
res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
ll n, k;
cin >> n >> k;
fac[0] = 1;
rfac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % mod;
for (ll i = 1; i <= n; i++)
rfac[i] = P(fac[i], mod - 2);
for (ll i = 1; i <= k; i++) {
/* cout << fac[n-k+i] << endl;
cout << rfac[i] << endl;
cout << rfac[n-k+1-i] << endl;
cout << fac[k-1] << endl;
cout << rfac[k-i] << endl;
cout << rfac[i-1] << endl;
*/ cout << fac[n - k + 1] * rfac[i] % mod * rfac[n - k + 1 - i] % mod *
fac[k - 1] % mod * rfac[k - i] % mod * rfac[i - 1] % mod
<< endl;
}
}
| #include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac[2005];
ll rfac[2005];
ll P(ll a, ll x) {
ll res = 1;
while (x > 0) {
if (x & 1)
res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
ll n, k;
cin >> n >> k;
fac[0] = 1;
rfac[0] = 1;
for (ll i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % mod;
for (ll i = 1; i <= n; i++)
rfac[i] = P(fac[i], mod - 2);
for (ll i = 1; i <= k; i++) {
/* cout << fac[n-k+i] << endl;
cout << rfac[i] << endl;
cout << rfac[n-k+1-i] << endl;
cout << fac[k-1] << endl;
cout << rfac[k-i] << endl;
cout << rfac[i-1] << endl;
*/
if (n - k + 1 - i < 0)
cout << 0 << endl;
else {
cout << fac[n - k + 1] * rfac[i] % mod * rfac[n - k + 1 - i] % mod *
fac[k - 1] % mod * rfac[k - i] % mod * rfac[i - 1] % mod
<< endl;
}
}
}
| replace | 41 | 44 | 41 | 49 | 0 | |
p02990 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
const int mod = 1000000007;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
#define COMB_MAX (int)50000 + 10
ll f[COMB_MAX], rf[COMB_MAX];
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
rep(i, 1, COMB_MAX) f[i] = (f[i - 1] * i) % mod;
rep(i, 0, COMB_MAX) rf[i] = inv(f[i]);
}
//---------------------------------------------------------------------------------------------------
ll C(int n, int k) {
ll a = f[n]; // = n!
ll b = rf[n - k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main() {
int n, k;
cin >> n >> k;
init();
rep(i, 1, k + 1) {
ll r = C(n - k + 1, i) * C(k - 1, i - 1);
printf("%lld\n", r % mod);
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
const int mod = 1000000007;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
#define COMB_MAX (int)50000 + 10
ll f[COMB_MAX], rf[COMB_MAX];
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
rep(i, 1, COMB_MAX) f[i] = (f[i - 1] * i) % mod;
rep(i, 0, COMB_MAX) rf[i] = inv(f[i]);
}
//---------------------------------------------------------------------------------------------------
ll C(int n, int k) {
if (k < 0 || k > n || n < 0)
return 0;
ll a = f[n]; // = n!
ll b = rf[n - k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main() {
int n, k;
cin >> n >> k;
init();
rep(i, 1, k + 1) {
ll r = C(n - k + 1, i) * C(k - 1, i - 1);
printf("%lld\n", r % mod);
}
return 0;
} | insert | 91 | 91 | 91 | 93 | 0 | |
p02990 | C++ | Runtime Error | // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define LFOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FORR(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define LFORR(i, a, b) for (ll i = (int)(a); i >= (ll)(b); i--)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define LREP(i, n) LFOR(i, 0, (ll)(n)-1)
#define REPR(i, n) FORR(i, (int)(n)-1, 0)
#define LREPR(i, n) LFORR(i, (ll)(n)-1, 0)
#define SIZ(v) int(v.size())
const int INF = 1e8;
const ll LINF = 1e15;
const ll MOD = 1e9 + 7;
vector<vector<ll>> cmemo;
ll combbi(int n, int k) {
if (k == 0 || n == k)
return cmemo[n][k] = 1;
if (cmemo[n][k])
return cmemo[n][k];
if (n < k)
return 0;
return cmemo[n][k] = ((combbi(n - 1, k - 1) + combbi(n - 1, k)) % MOD);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
ll tmp;
cin >> n >> k;
cmemo.assign(n, vector<ll>(n, 0));
FOR(i, 1, k) {
if (i - 1 > n - k)
tmp = 0;
else
tmp = (combbi(n - k + 1, n - k - i + 1) * combbi(k - 1, i - 1)) % MOD;
cout << tmp << endl;
}
}
| // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using namespace std;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define LFOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FORR(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define LFORR(i, a, b) for (ll i = (int)(a); i >= (ll)(b); i--)
#define REP(i, n) FOR(i, 0, (int)(n)-1)
#define LREP(i, n) LFOR(i, 0, (ll)(n)-1)
#define REPR(i, n) FORR(i, (int)(n)-1, 0)
#define LREPR(i, n) LFORR(i, (ll)(n)-1, 0)
#define SIZ(v) int(v.size())
const int INF = 1e8;
const ll LINF = 1e15;
const ll MOD = 1e9 + 7;
vector<vector<ll>> cmemo;
ll combbi(int n, int k) {
if (k == 0 || n == k)
return cmemo[n][k] = 1;
if (cmemo[n][k])
return cmemo[n][k];
if (n < k)
return 0;
return cmemo[n][k] = ((combbi(n - 1, k - 1) + combbi(n - 1, k)) % MOD);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
ll tmp;
cin >> n >> k;
cmemo.assign(n + 1, vector<ll>(n + 1, 0));
FOR(i, 1, k) {
if (i - 1 > n - k)
tmp = 0;
else
tmp = (combbi(n - k + 1, n - k - i + 1) * combbi(k - 1, i - 1)) % MOD;
cout << tmp << endl;
}
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define int ll
int mod = 1000000007;
int fact[3000];
int factinv[3000];
ll modpow(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll binom(int n, int r) {
if (r == 0 || r == n)
return 1;
int a, b, c;
a = fact[n];
b = factinv[r];
c = factinv[n - r];
return ((((a * b) % mod) * c) % mod);
}
int32_t main() {
usecppio int n, k, r;
fact[0] = 1;
factinv[0] = 1;
for (int i = 1; i <= 2500; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
factinv[i] = modpow(fact[i], mod - 2, mod);
}
cin >> n >> k;
r = n - k;
for (int i = 1; i <= k; i++) {
int a = binom(r + 1, i);
int b = binom(k - 1, i - 1);
cout << (a * b) % mod << '\n';
}
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define int ll
int mod = 1000000007;
int fact[3000];
int factinv[3000];
ll modpow(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll binom(int n, int r) {
if (r > n)
return 0;
if (r < 0)
return 0;
if (r == 0 || r == n)
return 1;
int a, b, c;
a = fact[n];
b = factinv[r];
c = factinv[n - r];
return ((((a * b) % mod) * c) % mod);
}
int32_t main() {
usecppio int n, k, r;
fact[0] = 1;
factinv[0] = 1;
for (int i = 1; i <= 2500; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
factinv[i] = modpow(fact[i], mod - 2, mod);
}
cin >> n >> k;
r = n - k;
for (int i = 1; i <= k; i++) {
int a = binom(r + 1, i);
int b = binom(k - 1, i - 1);
cout << (a * b) % mod << '\n';
}
}
| insert | 30 | 30 | 30 | 34 | 0 | |
p02990 | C++ | Runtime Error | /**
* author: rishabh_sethi
**/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(v.begin(), v.end(), val)
#define lower(v, val) lower_bound(v.begin(), v.end(), val)
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define jaldi_chal() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define S second
#define F first
#define fm(it, m) for (it = m.begin(); it != m.end(); it++)
#define ct_set(n) __builtin_popcount(n) // count no of set bits
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265 // acosl(-1)
#define precision cout << setprecision(15)
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define print_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
// vec.erase(std::remove(vec.begin(), vec.end(), val), vec.end());
using namespace std;
// for ordered set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
// v.resize(unique(v.begin(), v.end()) - v.begin()); // for unique elements in
// sorted vector fflush(stdout); // after every output
// Using 128 bit integers
/*
std::string toString(__int128 num) {
std::string str;
do {
int digit = num % 10;
str = std::to_string(digit) + str;
num = (num - digit) / 10;
} while (num != 0);
return str;
}
int main() {
__int128_t x;
string s;
cin >> s;
x = (stoll)(s);
__int128_t ans = x * x * x;
cout << toString(ans);
}
*/
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = (a * b) / g;
return ans;
}
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
vector<ll> primes;
bool prime[10005];
void seive() {
mem(prime, 1);
prime[0] = 0;
prime[1] = 0;
for (ll i = 2; i <= 10000; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= 10000; j += i)
prime[j] = 0;
}
}
}
ll power(ll a, ll b) {
ll ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans % mod * a % mod) % mod;
a = (a * a) % mod;
b = b / 2;
}
return ans;
}
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string num_to_bits(ll n) {
string ans = "";
while (n) {
ans += (n % 2) + '0';
n /= 2;
}
reverse(all(ans));
return ans;
}
ll bits_to_num(string s) {
ll ans = 0;
for (ll i = 0; i < s.size(); i++) {
ll x = s.size() - i - 1;
ll val = pow(2LL, x);
if (s[i] == '1') {
ans = ans + val;
}
}
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
// Function to compute a/b under modlo m
ll modDivide(ll a, ll b, ll m) {
a = a % m;
ll inv = modInverse(b, m);
// if (inv == -1)
// cout << "Division not defined";
// else
// cout << "Result of division is " << (inv * a) % m;
return (inv * a) % m;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
// To call for modulo division (a / b) % m : modDivide(a, b, m);
/* This will store divisors of the number from 1 to n
for(i = 1; i <= n; i++) {
for(j = i; j <= n; j += i) {
v[j].pb(i);
}
}
*/
ll fact[2005];
void factorials() {
fact[0] = 1;
for (ll i = 1; i <= 2002; i++) {
fact[i] = (i * fact[i - 1]) % mod;
}
}
void solve() {
factorials();
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll ans1 = fact[n - k + 1];
ans1 = modDivide(ans1, fact[i], mod);
ans1 = modDivide(ans1, fact[n - k + 1 - i], mod);
ll ans2 = fact[k - 1];
ans2 = modDivide(ans2, fact[i - 1], mod);
ans2 = modDivide(ans2, fact[k - i], mod);
cout << (ans1 * ans2) % mod << endl;
}
}
int main() {
jaldi_chal()
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w", stdout);
// seive();
// for(int i = 2; i <= 10000; i++) {
// if(prime[i])
// primes.pb(i);
// }
bool codechef = 0;
ll t = 1;
if (codechef) {
cin >> t;
}
for (ll i = 1; i <= t; i++) {
// cout << "Case #" << i << ": ";
solve();
}
return 0;
} | /**
* author: rishabh_sethi
**/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(v.begin(), v.end(), val)
#define lower(v, val) lower_bound(v.begin(), v.end(), val)
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define jaldi_chal() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define S second
#define F first
#define fm(it, m) for (it = m.begin(); it != m.end(); it++)
#define ct_set(n) __builtin_popcount(n) // count no of set bits
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265 // acosl(-1)
#define precision cout << setprecision(15)
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define print_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
// vec.erase(std::remove(vec.begin(), vec.end(), val), vec.end());
using namespace std;
// for ordered set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
// v.resize(unique(v.begin(), v.end()) - v.begin()); // for unique elements in
// sorted vector fflush(stdout); // after every output
// Using 128 bit integers
/*
std::string toString(__int128 num) {
std::string str;
do {
int digit = num % 10;
str = std::to_string(digit) + str;
num = (num - digit) / 10;
} while (num != 0);
return str;
}
int main() {
__int128_t x;
string s;
cin >> s;
x = (stoll)(s);
__int128_t ans = x * x * x;
cout << toString(ans);
}
*/
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = (a * b) / g;
return ans;
}
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
vector<ll> primes;
bool prime[10005];
void seive() {
mem(prime, 1);
prime[0] = 0;
prime[1] = 0;
for (ll i = 2; i <= 10000; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= 10000; j += i)
prime[j] = 0;
}
}
}
ll power(ll a, ll b) {
ll ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans % mod * a % mod) % mod;
a = (a * a) % mod;
b = b / 2;
}
return ans;
}
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string num_to_bits(ll n) {
string ans = "";
while (n) {
ans += (n % 2) + '0';
n /= 2;
}
reverse(all(ans));
return ans;
}
ll bits_to_num(string s) {
ll ans = 0;
for (ll i = 0; i < s.size(); i++) {
ll x = s.size() - i - 1;
ll val = pow(2LL, x);
if (s[i] == '1') {
ans = ans + val;
}
}
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
// Function to compute a/b under modlo m
ll modDivide(ll a, ll b, ll m) {
a = a % m;
ll inv = modInverse(b, m);
// if (inv == -1)
// cout << "Division not defined";
// else
// cout << "Result of division is " << (inv * a) % m;
return (inv * a) % m;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
// To call for modulo division (a / b) % m : modDivide(a, b, m);
/* This will store divisors of the number from 1 to n
for(i = 1; i <= n; i++) {
for(j = i; j <= n; j += i) {
v[j].pb(i);
}
}
*/
ll fact[2005];
void factorials() {
fact[0] = 1;
for (ll i = 1; i <= 2002; i++) {
fact[i] = (i * fact[i - 1]) % mod;
}
}
void solve() {
factorials();
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll ans1 = 1;
if (n - k + 1 >= i) {
ans1 = fact[n - k + 1];
ans1 = modDivide(ans1, fact[i], mod);
ans1 = modDivide(ans1, fact[n - k + 1 - i], mod);
} else {
ans1 = 0;
}
ll ans2 = fact[k - 1];
ans2 = modDivide(ans2, fact[i - 1], mod);
ans2 = modDivide(ans2, fact[k - i], mod);
cout << (ans1 * ans2) % mod << endl;
}
}
int main() {
jaldi_chal()
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w", stdout);
// seive();
// for(int i = 2; i <= 10000; i++) {
// if(prime[i])
// primes.pb(i);
// }
bool codechef = 0;
ll t = 1;
if (codechef) {
cin >> t;
}
for (ll i = 1; i <= t; i++) {
// cout << "Case #" << i << ": ";
solve();
}
return 0;
} | replace | 235 | 238 | 235 | 243 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using P = pair<int, int>;
const int inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MAX = 1e9 + 7;
ll fact[10003];
template <typename T> void factorial(T m) {
fact[0] = 1;
fact[1] = 1;
for (int i = 2; i <= 10000; ++i) {
fact[i] = fact[i - 1] * i % m;
}
}
template <typename T> T Pow(T x, T n, T m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return Pow(x * x % m, n / 2, m);
else
return x * Pow(x, n - 1, m) % m;
}
template <typename T> T combination(T n, T k, T m) {
return fact[n] * Pow<T>(fact[k], m - 2, m) % m *
Pow<T>(fact[n - k], m - 2, m) % m;
}
int main() {
ll n, k;
cin >> n >> k;
factorial<ll>(MOD);
REP(i, k) {
if (n - k + 1 >= 1) {
cout << combination<ll>(n - k + 1, i, MOD) *
combination<ll>(k - 1, i - 1, MOD) % MOD
<< endl;
} else
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using P = pair<int, int>;
const int inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MAX = 1e9 + 7;
ll fact[10003];
template <typename T> void factorial(T m) {
fact[0] = 1;
fact[1] = 1;
for (int i = 2; i <= 10000; ++i) {
fact[i] = fact[i - 1] * i % m;
}
}
template <typename T> T Pow(T x, T n, T m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return Pow(x * x % m, n / 2, m);
else
return x * Pow(x, n - 1, m) % m;
}
template <typename T> T combination(T n, T k, T m) {
return fact[n] * Pow<T>(fact[k], m - 2, m) % m *
Pow<T>(fact[n - k], m - 2, m) % m;
}
int main() {
ll n, k;
cin >> n >> k;
factorial<ll>(MOD);
REP(i, k) {
if (n - k + 1 >= i) {
cout << combination<ll>(n - k + 1, i, MOD) *
combination<ll>(k - 1, i - 1, MOD) % MOD
<< endl;
} else
cout << 0 << endl;
}
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02990 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2000;
long long mod(long long a) {
a %= MOD;
return a >= 0 ? a : a + MOD;
}
long long inverse[MAX + 1];
long long factorial[MAX + 1];
long long factorial_inverse[MAX + 1];
void calc(int n) {
inverse[1] = 1;
factorial[0] = factorial[1] = 1;
factorial_inverse[0] = factorial_inverse[1] = 1;
for (int i = 2; i <= n; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
factorial[i] = i * factorial[i - 1] % MOD;
factorial_inverse[i] = inverse[i] * factorial_inverse[i - 1] % MOD;
}
}
long long comb(long long n, long long k) {
return factorial[n] *
(factorial_inverse[k] * factorial_inverse[n - k] % MOD) % MOD;
}
long long rep_comb(long long n, long long k) { return comb(n + k - 1, k); }
int main() {
long long n, k;
cin >> n >> k;
calc(n);
for (int i = 1; i <= k; i++) {
long long ans;
ans = rep_comb(i, k - i);
ans = mod(ans * rep_comb(i + 1, n - k - (i - 1)));
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2000;
long long mod(long long a) {
a %= MOD;
return a >= 0 ? a : a + MOD;
}
long long inverse[MAX + 1];
long long factorial[MAX + 1];
long long factorial_inverse[MAX + 1];
void calc(int n) {
inverse[1] = 1;
factorial[0] = factorial[1] = 1;
factorial_inverse[0] = factorial_inverse[1] = 1;
for (int i = 2; i <= n; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
factorial[i] = i * factorial[i - 1] % MOD;
factorial_inverse[i] = inverse[i] * factorial_inverse[i - 1] % MOD;
}
}
long long comb(long long n, long long k) {
return factorial[n] *
(factorial_inverse[k] * factorial_inverse[n - k] % MOD) % MOD;
}
long long rep_comb(long long n, long long k) { return comb(n + k - 1, k); }
int main() {
long long n, k;
cin >> n >> k;
calc(n);
for (int i = 1; i <= k; i++) {
long long ans;
ans = rep_comb(i, k - i);
if (n - k - (i - 1) < 0)
ans = 0;
else
ans = mod(ans * rep_comb(i + 1, n - k - (i - 1)));
cout << ans << endl;
}
return 0;
} | replace | 39 | 40 | 39 | 43 | 0 | |
p02990 | C++ | Runtime Error |
#include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORCLS(i, a, b) for (int i = (a); i <= (b); i++)
#define REPCLS(i, n) FORCLS(i, 1, n)
template <typename T>
T extGcdRec(T r1, T r2, T x1, T x2, T y1, T y2, T &x, T &y) {
if (r2 == 0) {
x = x1;
y = y1;
return r1;
}
T r3 = r1 / r2;
return extGcdRec(r2, r1 % r2, x2, x1 - r3 * x2, y2, y1 - r3 * y2, x, y);
}
template <typename T> T extGcd(T a, T b, T &x, T &y) {
if (a < b)
return extGcd(b, a, y, x);
return extGcdRec<T>(a, b, 1, 0, 0, 1, x, y);
}
template <typename T> T invMod(T a, T m) { // Zm上乗法逆数
T x, y;
if (extGcd<T>(a, m, x, y) == 1)
return (x + m) % m;
return 0;
}
const int N_MAX = 2001;
int N;
int K;
int numB, numR;
long invM[N_MAX] = {};
long nCr[N_MAX][N_MAX] = {};
const long MOD = 1000000000 + 7;
void init() {
// invM
REP(n, N_MAX) { invM[n] = invMod<long>(n, MOD); }
// nCr
REP(n, N_MAX) { nCr[n][0] = 1; }
REP(r, N_MAX) { nCr[0][r] = 1; }
FOR(r, 1, N_MAX) {
FOR(n, r, N_MAX) {
nCr[n][r] = (((n * invM[r]) % MOD) * nCr[n - 1][r - 1]) % MOD;
}
}
}
inline long sub(int sectionNumB, int sectionNumR) {
// n(num) を s(section)個の自然数に分ける分け方の個数は (n-1)C(s-1)
if (sectionNumB == 0 || sectionNumR == 0)
return 0;
return (nCr[numB - 1][sectionNumB - 1] * nCr[numR - 1][sectionNumR - 1]) %
MOD;
}
void solve() {
cin >> N >> K;
numB = K;
numR = N - K;
init();
// if (numR == 0) { // 赤がないパタン
// cout << 1 << endl;
// FOR(i, 2, K+1) {
// cout << 0 << endl;
// }
// return;
// }
FOR(i, 1, K + 1) {
long res = 0;
const int sectionNumB = i;
for (int sectionNumR : {i - 1, i, i, i + 1} /* B-B, B-R, R-B, R-R */) {
res = (res + sub(sectionNumB, sectionNumR)) % MOD;
}
cout << res << endl;
}
}
int main() {
solve();
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORCLS(i, a, b) for (int i = (a); i <= (b); i++)
#define REPCLS(i, n) FORCLS(i, 1, n)
template <typename T>
T extGcdRec(T r1, T r2, T x1, T x2, T y1, T y2, T &x, T &y) {
if (r2 == 0) {
x = x1;
y = y1;
return r1;
}
T r3 = r1 / r2;
return extGcdRec(r2, r1 % r2, x2, x1 - r3 * x2, y2, y1 - r3 * y2, x, y);
}
template <typename T> T extGcd(T a, T b, T &x, T &y) {
if (a < b)
return extGcd(b, a, y, x);
return extGcdRec<T>(a, b, 1, 0, 0, 1, x, y);
}
template <typename T> T invMod(T a, T m) { // Zm上乗法逆数
T x, y;
if (extGcd<T>(a, m, x, y) == 1)
return (x + m) % m;
return 0;
}
const int N_MAX = 2001;
int N;
int K;
int numB, numR;
long invM[N_MAX] = {};
long nCr[N_MAX][N_MAX] = {};
const long MOD = 1000000000 + 7;
void init() {
// invM
REP(n, N_MAX) { invM[n] = invMod<long>(n, MOD); }
// nCr
REP(n, N_MAX) { nCr[n][0] = 1; }
REP(r, N_MAX) { nCr[0][r] = 1; }
FOR(r, 1, N_MAX) {
FOR(n, r, N_MAX) {
nCr[n][r] = (((n * invM[r]) % MOD) * nCr[n - 1][r - 1]) % MOD;
}
}
}
inline long sub(int sectionNumB, int sectionNumR) {
// n(num) を s(section)個の自然数に分ける分け方の個数は (n-1)C(s-1)
if (sectionNumB == 0 || sectionNumR == 0)
return 0;
return (nCr[numB - 1][sectionNumB - 1] * nCr[numR - 1][sectionNumR - 1]) %
MOD;
}
void solve() {
cin >> N >> K;
numB = K;
numR = N - K;
init();
if (numR == 0) { // 赤がないパタン
cout << 1 << endl;
FOR(i, 2, K + 1) { cout << 0 << endl; }
return;
}
FOR(i, 1, K + 1) {
long res = 0;
const int sectionNumB = i;
for (int sectionNumR : {i - 1, i, i, i + 1} /* B-B, B-R, R-B, R-R */) {
res = (res + sub(sectionNumB, sectionNumR)) % MOD;
}
cout << res << endl;
}
}
int main() {
solve();
return 0;
}
| replace | 71 | 78 | 71 | 76 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#define llint long long
#define mod 1000000007
using namespace std;
llint n, k;
const int FACT_MAX = 200005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpow(a, n - 1) % mod)) % mod;
} else {
return modpow((a * a) % mod, n / 2) % mod;
}
}
void make_fact() {
llint val = 1;
fact[0] = 1;
for (int i = 1; i < FACT_MAX; i++) {
val *= i;
val %= mod;
fact[i] = val;
}
fact_inv[FACT_MAX - 1] = modpow(fact[FACT_MAX - 1], mod - 2);
for (int i = FACT_MAX - 2; i >= 0; i--) {
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
}
}
llint comb(llint n, llint k) {
llint ret = 1;
ret *= fact[n];
ret *= fact_inv[k], ret %= mod;
ret *= fact_inv[n - k], ret %= mod;
return ret;
}
int main(void) {
cin >> n >> k;
make_fact();
for (int i = 1; i <= k; i++) {
if (n - k + 1 < 0)
cout << 0 << endl;
else
cout << comb(k - 1, i - 1) * comb(n - k + 1, i) % mod << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#define llint long long
#define mod 1000000007
using namespace std;
llint n, k;
const int FACT_MAX = 200005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpow(a, n - 1) % mod)) % mod;
} else {
return modpow((a * a) % mod, n / 2) % mod;
}
}
void make_fact() {
llint val = 1;
fact[0] = 1;
for (int i = 1; i < FACT_MAX; i++) {
val *= i;
val %= mod;
fact[i] = val;
}
fact_inv[FACT_MAX - 1] = modpow(fact[FACT_MAX - 1], mod - 2);
for (int i = FACT_MAX - 2; i >= 0; i--) {
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
}
}
llint comb(llint n, llint k) {
llint ret = 1;
ret *= fact[n];
ret *= fact_inv[k], ret %= mod;
ret *= fact_inv[n - k], ret %= mod;
return ret;
}
int main(void) {
cin >> n >> k;
make_fact();
for (int i = 1; i <= k; i++) {
if (n - k < i - 1)
cout << 0 << endl;
else
cout << comb(k - 1, i - 1) * comb(n - k + 1, i) % mod << endl;
}
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
ll ex_euclid(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = ex_euclid(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll modinv(ll a, ll p) {
ll x, y, d;
d = ex_euclid(a, p, x, y);
assert(d == 1);
return ((x % MOD) + MOD) % MOD;
}
const int maxN = 4000;
ll fac[maxN], inv[maxN], finv[maxN];
// O(N) precomputation
void modnCk_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < maxN; i++) {
fac[i] = fac[i - 1] * i % MOD;
// inv[i] = modinv(i, MOD); // O(logN)
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; // O(1)
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// O(1) with O(N) precomputation
ll modnCk(int n, int k) {
if (n < k)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
ll red, blue;
int nb, kb, nr, kr;
modnCk_init();
for (int i = 1; i <= K; i++) {
nb = K - 1;
kb = K - i;
blue = modnCk(nb, kb);
nr = N - K + 1;
kr = N - K - i + 1;
red = modnCk(nr, kr);
cout << blue * red % MOD << endl;
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
ll ex_euclid(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = ex_euclid(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll modinv(ll a, ll p) {
ll x, y, d;
d = ex_euclid(a, p, x, y);
assert(d == 1);
return ((x % MOD) + MOD) % MOD;
}
const int maxN = 4000;
ll fac[maxN], inv[maxN], finv[maxN];
// O(N) precomputation
void modnCk_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < maxN; i++) {
fac[i] = fac[i - 1] * i % MOD;
// inv[i] = modinv(i, MOD); // O(logN)
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; // O(1)
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// O(1) with O(N) precomputation
ll modnCk(int n, int k) {
if (k < 0)
return 0;
if (n < k)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
ll red, blue;
int nb, kb, nr, kr;
modnCk_init();
for (int i = 1; i <= K; i++) {
nb = K - 1;
kb = K - i;
blue = modnCk(nb, kb);
nr = N - K + 1;
kr = N - K - i + 1;
red = modnCk(nr, kr);
cout << blue * red % MOD << endl;
}
return 0;
} | insert | 53 | 53 | 53 | 55 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define ll long long
typedef long long ll;
typedef pair<int, int> P;
// std::vector<std::vector<long long>> v(n + 1,std::vector<long long>(n + 1,
// 0));
std::vector<std::vector<long>> v(2019, std::vector<long>(2019, 0));
long mod = 1000000007;
long nCr(long n, long r) {
if (v[n][r] != 0) {
return v[n][r];
}
return v[n][r] = (nCr(n - 1, r - 1) + nCr(n - 1, r)) % mod;
}
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
for (int i = 0; i <= n; i++) {
v[i][0] = 1;
v[i][i] = 1;
}
repd(i, 1, k + 1) {
ll ans = nCr(n - k + 1, i) * nCr(k - 1, i - 1);
cout << ans % mod << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define ll long long
typedef long long ll;
typedef pair<int, int> P;
// std::vector<std::vector<long long>> v(n + 1,std::vector<long long>(n + 1,
// 0));
std::vector<std::vector<long>> v(2019, std::vector<long>(2019, 0));
long mod = 1000000007;
long nCr(long n, long r) {
if (v[n][r] != 0) {
return v[n][r];
}
return v[n][r] = (nCr(n - 1, r - 1) + nCr(n - 1, r)) % mod;
}
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
for (int i = 0; i <= n; i++) {
v[i][0] = 1;
v[i][i] = 1;
}
repd(i, 1, k + 1) {
if ((n - k + 1) < i) {
cout << 0 << endl;
continue;
}
ll ans = nCr(n - k + 1, i) * nCr(k - 1, i - 1);
cout << ans % mod << endl;
}
return 0;
}
| insert | 47 | 47 | 47 | 52 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAX = 1e6;
long long fact[MAX + 1] = {0};
void fact_init() {
fact[0] = 1;
for (long long i = 1; i <= MAX; i++) {
fact[i] = (fact[i - 1] * i % MOD) % MOD;
}
}
long long repeat_fact(long long N, long long P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
long long t = repeat_fact(N, P / 2);
return (t % MOD * t % MOD) % MOD;
} else
return (N % MOD * repeat_fact(N, P - 1)) % MOD;
}
long long combination(long long n, long long k) {
long long fact1 = fact[n];
long long fact2 = repeat_fact(fact[k], MOD - 2);
long long fact3 = repeat_fact(fact[n - k], MOD - 2);
long long ans = ((fact1 * fact2) % MOD * fact3) % MOD;
return ans;
}
void solve(long long N, long long K) {
int r = 1;
for (int i = N - K + 1; i <= N; i++) {
cout << combination(N - K + 1, r) * combination(K - 1, r - 1) % MOD << endl;
r++;
}
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
cin >> N;
long long K;
cin >> K;
fact_init();
solve(N, K);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAX = 1e6;
long long fact[MAX + 1] = {0};
void fact_init() {
fact[0] = 1;
for (long long i = 1; i <= MAX; i++) {
fact[i] = (fact[i - 1] * i % MOD) % MOD;
}
}
long long repeat_fact(long long N, long long P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
long long t = repeat_fact(N, P / 2);
return (t % MOD * t % MOD) % MOD;
} else
return (N % MOD * repeat_fact(N, P - 1)) % MOD;
}
long long combination(long long n, long long k) {
long long fact1 = fact[n];
long long fact2 = repeat_fact(fact[k], MOD - 2);
long long fact3 = repeat_fact(fact[n - k], MOD - 2);
long long ans = ((fact1 * fact2) % MOD * fact3) % MOD;
return ans;
}
void solve(long long N, long long K) {
for (long long i = 1; i <= K; i++) {
if (i > N - K + 1) {
cout << 0 << endl;
} else {
cout << combination(N - K + 1, i) * combination(K - 1, i - 1) % MOD
<< endl;
}
}
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
cin >> N;
long long K;
cin >> K;
fact_init();
solve(N, K);
return 0;
}
| replace | 33 | 37 | 33 | 40 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.