problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
#define MAXN 2001
#define MAXP 2001
int C[MAXN][MAXP];
void init() {
REP(i, MAXN) { C[i][0] = 1; }
REPS(i, MAXN - 1) {
REPS(j, MAXP - 1) { C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD; }
}
}
// 0 1 2
// i=0. 1 0 0 0000
// i=1. 1 1 0 0000
// i=2. 1 2 1 0000
// K,i. not 0. ( (K-1) i-1)
// N-K-(i-1) divide i+2 (max) allow 0. ( N-K+1 i )
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
init();
// cout << C[2][0] << " " << C[2][0] << "\n";
cin >> N >> K;
// 5 3, 3--1*3 6--2*3 1
REPS(i, K) { cout << (C[K - 1][i - 1] * C[N - K + 1][i]) % MOD << "\n"; }
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
#define MAXN 2001
#define MAXP 2001
lli C[MAXN][MAXP];
void init() {
REP(i, MAXN) { C[i][0] = 1; }
REPS(i, MAXN - 1) {
REPS(j, MAXP - 1) { C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD; }
}
}
// 0 1 2
// i=0. 1 0 0 0000
// i=1. 1 1 0 0000
// i=2. 1 2 1 0000
// K,i. not 0. ( (K-1) i-1)
// N-K-(i-1) divide i+2 (max) allow 0. ( N-K+1 i )
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
init();
// cout << C[2][0] << " " << C[2][0] << "\n";
cin >> N >> K;
// 5 3, 3--1*3 6--2*3 1
REPS(i, K) { cout << (C[K - 1][i - 1] * C[N - K + 1][i]) % MOD << "\n"; }
} | [
"variable_declaration.type.change"
] | 798,552 | 798,553 | u468262978 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
#define MAXN 100101
#define MAXP 101
int C[MAXN][MAXP];
void init() {
REP(i, MAXN) { C[i][0] = 1; }
REPS(i, MAXN - 1) {
REPS(j, MAXP - 1) { C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD; }
}
}
// 0 1 2
// i=0. 1 0 0 0000
// i=1. 1 1 0 0000
// i=2. 1 2 1 0000
// K,i. not 0. ( (K-1) i-1)
// N-K-(i-1) divide i+2 (max) allow 0. ( N-K+1 i )
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
init();
// cout << C[2][0] << " " << C[2][0] << "\n";
cin >> N >> K;
// 5 3, 3--1*3 6--2*3 1
REPS(i, K) { cout << (C[K - 1][i - 1] * C[N - K + 1][i]) % MOD << "\n"; }
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
#define MAXN 2001
#define MAXP 2001
lli C[MAXN][MAXP];
void init() {
REP(i, MAXN) { C[i][0] = 1; }
REPS(i, MAXN - 1) {
REPS(j, MAXP - 1) { C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD; }
}
}
// 0 1 2
// i=0. 1 0 0 0000
// i=1. 1 1 0 0000
// i=2. 1 2 1 0000
// K,i. not 0. ( (K-1) i-1)
// N-K-(i-1) divide i+2 (max) allow 0. ( N-K+1 i )
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
init();
// cout << C[2][0] << " " << C[2][0] << "\n";
cin >> N >> K;
// 5 3, 3--1*3 6--2*3 1
REPS(i, K) { cout << (C[K - 1][i - 1] * C[N - K + 1][i]) % MOD << "\n"; }
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 798,554 | 798,553 | u468262978 | cpp |
p02990 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
ll dp[205][205] = {};
ll comb(ll n, ll k) {
if (dp[n][k] != 0)
return dp[n][k];
rep(i, n + 1) {
dp[i][0] = 1;
dp[i][i] = 1;
}
REP(i, 2, n + 1) {
REP(j, 1, i) {
dp[i][j] = (dp[i - 1][j - 1] % MOD + dp[i - 1][j] % MOD) % MOD;
// printf("%d \n",dp[i][j]);
}
// cout << "\n";
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
REP(i, 1, k + 1) { cout << comb(n - k + 1, i) * comb(k - 1, i - 1) << "\n"; }
} | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
ll dp[2005][2005] = {};
ll comb(ll n, ll k) {
if (dp[n][k] != 0)
return dp[n][k];
rep(i, n + 1) {
dp[i][0] = 1;
dp[i][i] = 1;
}
REP(i, 2, n + 1) {
REP(j, 1, i) {
dp[i][j] = (dp[i - 1][j - 1] % MOD + dp[i - 1][j] % MOD) % MOD;
// printf("%d \n",dp[i][j]);
}
// cout << "\n";
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
REP(i, 1, k + 1) {
cout << comb(n - k + 1, i) * comb(k - 1, i - 1) % MOD << "\n";
}
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 798,568 | 798,569 | u242679311 | cpp |
p02990 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
ll dp[2005][2005] = {};
ll comb(ll n, ll k) {
if (dp[n][k] != 0)
return dp[n][k];
rep(i, n + 1) {
dp[i][0] = 1;
dp[i][i] = 1;
}
REP(i, 2, n + 1) {
REP(j, 1, i) {
dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % MOD;
// printf("%d \n",dp[i][j]);
}
// cout << "\n";
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
REP(i, 1, k + 1) { cout << comb(n - k + 1, i) * comb(k - 1, i - 1) << "\n"; }
} | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;
ll dp[2005][2005] = {};
ll comb(ll n, ll k) {
if (dp[n][k] != 0)
return dp[n][k];
rep(i, n + 1) {
dp[i][0] = 1;
dp[i][i] = 1;
}
REP(i, 2, n + 1) {
REP(j, 1, i) {
dp[i][j] = (dp[i - 1][j - 1] % MOD + dp[i - 1][j] % MOD) % MOD;
// printf("%d \n",dp[i][j]);
}
// cout << "\n";
}
return dp[n][k];
}
int main() {
ll n, k;
cin >> n >> k;
REP(i, 1, k + 1) {
cout << comb(n - k + 1, i) * comb(k - 1, i - 1) % MOD << "\n";
}
} | [
"assignment.change"
] | 798,570 | 798,569 | u242679311 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
int main() {
ll n, k;
cin >> n >> k;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll ans;
for (ll i = 1; i <= k; i++) {
ans = comb(n - k + 1, i) * comb(k - 1, i - 1);
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
int main() {
ll n, k;
cin >> n >> k;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll ans;
for (ll i = 1; i <= k; i++) {
ans = comb(n - k + 1, i) * comb(k - 1, i - 1) % M;
cout << ans << endl;
}
return 0;
}
| [
"assignment.change"
] | 798,576 | 798,577 | u332253305 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
using ll = long long;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
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;
}
}
ll 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;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
COMint();
ll N;
cin >> N;
ll K;
cin >> K;
ll ans;
ans = 0;
for (int i = 1; i <= K; i++) {
ans = COM(K - 1, i - 1) * COM(N - K + 1, i);
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
using ll = long long;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
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;
}
}
ll 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;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
COMint();
ll N;
cin >> N;
ll K;
cin >> K;
ll ans;
ans = 0;
for (int i = 1; i <= K; i++) {
ans = COM(K - 1, i - 1) * COM(N - K + 1, i);
cout << ans % MOD << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 798,585 | 798,586 | u311671153 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long c[2010][2010] = {}, mod = 1e9 + 7;
void init() {
for (int i = 0; i < 2005; i++) {
c[i][0] = 1;
for (int j = 1; j < i + 1; j++) {
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
}
int main() {
init();
int n, k;
cin >> n >> k;
for (int i = 1; i < k + 1; i++) {
cout << c[k - 1][i - 1] * c[n - k + 1][i] % mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long c[2010][2010] = {}, mod = 1e9 + 7;
void init() {
for (int i = 0; i < 2005; i++) {
c[i][0] = 1;
for (int j = 1; j < i + 1; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
}
int main() {
init();
int n, k;
cin >> n >> k;
for (int i = 1; i < k + 1; i++) {
cout << c[k - 1][i - 1] * c[n - k + 1][i] % mod << endl;
}
return 0;
}
| [
"assignment.change"
] | 798,595 | 798,596 | u164474813 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
vector<vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
}
}
return v;
}
const int MAX_N = 2000;
const int MAX_M = 2000;
long long memo[MAX_N + 1][MAX_M + 1];
long long p(long long n, long long m) {
long long ret;
if (memo[n][m] >= 0)
return memo[n][m];
if (n == 0 || m == 1)
return 1;
ret = p(n, m - 1);
if (n >= m)
ret += p(n - m, m);
return memo[n][m] = ret;
}
int main() {
int N, K;
cin >> N >> K;
vector<vector<long long>> vcomb;
vcomb = comb(2001, 2001);
for (long long i = 1; i <= K; i++) {
// cout<<N-K+1<<" "<<i<<" "<<K-1<<endl;
cout << ((vcomb[N - K + 1][i] % 1000000007) *
(vcomb[K - 1][i - 1] % 1000000007)) %
1000000007
<< endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
vector<vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]) % 1000000007;
}
}
return v;
}
const int MAX_N = 2000;
const int MAX_M = 2000;
long long memo[MAX_N + 1][MAX_M + 1];
long long p(long long n, long long m) {
long long ret;
if (memo[n][m] >= 0)
return memo[n][m];
if (n == 0 || m == 1)
return 1;
ret = p(n, m - 1);
if (n >= m)
ret += p(n - m, m);
return memo[n][m] = ret;
}
int main() {
int N, K;
cin >> N >> K;
vector<vector<long long>> vcomb;
vcomb = comb(2001, 2001);
for (long long i = 1; i <= K; i++) {
// cout<<N-K+1<<" "<<i<<" "<<K-1<<endl;
cout << ((vcomb[N - K + 1][i] % 1000000007) *
(vcomb[K - 1][i - 1] % 1000000007)) %
1000000007
<< endl;
}
return 0;
}
| [
"assignment.change"
] | 798,597 | 798,598 | u683667335 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
// const int mod = 103;
vector<long long> factorial;
long long mod_pow(long long a, long long p) {
vector<long long> vals = {a};
vector<long long> pow2s = {1};
while (pow2s.back() < p) {
long long val = vals.back() * vals.back() % mod;
vals.emplace_back(val);
pow2s.emplace_back(pow2s.back() << 1);
}
long long ret = 1;
long long p2 = p;
for (int i = vals.size() - 1; i >= 0; i--) {
if (p2 >= pow2s[i]) {
p2 -= pow2s[i];
ret = (ret * vals[i]) % mod;
}
}
return ret;
}
long long mod_combi(int n, int k) {
long long x = factorial[n];
long long y = factorial[k] * factorial[n - k] % mod;
y = mod_pow(y, mod - 2);
long long ret = x * y % mod;
return ret;
}
int calc(int ball, int partition) {
// printf("calc %d %d\n", ball, partition);
return mod_combi(ball + partition, ball);
}
int main() {
int n, k;
cin >> n >> k;
int brue = k;
int red = n - k;
factorial.assign(2001, 1);
for (int i = 1; i <= factorial.size(); i++) {
factorial[i] = factorial[i - 1] * i % mod;
}
vector<int> ans(k + 1, 0);
for (int i = 1; i <= k; i++) {
int rest_blue = k - i;
int rest_red = red - (i - 1);
if (rest_red < 0) {
break;
}
int patition_blue = i;
int patition_red = i + 1;
ans[i] = 1LL * calc(rest_blue, patition_blue - 1) *
calc(rest_red, patition_red - 1) % mod;
// printf("ans [%d] %d\n", i, ans[i]);
}
for (int i = 1; i <= k; i++) {
cout << ans[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
vector<long long> factorial;
long long mod_pow(long long a, long long p) {
vector<long long> vals = {a};
vector<long long> pow2s = {1};
while (pow2s.back() < p) {
long long val = vals.back() * vals.back() % mod;
vals.emplace_back(val);
pow2s.emplace_back(pow2s.back() << 1);
}
long long ret = 1;
long long p2 = p;
for (int i = vals.size() - 1; i >= 0; i--) {
if (p2 >= pow2s[i]) {
p2 -= pow2s[i];
ret = (ret * vals[i]) % mod;
}
}
return ret;
}
long long mod_combi(int n, int k) {
long long x = factorial[n];
long long y = factorial[k] * factorial[n - k] % mod;
y = mod_pow(y, mod - 2);
long long ret = x * y % mod;
return ret;
}
int calc(int ball, int partition) {
// printf("calc %d %d\n", ball, partition);
return mod_combi(ball + partition, ball);
}
int main() {
int n, k;
cin >> n >> k;
int brue = k;
int red = n - k;
factorial.assign(4001, 1);
for (int i = 1; i < factorial.size(); i++) {
factorial[i] = factorial[i - 1] * i % mod;
}
vector<int> ans(k + 1, 0);
for (int i = 1; i <= k; i++) {
int rest_blue = k - i;
int rest_red = red - (i - 1);
if (rest_red < 0) {
break;
}
int patition_blue = i;
int patition_red = i + 1;
ans[i] = 1LL * calc(rest_blue, patition_blue - 1) *
calc(rest_red, patition_red - 1) % mod;
// printf("ans [%d] %d\n", i, ans[i]);
}
for (int i = 1; i <= k; i++) {
cout << ans[i] << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 798,599 | 798,600 | u590241855 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll n_) : num((n_ + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint pow(const modint x, ll r) { return x ^ r; }
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
int main(void) {
ll n, k;
cin >> n >> k;
rep1(i, k) { cout << C(k - 1, i - 1) * C(n - k, i) << endl; }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll n_) : num((n_ + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint pow(const modint x, ll r) { return x ^ r; }
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
int main(void) {
ll n, k;
cin >> n >> k;
rep1(i, k) { cout << C(k - 1, i - 1) * C(n - k + 1, i) << endl; }
return 0;
}
| [
"expression.operation.binary.add"
] | 798,601 | 798,602 | u241615199 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, n, a) for (int i = (n); i >= (a); i--)
#define REPR(i, n) FOR(i, n, 0)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQR = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1000000007;
int a[2002][2002];
void minit() {
REP(i, 2000) {
REP(j, 2000) { a[i][j] = 0; }
}
a[0][0] = 1;
FOR(i, 0, 2001) {
FOR(j, 0, i + 1) {
a[i + 1][j] = (a[i + 1][j] + a[i][j]) % MOD;
a[i + 1][j + 1] = (a[i + 1][j + 1] + a[i][j]) % MOD;
}
}
}
int mod_comb(int i, int j) {
if (i == 0)
return 0;
if (j == 0)
return 0;
if (i < j)
return 0;
return a[i][j];
}
int main() {
minit();
int n, k;
cin >> n >> k;
int m = n - k; // red
ll ans = m + 1;
cout << ans << endl;
FOR(i, 2, k + 1) {
ll tmp = mod_comb(m + 1, i) * mod_comb(k - 1, i - 1) % MOD;
cout << tmp << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, n, a) for (int i = (n); i >= (a); i--)
#define REPR(i, n) FOR(i, n, 0)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQR = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1000000007;
int a[2002][2002];
void minit() {
REP(i, 2000) {
REP(j, 2000) { a[i][j] = 0; }
}
a[0][0] = 1;
FOR(i, 0, 2001) {
FOR(j, 0, i + 1) {
a[i + 1][j] = (a[i + 1][j] + a[i][j]) % MOD;
a[i + 1][j + 1] = (a[i + 1][j + 1] + a[i][j]) % MOD;
}
}
}
ll mod_comb(int i, int j) {
if (i == 0)
return 0;
if (j == 0)
return 0;
if (i < j)
return 0;
return a[i][j];
}
int main() {
minit();
int n, k;
cin >> n >> k;
int m = n - k; // red
ll ans = m + 1;
cout << ans << endl;
FOR(i, 2, k + 1) {
ll tmp = mod_comb(m + 1, i) * mod_comb(k - 1, i - 1) % MOD;
cout << tmp << endl;
}
}
| [] | 798,606 | 798,607 | u116518875 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
typedef long long ll;
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;
}
ll n, k;
int main() {
// 前処理
COMinit();
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
printf("%lld\n", COM(n - k + 1, i) * COM(k - 1, i - 1));
}
// 計算例
// cout << COM(100000, 50000) << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
typedef long long ll;
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;
}
ll n, k;
int main() {
// 前処理
COMinit();
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
printf("%lld\n", COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD);
}
}
| [
"expression.operation.binary.add"
] | 798,608 | 798,609 | u141938981 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int N = 2007, mod = 1e9 + 7;
int c[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 0; i <= n + 1; ++i) {
c[i][0] = 1;
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
for (int i = 1; i <= k; ++i)
cout << c[k - 1][i - 1] * c[n - k + 1][i] % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2007, mod = 1e9 + 7;
ll c[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 0; i <= n + 1; ++i) {
c[i][0] = 1;
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
for (int i = 1; i <= k; ++i)
cout << c[k - 1][i - 1] * c[n - k + 1][i] % mod << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 798,610 | 798,611 | u310673702 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define mod 1000000007
long long int comb[4001][4001] = {};
int main() {
int n, k;
cin >> n >> k;
comb[0][0] = 1;
for (int i = 1; i <= 2000; i++) {
comb[i][0] = 1;
for (int j = 1; j <= i; j++) {
comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % mod;
}
}
for (int i = 1; i <= k; i++) {
if (n - k < i - 1) {
// i回回収するためには赤ボールはi - 1個以上必要
cout << 0 << endl;
} else {
// n - k個の赤ボールの隙間(n - k +
// 1個ある)から青ボールを入れるi個の隙間を選ぶ
// k個のボールをiグループに分ける方法 = (k - 1)C(i - 1)
cout << (comb[n - k + 1][i] * comb[k - 1][i - 1]) << endl;
}
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define mod 1000000007
long long int comb[4001][4001] = {};
int main() {
int n, k;
cin >> n >> k;
comb[0][0] = 1;
for (int i = 1; i <= 2000; i++) {
comb[i][0] = 1;
for (int j = 1; j <= i; j++) {
comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % mod;
}
}
for (int i = 1; i <= k; i++) {
if (n - k < i - 1) {
// i回回収するためには赤ボールはi - 1個以上必要
cout << 0 << endl;
} else {
// n - k個の赤ボールの隙間(n - k +
// 1個ある)から青ボールを入れるi個の隙間を選ぶ
// k個のボールをiグループに分ける方法 = (k - 1)C(i - 1)
cout << (comb[n - k + 1][i] * comb[k - 1][i - 1]) % mod << endl;
}
}
} | [
"expression.operation.binary.add"
] | 798,621 | 798,622 | u261965335 | cpp |
p02990 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL << 62) - 1;
const ll MOD = 1e9 + 7;
const int MAX = 200001;
// fac[n]: n!
// finv[n]: (n!)^-1
// inv[n]: nの逆元
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void comb_init() {
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;
}
}
// 二項係数計算 (combination)
// nCk = (n!) * (k!)^-1 * ((n-k)!)^-1 として計算
ll comb(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;
}
// 重複組み合わせを求める
ll nHr(ll n, ll r) { return comb(n + r - 1, r); }
ll N, K;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
comb_init();
ll blue = K;
ll red = N - K;
for (ll i = 1; i <= blue; i++) {
if (i > red + 1) {
cout << 0 << endl;
continue;
}
if (i == 1) {
ll ans = comb(red + 1, i);
cout << ans % MOD << endl;
} else {
ll ans = comb(red + 1, i) * nHr(blue - 1, blue - i);
cout << ans % MOD << endl;
}
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL << 62) - 1;
const ll MOD = 1e9 + 7;
const int MAX = 200001;
// fac[n]: n!
// finv[n]: (n!)^-1
// inv[n]: nの逆元
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void comb_init() {
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;
}
}
// 二項係数計算 (combination)
// nCk = (n!) * (k!)^-1 * ((n-k)!)^-1 として計算
ll comb(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;
}
// 重複組み合わせを求める
ll nHr(ll n, ll r) { return comb(n + r - 1, r); }
ll N, K;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
comb_init();
ll blue = K;
ll red = N - K;
for (ll i = 1; i <= blue; i++) {
if (i > red + 1) {
cout << 0 << endl;
continue;
}
if (i == 1) {
ll ans = comb(red + 1, i);
cout << ans % MOD << endl;
} else {
ll ans = comb(red + 1, i) * comb(blue - 1, blue - i);
cout << ans % MOD << endl;
}
}
return 0;
} | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 798,623 | 798,624 | u751964641 | cpp |
p02990 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
class Combi {
private:
v(ll) fac, inv, finv;
void init(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < 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;
}
}
public:
Combi(int N) : fac(N + 1), inv(N + 1), finv(N + 1) { init(N + 1); }
int Cmod(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;
}
ll Pmod(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
};
int main() {
int N, K;
cin >> N >> K;
Combi c = Combi(N);
vi ans(K);
rep(i, K) {
int k = i + 1;
ans[i] = (c.Cmod(N - K + 1, k) % MOD) * (c.Cmod(K - 1, k - 1) % MOD);
ans[i] %= MOD;
}
rep(i, K) { cout << ans[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
class Combi {
private:
v(ll) fac, inv, finv;
void init(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < 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;
}
}
public:
Combi(int N) : fac(N + 1), inv(N + 1), finv(N + 1) { init(N + 1); }
ll Cmod(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;
}
ll Pmod(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
};
int main() {
int N, K;
cin >> N >> K;
Combi c = Combi(2000);
v(ll) ans(K);
rep(i, K) {
int k = i + 1;
ans[i] = (c.Cmod(N - K + 1, k) % MOD) * (c.Cmod(K - 1, k - 1) % MOD);
ans[i] %= MOD;
}
rep(i, K) { cout << ans[i] << endl; }
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.arguments.add"
] | 798,625 | 798,626 | u340293807 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
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 long long INF = 1LL << 60;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using bl = bool;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using vbl = V<bl>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define rFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define oFOR(i, a, b) for (ll i = (a); i < (b); i += 2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define M(a, b) max(a, b)
#define rM(a, b) min(a, b)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define co(a) cout << a << endl;
#define ci(a) cin >> a;
ll sum(ll n) {
ll m = 0;
FOR(i, 0, 20) {
m += n % 10;
n /= 10;
if (n == 0) {
break;
}
}
return m;
}
ll combi(ll n, ll m) {
ll ans = 1;
FOR(i, n - m + 1, n + 1) {
ans *= i;
ans /= (i - n + m);
ans %= 1000000007;
}
return ans;
}
ll lcm(ll a, ll b) {
ll n;
n = a / gcd(a, b) * b;
return n;
}
/****************************************\
| Thank you for viewing my code:) |
| Written by RedSpica a.k.a. RanseMirage |
| Twitter:@asakaakasaka |
\****************************************/
signed main() {
ll n, k;
ci(n >> k);
FOR(i, 1, k + 1) {
ll ans = combi(n - k + 1, i);
ans *= combi(k - 1, i - 1);
co(ans)
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
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 long long INF = 1LL << 60;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using bl = bool;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using vbl = V<bl>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define rFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define oFOR(i, a, b) for (ll i = (a); i < (b); i += 2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define M(a, b) max(a, b)
#define rM(a, b) min(a, b)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define co(a) cout << a << endl;
#define ci(a) cin >> a;
ll sum(ll n) {
ll m = 0;
FOR(i, 0, 20) {
m += n % 10;
n /= 10;
if (n == 0) {
break;
}
}
return m;
}
ll combi(ll n, ll m) {
ll ans = 1;
FOR(i, n - m + 1, n + 1) {
ans *= i;
ans /= (i - n + m);
}
return ans;
}
ll lcm(ll a, ll b) {
ll n;
n = a / gcd(a, b) * b;
return n;
}
/****************************************\
| Thank you for viewing my code:) |
| Written by RedSpica a.k.a. RanseMirage |
| Twitter:@asakaakasaka |
\****************************************/
const int MAX = 510000;
const int MOD = 1000000007;
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() {
// 前処理
COMinit();
ll n, k;
ci(n >> k) FOR(i, 1, k + 1) {
ll ans = 1;
ans *= COM(n - k + 1, i);
ans *= COM(k - 1, i - 1);
ans %= 1000000007;
co(ans)
}
}
| [] | 798,631 | 798,632 | u835924161 | cpp |
p02990 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {0};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
COMB[n][r] = (COMB[n - 1][r - 1] + COMB[n - 1][r]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
comb_init(N);
for (int k = 1; k <= K; ++k)
cout << ((uint64_t)COMB[N - K + 1][k] * COMB[K - 1][k - 1]) % MOD << endl;
return 0;
}
| #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {1};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
COMB[n][r] = (COMB[n - 1][r - 1] + COMB[n - 1][r]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
comb_init(N);
for (int k = 1; k <= K; ++k)
cout << ((uint64_t)COMB[N - K + 1][k] * COMB[K - 1][k - 1]) % MOD << endl;
return 0;
}
| [
"literal.number.change"
] | 798,633 | 798,634 | u843070415 | cpp |
p02990 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {0};
// uint32_t comb(uint32_t n, uint32_t r)
// {
// if (COMB[n][r] != 0)
// return COMB[n][r];
// cerr << n << ' ' << r << endl;
// cerr << COMB[n][r] << endl;
// // else if (n==r || r==0)
// // return COMB[n][r] = 1;
// // else {
// // return COMB[n][r] = (comb(n-1,r-1) + comb(n-1,r))%MOD;
// // }
// }
void comb_init(uint32_t N) {
// COMB[0][0] = 1;
// COMB[1][0] = 1;
// COMB[1][1] = 1;
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
COMB[n][r] = (COMB[n - 1][r - 1] + COMB[n - 1][r]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
comb_init(N);
for (int k = 1; k <= K; ++k)
// cout << ((uint64_t)comb(N-K+1,k)*comb(K-1,k-1))%MOD << endl;
cout << ((uint64_t)COMB[N - K + 1][k] * COMB[K - 1][k - 1]) % MOD << endl;
return 0;
}
| #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {1};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
COMB[n][r] = (COMB[n - 1][r - 1] + COMB[n - 1][r]) % MOD;
}
}
}
int main() {
int N, K;
cin >> N >> K;
comb_init(N);
for (int k = 1; k <= K; ++k)
cout << ((uint64_t)COMB[N - K + 1][k] * COMB[K - 1][k - 1]) % MOD << endl;
return 0;
}
| [
"literal.number.change"
] | 798,636 | 798,634 | u843070415 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MAX = 2001;
const int MOD = 1000000007;
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(void) {
COMinit();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << COM(n - k + 1, i) * COM(k - 1, i - 1) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
const int MAX = 2001;
const int MOD = 1000000007;
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(void) {
COMinit();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << (COM(n - k + 1, i) * COM(k - 1, i - 1)) % MOD << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 798,644 | 798,645 | u810075828 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
int c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
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;
}
}
}
int comb(int n, int r) { return c[n][r]; }
int main() {
int n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans = comb(n - k + 1, i) * comb(k - 1, i - 1);
printf("%lld\n", ans % MOD);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
ll c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
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 comb(int n, int r) { return c[n][r]; }
int main() {
int n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans = comb(n - k + 1, i) * comb(k - 1, i - 1);
printf("%lld\n", ans % MOD);
}
return 0;
} | [
"variable_declaration.type.change"
] | 798,646 | 798,647 | u221067205 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const ll MOD = 1e9 + 7;
int c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
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;
}
}
}
int comb(int n, int r) { return c[n][r]; }
int main() {
int n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans = comb(n - k + 1, i) * comb(k - 1, i - 1);
printf("%lld\n", ans % MOD);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
ll c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
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 comb(int n, int r) { return c[n][r]; }
int main() {
int n, k;
cin >> n >> k;
init();
for (int i = 1; i <= k; i++) {
ll ans = comb(n - k + 1, i) * comb(k - 1, i - 1);
printf("%lld\n", ans % MOD);
}
return 0;
} | [
"variable_declaration.type.change"
] | 798,648 | 798,647 | u221067205 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll M = 1000000007;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
// fac[0] = fac[1] = 1;
// finv[0] = finv[1] = 1;
// inv[0] = inv[1] = 1;
for (ll i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll c4(ll n, ll k, ll m) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
signed main() {
ll N, K;
cin >> N >> K;
c4_init(M);
for (ll i = 1; i <= K; i++) {
cout << c4(N - K + 1, i, M) * c4(K - 1, i - 1, M) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll M = 1000000007;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
// fac[0] = fac[1] = 1;
// finv[0] = finv[1] = 1;
// inv[0] = inv[1] = 1;
for (ll i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll c4(ll n, ll k, ll m) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
signed main() {
ll N, K;
cin >> N >> K;
c4_init(M);
for (ll i = 1; i <= K; i++) {
cout << c4(N - K + 1, i, M) * c4(K - 1, i - 1, M) % M << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 798,649 | 798,650 | u702996070 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<vector<ll>> com(2010, vector<ll>(2010));
void comb(int n) {
for (int i = 0; i < n; i++) {
com[i][0] = 1;
com[i][i] = 1;
}
for (int k = 1; k < n; k++) {
for (int j = 1; j < k; j++) {
com[k][j] = (com[k - 1][j - 1] + com[k - 1][j]) % mod;
}
}
}
int main() {
int n, k;
cin >> n >> k;
// r=n-k,b=k
//回収するのはb
int r = n - k, b = k;
vector<ll> ans;
comb(n);
for (int i = 1; i <= k; i++) {
ll tmp = (com[r + 1][i] * com[b - 1][i - 1]) % mod;
ans.push_back(tmp);
}
rep(i, k) cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<vector<ll>> com(2010, vector<ll>(2010));
void comb(int n) {
for (int i = 0; i < n; i++) {
com[i][0] = 1;
com[i][i] = 1;
}
for (int k = 1; k < n; k++) {
for (int j = 1; j < k; j++) {
com[k][j] = (com[k - 1][j - 1] + com[k - 1][j]) % mod;
}
}
}
int main() {
int n, k;
cin >> n >> k;
// r=n-k,b=k
//回収するのはb
int r = n - k, b = k;
vector<ll> ans;
comb(n + 10);
for (int i = 1; i <= k; i++) {
ll tmp = (com[r + 1][i] * com[b - 1][i - 1]) % mod;
ans.push_back(tmp);
}
rep(i, k) cout << ans[i] << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 798,657 | 798,658 | u022832318 | cpp |
p02990 | #include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#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, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define SORTR(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.begin(), v.end(), greater<int>());
#define REMOVE(v, n) remove(vector<int> v, v + v.size(), int n)
#define ll long long
#define ull unsigned long long
#define pb(a) push_back(a)
#define INF 999999999
#define V(v, i, j) vector(v.begin() + i, v.begin() + j)
#define INSERT(va, vb) va.insert(va.end(), vb.begin(), vb.end())
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
const int MOD = 1000000007;
// vector< vector<int> > v (size1, vector<int>(size2) );
const int MAX = 510000;
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() {
COMinit();
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
FOR(i, 0, k) { cout << COM(k - 1, i) * COM(n - k + 1, i + 1) << endl; }
} | #include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#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, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define SORTR(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.begin(), v.end(), greater<int>());
#define REMOVE(v, n) remove(vector<int> v, v + v.size(), int n)
#define ll long long
#define ull unsigned long long
#define pb(a) push_back(a)
#define INF 999999999
#define V(v, i, j) vector(v.begin() + i, v.begin() + j)
#define INSERT(va, vb) va.insert(va.end(), vb.begin(), vb.end())
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
const int MOD = 1000000007;
// vector< vector<int> > v (size1, vector<int>(size2) );
const int MAX = 510000;
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() {
COMinit();
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
FOR(i, 0, k) { cout << COM(k - 1, i) * COM(n - k + 1, i + 1) % MOD << endl; }
}
| [
"expression.operation.binary.add"
] | 798,659 | 798,660 | u908349502 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int N = 2002, mod = 1e9 + 7;
int c[N][N];
int main() {
int n, k;
int i, j;
cin >> n >> k;
for (i = 0; i <= n + 1; i++) {
c[i][0] = 1;
for (j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (i = 1; i <= k; i++) {
int ans = c[k - 1][i - 1] * c[n - k + 1][i] % mod;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2002, mod = 1e9 + 7;
int c[N][N];
int main() {
int n, k;
int i, j;
cin >> n >> k;
for (i = 0; i <= n + 1; i++) {
c[i][0] = 1;
for (j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (i = 1; i <= k; i++) {
int ans = 1ll * c[k - 1][i - 1] * c[n - k + 1][i] % mod;
cout << ans << endl;
}
return 0;
} | [
"assignment.change"
] | 798,665 | 798,666 | u127768253 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define elif else if
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run(a) __attribute__((constructor)) def _##a()
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define fi first
#define se second
#define ok(a, b) (0 <= (a) && (a) < (b))
#define modulo(a) ((a % mod + mod) % mod)
template <class T> using vvector = vector<vector<T>>;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
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;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << endl; \
rep(__i, h) { \
rep(__j, w) cerr << a[__i][__j] << space; \
cerr << endl; \
} \
cerr << "]" << endl; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) if (__i) cerr << space << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
struct edge {
ll to, cost;
edge(ll a, ll b) : to(a), cost(b) {}
};
struct position {
ll x, y;
position() {}
position(ll a, ll b) : x(a), y(b) {}
position next(ll i) { return {x + dx[i], y + dy[i]}; }
ll mdist() { return abs(x) + abs(y); }
double dist() { return sqrt(x * x + y * y); }
double norm(ll d) {
if (d == inf)
return max(x, y);
if (d == 1)
return mdist();
if (d == 2)
return dist();
return 0;
}
ll num(ll width) { return abs(x) * width + abs(y); }
bool operator==(position a) { return x == a.x && y == a.y; }
bool operator!=(position a) { return x != a.x || y != a.y; }
bool operator<(position a) { return x < a.x && y < a.y; }
bool operator>(position a) { return x > a.x && y > a.y; }
bool operator<=(position a) { return x <= a.x && y <= a.y; }
bool operator>=(position a) { return x >= a.x && y >= a.y; }
position operator+(position a) { return position(x + a.x, y + a.y); }
position operator-(position a) { return position(x - a.x, y - a.y); }
position operator*(position a) { return position(x * a.x, y * a.y); }
position operator/(position a) { return position(x / a.x, y / a.y); }
position operator%(position a) { return position(x % a.x, y % a.y); }
position complex(position a) {
return position(x * a.x - y * a.y, x * a.y + y * a.x);
}
/*
// for sort:
bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
*/
};
position Origin = position(0, 0);
using pos = position;
using vec = position;
struct Range {
ll left, right;
Range() {}
Range(ll l, ll r) : left(l), right(r) {}
ll length() { return right - left; }
bool operator==(Range A) { return left == A.left && right == A.right; }
bool operator!=(Range A) { return !(Range(left, right) == A); }
bool operator>(Range A) { return left < A.left && right > A.right; }
bool operator<(Range A) { return left > A.left && right < A.right; }
bool operator>=(Range A) { return left <= A.left && right >= A.right; }
bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
#define loop() for (;;)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run(0) { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")
// Gen-Test
#define RAND(a) \
{ \
random_device rnd; \
mt19937_64 a(rnd()); \
}
#define warning(A) \
if (!(A)) \
return 1
#define sin(a, b) ifstream a(b);
#define sout(a, b) ofstream a(b);
// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }
template <class T> def in() {
T A;
cin >> A;
return A;
}
template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
rep(i, H) {
rep(j, W) {
if (j)
cout << divc << A[i][j];
else
cout << A[i][j];
}
cout << endc;
}
}
ll n = 10000;
def 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;
}
def mod_inv(ll a) {
ll x, y;
ll d = extgcd(a, MOD, x, y);
return (d == 1) * ((x + MOD) % MOD);
}
ll dataf[100001], datai[100001];
ll mod_fact(ll a) {
if (a == 0)
return 1;
if (dataf[a])
return dataf[a];
return dataf[a] = mod_fact(a - 1) * a % MOD;
}
ll mod_inv_fact(ll a) {
if (a == n)
return mod_inv(mod_fact(n));
if (datai[a])
return datai[a];
return datai[a] = mod_inv_fact(a + 1) * (a + 1) % MOD;
}
ll mod_comb_fast(ll n, ll r) {
if (r < 0 || n < r)
return 0LL;
return mod_fact(n) * mod_inv_fact(n - r) % MOD * mod_inv_fact(r) % MOD;
}
signed main() {
ll N, K;
cin >> N >> K;
#define nCr mod_comb_fast
rep(i, K) cout << nCr(N - K + 1, i + 1) * nCr(K - 1, i) << endl;
}
// 今年残り 331AC
// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++20 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define elif else if
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run(a) __attribute__((constructor)) def _##a()
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define fi first
#define se second
#define ok(a, b) (0 <= (a) && (a) < (b))
#define modulo(a) ((a % mod + mod) % mod)
template <class T> using vvector = vector<vector<T>>;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
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;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << endl; \
rep(__i, h) { \
rep(__j, w) cerr << a[__i][__j] << space; \
cerr << endl; \
} \
cerr << "]" << endl; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) if (__i) cerr << space << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
struct edge {
ll to, cost;
edge(ll a, ll b) : to(a), cost(b) {}
};
struct position {
ll x, y;
position() {}
position(ll a, ll b) : x(a), y(b) {}
position next(ll i) { return {x + dx[i], y + dy[i]}; }
ll mdist() { return abs(x) + abs(y); }
double dist() { return sqrt(x * x + y * y); }
double norm(ll d) {
if (d == inf)
return max(x, y);
if (d == 1)
return mdist();
if (d == 2)
return dist();
return 0;
}
ll num(ll width) { return abs(x) * width + abs(y); }
bool operator==(position a) { return x == a.x && y == a.y; }
bool operator!=(position a) { return x != a.x || y != a.y; }
bool operator<(position a) { return x < a.x && y < a.y; }
bool operator>(position a) { return x > a.x && y > a.y; }
bool operator<=(position a) { return x <= a.x && y <= a.y; }
bool operator>=(position a) { return x >= a.x && y >= a.y; }
position operator+(position a) { return position(x + a.x, y + a.y); }
position operator-(position a) { return position(x - a.x, y - a.y); }
position operator*(position a) { return position(x * a.x, y * a.y); }
position operator/(position a) { return position(x / a.x, y / a.y); }
position operator%(position a) { return position(x % a.x, y % a.y); }
position complex(position a) {
return position(x * a.x - y * a.y, x * a.y + y * a.x);
}
/*
// for sort:
bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
*/
};
position Origin = position(0, 0);
using pos = position;
using vec = position;
struct Range {
ll left, right;
Range() {}
Range(ll l, ll r) : left(l), right(r) {}
ll length() { return right - left; }
bool operator==(Range A) { return left == A.left && right == A.right; }
bool operator!=(Range A) { return !(Range(left, right) == A); }
bool operator>(Range A) { return left < A.left && right > A.right; }
bool operator<(Range A) { return left > A.left && right < A.right; }
bool operator>=(Range A) { return left <= A.left && right >= A.right; }
bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
#define loop() for (;;)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run(0) { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")
// Gen-Test
#define RAND(a) \
{ \
random_device rnd; \
mt19937_64 a(rnd()); \
}
#define warning(A) \
if (!(A)) \
return 1
#define sin(a, b) ifstream a(b);
#define sout(a, b) ofstream a(b);
// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }
template <class T> def in() {
T A;
cin >> A;
return A;
}
template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
rep(i, H) {
rep(j, W) {
if (j)
cout << divc << A[i][j];
else
cout << A[i][j];
}
cout << endc;
}
}
ll n = 10000;
def 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;
}
def mod_inv(ll a) {
ll x, y;
ll d = extgcd(a, MOD, x, y);
return (d == 1) * ((x + MOD) % MOD);
}
ll dataf[100001], datai[100001];
ll mod_fact(ll a) {
if (a == 0)
return 1;
if (dataf[a])
return dataf[a];
return dataf[a] = mod_fact(a - 1) * a % MOD;
}
ll mod_inv_fact(ll a) {
if (a == n)
return mod_inv(mod_fact(n));
if (datai[a])
return datai[a];
return datai[a] = mod_inv_fact(a + 1) * (a + 1) % MOD;
}
ll mod_comb_fast(ll n, ll r) {
if (r < 0 || n < r)
return 0LL;
return mod_fact(n) * mod_inv_fact(n - r) % MOD * mod_inv_fact(r) % MOD;
}
signed main() {
ll N, K;
cin >> N >> K;
#define nCr mod_comb_fast
rep(i, K) cout << nCr(N - K + 1, i + 1) * nCr(K - 1, i) % MOD << endl;
}
// 今年残り 331AC
// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++20 | [
"expression.operation.binary.add"
] | 798,680 | 798,681 | u398942100 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define elif else if
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run(a) __attribute__((constructor)) def _##a()
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define fi first
#define se second
#define ok(a, b) (0 <= (a) && (a) < (b))
#define modulo(a) ((a % mod + mod) % mod)
template <class T> using vvector = vector<vector<T>>;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
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;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << endl; \
rep(__i, h) { \
rep(__j, w) cerr << a[__i][__j] << space; \
cerr << endl; \
} \
cerr << "]" << endl; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) if (__i) cerr << space << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
struct edge {
ll to, cost;
edge(ll a, ll b) : to(a), cost(b) {}
};
struct position {
ll x, y;
position() {}
position(ll a, ll b) : x(a), y(b) {}
position next(ll i) { return {x + dx[i], y + dy[i]}; }
ll mdist() { return abs(x) + abs(y); }
double dist() { return sqrt(x * x + y * y); }
double norm(ll d) {
if (d == inf)
return max(x, y);
if (d == 1)
return mdist();
if (d == 2)
return dist();
return 0;
}
ll num(ll width) { return abs(x) * width + abs(y); }
bool operator==(position a) { return x == a.x && y == a.y; }
bool operator!=(position a) { return x != a.x || y != a.y; }
bool operator<(position a) { return x < a.x && y < a.y; }
bool operator>(position a) { return x > a.x && y > a.y; }
bool operator<=(position a) { return x <= a.x && y <= a.y; }
bool operator>=(position a) { return x >= a.x && y >= a.y; }
position operator+(position a) { return position(x + a.x, y + a.y); }
position operator-(position a) { return position(x - a.x, y - a.y); }
position operator*(position a) { return position(x * a.x, y * a.y); }
position operator/(position a) { return position(x / a.x, y / a.y); }
position operator%(position a) { return position(x % a.x, y % a.y); }
position complex(position a) {
return position(x * a.x - y * a.y, x * a.y + y * a.x);
}
/*
// for sort:
bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
*/
};
position Origin = position(0, 0);
using pos = position;
using vec = position;
struct Range {
ll left, right;
Range() {}
Range(ll l, ll r) : left(l), right(r) {}
ll length() { return right - left; }
bool operator==(Range A) { return left == A.left && right == A.right; }
bool operator!=(Range A) { return !(Range(left, right) == A); }
bool operator>(Range A) { return left < A.left && right > A.right; }
bool operator<(Range A) { return left > A.left && right < A.right; }
bool operator>=(Range A) { return left <= A.left && right >= A.right; }
bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
#define loop() for (;;)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run(0) { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")
// Gen-Test
#define RAND(a) \
{ \
random_device rnd; \
mt19937_64 a(rnd()); \
}
#define warning(A) \
if (!(A)) \
return 1
#define sin(a, b) ifstream a(b);
#define sout(a, b) ofstream a(b);
// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }
template <class T> def in() {
T A;
cin >> A;
return A;
}
template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
rep(i, H) {
rep(j, W) {
if (j)
cout << divc << A[i][j];
else
cout << A[i][j];
}
cout << endc;
}
}
ll n = 3000;
def 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;
}
def mod_inv(ll a) {
ll x, y;
ll d = extgcd(a, MOD, x, y);
return (d == 1) * ((x + MOD) % MOD);
}
ll dataf[100001], datai[100001];
ll mod_fact(ll a) {
if (a == 0)
return 1;
if (dataf[a])
return dataf[a];
return dataf[a] = mod_fact(a - 1) * a % MOD;
}
ll mod_inv_fact(ll a) {
if (a == n)
return mod_inv(mod_fact(n));
if (datai[a])
return datai[a];
return datai[a] = mod_inv_fact(a + 1) * (a + 1) % MOD;
}
ll mod_comb_fast(ll n, ll r) {
if (r < 0 || n < r)
return 0LL;
return mod_fact(n) * mod_inv_fact(n - r) % MOD * mod_inv_fact(r) % MOD;
}
signed main() {
ll N, K;
cin >> N >> K;
#define nCr mod_comb_fast
rep(i, K) cout << nCr(N - K + 1, i + 1) * nCr(K - 1, i) << endl;
}
// 今年残り 331AC
// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++20 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define elif else if
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run(a) __attribute__((constructor)) def _##a()
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define fi first
#define se second
#define ok(a, b) (0 <= (a) && (a) < (b))
#define modulo(a) ((a % mod + mod) % mod)
template <class T> using vvector = vector<vector<T>>;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
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;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << endl; \
rep(__i, h) { \
rep(__j, w) cerr << a[__i][__j] << space; \
cerr << endl; \
} \
cerr << "]" << endl; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) if (__i) cerr << space << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
struct edge {
ll to, cost;
edge(ll a, ll b) : to(a), cost(b) {}
};
struct position {
ll x, y;
position() {}
position(ll a, ll b) : x(a), y(b) {}
position next(ll i) { return {x + dx[i], y + dy[i]}; }
ll mdist() { return abs(x) + abs(y); }
double dist() { return sqrt(x * x + y * y); }
double norm(ll d) {
if (d == inf)
return max(x, y);
if (d == 1)
return mdist();
if (d == 2)
return dist();
return 0;
}
ll num(ll width) { return abs(x) * width + abs(y); }
bool operator==(position a) { return x == a.x && y == a.y; }
bool operator!=(position a) { return x != a.x || y != a.y; }
bool operator<(position a) { return x < a.x && y < a.y; }
bool operator>(position a) { return x > a.x && y > a.y; }
bool operator<=(position a) { return x <= a.x && y <= a.y; }
bool operator>=(position a) { return x >= a.x && y >= a.y; }
position operator+(position a) { return position(x + a.x, y + a.y); }
position operator-(position a) { return position(x - a.x, y - a.y); }
position operator*(position a) { return position(x * a.x, y * a.y); }
position operator/(position a) { return position(x / a.x, y / a.y); }
position operator%(position a) { return position(x % a.x, y % a.y); }
position complex(position a) {
return position(x * a.x - y * a.y, x * a.y + y * a.x);
}
/*
// for sort:
bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
*/
};
position Origin = position(0, 0);
using pos = position;
using vec = position;
struct Range {
ll left, right;
Range() {}
Range(ll l, ll r) : left(l), right(r) {}
ll length() { return right - left; }
bool operator==(Range A) { return left == A.left && right == A.right; }
bool operator!=(Range A) { return !(Range(left, right) == A); }
bool operator>(Range A) { return left < A.left && right > A.right; }
bool operator<(Range A) { return left > A.left && right < A.right; }
bool operator>=(Range A) { return left <= A.left && right >= A.right; }
bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
#define loop() for (;;)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run(0) { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")
// Gen-Test
#define RAND(a) \
{ \
random_device rnd; \
mt19937_64 a(rnd()); \
}
#define warning(A) \
if (!(A)) \
return 1
#define sin(a, b) ifstream a(b);
#define sout(a, b) ofstream a(b);
// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }
template <class T> def in() {
T A;
cin >> A;
return A;
}
template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
rep(i, H) {
rep(j, W) {
if (j)
cout << divc << A[i][j];
else
cout << A[i][j];
}
cout << endc;
}
}
ll n = 10000;
def 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;
}
def mod_inv(ll a) {
ll x, y;
ll d = extgcd(a, MOD, x, y);
return (d == 1) * ((x + MOD) % MOD);
}
ll dataf[100001], datai[100001];
ll mod_fact(ll a) {
if (a == 0)
return 1;
if (dataf[a])
return dataf[a];
return dataf[a] = mod_fact(a - 1) * a % MOD;
}
ll mod_inv_fact(ll a) {
if (a == n)
return mod_inv(mod_fact(n));
if (datai[a])
return datai[a];
return datai[a] = mod_inv_fact(a + 1) * (a + 1) % MOD;
}
ll mod_comb_fast(ll n, ll r) {
if (r < 0 || n < r)
return 0LL;
return mod_fact(n) * mod_inv_fact(n - r) % MOD * mod_inv_fact(r) % MOD;
}
signed main() {
ll N, K;
cin >> N >> K;
#define nCr mod_comb_fast
rep(i, K) cout << nCr(N - K + 1, i + 1) * nCr(K - 1, i) % MOD << endl;
}
// 今年残り 331AC
// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++20 | [
"literal.number.change",
"variable_declaration.value.change"
] | 798,682 | 798,681 | u398942100 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
long long c[2001][2001];
int main() {
long DIV = 1e9 + 7;
int n, k;
cin >> n >> k;
int Nmax = max(n - k + 1, k - 1);
for (int i = 0; i <= Nmax; i++) {
for (int j = 0; j <= Nmax; j++) {
if (j <= i) {
c[i][j] = 1;
} else {
c[i][j] = 0;
}
}
}
for (int i = 2; i <= Nmax; i++) {
for (int j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % DIV;
}
}
for (int i = 0; i <= Nmax; i++) {
for (int j = 0; j <= Nmax; j++) {
if (j > i) {
c[i][j] = 1;
}
}
}
for (int i = 1; i <= k; i++) {
if (i <= n - k + 1) {
cout << (c[n - k + 1][i] * c[k - 1][i - 1]) % DIV << endl;
} else {
cout << 1 << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
long long c[2001][2001];
int main() {
long DIV = 1e9 + 7;
int n, k;
cin >> n >> k;
int Nmax = max(n - k + 1, k - 1);
for (int i = 0; i <= Nmax; i++) {
for (int j = 0; j <= Nmax; j++) {
if (j <= i) {
c[i][j] = 1;
} else {
c[i][j] = 0;
}
}
}
for (int i = 2; i <= Nmax; i++) {
for (int j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % DIV;
}
}
for (int i = 0; i <= Nmax; i++) {
for (int j = 0; j <= Nmax; j++) {
if (j > i) {
c[i][j] = 1;
}
}
}
for (int i = 1; i <= k; i++) {
if (i <= n - k + 1) {
cout << (c[n - k + 1][i] * c[k - 1][i - 1]) % DIV << endl;
} else {
cout << 0 << endl;
}
}
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 798,685 | 798,686 | u947304300 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + 1ll * (c[k][i] * c[j][i - 1]) % M * (n - k - j + 1) % M) % M;
printf("%lld\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + 1ll * c[k][i] * c[j][i - 1] % M * (n - k - j + 1) % M) % M;
printf("%lld\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| [] | 798,687 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + (c[k][i] * c[j][i - 1]) % M * (n - k - j + 1) % M) % M;
printf("%lld\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + 1ll * c[k][i] * c[j][i - 1] % M * (n - k - j + 1) % M) % M;
printf("%lld\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,689 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + (c[k][i] * c[j][i - 1]) % M * (n - k - j + 1) % M) % M;
printf("%d\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[j][k][0]=(dp[j][k][0]+dp[j][k][1])%M;
// dp[j][k][1]=(dp[j-1][k-1][0]+dp[j-1][k][1])%M;
// }
// }
// }
// for (int i=1;i<=k;i++) printf("%d\n",(dp[k][i][0]+dp[k][i][1])%M);
//}
////TLM
int n, k, c[N][N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c[i][1] = c[i][i] = 1;
for (int j = 2; j < i; j++)
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
c[0][0] = 1;
for (int i = 1; i <= k; i++) {
ll ans = 0;
for (int j = i - 1; j <= n - k; j++)
ans = (ans + 1ll * c[k][i] * c[j][i - 1] % M * (n - k - j + 1) % M) % M;
printf("%lld\n", ans);
}
}
// B:C(i,k);
// R:C(i+1,n-k);
| [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 798,690 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
ll f[101010];
void factInit() {
f[0] = 1;
for (ll i = 1; i < 101010; i++)
f[i] = (f[i - 1] * i) % MOD;
}
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;
}
ll combination(ll n, ll r) {
if (n < r)
return 1;
// nCk = n! / ((n-k)! * k!)
ll a = f[n]; // = n!
ll b = f[n - r]; // = (n-k)!
ll c = f[r]; // = k!
ll bc = (b % MOD * c % MOD) % MOD;
// return (a / bc) % MOD;
return (a * inv(bc)) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ll blue = k;
ll red = n - k;
factInit();
for (ll i = 1; i <= blue; i++) {
ll c = combination(red + 1, i);
ll c2 = combination(k - 1, i - 1);
ll res = c % MOD * c2 % MOD;
cout << res % MOD << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
ll f[101010];
void factInit() {
f[0] = 1;
for (ll i = 1; i < 101010; i++)
f[i] = (f[i - 1] * i) % MOD;
}
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;
}
ll combination(ll n, ll r) {
if (n < r)
return 0;
// nCk = n! / ((n-k)! * k!)
ll a = f[n]; // = n!
ll b = f[n - r]; // = (n-k)!
ll c = f[r]; // = k!
ll bc = (b % MOD * c % MOD) % MOD;
// return (a / bc) % MOD;
return (a * inv(bc)) % MOD;
}
int main() {
ll n, k;
cin >> n >> k;
ll blue = k;
ll red = n - k;
factInit();
for (ll i = 1; i <= blue; i++) {
ll c = combination(red + 1, i);
ll c2 = combination(k - 1, i - 1);
ll res = c % MOD * c2 % MOD;
cout << res % MOD << endl;
}
} | [
"literal.number.change",
"function.return_value.change"
] | 798,703 | 798,704 | u881599732 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << (x) << endl
#define ps(x) cout << (x);
#define pfix(d, x) cout << fixed << setprecision(d) << x << endl;
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
#define fi first
#define se second
ll a[31][100001], b, c[100001], d, n, m, p, q, x, y, k, h, w, sum, mi, ma,
ans[100001], l, r, res, tmp;
bool flag;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
char cha;
string s;
typedef vector<int> VI;
typedef vector<pair<int, int>> VP;
vector<vector<ll>> combi(int n) {
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
rep(i, n + 1) {
v[i][0] = 1;
v[i][i] = 1;
}
rep(i, 1, n + 1) rep(j, 1, i) { v[i][j] = v[i - 1][j - 1] + v[i - 1][j]; }
return v;
}
// i回操作のボールの並べ方： {N-K+1}C{i}*{K-1}C{i-1}
int main() {
cin >> n >> k;
vector<vector<ll>> v = combi(n + 1);
rep(i, 1, k + 1) p(v[n - k + 1][i] * v[k - 1][i - 1] % mod);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#define d(x) cerr << #x << "=" << x << endl;
#define p(x) cout << (x) << endl
#define ps(x) cout << (x);
#define pfix(d, x) cout << fixed << setprecision(d) << x << endl;
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define minel(v) *min_element(all(v))
#define minind(v) distance((v).begin(), min_element(all(v)))
#define maxel(v) *max_element(all(v))
#define maxind(v) distance((v).begin(), max_element(all(v)))
#define fi first
#define se second
ll a[31][100001], b, c[100001], d, n, m, p, q, x, y, k, h, w, sum, mi, ma,
ans[100001], l, r, res, tmp;
bool flag;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
char cha;
string s;
typedef vector<int> VI;
typedef vector<pair<int, int>> VP;
vector<vector<ll>> combi(int n) {
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
rep(i, n + 1) {
v[i][0] = 1;
v[i][i] = 1;
}
rep(i, 1, n + 1) rep(j, 1, i) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
return v;
}
// i回操作のボールの並べ方： {N-K+1}C{i}*{K-1}C{i-1}
int main() {
cin >> n >> k;
vector<vector<ll>> v = combi(n + 1);
rep(i, 1, k + 1) p(v[n - k + 1][i] * v[k - 1][i - 1] % mod);
return 0;
}
| [
"assignment.change"
] | 798,709 | 798,710 | u001566280 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll m = pow(10, 9) + 7;
vector<ll> fac(2001);
vector<ll> ifac(2001);
ll mpow(ll a, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n = n >> 1;
}
return ans;
}
void COMinit() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 0; i < 2000; i++) {
fac[i + 1] = fac[i] * (i + 1) % m;
ifac[i + 1] = ifac[i] * mpow(i + 1, m - 2) % m;
}
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0) {
return 1;
}
if (a < b && a < 0) {
return 0;
}
ll tmp = ifac[a - b] * ifac[b] % m;
return tmp * fac[a] % m;
}
int main() {
ll N, K;
cin >> N >> K;
COMinit();
for (int i = 1; i <= K; i++) {
ll ans = 0;
ans = comb(N - K + 1, i) * comb(K - 1, i - 1) % m;
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll m = pow(10, 9) + 7;
vector<ll> fac(2001);
vector<ll> ifac(2001);
ll mpow(ll a, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n = n >> 1;
}
return ans;
}
void COMinit() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 0; i < 2000; i++) {
fac[i + 1] = fac[i] * (i + 1) % m;
ifac[i + 1] = ifac[i] * mpow(i + 1, m - 2) % m;
}
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0) {
return 1;
}
if (a < b || a < 0) {
return 0;
}
ll tmp = ifac[a - b] * ifac[b] % m;
return tmp * fac[a] % m;
}
int main() {
ll N, K;
cin >> N >> K;
COMinit();
for (int i = 1; i <= K; i++) {
ll ans = 0;
ans = comb(N - K + 1, i) * comb(K - 1, i - 1) % m;
cout << ans << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 798,711 | 798,712 | u255172538 | cpp |
p02990 | #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
const int N = 4e5 + 5;
const int MOD = 1e9 + 7;
int n, m, k;
int fact[N], invfact[N];
int pow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
int modinv(int k) { return pow(k, MOD - 2, MOD); }
void precompute() {
fact[0] = fact[1] = 1;
for (int i = 2; i < N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
invfact[N - 1] = modinv(fact[N - 1]);
for (int i = N - 2; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1);
invfact[i] %= MOD;
}
}
int nCr(int x, int y) {
if (y > x)
return 0;
int num = fact[x];
num *= invfact[y];
num %= MOD;
num *= invfact[x - y];
num %= MOD;
return num;
}
int bulec[2020], redc[2020];
int32_t main() {
IOS;
cin >> n >> k;
precompute();
int ans = 0;
// cout << nCr(1995 + 4 - 1, 4 - 1)%MOD << endl;
for (int i = 0; i < k; i++) { //箱
bulec[i] = nCr(k - 1, i) % MOD;
// cout << bulec[i] << "bule" << i << endl;
redc[i] = 1;
}
int use = n - k; // cout << red << endl;
for (int i = 0; i < use; i++) {
int red = use - i;
if (red < 0) {
redc[i] = 0;
}
/*else if (red + i + 2 - 1 < red) {
continue;
}*/
redc[i] = nCr(red + i + 1, red) % MOD;
// cout << redc[i] << "red" << i << endl;
}
for (int i = 0; i < k; i++) {
int ans = (bulec[i] * redc[i]) % MOD;
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
const int N = 4e5 + 5;
const int MOD = 1e9 + 7;
int n, m, k;
int fact[N], invfact[N];
int pow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
int modinv(int k) { return pow(k, MOD - 2, MOD); }
void precompute() {
fact[0] = fact[1] = 1;
for (int i = 2; i < N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
invfact[N - 1] = modinv(fact[N - 1]);
for (int i = N - 2; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1);
invfact[i] %= MOD;
}
}
int nCr(int x, int y) {
if (y > x)
return 0;
int num = fact[x];
num *= invfact[y];
num %= MOD;
num *= invfact[x - y];
num %= MOD;
return num;
}
int bulec[2020], redc[2020];
int32_t main() {
IOS;
cin >> n >> k;
precompute();
int ans = 0;
// cout << nCr(1995 + 4 - 1, 4 - 1)%MOD << endl;
for (int i = 0; i < k; i++) { //箱
bulec[i] = nCr(k - 1, i) % MOD;
// cout << bulec[i] << "bule" << i << endl;
redc[i] = 1;
}
int use = n - k; // cout << red << endl;
for (int i = 0; i < k; i++) {
int red = use - i;
if (red < 0) {
redc[i] = 0;
continue;
}
/*else if (red + i + 2 - 1 < red) {
continue;
}*/
redc[i] = nCr(red + i + 1, red) % MOD;
// cout << redc[i] << "red" << i << endl;
}
for (int i = 0; i < k; i++) {
int ans = (bulec[i] * redc[i]) % MOD;
cout << ans << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,717 | 798,718 | u338903636 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int inv[5005];
int fac[5005];
int facinv[5005];
int mod = 1e9 + 7;
int f, t;
int main() {
int n, k;
cin >> n >> k;
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[1] = 0;
fac[1] = 1;
for (int i = 2; i <= 5005; ++i) {
fac[i] = fac[i - 1] * 1LL * i % mod;
}
facinv[0] = 1;
facinv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
facinv[i] = facinv[i - 1] * 1LL * inv[i] % mod;
}
for (int i = 1; i <= k; ++i) {
// C(k-1,i-1) * C(n-k+1,i)
int a = ((1LL * fac[k - 1] * facinv[i - 1]) % mod * facinv[k - i]) % mod;
int b = 0;
if (n - k - i + 1 >= 0) {
b = ((1LL * fac[n - k + 1] * facinv[i]) % mod * facinv[n - k - i + 1]) %
mod;
}
// cout<<a<<" "<<b<<endl;
cout << (1LL * a * b) % mod << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int inv[5005];
int fac[5005];
int facinv[5005];
int mod = 1e9 + 7;
int f, t;
int main() {
int n, k;
cin >> n >> k;
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i <= 5005; ++i) {
fac[i] = fac[i - 1] * 1LL * i % mod;
}
facinv[0] = 1;
facinv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
facinv[i] = facinv[i - 1] * 1LL * inv[i] % mod;
}
for (int i = 1; i <= k; ++i) {
// C(k-1,i-1) * C(n-k+1,i)
int a = ((1LL * fac[k - 1] * facinv[i - 1]) % mod * facinv[k - i]) % mod;
int b = 0;
if (n - k - i + 1 >= 0) {
b = ((1LL * fac[n - k + 1] * facinv[i]) % mod * facinv[n - k - i + 1]) %
mod;
}
// cout<<a<<" "<<b<<endl;
cout << (1LL * a * b) % mod << endl;
}
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 798,721 | 798,722 | u542111796 | cpp |
p02990 | #include <iostream>
using namespace std;
#define MOD 1000000007
long long C[2005][2005] = {};
void ncr() {
for (int i = 0; i <= 2000; ++i)
C[i][0] = C[i][i] = 1, C[i][1] = i;
for (int i = 1; i <= 2000; ++i) {
for (int j = 2; j < i; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}
int main() {
ncr();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i)
cout << C[n - k + 1][i] * C[k - 1][i - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MOD 1000000007
long long C[2005][2005] = {};
void ncr() {
for (int i = 0; i <= 2000; ++i)
C[i][0] = C[i][i] = 1, C[i][1] = i;
for (int i = 1; i <= 2000; ++i) {
for (int j = 2; j < i; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}
int main() {
ncr();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i)
cout << (C[n - k + 1][i] * C[k - 1][i - 1]) % MOD << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 798,725 | 798,726 | u848359007 | cpp |
p02990 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007ll
long long inv(long long n) {
long long ans = 1;
while (n > 1) {
ans *= (mod - mod / n) % mod;
ans %= mod;
n = mod % n;
}
return ans;
}
long long comb_mod(long long n, long long r) {
long long deno = 1;
long long mole = 1;
long long r_change = (r <= n / 2) ? r : n - r;
for (long long i = 1; i <= r_change; i++) {
mole *= i % mod;
}
for (long long i = n - r_change + 1; i <= n; i++) {
deno *= i % mod;
}
mole = inv(mole);
return (mole * deno) % mod;
}
int main() {
int n = 0, k = 0;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k + 1 < i) {
cout << 0 << endl;
} else {
cout << comb_mod(n - k + 1, i) * comb_mod(k - 1, i - 1) % mod << endl;
}
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007ll
long long inv(long long n) {
long long ans = 1;
while (n > 1) {
ans *= (mod - mod / n) % mod;
ans %= mod;
n = mod % n;
}
return ans;
}
long long comb_mod(long long n, long long r) {
long long deno = 1;
long long mole = 1;
long long r_change = (r <= n / 2) ? r : n - r;
for (long long i = 1; i <= r_change; i++) {
mole *= i;
mole %= mod;
}
for (long long i = n - r_change + 1; i <= n; i++) {
deno *= i;
deno %= mod;
}
mole = inv(mole);
return (mole * deno) % mod;
}
int main() {
int n = 0, k = 0;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k + 1 < i) {
cout << 0 << endl;
} else {
cout << comb_mod(n - k + 1, i) * comb_mod(k - 1, i - 1) % mod << endl;
}
}
return 0;
}
| [
"expression.operation.binary.change",
"assignment.change"
] | 798,740 | 798,741 | u324549724 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// See debug.cc for usage etc
#define DEBUG 0
template <class... Args> string dbgFormat(const char *fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args...);
return string(buf);
}
#if DEBUG
#define DLOG(...) cerr << dbgFormat(__VA_ARGS__) << endl
#define DCALL(func, ...) func(__VA_ARGS__)
#else
#define DLOG(...)
#define DCALL(func, ...)
#endif
ll MOD = 1e9 + 7;
// g = eGCD(a, b, s, t) ---> sa + tb = g
constexpr ll eGCD(ll a, ll b, ll &s, ll &t) {
if (a == 0) {
s = 0;
t = 1;
return b;
}
ll u = 0;
ll g = eGCD(b % a, a, t, u);
s = u - (b / a) * t;
return g;
}
constexpr ll gcd(ll a, ll b) {
ll dummy1 = 0;
ll dummy2 = 0;
return eGCD(a, b, dummy1, dummy2);
}
struct Fp {
ll val;
Fp(ll t = 0) : val(t < 0 ? MOD + t % MOD : t >= MOD ? t % MOD : t) {}
Fp &operator+=(const Fp &t) {
val += t.val;
if (val > MOD)
val -= MOD;
return *this;
}
Fp &operator-=(const Fp &t) {
val -= t.val;
if (val < 0)
val += MOD;
return *this;
}
Fp &operator*=(const Fp &t) {
val = (val * t.val) % MOD;
return *this;
}
Fp inv() const {
if (val == 0) {
cerr << "inv() is called for zero." << endl;
exit(1);
}
ll u = 0;
ll v = 0;
eGCD(val, MOD, u, v);
return Fp(u);
}
Fp &operator/=(const Fp &t) { return (*this) *= t.inv(); }
Fp operator+(const Fp &t) const { return Fp(val) += t; }
Fp operator-(const Fp &t) const { return Fp(val) -= t; }
Fp operator*(const Fp &t) const { return Fp(val) *= t; }
Fp operator/(const Fp &t) const { return Fp(val) /= t; }
Fp operator-() const { return Fp(-val); }
bool operator==(const Fp &t) const { return val == t.val; }
bool operator!=(const Fp &t) const { return val != t.val; }
operator ll() const { return val; }
};
ll N, K;
constexpr ll maxN = 2000;
vector<Fp> fact(maxN + 1);
vector<Fp> invFact(maxN + 1);
Fp combi(ll n, ll r) { return fact.at(n) * invFact.at(r) * invFact.at(n - r); }
int main() {
#if !DEBUG
ios_base::sync_with_stdio(false);
#endif
cout << setprecision(20);
fact.at(0) = 1;
for (ll i = 1; i <= maxN; i++)
fact.at(i) = i * fact.at(i - 1);
invFact.at(maxN) = fact.at(maxN).inv();
for (ll i = maxN; i >= 1; i--)
invFact.at(i - 1) = i * invFact.at(i);
cin >> N >> K;
for (ll i = 1; i <= K; i++) {
if (i > N - K + 1) {
cout << "0\n";
} else {
ll x = combi(K - 1, i - 1);
ll y = combi(N - K + 1, i);
cout << x * y << "\n";
}
}
return 0;
}
| #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// See debug.cc for usage etc
#define DEBUG 0
template <class... Args> string dbgFormat(const char *fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args...);
return string(buf);
}
#if DEBUG
#define DLOG(...) cerr << dbgFormat(__VA_ARGS__) << endl
#define DCALL(func, ...) func(__VA_ARGS__)
#else
#define DLOG(...)
#define DCALL(func, ...)
#endif
ll MOD = 1e9 + 7;
// g = eGCD(a, b, s, t) ---> sa + tb = g
constexpr ll eGCD(ll a, ll b, ll &s, ll &t) {
if (a == 0) {
s = 0;
t = 1;
return b;
}
ll u = 0;
ll g = eGCD(b % a, a, t, u);
s = u - (b / a) * t;
return g;
}
constexpr ll gcd(ll a, ll b) {
ll dummy1 = 0;
ll dummy2 = 0;
return eGCD(a, b, dummy1, dummy2);
}
struct Fp {
ll val;
Fp(ll t = 0) : val(t < 0 ? MOD + t % MOD : t >= MOD ? t % MOD : t) {}
Fp &operator+=(const Fp &t) {
val += t.val;
if (val > MOD)
val -= MOD;
return *this;
}
Fp &operator-=(const Fp &t) {
val -= t.val;
if (val < 0)
val += MOD;
return *this;
}
Fp &operator*=(const Fp &t) {
val = (val * t.val) % MOD;
return *this;
}
Fp inv() const {
if (val == 0) {
cerr << "inv() is called for zero." << endl;
exit(1);
}
ll u = 0;
ll v = 0;
eGCD(val, MOD, u, v);
return Fp(u);
}
Fp &operator/=(const Fp &t) { return (*this) *= t.inv(); }
Fp operator+(const Fp &t) const { return Fp(val) += t; }
Fp operator-(const Fp &t) const { return Fp(val) -= t; }
Fp operator*(const Fp &t) const { return Fp(val) *= t; }
Fp operator/(const Fp &t) const { return Fp(val) /= t; }
Fp operator-() const { return Fp(-val); }
bool operator==(const Fp &t) const { return val == t.val; }
bool operator!=(const Fp &t) const { return val != t.val; }
operator ll() const { return val; }
};
ll N, K;
constexpr ll maxN = 2000;
vector<Fp> fact(maxN + 1);
vector<Fp> invFact(maxN + 1);
Fp combi(ll n, ll r) { return fact.at(n) * invFact.at(r) * invFact.at(n - r); }
int main() {
#if !DEBUG
ios_base::sync_with_stdio(false);
#endif
cout << setprecision(20);
fact.at(0) = 1;
for (ll i = 1; i <= maxN; i++)
fact.at(i) = i * fact.at(i - 1);
invFact.at(maxN) = fact.at(maxN).inv();
for (ll i = maxN; i >= 1; i--)
invFact.at(i - 1) = i * invFact.at(i);
cin >> N >> K;
for (ll i = 1; i <= K; i++) {
if (i > N - K + 1) {
cout << "0\n";
} else {
Fp x = combi(K - 1, i - 1);
Fp y = combi(N - K + 1, i);
cout << x * y << "\n";
}
}
return 0;
}
| [
"variable_declaration.type.change"
] | 798,742 | 798,743 | u588093355 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1e9 + 7;
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() {
// 前処理
COMinit();
int N, K, R;
cin >> N >> K;
R = N - K;
for (int i = 1; i <= K; i++) {
cout << COM(N - K + 1, i) * COM(K - 1, i - 1) << endl;
}
} | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1e9 + 7;
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() {
// 前処理
COMinit();
int N, K, R;
cin >> N >> K;
R = N - K;
for (int i = 1; i <= K; i++) {
cout << (COM(N - K + 1, i) * COM(K - 1, i - 1)) % MOD << endl;
}
} | [
"expression.operation.binary.add"
] | 798,757 | 798,758 | u168774513 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long c[5005][5005];
void init(int n) {
c[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
c[i][j] %= MOD;
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
long long comb(long long n, long long k) { return c[n][k]; }
int main() {
init(5003);
int N, K;
cin >> N >> K;
int red = N - K, blue = K;
int ans = 1;
for (int i = 1; i <= K; i++) {
ans *= comb(red + 1, i);
ans *= comb(blue - 1, i - 1);
ans %= MOD;
cout << ans << endl;
ans = 1;
}
}
| #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long c[5005][5005];
void init(int n) {
c[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
c[i][j] %= MOD;
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
long long comb(long long n, long long k) { return c[n][k]; }
int main() {
init(5000);
int N, K;
cin >> N >> K;
int red = N - K, blue = K;
long long ans = 1;
for (int i = 1; i <= K; i++) {
ans *= comb(red + 1, i);
ans *= comb(blue - 1, i - 1);
ans %= MOD;
cout << ans << endl;
ans = 1;
}
}
| [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,761 | 798,762 | u507188501 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
// #define MOD 1000000007
typedef long long ll;
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;
}
};
// Paskal's triangle => Combination
mint c[4005][4005];
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];
}
}
}
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 0;
if (k < 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;
printf("%lld\n", ans.x);
}
return 0;
}
/*
long long combination(int n, int r) {
long long num = 1;
for ( int i = 1; i <= r; i++ ) {
num = ( num * ( n - i + 1 ) / i ) % MOD; // 1/2が0になるので、右辺が num *
() / iとする
// cout << num << endl;
}
return num;
}
int main(){
int N, K;
cin >> N >> K;
for ( int i = 1; i <= K; i++ ) {
// K-1Ci-1 * N-K+1Ci
long long ans = 0;
ans = combination(K-1, i-1) % MOD;
ans *= combination(N-K+1, i) % MOD;
cout << ans << endl;
}
return 0;
}
*/
| #include <bits/stdc++.h>
using namespace std;
// #define MOD 1000000007
typedef long long ll;
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;
}
};
// Paskal's triangle => Combination
mint c[4005][4005];
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];
}
}
}
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;
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;
printf("%lld\n", ans.x);
}
return 0;
}
/*
long long combination(int n, int r) {
long long num = 1;
for ( int i = 1; i <= r; i++ ) {
num = ( num * ( n - i + 1 ) / i ) % MOD; // 1/2が0になるので、右辺が num *
() / iとする
// cout << num << endl;
}
return num;
}
int main(){
int N, K;
cin >> N >> K;
for ( int i = 1; i <= K; i++ ) {
// K-1Ci-1 * N-K+1Ci
long long ans = 0;
ans = combination(K-1, i-1) % MOD;
ans *= combination(N-K+1, i) % MOD;
cout << ans << endl;
}
return 0;
}
*/
| [
"literal.number.change",
"function.return_value.change"
] | 798,763 | 798,764 | u031598803 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1e15;
ll combi(ll N_, ll C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mo * factr[N_ - C_] % mo;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; ++i) {
int ret = 1;
(ret *= combi(red + 1, i)) %= mod;
(ret *= combi(k - 1, i - 1)) %= mod;
cout << ret % mod << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1e15;
ll combi(ll N_, ll C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mo * factr[N_ - C_] % mo;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; ++i) {
ll ret = 1;
(ret *= combi(red + 1, i)) %= mod;
(ret *= combi(k - 1, i - 1)) %= mod;
cout << ret % mod << endl;
}
return 0;
}
| [
"variable_declaration.type.change"
] | 798,765 | 798,766 | u699193595 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
for (ll i = 1; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
comb[i][j] = (comb[i][j] + mod) % mod;
}
}
}
for (ll i = 1; i <= k; i++) {
if (i > n - k + 1) {
cout << 0 << endl;
} else {
ll ans = comb[n - k + 1][i] * comb[k - 1][i - 1];
cout << (ans + mod) % mod << endl;
}
}
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
for (ll i = 0; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
comb[i][j] = (comb[i][j] + mod) % mod;
}
}
}
for (ll i = 1; i <= k; i++) {
if (i > n - k + 1) {
cout << 0 << endl;
} else {
ll ans = comb[n - k + 1][i] * comb[k - 1][i - 1];
cout << (ans + mod) % mod << endl;
}
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,767 | 798,768 | u201316840 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
comb[0][0] = 1;
for (ll i = 1; i < 6; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
comb[i][j] = (comb[i][j] + mod) % mod;
}
}
}
for (ll i = 1; i <= k; i++) {
if (i > n - k + 1) {
cout << 0 << endl;
} else {
ll ans = comb[n - k + 1][i] * comb[k - 1][i - 1];
cout << (ans + mod) % mod << endl;
}
}
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
comb[0][0] = 1;
for (ll i = 1; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j == i) {
comb[i][j] = 1;
} else {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
comb[i][j] = (comb[i][j] + mod) % mod;
}
}
}
for (ll i = 1; i <= k; i++) {
if (i > n - k + 1) {
cout << 0 << endl;
} else {
ll ans = comb[n - k + 1][i] * comb[k - 1][i - 1];
cout << (ans + mod) % mod << endl;
}
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,769 | 798,770 | u201316840 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
int ball, k, i;
long long ans = 0, ans2 = 0, ans3 = 0;
cin >> ball >> k;
vector<vector<long long int>> v(k, vector<long long int>(k, 0));
vector<vector<long long int>> a(ball - k + 2,
vector<long long int>(ball - k + 2, 0));
for (i = 1; i <= k; i++) {
ans = 0;
ans2 = 0;
ans3 = 0;
if (i == 1)
cout << ball - k + 1 << endl;
else if (i > ball - k + 1)
cout << 0 << endl;
else {
comb(v);
ans = v[k - 1][i - 1] % 1000000007;
comb(a);
ans2 = a[ball - k + 1][i] % 1000000007;
ans3 = (ans * ans2) % 1000000007;
cout << ans3 << endl;
}
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % 1000000007;
}
}
}
int main() {
int ball, k, i;
long long ans = 0, ans2 = 0, ans3 = 0;
cin >> ball >> k;
vector<vector<long long int>> v(k, vector<long long int>(k, 0));
vector<vector<long long int>> a(ball - k + 2,
vector<long long int>(ball - k + 2, 0));
for (i = 1; i <= k; i++) {
ans = 0;
ans2 = 0;
ans3 = 0;
if (i == 1)
cout << ball - k + 1 << endl;
else if (i > ball - k + 1)
cout << 0 << endl;
else {
comb(v);
ans = v[k - 1][i - 1] % 1000000007;
comb(a);
ans2 = a[ball - k + 1][i] % 1000000007;
ans3 = (ans * ans2) % 1000000007;
cout << ans3 << endl;
}
}
return 0;
} | [
"assignment.change"
] | 798,777 | 798,778 | u196254124 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
long long M = 1e9 + 7;
typedef long long ll;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
if (a < b)
return 0;
ll tmp = ifac[a - b] % M;
return tmp * fac[a] % M;
}
ll dupc(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < 0 || b == 0)
return 0;
ll tmp = ifac[a - 1] * ifac[b] % M;
return tmp * fac[a + b - 1] % M;
}
int main(void) {
long long n, k;
cin >> n >> k;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
for (int i = 1; i <= k; i++) {
long long ans = 0;
long long tmp = n - k + 1;
ans = comb(n - k + 1, i) % M;
// cout << "n-k+1Ci " << ans << endl;
if (i > 1) {
/*
long long k2 = k - i;
if (k2 == 0)
{
cout << ans << endl;
continue;
}
long long tmp2 = k2 + i - 1;
for (long long j = 0; j < i; j++)
{
ans = (ans * (tmp2 - j)) % M;
}
for (int j = i - 1; j > 1; j--)
{
ans /= j;
}
*/
if (k - i > 0) {
ans *= comb(k - 1, i - 1) % M;
}
}
cout << ans << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
long long M = 1e9 + 7;
typedef long long ll;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
if (a < b)
return 0;
ll tmp = ifac[a - b] % M;
return tmp * fac[a] % M;
}
ll dupc(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < 0 || b == 0)
return 0;
ll tmp = ifac[a - 1] * ifac[b] % M;
return tmp * fac[a + b - 1] % M;
}
int main(void) {
long long n, k;
cin >> n >> k;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 300000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
for (int i = 1; i <= k; i++) {
long long ans = 0;
long long tmp = n - k + 1;
ans = comb(n - k + 1, i) % M;
// cout << "n-k+1Ci " << ans << endl;
if (i > 1) {
/*
long long k2 = k - i;
if (k2 == 0)
{
cout << ans << endl;
continue;
}
long long tmp2 = k2 + i - 1;
for (long long j = 0; j < i; j++)
{
ans = (ans * (tmp2 - j)) % M;
}
for (int j = i - 1; j > 1; j--)
{
ans /= j;
}
*/
if (k - i > 0) {
ans *= comb(k - 1, i - 1) % M;
}
}
cout << ans % M << endl;
}
} | [
"expression.operation.binary.add"
] | 798,788 | 798,789 | u636137609 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n; i < m; i++)
#define rrange(i, n, m) for (ll i = n - 1; i = > m; i--)
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vp vector<pair<ll, ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define First first
#define Second second.first
#define Third second.second
//#define MOD 998244353
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll mydiv(ll a, ll b);
ll modpow(ll a);
ll mydiv(ll a, ll b) {
a = a % MOD;
return (a * (modpow(b) % MOD)) % MOD;
}
ll modpow(ll a) {
ll b = MOD - 2;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res % MOD;
}
inline ll nCr(ll n, ll r) {
if (n < r)
return 0;
ll bunbo = 1;
ll bunsi = 1;
// ll ret = 0;
for (ll i = 1; i <= r; i++) {
bunbo = (bunbo * (n - i + 1)) % MOD;
bunsi = (bunsi * i) % MOD;
// ret = (ret + (n - i + 1) / i) % MOD;
}
return mydiv(bunbo, bunsi);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vl O(K, 0);
vvl DP(N - K + 5, vector<ll>(K + 5));
DP[0][0] = 1;
DP[0][1] = 1;
rep(i, N - K + 1) {
rep(k, K + 1) { DP[i + 1][k + 1] = (DP[i + 1][k] + DP[i][k + 1]) % MOD; }
}
vl A(DP[N - K]);
rep(i, K) {
if (N - K - i + 1 < 0) {
O[i] = 1;
continue;
}
O[i] = (DP[N - K - i + 1][i + 2] * nCr(K - 1, i)) % MOD;
}
rep(i, K) { cout << O[i] << endl; }
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n; i < m; i++)
#define rrange(i, n, m) for (ll i = n - 1; i = > m; i--)
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vp vector<pair<ll, ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define First first
#define Second second.first
#define Third second.second
//#define MOD 998244353
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll mydiv(ll a, ll b);
ll modpow(ll a);
ll mydiv(ll a, ll b) {
a = a % MOD;
return (a * (modpow(b) % MOD)) % MOD;
}
ll modpow(ll a) {
ll b = MOD - 2;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res % MOD;
}
inline ll nCr(ll n, ll r) {
if (n < r)
return 0;
ll bunbo = 1;
ll bunsi = 1;
// ll ret = 0;
for (ll i = 1; i <= r; i++) {
bunbo = (bunbo * (n - i + 1)) % MOD;
bunsi = (bunsi * i) % MOD;
// ret = (ret + (n - i + 1) / i) % MOD;
}
return mydiv(bunbo, bunsi);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vl O(K, 0);
vvl DP(N - K + 5, vector<ll>(K + 5));
DP[0][0] = 1;
DP[0][1] = 1;
rep(i, N - K + 1) {
rep(k, K + 1) { DP[i + 1][k + 1] = (DP[i + 1][k] + DP[i][k + 1]) % MOD; }
}
vl A(DP[N - K]);
rep(i, K) {
if (N - K - i + 1 < 0) {
O[i] = 0;
continue;
}
O[i] = (DP[N - K - i + 1][i + 2] * nCr(K - 1, i)) % MOD;
}
rep(i, K) { cout << O[i] << endl; }
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 798,790 | 798,791 | u991974907 | cpp |
p02990 | #include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
size_t n, k;
cin >> n >> k;
auto r = n - k;
vector<vector<unsigned long>> C(n, vector<unsigned long>(n));
C[0][0] = 1;
for (size_t i = 1; i < n; ++i) {
C[i][0] = 1;
for (size_t j = 1; j <= i; ++j)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
for (size_t i = 1; i <= k; ++i) {
cout << C[r + 1][i] * C[k - 1][i - 1] % MOD << endl;
}
return 0;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
size_t n, k;
cin >> n >> k;
auto r = n - k;
vector<vector<unsigned long>> C(n + 10, vector<unsigned long>(n + 10));
C[0][0] = 1;
for (size_t i = 1; i < n + 10; ++i) {
C[i][0] = 1;
for (size_t j = 1; j <= i; ++j)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
for (size_t i = 1; i <= k; ++i) {
cout << C[r + 1][i] * C[k - 1][i - 1] % MOD << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 798,794 | 798,795 | u462437857 | cpp |
p02990 | // 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;
}
}
| [
"expression.operation.binary.add"
] | 798,801 | 798,802 | u136354774 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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 p = 1000000007;
const int NMAX = 50000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FORq(i, 2, NMAX - 1) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % p) % p;
}
int main() {
ll N, K;
cin >> N >> K;
ll R = N - K;
combinit();
FORq(i, 1, K) {
if (i == 1) {
if (K != N) {
cout << R + 1 << "\n";
continue;
} else {
cout << 1 << "\n";
}
}
ll ans = 0;
ll ans1, ans2;
ans1 = comb(K - 1, i - 1) % MOD;
ans2 = 0;
for (ll l = 1; l <= R; l++) {
if (l < i - 1)
continue;
ans2 = (ans2 + (comb(l - (i - 1) + (i - 2), i - 2) * (R - l + 1)) % MOD) %
MOD;
}
// cout << ans1 << ", " << ans2 << endl;
ans = (ans1 * ans2) % MOD;
cout << ans << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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 p = 1000000007;
const int NMAX = 50000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FORq(i, 2, NMAX - 1) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % p) % p;
}
int main() {
ll N, K;
cin >> N >> K;
ll R = N - K;
combinit();
FORq(i, 1, K) {
if (i == 1) {
if (K != N) {
cout << R + 1 << "\n";
continue;
} else {
cout << 1 << "\n";
continue;
}
}
ll ans = 0;
ll ans1, ans2;
ans1 = comb(K - 1, i - 1) % MOD;
ans2 = 0;
for (ll l = 1; l <= R; l++) {
if (l < i - 1)
continue;
ans2 = (ans2 + (comb(l - (i - 1) + (i - 2), i - 2) * (R - l + 1)) % MOD) %
MOD;
}
// cout << ans1 << ", " << ans2 << endl;
ans = (ans1 * ans2) % MOD;
cout << ans << "\n";
}
return 0;
}
| [] | 798,803 | 798,804 | u236433947 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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 p = 1000000007;
const int NMAX = 50000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FORq(i, 2, NMAX - 1) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % p) % p;
}
int main() {
ll N, K;
cin >> N >> K;
ll R = N - K;
combinit();
FORq(i, 1, K) {
if (i == 1) {
if (K == N) {
cout << R + 1 << "\n";
continue;
} else {
cout << 1 << "\n";
}
}
ll ans = 0;
ll ans1, ans2;
ans1 = comb(K - 1, i - 1) % MOD;
ans2 = 0;
for (ll l = 1; l <= R; l++) {
if (l < i - 1)
continue;
ans2 = (ans2 + (comb(l - (i - 1) + (i - 2), i - 2) * (R - l + 1)) % MOD) %
MOD;
}
// cout << ans1 << ", " << ans2 << endl;
ans = (ans1 * ans2) % MOD;
cout << ans << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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 p = 1000000007;
const int NMAX = 50000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FORq(i, 2, NMAX - 1) {
fac[i] = fac[i - 1] * i % p;
inv[i] = p - inv[p % i] * (p / i) % p;
finv[i] = finv[i - 1] * inv[i] % p;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % p) % p;
}
int main() {
ll N, K;
cin >> N >> K;
ll R = N - K;
combinit();
FORq(i, 1, K) {
if (i == 1) {
if (K != N) {
cout << R + 1 << "\n";
continue;
} else {
cout << 1 << "\n";
continue;
}
}
ll ans = 0;
ll ans1, ans2;
ans1 = comb(K - 1, i - 1) % MOD;
ans2 = 0;
for (ll l = 1; l <= R; l++) {
if (l < i - 1)
continue;
ans2 = (ans2 + (comb(l - (i - 1) + (i - 2), i - 2) * (R - l + 1)) % MOD) %
MOD;
}
// cout << ans1 << ", " << ans2 << endl;
ans = (ans1 * ans2) % MOD;
cout << ans << "\n";
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,805 | 798,804 | u236433947 | cpp |
p02990 | //
// main.cpp
// 競技20190629
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define ll long long int
const ll overflow = 1000000007;
int br() {
printf("\n");
return 0;
}
ll combi(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return combi(n - 1, k - 1) + combi(n - 1, k);
}
}
ll combi2(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return (combi(n - 1, k - 1) + combi(n - 1, k)) % overflow;
}
}
ll 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;
}
ll combi3(ll n, ll k, ll m) {
ll ans = 1;
for (ll i = 0; i < k; i++) {
ans = (ans * (n - i)) % m;
ans = (ans * modinv(i + 1, m)) % m;
}
return ans;
}
int gcd(int a, int b) { //最大公約数
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
// sort(a,a+100,greater<int>());大きい順
// sort(a,a+100);小さい順
/*
int N;
cin >> N;
vector<int> d(N);
int i = 0;
int n = N;
while(n--){
cin >> d[i];
i++;
}
sort(d.begin(),d.end());
d.erase( unique(d.begin(),d.end()),
d.end());隣り合った重複を削除し、き消し多分要素数を詰める cout<<d.size()<<endl;
return 0;
*/
int X() {
string s;
cin >> s;
size_t size = s.length();
string ans;
for (int i = 0; i < size; i++) {
if (i % 2 == 0) {
ans = ans + s[i];
}
}
cout << ans << endl;
return 0;
}
int Ap() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[2] == s[3]) {
return printf("No\n");
}
if (s[0] == s[1] && s[2] == s[3]) {
return printf("Yes\n");
}
if (s[0] == s[2] && s[1] == s[3]) {
return printf("Yes\n");
}
if (s[0] == s[3] && s[1] == s[2]) {
return printf("Yes\n");
}
return printf("No\n");
}
int mymid(int a, int b, int c) {
if (a >= b && b >= c)
return b;
if (a <= b && b <= c)
return b;
return -1;
}
int Bp() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if (mymid(p[i - 1], p[i], p[i + 1]) == p[i])
ans++;
}
printf("%d\n", ans);
return 0;
}
int Cp() {
int N;
cin >> N;
vector<int> d(N);
int i = 0;
int nn = N;
while (nn--) {
cin >> d[i];
i++;
}
sort(d.begin(), d.end());
printf("%d\n", d[N / 2] - d[N / 2 - 1]);
return 0;
}
int Dp() {
ll n, k;
cin >> n >> k;
// for(int i=1;i<=k;i++){printf("%d\n",(int)(combi2(n-k+1,i)*combi(k-1,i-1))
// );}
for (int i = 1; i <= k; i++) {
printf("%lld\n",
(combi3(n - k + 1, i, overflow) * combi3(k - 1, i - 1, overflow)));
}
return 0;
}
int main() {
Dp();
return 0;
}
| //
// main.cpp
// 競技20190629
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define ll long long int
const ll overflow = 1000000007;
int br() {
printf("\n");
return 0;
}
ll combi(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return combi(n - 1, k - 1) + combi(n - 1, k);
}
}
ll combi2(int n, int k) {
if (n == k || k == 0)
return 1;
else {
return (combi(n - 1, k - 1) + combi(n - 1, k)) % overflow;
}
}
ll 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;
}
ll combi3(ll n, ll k, ll m) {
ll ans = 1;
for (ll i = 0; i < k; i++) {
ans = (ans * (n - i)) % m;
ans = (ans * modinv(i + 1, m)) % m;
}
return ans;
}
int gcd(int a, int b) { //最大公約数
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
// sort(a,a+100,greater<int>());大きい順
// sort(a,a+100);小さい順
/*
int N;
cin >> N;
vector<int> d(N);
int i = 0;
int n = N;
while(n--){
cin >> d[i];
i++;
}
sort(d.begin(),d.end());
d.erase( unique(d.begin(),d.end()),
d.end());隣り合った重複を削除し、き消し多分要素数を詰める cout<<d.size()<<endl;
return 0;
*/
int X() {
string s;
cin >> s;
size_t size = s.length();
string ans;
for (int i = 0; i < size; i++) {
if (i % 2 == 0) {
ans = ans + s[i];
}
}
cout << ans << endl;
return 0;
}
int Ap() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[2] == s[3]) {
return printf("No\n");
}
if (s[0] == s[1] && s[2] == s[3]) {
return printf("Yes\n");
}
if (s[0] == s[2] && s[1] == s[3]) {
return printf("Yes\n");
}
if (s[0] == s[3] && s[1] == s[2]) {
return printf("Yes\n");
}
return printf("No\n");
}
int mymid(int a, int b, int c) {
if (a >= b && b >= c)
return b;
if (a <= b && b <= c)
return b;
return -1;
}
int Bp() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if (mymid(p[i - 1], p[i], p[i + 1]) == p[i])
ans++;
}
printf("%d\n", ans);
return 0;
}
int Cp() {
int N;
cin >> N;
vector<int> d(N);
int i = 0;
int nn = N;
while (nn--) {
cin >> d[i];
i++;
}
sort(d.begin(), d.end());
printf("%d\n", d[N / 2] - d[N / 2 - 1]);
return 0;
}
int Dp() {
ll n, k;
cin >> n >> k;
// for(int i=1;i<=k;i++){printf("%d\n",(int)(combi2(n-k+1,i)*combi(k-1,i-1))
// );}
for (int i = 1; i <= k; i++) {
printf("%lld\n",
(combi3(n - k + 1, i, overflow) * combi3(k - 1, i - 1, overflow)) %
overflow);
}
return 0;
}
int main() {
Dp();
return 0;
}
| [
"call.arguments.change"
] | 798,806 | 798,807 | u024416480 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long int64;
int main(void) {
int64 N, K;
cin >> N >> K;
int64 facA = 1, facB = 1;
for (int64 i = 1; i <= N - K + 1; i++) {
facA *= i;
facA %= MOD;
}
for (int64 i = 1; i <= K - 1; i++) {
facB *= i;
facB %= MOD;
}
// cout<<facA<<" "<<facB<<endl;
vector<int64> facinv(N + 1), inv(N + 1);
facinv[0] = facinv[1] = 1;
inv[1] = 1;
for (int64 i = 2; i <= N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
facinv[i] = facinv[i - 1] * inv[i] % MOD;
}
for (int64 i = 1; i <= K; i++) {
if (N - K + 1 < i) {
cout << 0 << endl;
} else {
cout << (facA * (facinv[i] * facinv[(N - K + 1) - i] % MOD) % MOD) *
(facB * (facinv[i - 1] * facinv[(K - 1) - (i - 1)] % MOD) %
MOD)
<< endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long int64;
int main(void) {
int64 N, K;
cin >> N >> K;
int64 facA = 1, facB = 1;
for (int64 i = 1; i <= N - K + 1; i++) {
facA *= i;
facA %= MOD;
}
for (int64 i = 1; i <= K - 1; i++) {
facB *= i;
facB %= MOD;
}
// cout<<facA<<" "<<facB<<endl;
vector<int64> facinv(N + 1), inv(N + 1);
facinv[0] = facinv[1] = 1;
inv[1] = 1;
for (int64 i = 2; i <= N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
facinv[i] = facinv[i - 1] * inv[i] % MOD;
}
for (int64 i = 1; i <= K; i++) {
if (N - K + 1 < i) {
cout << 0 << endl;
} else {
cout << (facA * (facinv[i] * facinv[(N - K + 1) - i] % MOD) % MOD) *
(facB * (facinv[i - 1] * facinv[(K - 1) - (i - 1)] % MOD) %
MOD) %
MOD
<< endl;
}
}
return 0;
} | [] | 798,809 | 798,810 | u647569169 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
const vector<pll> dir = {{0, 1}, {1, 0}, {-1, 0}, {0, -1},
{1, 1}, {-1, 1}, {1, -1}, {-1, -1}};
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (i).rbegin(), (i).rend()
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
inline constexpr int modf(ll n) {
ll ans = 1;
rep(i, 0, n) { ans = ans * (n - i) % MOD; }
return ans;
}
vector<ll> func, inv;
void init(ll n) {
func.resize(n + 1);
inv.resize(n + 1);
func[0] = 1;
rep(i, 0, n) { func[i + 1] = func[i] * (i + 1) % MOD; }
inv[n] = intpow(func[n], MOD - 2);
rrep(i, 1, n + 1) { inv[i - 1] = inv[i] * i % MOD; }
}
ll comb(ll a, ll b) { return func[a] * inv[b] % MOD * inv[a - b] % MOD; }
inline long double median(vector<ll> v) {
ll size = v.size();
sort(v.begin(), v.end());
if (size % 2 == 1)
return v[(size - 1) / 2];
else
return v[(size / 2) - 1];
}
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;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
int main() {
ll n, k;
cin >> n >> k;
init(n);
rep(i, 1, min(n - k + 2, k + 1)) cout
<< comb(n - k + 1, i) * comb(k - 1, i - 1) << endl;
if (n - k + 2 < k + 1)
rep(i, 0, 2 * k - n - 1) cout << 0 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
const vector<pll> dir = {{0, 1}, {1, 0}, {-1, 0}, {0, -1},
{1, 1}, {-1, 1}, {1, -1}, {-1, -1}};
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (i).rbegin(), (i).rend()
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
inline constexpr int modf(ll n) {
ll ans = 1;
rep(i, 0, n) { ans = ans * (n - i) % MOD; }
return ans;
}
vector<ll> func, inv;
void init(ll n) {
func.resize(n + 1);
inv.resize(n + 1);
func[0] = 1;
rep(i, 0, n) { func[i + 1] = func[i] * (i + 1) % MOD; }
inv[n] = intpow(func[n], MOD - 2);
rrep(i, 1, n + 1) { inv[i - 1] = inv[i] * i % MOD; }
}
ll comb(ll a, ll b) { return func[a] * inv[b] % MOD * inv[a - b] % MOD; }
inline long double median(vector<ll> v) {
ll size = v.size();
sort(v.begin(), v.end());
if (size % 2 == 1)
return v[(size - 1) / 2];
else
return v[(size / 2) - 1];
}
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;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
int main() {
ll n, k;
cin >> n >> k;
init(n);
rep(i, 1, min(n - k + 2, k + 1)) cout
<< comb(n - k + 1, i) * comb(k - 1, i - 1) % MOD << endl;
if (n - k + 2 < k + 1)
rep(i, 0, 2 * k - n - 1) cout << 0 << endl;
}
| [
"expression.operation.binary.add"
] | 798,820 | 798,821 | u356489231 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
const long long MOD = 1000000007;
const int MAX_C = 3000;
long long Com[MAX_C][MAX_C];
void calc_com() {
memset(Com, 0, sizeof(Com));
Com[0][0] = 1;
for (int i = 1; i < MAX_C; ++i) {
Com[i][0] = 1;
for (int j = 1; j < MAX_C; ++j) {
Com[i][j] = (Com[i - 1][j - 1] + Com[i - 1][j]) % MOD;
}
}
}
int main() {
int n, k;
cin >> n >> k;
calc_com();
for (int i = 1; i < k + 1; i++) {
ll ans;
ans = (Com[n - k + 1][i]) * Com[k - 1][i - 1];
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
const long long MOD = 1000000007;
const int MAX_C = 3000;
long long Com[MAX_C][MAX_C];
void calc_com() {
memset(Com, 0, sizeof(Com));
Com[0][0] = 1;
for (int i = 1; i < MAX_C; ++i) {
Com[i][0] = 1;
for (int j = 1; j < MAX_C; ++j) {
Com[i][j] = (Com[i - 1][j - 1] + Com[i - 1][j]) % MOD;
}
}
}
int main() {
int n, k;
cin >> n >> k;
calc_com();
for (int i = 1; i < k + 1; i++) {
ll ans;
ans = (Com[n - k + 1][i]) * Com[k - 1][i - 1] % 1000000007;
cout << ans << endl;
}
return 0;
}
| [
"assignment.change"
] | 798,832 | 798,833 | u859765185 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
const long long MOD = 1000000007;
const int MAX_C = 1000;
long long Com[MAX_C][MAX_C];
void calc_com() {
memset(Com, 0, sizeof(Com));
Com[0][0] = 1;
for (int i = 1; i < MAX_C; ++i) {
Com[i][0] = 1;
for (int j = 1; j < MAX_C; ++j) {
Com[i][j] = (Com[i - 1][j - 1] + Com[i - 1][j]) % MOD;
}
}
}
int main() {
int n, k;
cin >> n >> k;
calc_com();
for (int i = 1; i < k + 1; i++) {
ll ans;
ans = (Com[n - k + 1][i] % 1000000007) * Com[k - 1][i - 1] % 1000000007;
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
const long long MOD = 1000000007;
const int MAX_C = 3000;
long long Com[MAX_C][MAX_C];
void calc_com() {
memset(Com, 0, sizeof(Com));
Com[0][0] = 1;
for (int i = 1; i < MAX_C; ++i) {
Com[i][0] = 1;
for (int j = 1; j < MAX_C; ++j) {
Com[i][j] = (Com[i - 1][j - 1] + Com[i - 1][j]) % MOD;
}
}
}
int main() {
int n, k;
cin >> n >> k;
calc_com();
for (int i = 1; i < k + 1; i++) {
ll ans;
ans = (Com[n - k + 1][i]) * Com[k - 1][i - 1] % 1000000007;
cout << ans << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 798,834 | 798,833 | u859765185 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 2) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 2][i]) % M;
w = (w * A[b][i - 1]) % M;
cout << w << endl;
}
} | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 1) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 1][i]) % M;
w = (w * A[b - 1][i - 1]) % M;
cout << w << endl;
}
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,835 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 1) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 2][i]) % M;
w = (w * A[b][i - 1]) % M;
cout << w << endl;
}
} | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 1) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 1][i]) % M;
w = (w * A[b - 1][i - 1]) % M;
cout << w << endl;
}
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,837 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2001][2001];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 1) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 2][i]) % M;
w = (w * A[b][i - 1]) % M;
cout << w << endl;
}
} | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++) {
if (i > c + 1) {
cout << 0 << endl;
continue;
}
w = 1;
w = (w * A[c + 1][i]) % M;
w = (w * A[b - 1][i - 1]) % M;
cout << w << endl;
}
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,838 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(20001); // n!(mod M)
vector<ll> ifac(20001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 20000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll n, k;
ll ans;
cin >> n >> k;
ll r = n - k;
for (ll i = 1; i <= k; i++) {
ans = 0;
if (r + 1 < i)
cout << 0 << endl;
if (i == 1)
cout << r + 1 << endl;
else {
ll t = 0;
ans += comb(k - 1, k - i) % M;
for (ll j = -1; j <= 1; j++) {
if (r - 1 >= r - i - j && r - i - j >= 0)
t += comb(r - 1, r - i - j) % M;
if (r - 1 >= r - i - j && r - i - j >= 0 && j == 0)
t += comb(r - 1, r - i - j) % M;
}
ans *= (t % M);
ans %= M;
cout << ans << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(20001); // n!(mod M)
vector<ll> ifac(20001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
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 % M;
x = x * x % M;
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] % M;
return tmp * fac[a] % M;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 20000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll n, k;
ll ans;
cin >> n >> k;
ll r = n - k;
for (ll i = 1; i <= k; i++) {
ans = 0;
if (r + 1 < i)
cout << 0 << endl;
else if (i == 1)
cout << r + 1 << endl;
else {
ll t = 0;
ans += comb(k - 1, k - i) % M;
for (ll j = -1; j <= 1; j++) {
if (r - 1 >= r - i - j && r - i - j >= 0)
t += comb(r - 1, r - i - j) % M;
if (r - 1 >= r - i - j && r - i - j >= 0 && j == 0)
t += comb(r - 1, r - i - j) % M;
}
ans *= (t % M);
ans %= M;
cout << ans << endl;
}
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 798,841 | 798,842 | u280114218 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll kai[3000], inv[3000];
int n, k;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n /= 2;
}
return res;
}
void init() {
kai[0] = 1LL;
for (ll i = 1LL; i <= 2500; i++) {
kai[i] = kai[i - 1] * i;
kai[i] %= MOD;
}
inv[2500] = mod_pow(kai[2500], MOD - 2LL, MOD);
for (ll i = 2499; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1);
inv[i] %= MOD;
}
}
int main() {
ll ans;
scanf("%d %d", &n, &k);
init();
for (ll i = 1; i <= k; i++) {
ans = 1LL;
ans *= kai[k - 1];
ans %= MOD;
ans *= inv[i - 1];
ans %= MOD;
ans *= inv[k - i];
ans %= MOD;
ans *= kai[n - k + 1];
ans %= MOD;
ans *= inv[i];
ans %= MOD;
if (n - k + 1 - i > 0) {
ans *= inv[n - k + 1 - i];
ans %= MOD;
printf("%lld\n", ans);
} else {
printf("0\n");
}
}
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll kai[3000], inv[3000];
int n, k;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n /= 2;
}
return res;
}
void init() {
kai[0] = 1LL;
for (ll i = 1LL; i <= 2500; i++) {
kai[i] = kai[i - 1] * i;
kai[i] %= MOD;
}
inv[2500] = mod_pow(kai[2500], MOD - 2LL, MOD);
for (ll i = 2499; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1);
inv[i] %= MOD;
}
}
int main() {
ll ans;
scanf("%d %d", &n, &k);
init();
for (ll i = 1; i <= k; i++) {
ans = 1LL;
ans *= kai[k - 1];
ans %= MOD;
ans *= inv[i - 1];
ans %= MOD;
ans *= inv[k - i];
ans %= MOD;
ans *= kai[n - k + 1];
ans %= MOD;
ans *= inv[i];
ans %= MOD;
if (n - k + 1 - i >= 0) {
ans *= inv[n - k + 1 - i];
ans %= MOD;
printf("%lld\n", ans);
} else {
printf("0\n");
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,848 | 798,849 | u855429581 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
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() {
// 前処理
COMinit();
long long int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << COM(k - 1, i - 1) * COM(n - k + 1, i) << endl;
}
} | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
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() {
// 前処理
COMinit();
long long int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << COM(k - 1, i - 1) * COM(n - k + 1, i) % MOD << endl;
}
} | [
"expression.operation.binary.add"
] | 798,850 | 798,851 | u086355897 | cpp |
p02990 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
const int hell = 1000000007;
const int MOD = 1000000007;
const int MOD1 = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a % hell;
int t = power(a, b / 2);
t *= t;
t %= hell;
if (b & 1) {
t *= a;
t %= hell;
}
return t;
}
/*
void EE(int a, int b, int& x, int& y)
{
if(a%b == 0)
{
x=0;
y=1;
return;
}
EE(b,a%b,x,y);
int temp = x;
x = y;
y = temp - y*(a/b);
}
*/
int inverse(int a) { return power(a, hell - 2); }
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int dig(int a) {
int sum = 0;
while (a != 0) {
sum += a % 10;
a /= 10;
}
}
int fac[2010] = {0};
void factorial() {
fac[0] = 1;
rep(i, 1, 2010) fac[i] = (i * fac[i - 1]) % hell;
}
int dp[2010][2010];
int solve() {
factorial();
int n, k;
cin >> n >> k;
int mn = min(k, n - k + 1);
rep(i, 1, 2005) {
dp[i][0] = 0;
dp[i][1] = 1;
dp[i][i] = 1;
rep(j, 2, i) { dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % hell; }
}
rep(i, 1, mn + 1) {
int ans1 = fac[n - k + 1];
int ans2 = fac[i] * fac[n - k + 1 - i];
ans2 %= hell;
ans1 *= inverse(ans2);
ans1 %= hell;
int ans = (dp[k][i]) % hell;
ans *= ans1;
ans %= hell;
cout << ans << endl;
}
rep(i, mn + 1, k) { cout << 0 << endl; }
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// pri();
clock_t time_req;
// Without ung pow function
// cin>>t;
int k = 1;
while (t--) {
// cout<<"Case #"<<k<<":"<<" ";k++;
solve();
// cout<<endl;
}
time_req = clock() - time_req;
// cout <<endl<< "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
const int hell = 1000000007;
const int MOD = 1000000007;
const int MOD1 = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a % hell;
int t = power(a, b / 2);
t *= t;
t %= hell;
if (b & 1) {
t *= a;
t %= hell;
}
return t;
}
/*
void EE(int a, int b, int& x, int& y)
{
if(a%b == 0)
{
x=0;
y=1;
return;
}
EE(b,a%b,x,y);
int temp = x;
x = y;
y = temp - y*(a/b);
}
*/
int inverse(int a) { return power(a, hell - 2); }
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int dig(int a) {
int sum = 0;
while (a != 0) {
sum += a % 10;
a /= 10;
}
}
int fac[2010] = {0};
void factorial() {
fac[0] = 1;
rep(i, 1, 2010) fac[i] = (i * fac[i - 1]) % hell;
}
int dp[2010][2010];
int solve() {
factorial();
int n, k;
cin >> n >> k;
int mn = min(k, n - k + 1);
rep(i, 1, 2005) {
dp[i][0] = 0;
dp[i][1] = 1;
dp[i][i] = 1;
rep(j, 2, i) { dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % hell; }
}
rep(i, 1, mn + 1) {
int ans1 = fac[n - k + 1];
int ans2 = fac[i] * fac[n - k + 1 - i];
ans2 %= hell;
ans1 *= inverse(ans2);
ans1 %= hell;
int ans = (dp[k][i]) % hell;
ans *= ans1;
ans %= hell;
cout << ans << endl;
}
rep(i, mn + 1, k + 1) { cout << 0 << endl; }
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// pri();
clock_t time_req;
// Without ung pow function
// cin>>t;
int k = 1;
while (t--) {
// cout<<"Case #"<<k<<":"<<" ";k++;
solve();
// cout<<endl;
}
time_req = clock() - time_req;
// cout <<endl<< "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 798,860 | 798,861 | u240509821 | cpp |
p02990 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cin >> arr[i1]
#define pb(x) push_back(x)
#define si(a) scanf("%lld", &a)
#define pi(a) printf("%lld", a)
#define mod 1000000007
#define f first
#define s second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
//recursions\
#pragma comment(linker, "/stack:200000000")
//loops\
#pragma GCC optimize("unroll-loops")
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, greater_equal<ll>, rb_tree_tag, \
tree_order_statistics_node_update> // s.order_of_key(val)
// *s.find_by_order(ind)
using namespace std;
// i ll be the king
ll fact[4005], invf[4005];
ll modexp(ll a, ll b) {
a %= mod;
if (a == 0 || a == 1)
return a;
if (b == 0)
return 1;
if (b % 2 == 0) {
ll res = modexp(a, b / 2);
return (res * res) % mod;
}
return (a * modexp(a, b - 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n < r || n <= 0 || r <= 0)
return 0;
ll ans = (fact[n] * invf[r]) % mod;
ans = (ans * invf[n - r]) % mod;
return ans;
}
int main() {
sync;
fact[0] = invf[0] = 1;
for (ll i = 1; i < 4005; i++)
fact[i] = (fact[i - 1] * i) % mod,
invf[i] = (invf[i - 1] * modexp(i, mod - 2)) % mod;
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll ans = ncr(k - 1, i - 1) * ncr(n - k - 1, i - 1);
ans %= mod;
ans *= (ll)2;
ans %= mod;
ans += (ncr(k - 1, i - 1) * ncr(n - k - 1, i - 2)) % mod;
ans %= mod;
ans += (ncr(k - 1, i - 1) * ncr(n - k - 1, i)) % mod;
ans %= mod;
if (n == k && i == 1)
ans = 1;
cout << ans << "\n";
}
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cin >> arr[i1]
#define pb(x) push_back(x)
#define si(a) scanf("%lld", &a)
#define pi(a) printf("%lld", a)
#define mod 1000000007
#define f first
#define s second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
//recursions\
#pragma comment(linker, "/stack:200000000")
//loops\
#pragma GCC optimize("unroll-loops")
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, greater_equal<ll>, rb_tree_tag, \
tree_order_statistics_node_update> // s.order_of_key(val)
// *s.find_by_order(ind)
using namespace std;
// i ll be the king
ll fact[4005], invf[4005];
ll modexp(ll a, ll b) {
a %= mod;
if (a == 0 || a == 1)
return a;
if (b == 0)
return 1;
if (b % 2 == 0) {
ll res = modexp(a, b / 2);
return (res * res) % mod;
}
return (a * modexp(a, b - 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
ll ans = (fact[n] * invf[r]) % mod;
ans = (ans * invf[n - r]) % mod;
return ans;
}
int main() {
sync;
fact[0] = invf[0] = 1;
for (ll i = 1; i < 4005; i++)
fact[i] = (fact[i - 1] * i) % mod,
invf[i] = (invf[i - 1] * modexp(i, mod - 2)) % mod;
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll ans = ncr(k - 1, i - 1) * ncr(n - k - 1, i - 1);
ans %= mod;
ans *= (ll)2;
ans %= mod;
ans += (ncr(k - 1, i - 1) * ncr(n - k - 1, i - 2)) % mod;
ans %= mod;
ans += (ncr(k - 1, i - 1) * ncr(n - k - 1, i)) % mod;
ans %= mod;
if (n == k && i == 1)
ans = 1;
cout << ans << "\n";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,863 | 798,864 | u181228520 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
const int MOD = 1000000007;
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 comb(long long n, long long 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(void) {
int n, k;
cin >> n >> k;
int r = n - k;
COMinit();
for (int i = 0; i < k; ++i) {
cout << comb(k - 1, i) * comb(r + 1, i + 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
const int MOD = 1000000007;
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 comb(long long n, long long 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(void) {
int n, k;
cin >> n >> k;
int r = n - k;
COMinit();
for (int i = 0; i < k; ++i) {
cout << comb(k - 1, i) * comb(r + 1, i + 1) % MOD << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 798,872 | 798,873 | u285409047 | cpp |
p02990 | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f(i, a, b) for (int i = a; i <= b; i++)
#define mm make_pair
#define pi 2 * acos(0.0)
#define lcm(a, b) (a * b) / __gcd(a, b)
#define Case(i, ans) cout << "Case " << i << ": " << ans << endl;
#define cp(i, ans) printf("%.if", ans);
#define cpp(i, ans) \
cout.precision(i); \
cout << fixed << ans << endl;
#define Y \
{ \
cout << "YES" << endl; \
return 0; \
}
#define pb(x) push_back(x)
#define lowbit(x) (x) & (-x)
#define out(x) \
{ \
cout << x << endl; \
return 0; \
}
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f, maxn = 2e5 + 100;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll ksm(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = (r * a) % mod;
a = a * a % mod;
b >>= 1;
}
return r;
}
ll n, k, c[2005][2005] = {0};
void pre() {
c[0][0] = 1;
for (int i = 1; i <= 2000; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
int main() {
cin >> n >> k;
pre();
for (int i = 1; i <= k; i++) {
ll n1 = i - 1;
ll ban = c[k - 1][n1];
ll ans = c[n - k + 1][i] * ban;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f(i, a, b) for (int i = a; i <= b; i++)
#define mm make_pair
#define pi 2 * acos(0.0)
#define lcm(a, b) (a * b) / __gcd(a, b)
#define Case(i, ans) cout << "Case " << i << ": " << ans << endl;
#define cp(i, ans) printf("%.if", ans);
#define cpp(i, ans) \
cout.precision(i); \
cout << fixed << ans << endl;
#define Y \
{ \
cout << "YES" << endl; \
return 0; \
}
#define pb(x) push_back(x)
#define lowbit(x) (x) & (-x)
#define out(x) \
{ \
cout << x << endl; \
return 0; \
}
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f, maxn = 2e5 + 100;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll ksm(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = (r * a) % mod;
a = a * a % mod;
b >>= 1;
}
return r;
}
ll n, k, c[2005][2005] = {0};
void pre() {
c[0][0] = 1;
for (int i = 1; i <= 2000; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
int main() {
cin >> n >> k;
pre();
for (int i = 1; i <= k; i++) {
ll n1 = i - 1;
ll ban = c[k - 1][n1];
ll ans = (c[n - k + 1][i] * ban) % mod;
cout << ans << endl;
}
} | [
"assignment.change"
] | 798,880 | 798,881 | u708986486 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j < 9; j++) {
llc = lll;
for (int k = 0; k < 9; k++) {
lll *= llc;
lll %= mod;
}
}
for (int j = 0; j < 5; j++) {
lll *= ki[i];
lll %= mod;
}
kii[i] = lll;
kii[i] %= mod;
}
int N, K;
cin >> N >> K;
long long ans = 0;
for (int i = 1; i <= K; i++) {
ans = 0;
if (N - K < i - 1) {
cout << 0 << endl;
continue;
}
if (i != 1) {
ans += ki[N - K - 1] * kii[i - 2] % mod * kii[N - K - i + 1] % mod;
} else if (N - K == 0) {
cout << 1 << endl;
}
if (N - K > i - 1) {
ans += ki[N - K - 1] * kii[i - 1] % mod * kii[N - K - i] % mod * 2;
}
if (N - K > i) {
ans += ki[N - K - 1] * kii[i] % mod * kii[N - K - i - 1] % mod;
}
ans %= mod;
ans *= ki[K - 1] % mod * kii[i - 1] % mod * kii[K - i] % mod;
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j < 9; j++) {
llc = lll;
for (int k = 0; k < 9; k++) {
lll *= llc;
lll %= mod;
}
}
for (int j = 0; j < 5; j++) {
lll *= ki[i];
lll %= mod;
}
kii[i] = lll;
kii[i] %= mod;
}
int N, K;
cin >> N >> K;
long long ans = 0;
for (int i = 1; i <= K; i++) {
ans = 0;
if (N - K < i - 1) {
cout << 0 << endl;
continue;
}
if (i != 1) {
ans += ki[N - K - 1] * kii[i - 2] % mod * kii[N - K - i + 1] % mod;
} else if (N - K == 0) {
cout << 1 << endl;
continue;
}
if (N - K > i - 1) {
ans += ki[N - K - 1] * kii[i - 1] % mod * kii[N - K - i] % mod * 2;
}
if (N - K > i) {
ans += ki[N - K - 1] * kii[i] % mod * kii[N - K - i - 1] % mod;
}
ans %= mod;
ans *= ki[K - 1] % mod * kii[i - 1] % mod * kii[K - i] % mod;
ans %= mod;
cout << ans << endl;
}
return 0;
} | [] | 798,882 | 798,883 | u912534104 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j < 9; j++) {
llc = lll;
for (int k = 0; k < 9; k++) {
lll *= llc;
lll %= mod;
}
}
for (int j = 0; j < 5; j++) {
lll *= ki[i];
lll %= mod;
}
kii[i] = lll;
kii[i] %= mod;
}
int N, K;
cin >> N >> K;
long long ans = 0;
for (int i = 1; i <= K; i++) {
ans = 0;
if (N - K < i - 1) {
cout << 0 << endl;
break;
}
if (i != 1) {
ans += ki[N - K - 1] * kii[i - 2] % mod * kii[N - K - i + 1] % mod;
} else if (N - K == 0) {
cout << 1 << endl;
}
if (N - K > i - 1) {
ans += ki[N - K - 1] * kii[i - 1] % mod * kii[N - K - i] % mod * 2;
}
if (N - K > i) {
ans += ki[N - K - 1] * kii[i] % mod * kii[N - K - i - 1] % mod;
}
ans %= mod;
ans *= ki[K - 1] % mod * kii[i - 1] % mod * kii[K - i] % mod;
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j < 9; j++) {
llc = lll;
for (int k = 0; k < 9; k++) {
lll *= llc;
lll %= mod;
}
}
for (int j = 0; j < 5; j++) {
lll *= ki[i];
lll %= mod;
}
kii[i] = lll;
kii[i] %= mod;
}
int N, K;
cin >> N >> K;
long long ans = 0;
for (int i = 1; i <= K; i++) {
ans = 0;
if (N - K < i - 1) {
cout << 0 << endl;
continue;
}
if (i != 1) {
ans += ki[N - K - 1] * kii[i - 2] % mod * kii[N - K - i + 1] % mod;
} else if (N - K == 0) {
cout << 1 << endl;
continue;
}
if (N - K > i - 1) {
ans += ki[N - K - 1] * kii[i - 1] % mod * kii[N - K - i] % mod * 2;
}
if (N - K > i) {
ans += ki[N - K - 1] * kii[i] % mod * kii[N - K - i - 1] % mod;
}
ans %= mod;
ans *= ki[K - 1] % mod * kii[i - 1] % mod * kii[K - i] % mod;
ans %= mod;
cout << ans << endl;
}
return 0;
} | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 798,884 | 798,883 | u912534104 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long ans, p[2010][2010];
long long combi(int a, int b) {
if ((b == 0) || (a == b)) {
return 1;
}
if (p[a][b] != 0) {
return p[a][b];
}
ans = combi(a - 1, b - 1) + combi(a - 1, b);
p[a][b] = ans;
return ans;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k < i - 1) {
cout << 0 << endl;
continue;
}
ans = combi(k - 1, i - 1) * combi(n - k + 1, i);
ans %= 1000000007;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long ans, p[2010][2010];
long long combi(int a, int b) {
if ((b == 0) || (a == b)) {
return 1;
}
if (p[a][b] != 0) {
return p[a][b];
}
ans = combi(a - 1, b - 1) + combi(a - 1, b);
ans %= 1000000007;
p[a][b] = ans;
return ans;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k < i - 1) {
cout << 0 << endl;
continue;
}
ans = combi(k - 1, i - 1) * combi(n - k + 1, i);
ans %= 1000000007;
cout << ans << endl;
}
} | [
"assignment.add"
] | 798,898 | 798,899 | u576357314 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
const int MOD = 1000000007;
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() {
COMinit();
int t;
int a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++) {
if (i * 2 - 1 > b) {
cout << 0 << endl;
continue;
}
if (i != 1)
t = COM(b - 1, i - 1);
else
t = 1;
cout << t * COM(a - b + 1, a - b - i + 1) % 1000000007 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
const int MOD = 1000000007;
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() {
COMinit();
int t;
int a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++) {
if (i * 2 - 1 > a) {
cout << 0 << endl;
continue;
}
if (i != 1)
t = COM(b - 1, i - 1);
else
t = 1;
cout << t * COM(a - b + 1, a - b - i + 1) % 1000000007 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 798,904 | 798,905 | u953110527 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
const int MOD = 1000000007;
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() {
COMinit();
int t;
int a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++) {
if (b * 2 - 1 > a) {
cout << 0 << endl;
continue;
}
if (i != 1)
t = COM(b - 1, i - 1) % 1000000007;
else
t = 1;
cout << t * COM(a - b + 1, a - b - i + 1) % 1000000007 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
const int MOD = 1000000007;
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() {
COMinit();
int t;
int a, b;
cin >> a >> b;
for (int i = 1; i <= b; i++) {
if (i * 2 - 1 > a) {
cout << 0 << endl;
continue;
}
if (i != 1)
t = COM(b - 1, i - 1);
else
t = 1;
cout << t * COM(a - b + 1, a - b - i + 1) % 1000000007 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 798,906 | 798,905 | u953110527 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c[2050][2050], d[2050][2050], M = 1e9 + 7;
void Init() {
for (int i = 1; i <= 2010; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % M;
}
}
for (int i = 0; i <= 2010; i++)
d[0][i] = 1;
for (int i = 1; i <= 2010; i++)
for (int j = 1; j <= 2010; j++)
d[i][j] = (d[i][j - 1] + d[i - 1][j]) % M;
}
int main() {
Init();
cin >> n >> a;
b = n - a + 1;
for (int i = 1; i <= a; i++) {
if (i > b)
printf("0\n");
printf("%lld\n", 1ll * c[b][i] * d[a - i][i] % M);
}
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c[2050][2050], d[2050][2050], M = 1e9 + 7;
void Init() {
for (int i = 1; i <= 2010; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % M;
}
}
for (int i = 0; i <= 2010; i++)
d[0][i] = 1;
for (int i = 1; i <= 2010; i++)
for (int j = 1; j <= 2010; j++)
d[i][j] = (d[i][j - 1] + d[i - 1][j]) % M;
}
int main() {
Init();
cin >> n >> a;
b = n - a + 1;
for (int i = 1; i <= a; i++) {
if (i > b)
printf("0\n");
else
printf("%lld\n", 1ll * c[b][i] * d[a - i][i] % M);
}
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 798,923 | 798,924 | u316473009 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powmod(ll b, ll e) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % MOD) * (b % MOD) % MOD;
b = (b % MOD) * (b % MOD) % MOD;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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 (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
const int MAX = 3000;
ll fac[MAX], finv[MAX], inv[MAX];
void combinit() {
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;
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
combinit();
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
// if(i == 1 or i == k){
// cout << com(n-k+1, i) << endl;
// }
// else{
// cout << com(n-k+1, i)* << endl;
// }
cout << com(n - k + 1, i) * com(k - 1, k - i) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powmod(ll b, ll e) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % MOD) * (b % MOD) % MOD;
b = (b % MOD) * (b % MOD) % MOD;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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 (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
const int MAX = 3000;
ll fac[MAX], finv[MAX], inv[MAX];
void combinit() {
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;
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
combinit();
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
// if(i == 1 or i == k){
// cout << com(n-k+1, i) << endl;
// }
// else{
// cout << com(n-k+1, i)* << endl;
// }
cout << com(n - k + 1, i) * com(k - 1, k - i) % MOD << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 798,928 | 798,929 | u306142032 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, B) (A = std::min(A, B))
typedef long long ll;
struct POINT {
int x;
int y;
POINT(int x, int y) : x(x), y(y) {}
};
POINT operator+(const POINT &a, const POINT &b) {
return POINT(a.x + b.x, a.y + b.y);
}
POINT operator-(const POINT &a, const POINT &b) {
return POINT(a.x - b.x, a.y - b.y);
}
/* std::cout << ;*/
/* std::cout << << std::endl; */
const int MOD = 1000000007;
const int MAX = 510000;
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 c(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;
}
ll memo[4001];
ll h(ll n, ll r) { return c(n + r - 1, r); }
int main(void) {
int n, k;
std::cin >> n >> k;
COMinit();
REP(i, 4001) memo[i] = -1;
REP(i, k + 1) {
if (i == 0)
continue;
// std::cout << "here" << i << std::endl;
if (n - k + 1 < i) {
std::cout << 0 << std::endl;
return 0;
}
// std::cout << "i : " << i << std::endl;
// std::cout << "k - i : " << k - i << ", n - k - (i - 1) : " << n - k - (i
// - 1) << std::endl;
std::cout << (h(i, k - i) * h(i + 1, n - k - (i - 1))) % MOD << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, B) (A = std::min(A, B))
typedef long long ll;
struct POINT {
int x;
int y;
POINT(int x, int y) : x(x), y(y) {}
};
POINT operator+(const POINT &a, const POINT &b) {
return POINT(a.x + b.x, a.y + b.y);
}
POINT operator-(const POINT &a, const POINT &b) {
return POINT(a.x - b.x, a.y - b.y);
}
/* std::cout << ;*/
/* std::cout << << std::endl; */
const int MOD = 1000000007;
const int MAX = 510000;
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 c(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;
}
ll memo[4001];
ll h(ll n, ll r) { return c(n + r - 1, r); }
int main(void) {
int n, k;
std::cin >> n >> k;
COMinit();
REP(i, 4001) memo[i] = -1;
REP(i, k + 1) {
if (i == 0)
continue;
// std::cout << "here" << i << std::endl;
if (n - k + 1 < i) {
std::cout << 0 << std::endl;
continue;
}
// std::cout << "i : " << i << std::endl;
// std::cout << "k - i : " << k - i << ", n - k - (i - 1) : " << n - k - (i
// - 1) << std::endl;
std::cout << (h(i, k - i) * h(i + 1, n - k - (i - 1))) % MOD << std::endl;
}
return 0;
} | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 798,930 | 798,931 | u218356514 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, B) (A = std::min(A, B))
typedef long long ll;
struct POINT {
int x;
int y;
POINT(int x, int y) : x(x), y(y) {}
};
POINT operator+(const POINT &a, const POINT &b) {
return POINT(a.x + b.x, a.y + b.y);
}
POINT operator-(const POINT &a, const POINT &b) {
return POINT(a.x - b.x, a.y - b.y);
}
/* std::cout << ;*/
/* std::cout << << std::endl; */
const int MOD = 1000000007;
const int MAX = 510000;
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 c(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;
}
ll memo[4001];
ll h(ll n, ll r) { return c(n + r - 1, r); }
int main(void) {
int n, k;
std::cin >> n >> k;
COMinit();
REP(i, 4001) memo[i] = -1;
REP(i, k + 1) {
if (i == 0)
continue;
// std::cout << "here" << i << std::endl;
if (n - k + 1 < i)
std::cout << 0 << std::endl;
// std::cout << "i : " << i << std::endl;
// std::cout << "k - i : " << k - i << ", n - k - (i - 1) : " << n - k - (i
// - 1) << std::endl;
std::cout << (h(i, k - i) * h(i + 1, n - k - (i - 1))) % MOD << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, B) (A = std::min(A, B))
typedef long long ll;
struct POINT {
int x;
int y;
POINT(int x, int y) : x(x), y(y) {}
};
POINT operator+(const POINT &a, const POINT &b) {
return POINT(a.x + b.x, a.y + b.y);
}
POINT operator-(const POINT &a, const POINT &b) {
return POINT(a.x - b.x, a.y - b.y);
}
/* std::cout << ;*/
/* std::cout << << std::endl; */
const int MOD = 1000000007;
const int MAX = 510000;
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 c(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;
}
ll memo[4001];
ll h(ll n, ll r) { return c(n + r - 1, r); }
int main(void) {
int n, k;
std::cin >> n >> k;
COMinit();
REP(i, 4001) memo[i] = -1;
REP(i, k + 1) {
if (i == 0)
continue;
// std::cout << "here" << i << std::endl;
if (n - k + 1 < i) {
std::cout << 0 << std::endl;
continue;
}
// std::cout << "i : " << i << std::endl;
// std::cout << "k - i : " << k - i << ", n - k - (i - 1) : " << n - k - (i
// - 1) << std::endl;
std::cout << (h(i, k - i) * h(i + 1, n - k - (i - 1))) % MOD << std::endl;
}
return 0;
} | [] | 798,932 | 798,931 | u218356514 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
class Combination {
public:
vector<ll> fact;
vector<ll> inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) {
if (r > n)
return 0;
return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;
}
ll nPr(ll n, ll r) {
if (r > n)
return 0;
return (fact[n] * inv[n - r]) % mod;
}
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
forn(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
forn(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const ll mod = 1e9 + 7;
const ll N = 505;
Combination comb(N, mod);
ll b, r;
cin >> r >> b;
r = r - b;
Mat M(N + 1, Arr(N + 1));
forn(i, N) M[i][0] = 1;
forn(j, N) M[0][j] = 0;
fori(i, 1, N) fori(j, 1, N) M[i][j] = (M[i - 1][j] + M[i][j - 1]) % mod;
fori(i, 1, b + 1) {
cout << ((comb.nCr(r + 1, i) * M[i][b - i]) % mod) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
class Combination {
public:
vector<ll> fact;
vector<ll> inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) {
if (r > n)
return 0;
return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;
}
ll nPr(ll n, ll r) {
if (r > n)
return 0;
return (fact[n] * inv[n - r]) % mod;
}
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
forn(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
forn(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const ll mod = 1e9 + 7;
const ll N = 2005;
Combination comb(N, mod);
ll b, r;
cin >> r >> b;
r = r - b;
Mat M(N + 1, Arr(N + 1));
forn(i, N) M[i][0] = 1;
forn(j, N) M[0][j] = 0;
fori(i, 1, N) fori(j, 1, N) M[i][j] = (M[i - 1][j] + M[i][j - 1]) % mod;
fori(i, 1, b + 1) {
cout << ((comb.nCr(r + 1, i) * M[i][b - i]) % mod) << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 798,933 | 798,934 | u282860133 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
class Combination {
public:
vector<ll> fact;
vector<ll> inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) {
if (r > n)
return 0;
return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;
}
ll nPr(ll n, ll r) {
if (r > n)
return 0;
return (fact[n] * inv[n - r]) % mod;
}
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
forn(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
forn(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const ll mod = 1e9 + 7;
const ll N = 2005;
Combination comb(N, mod);
ll b, r;
cin >> r >> b;
r = r - b;
Mat M(N + 1, Arr(N + 1));
forn(i, N) M[i][0] = 1;
forn(j, N) M[0][j] = 0;
fori(i, 1, N) fori(j, 1, N) M[i][j] = (M[i - 1][j] + M[i][j - 1]) % mod;
fori(i, 1, b + 1) { cout << (comb.nCr(r + 1, i) * M[i][b - i]) << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#define Mat vector<vector<ll>>
#define Arr vector<ll>
#define Matd vector<vector<ld>>
#define Arrd vector<ld>
class Combination {
public:
vector<ll> fact;
vector<ll> inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) {
if (r > n)
return 0;
return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;
}
ll nPr(ll n, ll r) {
if (r > n)
return 0;
return (fact[n] * inv[n - r]) % mod;
}
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
forn(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
forn(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const ll mod = 1e9 + 7;
const ll N = 2005;
Combination comb(N, mod);
ll b, r;
cin >> r >> b;
r = r - b;
Mat M(N + 1, Arr(N + 1));
forn(i, N) M[i][0] = 1;
forn(j, N) M[0][j] = 0;
fori(i, 1, N) fori(j, 1, N) M[i][j] = (M[i - 1][j] + M[i][j - 1]) % mod;
fori(i, 1, b + 1) {
cout << ((comb.nCr(r + 1, i) * M[i][b - i]) % mod) << endl;
}
return 0;
} | [] | 798,935 | 798,934 | u282860133 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
#define CIN(V, s, n) \
for (int i = s; i < n; i++) { \
cin >> V[i]; \
}
#define COUT(V, s, n) \
for (int i = s; i < n; i++) { \
cout << V[i] << " "; \
}
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define CLEAR(V) \
; \
for (ll i = 0; i < V.size(); i++) \
V[i] = 0;
// map<ll,vector<ll> > M;
// map<ll,vector<ll> >:: iterator it;
// it = M.begin();
// it.F will be ll
// it.S will be vector<ll>
using namespace std;
bool SbS(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll SUMD(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n = n / 10;
}
return sum;
}
ll BS(vector<ll> &PS, ll s, ll e, ll ser) {
if (s > e)
return s;
ll mid = (s + e) / 2;
if (PS[mid] == ser) {
return mid;
} else if (PS[mid] > ser) {
return BS(PS, s, mid - 1, ser);
} else
return BS(PS, mid + 1, e, ser);
}
ll rd(dl x) {
if ((ll)x == x)
return (ll)x;
else
return ((ll)x);
}
ll MI(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int main() {
ll t = 1;
// cin >> t;
while (t--) {
ll n, m, k, i, j, l, u, v, x, y, a, b, c, d;
vector<ll> F(5001, 1), IF(5001, 1);
for (i = 2; i <= 5000; i++) {
F[i] = (F[i - 1] * i) % mod;
}
for (i = 2; i <= 5000; i++) {
IF[i] = (IF[i - 1] * MI(i, mod)) % mod;
// cout << IF[i] << " ";
}
cin >> n >> k;
vector<ll> Wa(k + 1);
for (i = 1; (i <= k and i <= n - k + 1); i++) {
Wa[i] = (((F[k - 1] * IF[i - 1]) % mod) * (IF[k - i])) % mod;
Wa[i] =
(Wa[i] * (((F[n - k + 1] * IF[i]) % mod) * IF[n - k + 1 - i]) % mod) %
mod;
}
for (i = 1; i <= k; i++) {
cout << Wa[i] << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
#define CIN(V, s, n) \
for (int i = s; i < n; i++) { \
cin >> V[i]; \
}
#define COUT(V, s, n) \
for (int i = s; i < n; i++) { \
cout << V[i] << " "; \
}
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define CLEAR(V) \
; \
for (ll i = 0; i < V.size(); i++) \
V[i] = 0;
// map<ll,vector<ll> > M;
// map<ll,vector<ll> >:: iterator it;
// it = M.begin();
// it.F will be ll
// it.S will be vector<ll>
using namespace std;
bool SbS(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll SUMD(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n = n / 10;
}
return sum;
}
ll BS(vector<ll> &PS, ll s, ll e, ll ser) {
if (s > e)
return s;
ll mid = (s + e) / 2;
if (PS[mid] == ser) {
return mid;
} else if (PS[mid] > ser) {
return BS(PS, s, mid - 1, ser);
} else
return BS(PS, mid + 1, e, ser);
}
ll rd(dl x) {
if ((ll)x == x)
return (ll)x;
else
return ((ll)x);
}
ll MI(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int main() {
ll t = 1;
// cin >> t;
while (t--) {
ll n, m, k, i, j, l, u, v, x, y, a, b, c, d;
vector<ll> F(5001, 1), IF(5001, 1);
for (i = 2; i <= 5000; i++) {
F[i] = (F[i - 1] * i) % mod;
}
for (i = 2; i <= 5000; i++) {
IF[i] = (IF[i - 1] * MI(i, mod)) % mod;
// cout << IF[i] << " ";
}
cin >> n >> k;
vector<ll> Wa(k + 1);
for (i = 1; (i <= k and i <= n - k + 1); i++) {
Wa[i] = (((F[k - 1] * IF[i - 1]) % mod) * (IF[k - i])) %
mod; //(((F[k]*IF[k-i])%mod));//
Wa[i] = (Wa[i] *
((((F[n - k + 1] * IF[i]) % mod) * IF[n - k + 1 - i]) % mod)) %
mod;
}
for (i = 1; i <= k; i++) {
cout << Wa[i] << endl;
}
}
return 0;
}
| [] | 798,942 | 798,943 | u121266738 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
#define CIN(V, s, n) \
for (int i = s; i < n; i++) { \
cin >> V[i]; \
}
#define COUT(V, s, n) \
for (int i = s; i < n; i++) { \
cout << V[i] << " "; \
}
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define CLEAR(V) \
; \
for (ll i = 0; i < V.size(); i++) \
V[i] = 0;
// map<ll,vector<ll> > M;
// map<ll,vector<ll> >:: iterator it;
// it = M.begin();
// it.F will be ll
// it.S will be vector<ll>
using namespace std;
bool SbS(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll SUMD(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n = n / 10;
}
return sum;
}
ll BS(vector<ll> &PS, ll s, ll e, ll ser) {
if (s > e)
return s;
ll mid = (s + e) / 2;
if (PS[mid] == ser) {
return mid;
} else if (PS[mid] > ser) {
return BS(PS, s, mid - 1, ser);
} else
return BS(PS, mid + 1, e, ser);
}
ll rd(dl x) {
if ((ll)x == x)
return (ll)x;
else
return ((ll)x);
}
ll MI(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int main() {
ll t = 1;
// cin >> t;
while (t--) {
ll n, m, k, i, j, l, u, v, x, y, a, b, c, d;
vector<ll> F(5000, 1), IF(5000, 1);
for (i = 2; i <= 5000; i++) {
F[i] = (F[i - 1] * i) % mod;
}
for (i = 2; i <= 5000; i++) {
IF[i] = (IF[i - 1] * MI(i, mod)) % mod;
// cout << IF[i] << " ";
}
cin >> n >> k;
vector<ll> Wa(k + 1);
for (i = 1; (i <= k and i <= n - k + 1); i++) {
Wa[i] = (((F[k - 1] * IF[i - 1]) % mod) * (IF[k - i])) % mod;
Wa[i] =
(Wa[i] * (((F[n - k + 1] * IF[i]) % mod) * IF[n - k + 1 - i]) % mod) %
mod;
}
for (i = 1; i <= k; i++) {
cout << Wa[i] << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
#define CIN(V, s, n) \
for (int i = s; i < n; i++) { \
cin >> V[i]; \
}
#define COUT(V, s, n) \
for (int i = s; i < n; i++) { \
cout << V[i] << " "; \
}
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define CLEAR(V) \
; \
for (ll i = 0; i < V.size(); i++) \
V[i] = 0;
// map<ll,vector<ll> > M;
// map<ll,vector<ll> >:: iterator it;
// it = M.begin();
// it.F will be ll
// it.S will be vector<ll>
using namespace std;
bool SbS(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
ll SUMD(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n = n / 10;
}
return sum;
}
ll BS(vector<ll> &PS, ll s, ll e, ll ser) {
if (s > e)
return s;
ll mid = (s + e) / 2;
if (PS[mid] == ser) {
return mid;
} else if (PS[mid] > ser) {
return BS(PS, s, mid - 1, ser);
} else
return BS(PS, mid + 1, e, ser);
}
ll rd(dl x) {
if ((ll)x == x)
return (ll)x;
else
return ((ll)x);
}
ll MI(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int main() {
ll t = 1;
// cin >> t;
while (t--) {
ll n, m, k, i, j, l, u, v, x, y, a, b, c, d;
vector<ll> F(5001, 1), IF(5001, 1);
for (i = 2; i <= 5000; i++) {
F[i] = (F[i - 1] * i) % mod;
}
for (i = 2; i <= 5000; i++) {
IF[i] = (IF[i - 1] * MI(i, mod)) % mod;
// cout << IF[i] << " ";
}
cin >> n >> k;
vector<ll> Wa(k + 1);
for (i = 1; (i <= k and i <= n - k + 1); i++) {
Wa[i] = (((F[k - 1] * IF[i - 1]) % mod) * (IF[k - i])) %
mod; //(((F[k]*IF[k-i])%mod));//
Wa[i] = (Wa[i] *
((((F[n - k + 1] * IF[i]) % mod) * IF[n - k + 1 - i]) % mod)) %
mod;
}
for (i = 1; i <= k; i++) {
cout << Wa[i] << endl;
}
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 798,944 | 798,943 | u121266738 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define endl "\n"
const ll N = 1e6 + 7;
const double PI = acos(-1);
ll mod = 1e9 + 7;
ll modexpo(ll b, ll p) {
ll res = 1;
while (p) {
if (p & 1)
res *= b;
p >>= 1;
b *= b;
b %= mod;
res %= mod;
}
return res;
}
ll modinverse(ll b) { return modexpo(b, mod - 2); }
int32_t main() {
IOS
ll n,
k;
cin >> n >> k;
ll res = 1;
ll res2 = n - k + 1;
ll fi = 1, fi1 = 1;
for (int i = 1; i <= k; i++) {
fi *= i;
fi %= mod;
if (i > 1)
fi1 = fi1 * (i - 1);
ll ans = res * res2;
ans %= mod;
ans *= modinverse(fi1);
ans %= mod;
ans *= modinverse(fi);
ans %= mod;
res *= (k - i);
res %= mod;
res2 *= (n - k + 1 - i);
res2 %= mod;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define endl "\n"
const ll N = 1e6 + 7;
const double PI = acos(-1);
ll mod = 1e9 + 7;
ll modexpo(ll b, ll p) {
ll res = 1;
while (p) {
if (p & 1)
res *= b;
p >>= 1;
b *= b;
b %= mod;
res %= mod;
}
return res;
}
ll modinverse(ll b) { return modexpo(b, mod - 2); }
int32_t main() {
IOS
ll n,
k;
cin >> n >> k;
ll res = 1;
ll res2 = n - k + 1;
ll fi = 1, fi1 = 1;
for (int i = 1; i <= k; i++) {
fi *= i;
fi %= mod;
if (i > 1)
fi1 = fi1 * (i - 1);
fi1 %= mod;
ll ans = res * res2;
ans %= mod;
ans *= modinverse(fi1);
ans %= mod;
ans *= modinverse(fi);
ans %= mod;
res *= (k - i);
res %= mod;
res2 *= (n - k + 1 - i);
res2 %= mod;
cout << ans << endl;
}
return 0;
}
| [
"assignment.add"
] | 798,949 | 798,950 | u300650560 | cpp |
p02990 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
using LL = long long;
using VS = vector<string>;
using VD = vector<double>;
using VI = vector<int>;
using VL = vector<LL>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int inf = (int)1e9;
const double pi = acos(-1.0);
const LL MOD = 1000000007;
const string Snum = "0123456789";
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1},
dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T> void ReSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> void Unique(T &a) {
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class T> auto Max(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto Min(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> int Count(const T &a, U c) {
return count(a.begin(), a.end(), c);
}
template <class T, class U> U Sum(const T &a, U init = 0) {
return accumulate(a.begin(), a.end(), init);
}
template <class T, class U> int Lower(const T &a, U s) {
return lower_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T, class U> int Upper(const T &a, U s) {
return upper_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T> T Age(T a, T b) { return (a + b - 1) / b; }
template <class T> T Gcd(T n, T m) { return m == 0 ? n : Gcd(m, n % m); }
template <class T> T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
/* INPUT */
template <class T> T InputF() { return 0; }
template <> char InputF() {
char ret = '\0', c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret = c;
c = getchar_unlocked();
}
return ret;
}
template <> string InputF() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
template <> int InputF() {
int ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10 + (c - '0');
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> LL InputF() {
LL ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10LL + (LL(c) - LL('0'));
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> double InputF() {
double ret = 0, dp = 1;
bool neg = false, adp = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while (('0' <= c && c <= '9') || c == '.') {
if (c == '.') {
adp = true;
} else if (adp) {
dp *= 0.1;
ret += (c - '0') * dp;
} else {
ret = ret * 10.0 + (c - '0');
}
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <class T> T StoT(string s) { return s; }
template <> char StoT(string s) { return s.front(); }
template <> string StoT(string s) { return s; }
template <> int StoT(string s) { return stoi(s); }
template <> LL StoT(string s) { return stoll(s); }
template <> double StoT(string s) { return stod(s); }
string GetLine() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
VS InputB;
template <class T> struct InputC {
operator T() { return InputF<T>(); }
vector<T> operator[](int h) {
vector<T> ret(h);
rep(i, h) ret[i] = InputF<T>();
return ret;
}
vector<vector<T>> operator[](PII p) {
int h, w;
tie(h, w) = p;
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = InputF<T>();
return ret;
}
T at(int n) {
while (sz(InputB) <= n)
InputB.pb(InputF<string>());
return StoT<T>(InputB[n]);
}
vector<T> at(int n, int h) {
vector<T> ret(h);
rep(i, h) ret[i] = at(i + n);
return ret;
}
vector<vector<T>> at(int n, int h, int w) {
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = at(n + i * w + j);
return ret;
}
};
InputC<char> inc;
InputC<string> ins;
InputC<int> ini;
InputC<LL> inl;
InputC<double> ind;
/* OUTPUT */
class ostreamfbuff : public std::basic_streambuf<char, std::char_traits<char>> {
protected:
int overflow(int nCh = EOF) {
putchar_unlocked(nCh);
return 0;
}
};
class ostreamf : public std::basic_iostream<char, std::char_traits<char>> {
public:
ostreamf(void)
: std::basic_iostream<char, std::char_traits<char>>(new ostreamfbuff()) {}
};
ostreamf coutf;
ostream &operator<<(ostream &ostr, InputC<string> i) {
ostr << string(i);
return ostr;
}
struct BoolStr {
string t, f;
BoolStr(string tr, string fa) : t(tr), f(fa) {}
} yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct Divizer {
string s;
Divizer(string s_) : s(s_) {}
} spc(" "), nosp(""), comma(","), lin("\n");
struct Output {
bool flag = false;
BoolStr bs;
Divizer di;
Output(bool f, BoolStr b, Divizer d) : flag(f), bs(b), di(d) {}
template <class T> void print(T o) { coutf << o; }
void print(double o) { printf("%.20f", o); }
void print(bool o) { coutf << (o ? bs.t : bs.f); }
template <class T, class U> void print(const pair<T, U> &o) {
print(o.first);
coutf << di.s;
print(o.second);
}
template <class T> void print(const vector<T> &o) {
for (int i = 0; i < (int)o.size(); ++i) {
if (i != 0)
coutf << di.s;
print(o[i]);
}
}
template <class T, class U> void print(const map<T, U> &o) {
coutf << "Map";
for (auto a : o) {
coutf << " {";
print(a);
coutf << "},";
}
coutf << "\n";
}
template <class T> void print(const set<T> &o) {
coutf << "Set {";
for (auto a : o) {
print(a);
coutf << ",";
}
coutf << "}\n";
}
template <class T> Output operator,(T o) {
if (flag)
coutf << di.s;
print(o);
Output t(true, bs, di);
return t;
}
Output operator,(Output o) {
coutf << '\n';
return o;
}
Output operator,(BoolStr b) {
Output t(flag, b, di);
return t;
}
Output operator,(Divizer d) {
Output t(flag, bs, d);
return t;
}
} out(false, Yes, spc);
/* ANSWER */
struct Answer {
int mini = INT_MAX, maxi = INT_MIN, sumi = 0;
LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0;
double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0;
int cnt = 0;
void operator=(int n) {
mini = min(mini, n);
maxi = max(maxi, n);
sumi += n;
cnt++;
}
void operator=(LL n) {
minl = min(minl, n);
maxl = max(maxl, n);
suml += n;
cnt++;
}
void operator=(double n) {
mind = min(mind, n);
maxd = max(maxd, n);
sumd += n;
cnt++;
}
} ans;
void comb(VVL &v) {
for (int i = 0; i < sz(v); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
FOR(k, 1, sz(v))
FOR(j, 1, k) v[k][j] = (v[k - 1][j - 1] % MOD + v[k - 1][j] % MOD) % MOD;
}
int main() {
LL n = inl, k = inl;
VVL c(n, VL(n));
comb(c);
rep(i, k) { out, c[k - 1][i] * c[n - k + 1][i + 1] % MOD, out; }
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
using LL = long long;
using VS = vector<string>;
using VD = vector<double>;
using VI = vector<int>;
using VL = vector<LL>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int inf = (int)1e9;
const double pi = acos(-1.0);
const LL MOD = 1000000007;
const string Snum = "0123456789";
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1},
dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T> void ReSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> void Unique(T &a) {
a.erase(unique(a.begin(), a.end()), a.end());
}
template <class T> auto Max(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto Min(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> int Count(const T &a, U c) {
return count(a.begin(), a.end(), c);
}
template <class T, class U> U Sum(const T &a, U init = 0) {
return accumulate(a.begin(), a.end(), init);
}
template <class T, class U> int Lower(const T &a, U s) {
return lower_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T, class U> int Upper(const T &a, U s) {
return upper_bound(a.begin(), a.end(), s) - a.begin();
}
template <class T> T Age(T a, T b) { return (a + b - 1) / b; }
template <class T> T Gcd(T n, T m) { return m == 0 ? n : Gcd(m, n % m); }
template <class T> T Lcm(T n, T m) { return n / Gcd(n, m) * m; }
/* INPUT */
template <class T> T InputF() { return 0; }
template <> char InputF() {
char ret = '\0', c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret = c;
c = getchar_unlocked();
}
return ret;
}
template <> string InputF() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n' && c != '\t' && c != ' ') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
template <> int InputF() {
int ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10 + (c - '0');
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> LL InputF() {
LL ret = 0;
bool neg = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
ret = ret * 10LL + (LL(c) - LL('0'));
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <> double InputF() {
double ret = 0, dp = 1;
bool neg = false, adp = false;
char c = getchar_unlocked();
if (c == '-') {
neg = true;
c = getchar_unlocked();
}
while (('0' <= c && c <= '9') || c == '.') {
if (c == '.') {
adp = true;
} else if (adp) {
dp *= 0.1;
ret += (c - '0') * dp;
} else {
ret = ret * 10.0 + (c - '0');
}
c = getchar_unlocked();
}
return neg ? -ret : ret;
}
template <class T> T StoT(string s) { return s; }
template <> char StoT(string s) { return s.front(); }
template <> string StoT(string s) { return s; }
template <> int StoT(string s) { return stoi(s); }
template <> LL StoT(string s) { return stoll(s); }
template <> double StoT(string s) { return stod(s); }
string GetLine() {
string ret;
char c = getchar_unlocked();
while (c != '\0' && c != '\n') {
ret.push_back(c);
c = getchar_unlocked();
}
return ret;
}
VS InputB;
template <class T> struct InputC {
operator T() { return InputF<T>(); }
vector<T> operator[](int h) {
vector<T> ret(h);
rep(i, h) ret[i] = InputF<T>();
return ret;
}
vector<vector<T>> operator[](PII p) {
int h, w;
tie(h, w) = p;
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = InputF<T>();
return ret;
}
T at(int n) {
while (sz(InputB) <= n)
InputB.pb(InputF<string>());
return StoT<T>(InputB[n]);
}
vector<T> at(int n, int h) {
vector<T> ret(h);
rep(i, h) ret[i] = at(i + n);
return ret;
}
vector<vector<T>> at(int n, int h, int w) {
vector<vector<T>> ret(h, vector<T>(w));
rep(i, h) rep(j, w) ret[i][j] = at(n + i * w + j);
return ret;
}
};
InputC<char> inc;
InputC<string> ins;
InputC<int> ini;
InputC<LL> inl;
InputC<double> ind;
/* OUTPUT */
class ostreamfbuff : public std::basic_streambuf<char, std::char_traits<char>> {
protected:
int overflow(int nCh = EOF) {
putchar_unlocked(nCh);
return 0;
}
};
class ostreamf : public std::basic_iostream<char, std::char_traits<char>> {
public:
ostreamf(void)
: std::basic_iostream<char, std::char_traits<char>>(new ostreamfbuff()) {}
};
ostreamf coutf;
ostream &operator<<(ostream &ostr, InputC<string> i) {
ostr << string(i);
return ostr;
}
struct BoolStr {
string t, f;
BoolStr(string tr, string fa) : t(tr), f(fa) {}
} yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct Divizer {
string s;
Divizer(string s_) : s(s_) {}
} spc(" "), nosp(""), comma(","), lin("\n");
struct Output {
bool flag = false;
BoolStr bs;
Divizer di;
Output(bool f, BoolStr b, Divizer d) : flag(f), bs(b), di(d) {}
template <class T> void print(T o) { coutf << o; }
void print(double o) { printf("%.20f", o); }
void print(bool o) { coutf << (o ? bs.t : bs.f); }
template <class T, class U> void print(const pair<T, U> &o) {
print(o.first);
coutf << di.s;
print(o.second);
}
template <class T> void print(const vector<T> &o) {
for (int i = 0; i < (int)o.size(); ++i) {
if (i != 0)
coutf << di.s;
print(o[i]);
}
}
template <class T, class U> void print(const map<T, U> &o) {
coutf << "Map";
for (auto a : o) {
coutf << " {";
print(a);
coutf << "},";
}
coutf << "\n";
}
template <class T> void print(const set<T> &o) {
coutf << "Set {";
for (auto a : o) {
print(a);
coutf << ",";
}
coutf << "}\n";
}
template <class T> Output operator,(T o) {
if (flag)
coutf << di.s;
print(o);
Output t(true, bs, di);
return t;
}
Output operator,(Output o) {
coutf << '\n';
return o;
}
Output operator,(BoolStr b) {
Output t(flag, b, di);
return t;
}
Output operator,(Divizer d) {
Output t(flag, bs, d);
return t;
}
} out(false, Yes, spc);
/* ANSWER */
struct Answer {
int mini = INT_MAX, maxi = INT_MIN, sumi = 0;
LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0;
double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0;
int cnt = 0;
void operator=(int n) {
mini = min(mini, n);
maxi = max(maxi, n);
sumi += n;
cnt++;
}
void operator=(LL n) {
minl = min(minl, n);
maxl = max(maxl, n);
suml += n;
cnt++;
}
void operator=(double n) {
mind = min(mind, n);
maxd = max(maxd, n);
sumd += n;
cnt++;
}
} ans;
void comb(VVL &v) {
for (int i = 0; i < sz(v); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
FOR(k, 1, sz(v))
FOR(j, 1, k) v[k][j] = (v[k - 1][j - 1] % MOD + v[k - 1][j] % MOD) % MOD;
}
int main() {
LL n = inl, k = inl;
VVL c(n + 5, VL(n + 5));
comb(c);
rep(i, k) { out, c[k - 1][i] * c[n - k + 1][i + 1] % MOD, out; }
} | [
"assignment.change"
] | 798,951 | 798,952 | u172873334 | cpp |
p02990 | #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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,958 | 798,959 | u613520453 | cpp |
p02990 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
// vector<vector<ll>> C(4000, vector<int> (4000,0));
ll C[4000][4000];
ll nCk(ll n, ll k) {
if (C[n][k] != 0)
return C[n][k];
if (n == k || k == 0)
return C[n][k] = 1;
else {
return C[n][k] = nCk(n - 1, k - 1) + nCk(n - 1, k);
}
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k + 1 < i || k < i) {
cout << 0 << endl;
continue;
} else {
cout << (nCk(k - 1, i - 1) % mod) * (nCk(n - k + 1, i) % mod) % mod
<< endl;
}
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
// vector<vector<ll>> C(4000, vector<int> (4000,0));
ll C[4000][4000];
ll nCk(ll n, ll k) {
if (C[n][k] != 0)
return C[n][k];
if (n == k || k == 0)
return C[n][k] = 1;
else {
return C[n][k] = nCk(n - 1, k - 1) % mod + nCk(n - 1, k) % mod;
}
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (n - k + 1 < i || k < i) {
cout << 0 << endl;
continue;
} else {
cout << (nCk(k - 1, i - 1) % mod) * (nCk(n - k + 1, i) % mod) % mod
<< endl;
}
}
return 0;
} | [
"assignment.change"
] | 798,964 | 798,965 | u534417782 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> fac;
vector<long long> ifac;
template <typename T> T modpow(T a, T n, T mod = MOD) { //(a^n)%MOD
T ret = 1;
while (n > 0) {
if ((n & 1) != 0) { // n%2==1
ret = ret * a % mod;
}
a = a * a % mod;
n = n / 2;
}
return ret;
}
template <typename T> T comb(T a, T b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
long long tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
fac.resize(3000);
ifac.resize(3000);
fac[0] = 1;
ifac[0] = 1;
for (long long i = 0; i < 3000; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
ifac[i + 1] = ifac[i] * modpow(i + 1, MOD - 2) % MOD;
}
int n, k;
cin >> n >> k;
long long b = k, r = n - k;
for (long long i = 1; i <= k; ++i) {
long long t = b - i;
long long ans = comb(r + 1, i);
ans = ans * modpow(t + 1, i - 1);
ans = ans % MOD;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> fac;
vector<long long> ifac;
template <typename T> T modpow(T a, T n, T mod = MOD) { //(a^n)%MOD
T ret = 1;
while (n > 0) {
if ((n & 1) != 0) { // n%2==1
ret = ret * a % mod;
}
a = a * a % mod;
n = n / 2;
}
return ret;
}
template <typename T> T comb(T a, T b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
long long tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
fac.resize(3000);
ifac.resize(3000);
fac[0] = 1;
ifac[0] = 1;
for (long long i = 0; i < 3000; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
ifac[i + 1] = ifac[i] * modpow(i + 1, MOD - 2) % MOD;
}
int n, k;
cin >> n >> k;
long long b = k, r = n - k;
for (long long i = 1; i <= k; ++i) {
long long t = b - i;
long long ans = comb(r + 1, i);
ans = ans * comb(t + i - 1, t);
ans = ans % MOD;
cout << ans << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 798,972 | 798,973 | u604693716 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long nCr[2020][2020];
const int mod = 1000000009;
long long f(int n, int r) {
if (nCr[n][r] != -1)
return nCr[n][r];
if (n == 0 && n == 1)
return nCr[n][r] = 1;
if (r == 0 || r == n)
return nCr[n][r] = 1;
else
return nCr[n][r] = (f(n - 1, r - 1) + f(n - 1, r)) % mod;
}
int main() {
memset(nCr, -1, sizeof nCr);
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
if (n - k - i + 1 < 0)
printf("0\n");
else {
printf("%d\n", (f(k - 1, i - 1) * f(n - k + 1, i)) % mod);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int n, k;
long long nCr[2020][2020];
const long long mod = 1000000007;
long long f(int n, int r) {
if (nCr[n][r] != -1)
return nCr[n][r];
if (n == 0 && n == 1)
return nCr[n][r] = 1;
if (r == 0 || r == n)
return nCr[n][r] = 1;
else
return nCr[n][r] = (f(n - 1, r - 1) + f(n - 1, r)) % mod;
}
int main() {
memset(nCr, -1, sizeof nCr);
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
if (n - k - i + 1 < 0)
printf("0\n");
else {
printf("%d\n", (f(k - 1, i - 1) * f(n - k + 1, i)) % mod);
}
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 798,976 | 798,977 | u076783581 | cpp |
p02990 | // atcoder/abc132/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename P, typename Q>
istream &operator>>(istream &is, pair<P, Q> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ",";
os << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(i, v) is >> i;
return is;
}
template <typename T> inline T setmax(T &a, T b) { return a = std::max(a, b); }
template <typename T> inline T setmin(T &a, T b) { return a = std::min(a, b); }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
const lli mod = 1e9 + 7;
const int N = 4000 + 5;
const int K = 4000 + 5;
static int nck[N][K];
fill(&nck[0][0], &nck[N - 1][K - 1] + 1, 0);
for (int i = 0; i < N; ++i) {
nck[i][0] = 1;
}
for (int n = 1; n < N; ++n) {
for (int k = 1; k < K; ++k) {
nck[n][k] = nck[n - 1][k - 1] + nck[n - 1][k];
nck[n][k] %= mod;
}
}
int n, k;
while (cin >> n >> k) {
for (int i = 0; i < k; ++i) {
lli x = nck[k - 1][i] * nck[(i + 1) + (n - k - i)][(i + 1)];
x %= mod;
cout << x << endl;
}
}
return 0;
}
| // atcoder/abc132/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename P, typename Q>
istream &operator>>(istream &is, pair<P, Q> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ",";
os << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(i, v) is >> i;
return is;
}
template <typename T> inline T setmax(T &a, T b) { return a = std::max(a, b); }
template <typename T> inline T setmin(T &a, T b) { return a = std::min(a, b); }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
const lli mod = 1e9 + 7;
const int N = 4000 + 5;
const int K = 4000 + 5;
static lli nck[N][K];
fill(&nck[0][0], &nck[N - 1][K - 1] + 1, 0);
for (int i = 0; i < N; ++i) {
nck[i][0] = 1;
}
for (int n = 1; n < N; ++n) {
for (int k = 1; k < K; ++k) {
nck[n][k] = nck[n - 1][k - 1] + nck[n - 1][k];
nck[n][k] %= mod;
}
}
int n, k;
while (cin >> n >> k) {
for (int i = 0; i < k; ++i) {
lli x = nck[k - 1][i] * nck[(i + 1) + (n - k - i)][(i + 1)];
x %= mod;
cout << x << endl;
}
}
return 0;
}
| [
"variable_declaration.type.change"
] | 798,978 | 798,979 | u768334187 | cpp |
p02990 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-12;
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(ld x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
inline ll mod(ll a, ll b) {
if (a > 0)
return a % b;
if (a % b == 0)
return 0;
ll x = -a / b + 1;
a += x * b;
return a % b;
}
ll powm(ll a, ll b, ll c) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll d = powm(a, b / 2, c);
return (d * d) % c;
} else
return (a * powm(a, b - 1, c)) % c;
}
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 dx[4] = {1, 0, -1, 0};
// ll dy[4] = {0, 1, 0, -1};
int main() {
IOS();
ll n, k;
cin >> n >> k;
ll l = n - k;
vector<ll> fact(4002), facti(4002);
fact[0] = facti[0] = 1;
for (int i = 1; i <= 4000; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
facti[i] = powm(fact[i], MOD - 2, MOD);
}
for (int i = 1; i <= k; i++) {
if (l < i - 1) {
dump(0);
continue;
}
ll ans = (((fact[k - 1] * facti[i - 1]) % MOD) * facti[k - i]) % MOD;
ans *= (((fact[l + 1] * facti[l - i + 1]) % MOD) * facti[i]) % MOD;
dump(ans);
}
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-12;
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(ld x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
inline ll mod(ll a, ll b) {
if (a > 0)
return a % b;
if (a % b == 0)
return 0;
ll x = -a / b + 1;
a += x * b;
return a % b;
}
ll powm(ll a, ll b, ll c) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll d = powm(a, b / 2, c);
return (d * d) % c;
} else
return (a * powm(a, b - 1, c)) % c;
}
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 dx[4] = {1, 0, -1, 0};
// ll dy[4] = {0, 1, 0, -1};
int main() {
IOS();
ll n, k;
cin >> n >> k;
ll l = n - k;
vector<ll> fact(4002), facti(4002);
fact[0] = facti[0] = 1;
for (int i = 1; i <= 4000; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
facti[i] = powm(fact[i], MOD - 2, MOD);
}
for (int i = 1; i <= k; i++) {
if (l < i - 1) {
dump(0);
continue;
}
ll ans = (((fact[k - 1] * facti[i - 1]) % MOD) * facti[k - i]) % MOD;
ans *= (((fact[l + 1] * facti[l - i + 1]) % MOD) * facti[i]) % MOD;
ans %= MOD;
dump(ans);
}
return 0;
}
| [
"assignment.add"
] | 798,986 | 798,987 | u872959410 | cpp |
p02990 | /* **
** SMIT MANGUKIYA
** DA-IICT(201801191)
**
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL))
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define el endl
#define INF LONG_LONG_MAX
#define MINF LONG_LONG_MIN
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define RFOR(i, a, b) for (ll i = a; i > b; i--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) (a * b) / gcd(a, b)
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
ll b_power(ll a, ll b); // a^b
ll min_div(ll n); // minimum divisor from 2 to ....n
int is_prime(ll n); // is prime!
ll ncr(ll n, ll c); // ncr(combination)
int solve[2001][2001];
void pre() {
int i, j;
for (i = 0; i < 2001; i++) {
solve[i][0] = 1;
solve[i][i] = 1;
}
for (i = 1; i < 2001; i++)
for (j = 1; j < 2001; j++)
if (i != j)
solve[i][j] = (solve[i - 1][j] % MOD + solve[i - 1][j - 1] % MOD) % MOD;
}
// ---------------------------------------------------------------------------------------------------
int main() {
FAST;
pre();
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll temp = ncr(n - k + 1, i);
int g = k - i;
ll temp2 = solve[g + i - 1][i - 1] % MOD;
ll ans = (temp * temp2) % MOD;
cout << ans << "\n";
}
}
// ---------------------------------------------------------------------------------------------------
ll b_power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll min_div(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
return i;
}
}
return n;
}
int is_prime(ll n) {
if (n == 2)
return 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
ll ncr(ll n, ll c) {
ll t = 1;
c = min(c, n - c);
for (ll i = 1; i <= c; i++)
t = ((t * (n - i + 1)) / i) % MOD;
return t;
}
| /* **
** SMIT MANGUKIYA
** DA-IICT(201801191)
**
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL))
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define el endl
#define INF LONG_LONG_MAX
#define MINF LONG_LONG_MIN
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define RFOR(i, a, b) for (ll i = a; i > b; i--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) (a * b) / gcd(a, b)
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
ll b_power(ll a, ll b); // a^b
ll min_div(ll n); // minimum divisor from 2 to ....n
int is_prime(ll n); // is prime!
ll ncr(ll n, ll c); // ncr(combination)
int solve[2001][2001];
void pre() {
int i, j;
for (i = 0; i < 2001; i++) {
solve[i][0] = 1;
solve[i][i] = 1;
}
for (i = 1; i < 2001; i++)
for (j = 1; j < 2001; j++)
if (i != j)
solve[i][j] = (solve[i - 1][j] % MOD + solve[i - 1][j - 1] % MOD) % MOD;
}
// ---------------------------------------------------------------------------------------------------
int main() {
FAST;
pre();
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= k; i++) {
ll temp = solve[n - k + 1][i];
int g = k - i;
ll temp2 = solve[g + i - 1][i - 1] % MOD;
ll ans = (temp * temp2) % MOD;
cout << ans << "\n";
}
}
// ---------------------------------------------------------------------------------------------------
ll b_power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll min_div(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
return i;
}
}
return n;
}
int is_prime(ll n) {
if (n == 2)
return 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
ll ncr(ll n, ll c) {
ll t = 1;
c = min(c, n - c);
for (ll i = 1; i <= c; i++)
t = ((t * (n - i + 1)) / i) % MOD;
return t;
}
| [
"call.arguments.change"
] | 798,988 | 798,989 | u670919462 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
ll inf = 1e9 + 7;
ll fact[200010] = {0};
ll inv[200010] = {0};
ll mult(ll n, ll m) {
if (m == 0)
return 1;
if (m == 1)
return n % inf;
else if (m % 2 == 0) {
ll t = mult(n, m / 2);
return (t * t) % inf;
} else {
ll t = mult(n, m - 1);
return (t * n) % inf;
}
}
void factorial(ll N) {
for (ll i = 0; i <= N; i++) {
if (i == 0) {
fact[i] = 1;
inv[i] = 1;
} else {
fact[i] = (i * fact[i - 1]) % inf;
inv[i] = mult(fact[i], inf - 2);
}
}
}
ll comb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
else
return (((fact[n] * inv[k]) % inf) * inv[n - k]) % inf;
}
ll hcomb(ll n, ll k) {
if (n == 0 && k == 0)
return 1;
return comb(n + k - 1, k);
}
int main() {
int N, K;
cin >> N >> K;
factorial(N);
for (int i = 1; i <= K; i++) {
// if(i%2==0){
cout << comb(N - K + 1, i) % inf * mult(i, K - i) % inf << endl;
/* }else{
cout <<
(comb(N-K+1,i+1)*mult(K-i-1,i+2)%inf+comb(N-K+1,i+3)*mult(K-i-3,i+3)%inf)%inf
<< endl;
}
}*/
}
} | #include <iostream>
using namespace std;
typedef long long ll;
ll inf = 1e9 + 7;
ll fact[200010] = {0};
ll inv[200010] = {0};
ll mult(ll n, ll m) {
if (m == 0)
return 1;
if (m == 1)
return n % inf;
else if (m % 2 == 0) {
ll t = mult(n, m / 2);
return (t * t) % inf;
} else {
ll t = mult(n, m - 1);
return (t * n) % inf;
}
}
void factorial(ll N) {
for (ll i = 0; i <= N; i++) {
if (i == 0) {
fact[i] = 1;
inv[i] = 1;
} else {
fact[i] = (i * fact[i - 1]) % inf;
inv[i] = mult(fact[i], inf - 2);
}
}
}
ll comb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
else
return (((fact[n] * inv[k]) % inf) * inv[n - k]) % inf;
}
ll hcomb(ll n, ll k) {
if (n == 0 && k == 0)
return 1;
return comb(n + k - 1, k);
}
int main() {
ll N, K;
cin >> N >> K;
factorial(N + K);
for (ll i = 1; i <= K; i++) {
cout << comb(N - K + 1, i) % inf * hcomb(i, K - i) % inf << endl;
}
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 798,994 | 798,995 | u623954643 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#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) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll _n) : num((_n + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
int main() {
ll N, K;
cin >> N >> K;
rep1(i, K + 1) {
/* cerr<<comb(K-1,i-1)<<endl;
cerr<<comb(N-K+1,i)<<endl;*/
ll ans = 1;
ans *= C(K - 1, i - 1) % MOD;
ans *= C(N - K + 1, i) % MOD;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#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) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9 + 7;
const int INF = 1e9;
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll _n) : num((_n + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
int main() {
ll N, K;
cin >> N >> K;
rep1(i, K + 1) {
/* cerr<<comb(K-1,i-1)<<endl;
cerr<<comb(N-K+1,i)<<endl;*/
ll ans = 1;
ans *= C(K - 1, i - 1) % MOD;
ans *= C(N - K + 1, i) % MOD;
ans %= MOD;
cout << ans << endl;
}
} | [
"assignment.add"
] | 799,004 | 799,005 | u106297876 | cpp |
p02990 | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
const int N = 2e3 + 5;
int c[N][N];
void calc() {
for (int n = 0; n < N; ++n) {
c[n][0] = c[n][n] = 1;
for (int k = 1; k < n; ++k)
c[n][k] = (c[n - 1][k - 1] + c[n - 1][k]) % MOD;
}
}
int main() {
int n, k;
cin >> n >> k;
calc();
for (int i = 1; i <= k; ++i)
cout << (c[n - k + 1][i] * c[k - 1][i - 1]) % MOD << '\n';
return 0;
}
| // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
const int N = 2e3 + 5;
int c[N][N];
void calc() {
for (int n = 0; n < N; ++n) {
c[n][0] = c[n][n] = 1;
for (int k = 1; k < n; ++k)
c[n][k] = (c[n - 1][k - 1] + c[n - 1][k]) % MOD;
}
}
int main() {
int n, k;
cin >> n >> k;
calc();
for (int i = 1; i <= k; ++i)
cout << (1LL * c[n - k + 1][i] * c[k - 1][i - 1]) % MOD << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 799,010 | 799,011 | u518468154 | cpp |
p02990 | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T &var_min(const T &t) { return t; }
template <typename T> const T &var_max(const T &t) { return t; }
template <typename T, typename... Tail>
const T &var_min(const T &t, const Tail &...tail) {
return min(t, var_min(tail...));
}
template <typename T, typename... Tail>
const T &var_max(const T &t, const Tail &...tail) {
return max(t, var_max(tail...));
}
template <typename T, typename... Tail> void chmin(T &t, const Tail &...tail) {
t = var_min(t, tail...);
}
template <typename T, typename... Tail> void chmax(T &t, const Tail &...tail) {
t = var_max(t, tail...);
}
template <typename T> const T &clamp(const T &t, const T &low, const T &high) {
return max(low, min(high, t));
}
template <typename T> void chclamp(T &t, const T &low, const T &high) {
t = clamp(t, low, high);
}
namespace init__ {
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
} // namespace init__
#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
return V<decltype(rec)>(s, rec);
#undef rec
}
template <ll MOD> class Combination {
private:
template <typename T> using V = vector<ll>;
ll N;
V<ll> factv, rfactv;
public:
/*
* MOD must be a prime number.
*/
Combination<MOD>(ll N) : N(N), factv(N + 1, 1), rfactv(N + 1) {
for (ll i = 1; i <= N; i++) {
factv[i] = factv[i - 1] * i % MOD;
}
for (ll i = 0; i <= N; i++) {
rfactv[i] = pow(factv[i], MOD - 2);
}
}
ll fact(ll n) { return factv[n]; }
ll rfact(ll n) { return rfactv[n]; }
ll pow(ll a, ll b) {
return b ? (b & 1 ? a : 1) * pow(a * a % MOD, b / 2) % MOD : 1;
}
ll comb(ll n, ll k) {
return factv[n] * rfactv[n - k] % MOD * rfactv[k] % MOD;
}
};
const ll mod = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
Combination<mod> comb(1e5);
for (ll i = 1; i <= K; i++) {
ll split = N - K + 1;
if (split < i) {
cout << 0 << endl;
continue;
}
ll line = i - 1;
ll rest = K - (line + 1);
ll ans = comb.pow(line + 1, rest);
(ans *= comb.comb(N - K + 1, line + 1)) %= mod;
cout << ans << endl;
}
return 0;
}
| // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T &var_min(const T &t) { return t; }
template <typename T> const T &var_max(const T &t) { return t; }
template <typename T, typename... Tail>
const T &var_min(const T &t, const Tail &...tail) {
return min(t, var_min(tail...));
}
template <typename T, typename... Tail>
const T &var_max(const T &t, const Tail &...tail) {
return max(t, var_max(tail...));
}
template <typename T, typename... Tail> void chmin(T &t, const Tail &...tail) {
t = var_min(t, tail...);
}
template <typename T, typename... Tail> void chmax(T &t, const Tail &...tail) {
t = var_max(t, tail...);
}
template <typename T> const T &clamp(const T &t, const T &low, const T &high) {
return max(low, min(high, t));
}
template <typename T> void chclamp(T &t, const T &low, const T &high) {
t = clamp(t, low, high);
}
namespace init__ {
struct InitIO {
InitIO() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
} // namespace init__
#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
return V<decltype(rec)>(s, rec);
#undef rec
}
template <ll MOD> class Combination {
private:
template <typename T> using V = vector<ll>;
ll N;
V<ll> factv, rfactv;
public:
/*
* MOD must be a prime number.
*/
Combination<MOD>(ll N) : N(N), factv(N + 1, 1), rfactv(N + 1) {
for (ll i = 1; i <= N; i++) {
factv[i] = factv[i - 1] * i % MOD;
}
for (ll i = 0; i <= N; i++) {
rfactv[i] = pow(factv[i], MOD - 2);
}
}
ll fact(ll n) { return factv[n]; }
ll rfact(ll n) { return rfactv[n]; }
ll pow(ll a, ll b) {
return b ? (b & 1 ? a : 1) * pow(a * a % MOD, b / 2) % MOD : 1;
}
ll comb(ll n, ll k) {
return factv[n] * rfactv[n - k] % MOD * rfactv[k] % MOD;
}
};
const ll mod = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
Combination<mod> comb(1e5);
for (ll i = 1; i <= K; i++) {
ll split = N - K + 1;
if (split < i) {
cout << 0 << endl;
continue;
}
ll line = i - 1;
ll rest = K - (line + 1);
ll ans = comb.comb(line + rest, rest);
(ans *= comb.comb(N - K + 1, line + 1)) %= mod;
cout << ans << endl;
}
return 0;
}
| [
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 799,012 | 799,013 | u216962796 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define REP(var, a, b) for (int var = (a); var < (b); var++)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define ALL(c) (c).begin(), (c).end()
#define rALL(c) (c).rbegin(), (c).rend()
ll MOD = 1000000007;
ll comb[3000 + 1][3000 + 1];
void init() {
comb[0][0] = 1;
comb[1][0] = 1;
comb[1][1] = 1;
rep(i, 2001) {
rep(j, i + 1) {
if (j == 0 || i == j) {
comb[i][j] = 1;
} else {
comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
}
}
}
}
int main() {
//
init();
int n, k;
cin >> n >> k;
REP(i, 1, k + 1) {
ll ans = comb[k - 1][i - 1] * comb[n - k + 1][i] % MOD;
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define REP(var, a, b) for (int var = (a); var < (b); var++)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define ALL(c) (c).begin(), (c).end()
#define rALL(c) (c).rbegin(), (c).rend()
ll MOD = 1000000007;
ll comb[3000 + 1][3000 + 1];
void init() {
comb[0][0] = 1;
comb[1][0] = 1;
comb[1][1] = 1;
rep(i, 2001) {
rep(j, i + 1) {
if (j == 0 || i == j) {
comb[i][j] = 1;
} else {
comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
}
}
}
}
int main() {
//
init();
int n, k;
cin >> n >> k;
REP(i, 1, k + 1) {
ll ans = comb[k - 1][i - 1] * comb[n - k + 1][i] % MOD;
cout << ans << endl;
}
return 0;
}
| [
"assignment.change"
] | 799,014 | 799,015 | u194385557 | cpp |
p02990 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
using namespace std;
int MOD = 1000000007;
ll bitpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
int N = 2005;
int fac[2011];
int inv[2011];
ll COM(ll n, ll k) { return fac[n] * inv[k] % MOD * inv[n - k] % MOD; }
signed main() {
fac[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = bitpow(fac[i], MOD - 2) % MOD;
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (i - 1 > n - k || i > k)
cout << 0 << endl;
cout << COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD << endl;
}
return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl
// https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a rm -r -f
// test;oj dl http://abc132.contest.atcoder.jp/tasks/abc132_b | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
using namespace std;
int MOD = 1000000007;
ll bitpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
int N = 2005;
int fac[2011];
int inv[2011];
ll COM(ll n, ll k) { return fac[n] * inv[k] % MOD * inv[n - k] % MOD; }
signed main() {
fac[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = bitpow(fac[i], MOD - 2) % MOD;
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
if (i - 1 > n - k || i > k) {
cout << 0 << endl;
} else
cout << COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD << endl;
}
return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl
// https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a rm -r -f
// test;oj dl http://abc132.contest.atcoder.jp/tasks/abc132_b | [
"control_flow.branch.else.add"
] | 799,016 | 799,017 | u548768105 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
ll modpow(ll a, ll p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll halfp = p / 2;
ll half = modpow(a, halfp);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
ll calcComb(ll a, ll b) {
if (b < 0) {
return 0;
}
if (a <= 0) {
return 0;
}
if (a < b) {
return 0;
}
if (b > a - b) {
return calcComb(a, a - b);
}
ll ansMul = 1;
ll ansDiv = 1;
REP(i, b) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= MOD;
ansDiv %= MOD;
}
ll ans = ansMul * modpow(ansDiv, MOD - 2);
ans %= MOD;
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; i++) {
long long res = calcComb(red + 1, i) * calcComb(k - 1, i - 1) % MOD;
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
ll modpow(ll a, ll p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll halfp = p / 2;
ll half = modpow(a, halfp);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
ll calcComb(ll a, ll b) {
if (b < 0) {
return 0;
}
if (a < 0) {
return 0;
}
if (a < b) {
return 0;
}
if (b > a - b) {
return calcComb(a, a - b);
}
ll ansMul = 1;
ll ansDiv = 1;
REP(i, b) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= MOD;
ansDiv %= MOD;
}
ll ans = ansMul * modpow(ansDiv, MOD - 2);
ans %= MOD;
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; i++) {
long long res = calcComb(red + 1, i) * calcComb(k - 1, i - 1) % MOD;
cout << res << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,018 | 799,019 | u824337972 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
ll modpow(ll a, ll p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll halfp = p / 2;
ll half = modpow(a, halfp);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
ll calcComb(ll a, ll b) {
if (b <= 0) {
return 0;
}
if (a <= 0) {
return 0;
}
if (a < b) {
return 0;
}
if (b > a - b) {
return calcComb(a, a - b);
}
ll ansMul = 1;
ll ansDiv = 1;
REP(i, b) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= MOD;
ansDiv %= MOD;
}
ll ans = ansMul * modpow(ansDiv, MOD - 2);
ans %= MOD;
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; i++) {
long long res = calcComb(red + 1, i) * calcComb(k - 1, i - 1) % MOD;
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
ll modpow(ll a, ll p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll halfp = p / 2;
ll half = modpow(a, halfp);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
ll calcComb(ll a, ll b) {
if (b < 0) {
return 0;
}
if (a < 0) {
return 0;
}
if (a < b) {
return 0;
}
if (b > a - b) {
return calcComb(a, a - b);
}
ll ansMul = 1;
ll ansDiv = 1;
REP(i, b) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= MOD;
ansDiv %= MOD;
}
ll ans = ansMul * modpow(ansDiv, MOD - 2);
ans %= MOD;
return ans;
}
int main() {
int n, k;
cin >> n >> k;
int red = n - k;
for (int i = 1; i <= k; i++) {
long long res = calcComb(red + 1, i) * calcComb(k - 1, i - 1) % MOD;
cout << res << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,020 | 799,019 | u824337972 | cpp |
p02990 | #include <iostream>
using namespace std;
long long ruijou(long long a, long long b) {
long long c, mod;
mod = 1e9 + 7;
if (b == 1) {
return a;
} else {
c = ruijou(a, b / 2);
c = (c * c) % mod;
if (b % 2 == 1) {
c = (c * a) % mod;
}
return c;
}
}
int main(void) {
long long N, K, i, a, mod, r;
mod = 1e9 + 7;
cin >> N >> K;
a = N - K + 1;
for (i = 1; i < K + 1; i++) {
cout << a << endl;
r = ruijou((i + 1) * i, mod - 2);
a = (a * (N - K + 1 - i) * (K - i) * r) % mod;
}
} | #include <iostream>
using namespace std;
long long ruijou(long long a, long long b) {
long long c, mod;
mod = 1e9 + 7;
if (b == 1) {
return a;
} else {
c = ruijou(a, b / 2);
c = (c * c) % mod;
if (b % 2 == 1) {
c = (c * a) % mod;
}
return c;
}
}
int main(void) {
long long N, K, i, a, mod, r;
mod = 1e9 + 7;
cin >> N >> K;
a = N - K + 1;
for (i = 1; i < K + 1; i++) {
cout << a << endl;
r = ruijou((i + 1) * i, mod - 2);
a = ((a * (N - K + 1 - i) * (K - i)) % mod * r) % mod;
}
}
| [
"assignment.change"
] | 799,021 | 799,022 | u965103758 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
#define N 2005
#define Mod 1000000007
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
int n, k, f[N];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
int calc(int n, int m) {
if (n < m)
return 1;
return f[n] * Pow(f[m], Mod - 2) % Mod * Pow(f[n - m], Mod - 2) % Mod;
}
signed main() {
scanf("%lld%lld", &n, &k), f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = f[i - 1] * i % Mod;
for (int i = 1; i <= k; i++)
printf("%lld\n", calc(k - 1, i - 1) * calc(n - k + 1, i) % Mod);
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define N 2005
#define Mod 1000000007
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
int n, k, f[N];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
int calc(int n, int m) {
if (n < m)
return 0;
return f[n] * Pow(f[m], Mod - 2) % Mod * Pow(f[n - m], Mod - 2) % Mod;
}
signed main() {
scanf("%lld%lld", &n, &k), f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = f[i - 1] * i % Mod;
for (int i = 1; i <= k; i++)
printf("%lld\n", calc(k - 1, i - 1) * calc(n - k + 1, i) % Mod);
return 0;
}
| [
"literal.number.change",
"function.return_value.change"
] | 799,025 | 799,026 | u928673524 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.