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 |
|---|---|---|---|---|---|---|---|
p02986 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <vector>
using namespace std;
const int N = 100'009;
int ct;
vector<tuple<int, int, int>> g[N];
int pa[N];
int tin[N];
int tout[N];
void dfs1(int x) {
tin[x] = ct++;
for (auto &e : g[x]) {
int y = get<0>(e);
if (y != pa[x]... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <vector>
using namespace std;
const int N = 100'009;
int ct;
vector<tuple<int, int, int>> g[N];
int pa[N];
int tin[N];
int tout[N];
void dfs1(int x) {
tin[x] = ct++;
for (auto &e : g[x]) {
int y = get<0>(e);
if (y != pa[x]... | [
"assignment.change"
] | 798,108 | 798,109 | u127130661 | cpp |
p02986 | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof a)
#define rep(i, a, b) for (int i(a), i##_END_(b); i <= i##_END_; i++)
#define drep(i, a, b) for (int i(a), i##_END_(b); i >= i##_END_; i--)
using namespace std;
template <class T> inline bool tomax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <cl... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof a)
#define rep(i, a, b) for (int i(a), i##_END_(b); i <= i##_END_; i++)
#define drep(i, a, b) for (int i(a), i##_END_(b); i >= i##_END_; i--)
using namespace std;
template <class T> inline bool tomax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <cl... | [
"assignment.change"
] | 798,125 | 798,126 | u226153407 | cpp |
p02986 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 798,131 | 798,132 | u834777932 | cpp |
p02986 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"identifier.change"
] | 798,133 | 798,134 | u930898631 | cpp |
p02987 | #include <stdio.h>
char a[5];
int main() {
while (scanf("%s", &a) != EOF) {
int t = 0, y = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
if (a[i] == a[j])
t++;
if (a[i] != a[j])
y++;
}
}
if (y != 0 && t == 2)
printf("YES\n");
... | #include <stdio.h>
char a[5];
int main() {
while (scanf("%s", &a) != EOF) {
int t = 0, y = 0;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
if (a[i] == a[j])
t++;
if (a[i] != a[j])
y++;
}
}
if (y != 0 && t == 2)
printf("Yes\n");
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 798,155 | 798,156 | u863370423 | cpp |
p02987 | #include <bits/stdc++.h>
#define LL long long
#define PB push_back
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (count(s.begin(), s.end(), s[i]) != 2) {
cout << "N0";
return 0;
}
}
cout << "Yes";
} | #include <bits/stdc++.h>
#define LL long long
#define PB push_back
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (count(s.begin(), s.end(), s[i]) != 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"literal.string.change",
"io.output.change"
] | 798,157 | 798,158 | u018679195 | cpp |
p02987 | #include <bits/stdc++.h> //abc177-C
using namespace std;
int main() {
string s;
cin >> s;
if ((s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ||
(s[0] == s[2] || s[1] == s[3] && s[0] != s[1]) ||
(s[0] == s[3] && s[1] == s[2] && s[0] != s[1])) {
cout << "Yes" << endl;
} else {
cout << "No" <<... | #include <bits/stdc++.h> //abc177-C
using namespace std;
int main() {
string s;
cin >> s;
if ((s[0] == s[1] && s[2] == s[3] && s[0] != s[2]) ||
(s[0] == s[2] && s[1] == s[3] && s[0] != s[1]) ||
(s[0] == s[3] && s[1] == s[2] && s[0] != s[1])) {
cout << "Yes" << endl;
} else {
cout << "No" <<... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 798,161 | 798,162 | u334623794 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,177 | 798,178 | u786793781 | cpp |
p02990 | #include <cstdio>
template <int N, typename T, T M> struct factorial_mod {
T mod[N + 1];
T inv_mod[N + 1];
constexpr factorial_mod() : mod(), inv_mod() {
mod[0] = 1;
for (int i = 0; i < N; ++i) {
mod[i + 1] = (mod[i] * (i + 1)) % M;
}
inv_mod[N] = power(mod[N], M - 2);
for (int i = N -... | #include <cstdio>
template <int N, typename T, T M> struct factorial_mod {
T mod[N + 1];
T inv_mod[N + 1];
constexpr factorial_mod() : mod(), inv_mod() {
mod[0] = 1;
for (int i = 0; i < N; ++i) {
mod[i + 1] = (mod[i] * (i + 1)) % M;
}
inv_mod[N] = power(mod[N], M - 2);
for (int i = N -... | [
"expression.operation.binary.add"
] | 798,179 | 798,180 | u931819817 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<vector<ll>> com(ll n, ll r) {
const long long _MOD = 1000000007;
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
ll tmp = v.size();
for (int i = 0; i < tmp; i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; ... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<vector<ll>> com(ll n, ll r) {
const long long _MOD = 1000000007;
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
ll tmp = v.size();
for (int i = 0; i < tmp; i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,181 | 798,182 | u432088501 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
vector<char> s;
string S;
s... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
vector<char> s;
string S;
s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,191 | 798,192 | u786283792 | cpp |
p02990 | #include <bits/stdc++.h> // ver2.1.7
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | #include <bits/stdc++.h> // ver2.1.7
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | [
"expression.operation.binary.add"
] | 798,197 | 798,198 | u095453583 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int dp[2001][2001];
int mod = 1000000007;
int nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int dp[2001][2001];
int mod = 1000000007;
int nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 798,199 | 798,200 | u915797797 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 132
// mod. m �ł� a �̋t�� a^{-1} ���v�Z����
LL modinv(LL a, LL m) {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 132
// mod. m �ł� a �̋t�� a^{-1} ���v�Z����
LL modinv(LL a, LL m) {
... | [] | 798,201 | 798,202 | u572472538 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, red;
long long const mod = 1e9 + 7;
vector<vector<long long>> comb;
cin >> n >> k;
red = n - k;
comb.assign(n * 2, vector<long long>());
for (int i = 0; i < n * 2; i++) {
comb[i].assign(i + 1, 0);
comb[i][0] = comb[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, red;
long long const mod = 1e9 + 7;
vector<vector<long long>> comb;
cin >> n >> k;
red = n - k;
comb.assign(n * 2, vector<long long>());
for (int i = 0; i < n * 2; i++) {
comb[i].assign(i + 1, 0);
comb[i][0] = comb[... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 798,205 | 798,206 | u024809932 | cpp |
p02990 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"assignment.change"
] | 798,209 | 798,210 | u941028483 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, v) \
VL v(n); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, v) \
VL v(n); ... | [
"call.arguments.change",
"call.arguments.add"
] | 798,227 | 798,228 | u423624748 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
const int MAX_N = 4001;
const int mod = 1000000007;
ll fact[MAX_N + 1];
ll inv[MAX_N + 1], finv[MAX_N + 1];
int in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
const int MAX_N = 4001;
const int mod = 1000000007;
ll fact[MAX_N + 1];
ll inv[MAX_N + 1], finv[MAX_N + 1];
int in... | [
"expression.operation.binary.add"
] | 798,237 | 798,238 | u526367939 | cpp |
p02990 | #include <bits/stdc++.h>
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 ... | #include <bits/stdc++.h>
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 ... | [
"expression.operation.binary.add"
] | 798,239 | 798,240 | u108540384 | cpp |
p02990 | #include <bits/stdc++.h>
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 ... | #include <bits/stdc++.h>
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 ... | [
"expression.operation.binary.add"
] | 798,239 | 798,241 | u108540384 | cpp |
p02990 | #include <bits/stdc++.h>
#define maxn 2005
using namespace std;
typedef long long ll;
ll inv[maxn], F[maxn], Finv[maxn];
ll mod = 1e9 + 7;
void init() {
inv[1] = 1;
for (int i = 2; i < maxn; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
F[0] = 1;
Finv[0] = 1;
for (int i = 1; i <= maxn; i++) {
... | #include <bits/stdc++.h>
#define maxn 2005
using namespace std;
typedef long long ll;
ll inv[maxn], F[maxn], Finv[maxn];
ll mod = 1e9 + 7;
void init() {
inv[1] = 1;
for (int i = 2; i < maxn; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
F[0] = 1;
Finv[0] = 1;
for (int i = 1; i <= maxn; i++) {
... | [
"literal.number.change",
"function.return_value.change"
] | 798,244 | 798,245 | u907481435 | cpp |
p02990 | #include <iostream>
using namespace std;
long long MOD = 1e9 + 7;
long long N, K;
long long C[2001][2001];
long long comb(long long a, long long b) {
if (b == 0) {
return C[a][b] = 1;
}
if (a == b) {
return C[a][b] = 1;
}
if (C[a][b] != -1)
return C[a][b];
return C[a][b] = (comb(a - 1, b - 1... | #include <iostream>
using namespace std;
long long MOD = 1e9 + 7;
long long N, K;
long long C[2001][2001];
long long comb(long long a, long long b) {
if (b == 0) {
return C[a][b] = 1;
}
if (a == b) {
return C[a][b] = 1;
}
if (C[a][b] != -1)
return C[a][b];
return C[a][b] = (comb(a - 1, b - 1... | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 798,248 | 798,249 | u705230587 | cpp |
p02990 | // ABC 132 D Blue and Red Balls
#include <iostream>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
int dp[2001][2001];
int main() {
int N, K;
cin >> N >> K;
dp[0][0] = 1;
for (int i = 1; i < 2001; i++) {
for (int j = 0; j <= i; j++) {
if (i == j || j == 0)
dp[i][j] = 1;
... | // ABC 132 D Blue and Red Balls
#include <iostream>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
int dp[2001][2001];
int main() {
int N, K;
cin >> N >> K;
dp[0][0] = 1;
for (int i = 1; i < 2001; i++) {
for (int j = 0; j <= i; j++) {
if (i == j || j == 0)
dp[i][j] = 1;
... | [
"type_conversion.add"
] | 798,250 | 798,251 | u069877747 | cpp |
p02990 | // ABC 132 D Blue and Red Balls
#include <iostream>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
int dp[2001][2001];
int main() {
int N, K;
cin >> N >> K;
dp[0][0] = 1;
for (int i = 1; i < 2001; i++) {
for (int j = 0; j <= i; j++) {
if (i == j || j == 0)
dp[i][j] = 1;
... | // ABC 132 D Blue and Red Balls
#include <iostream>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
int dp[2001][2001];
int main() {
int N, K;
cin >> N >> K;
dp[0][0] = 1;
for (int i = 1; i < 2001; i++) {
for (int j = 0; j <= i; j++) {
if (i == j || j == 0)
dp[i][j] = 1;
... | [
"type_conversion.add"
] | 798,252 | 798,253 | u069877747 | cpp |
p02990 | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define ford(i, n) for (int i = n - 1; i >=... | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define ford(i, n) for (int i = n - 1; i >=... | [
"variable_declaration.type.change"
] | 798,258 | 798,259 | u930706982 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
#define all(x) (x).beg... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 798,267 | 798,268 | u593555034 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
#define all(x) (x).beg... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 798,269 | 798,268 | u593555034 | cpp |
p02990 |
#include <bits/stdc++.h>
#define mem(ar, num) memset(ar, num, sizeof(ar))
#define me(ar) memset(ar, 0, sizeof(ar))
#define lowbit(x) (x & (-x))
#define Pb push_back
#define FI first
#define SE second
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define IOS ios:... |
#include <bits/stdc++.h>
#define mem(ar, num) memset(ar, num, sizeof(ar))
#define me(ar) memset(ar, 0, sizeof(ar))
#define lowbit(x) (x & (-x))
#define Pb push_back
#define FI first
#define SE second
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define IOS ios:... | [
"expression.operation.binary.add"
] | 798,270 | 798,271 | u592068888 | cpp |
p02990 | #include <iostream>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(v) \
if (scanf("%d", &v) < 1) \
;
con... | #include <iostream>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(v) \
if (scanf("%d", &v) < 1) \
;
con... | [
"call.arguments.change"
] | 798,276 | 798,277 | u025592199 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int fact[10004];
inline int mul(int a, int b) {
long long ret = 1ll * a * b;
return ret % mod;
}
inline int power(int a, int p) {
if (p == 0)
return 1;
int ret = power(a, p / 2);
ret = mul(ret, ret);
if (p % 2)
ret = mul(re... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int fact[10004];
inline int mul(int a, int b) {
long long ret = 1ll * a * b;
return ret % mod;
}
inline int power(int a, int p) {
if (p == 0)
return 1;
int ret = power(a, p / 2);
ret = mul(ret, ret);
if (p % 2)
ret = mul(re... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 798,280 | 798,281 | u541786453 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N = 2005, mod = 1000000007;
int c[2005][2005];
int main() {
// cout << "hell0" << endl;
int n, k;
c[0][0] = 1;
for (int i = 1; i < 2005; i++) {
for (int j = 0; j <= i; j++) {
if (j == i or j == 0)
c[i][j] = 1;
el... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N = 2005, mod = 1000000007;
int c[2005][2005];
int main() {
// cout << "hell0" << endl;
int n, k;
c[0][0] = 1;
for (int i = 1; i < 2005; i++) {
for (int j = 0; j <= i; j++) {
if (j == i or j == 0)
c[i][j] = 1;
el... | [
"assignment.change"
] | 798,282 | 798,283 | u708590262 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int64_t mod = 1E9 + 7;
vector<vector<int64_t>> cont(n + 1, vector<int64_t>(n + 1));
cont.at(1).at(1) = 1;
for (int i = 1; i < n; i++) {
cont.at(i).at(0) = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int64_t mod = 1E9 + 7;
vector<vector<int64_t>> cont(n + 1, vector<int64_t>(n + 1));
cont.at(1).at(1) = 1;
for (int i = 0; i <= n; i++) {
cont.at(i).at(0) = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change"
] | 798,288 | 798,287 | u408053928 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1... | [
"literal.number.change",
"io.output.change"
] | 798,291 | 798,292 | u277153875 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int infI = 1e9 + 5;
const long long infL = 1e18;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define iii pair<ii, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<l... | #include <bits/stdc++.h>
using namespace std;
const int infI = 1e9 + 5;
const long long infL = 1e18;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
#define mp make_pair
#define pb push_back
#define ii pair<int, int>
#define iii pair<ii, int>
#define ll long long
#define pll pair<ll, ll>
#define vl vector<vector<l... | [
"variable_declaration.type.change"
] | 798,303 | 798,304 | u416354178 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll C[2100][2100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j] + C[i - 1][j - 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll C[2100][2100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j] + C[i - 1][j - ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 798,305 | 798,306 | u146779775 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll C[2001][2001];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j] + C[i - 1][j - 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll C[2100][2100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j] + C[i - 1][j - ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 798,307 | 798,306 | u146779775 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"expression.operation.binary.add"
] | 798,313 | 798,314 | u525288965 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
int N, K;
cin >> N >> K;
const int modulo = 1e9 + 7;
int M = max(K, N - K);
vector<vector<int>> C(N + 1, vector<int>(M + 1));
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= min(M,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r",stdin);
int N, K;
cin >> N >> K;
const int modulo = 1e9 + 7;
int M = max(K, N - K);
vector<vector<ll>> C(N + 1, vector<ll>(M + 1));
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= min(M, i... | [
"call.arguments.change"
] | 798,315 | 798,316 | u781659997 | cpp |
p02990 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
uint64_t n, k, ndiv = 1000000007;
uint64_t pt[2001][2001];
int main(void) {
uint64_t i, j, x, y;
cin >> n >> k;
pt[0][0] = 1;
for (i = 1; i <= 2000; i++) {
for (j = 0; j <= i; j++) {
if (j == 0 || j == i) {
pt[i][j] = ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
uint64_t n, k, ndiv = 1000000007;
uint64_t pt[2001][2001];
int main(void) {
uint64_t i, j, x, y;
cin >> n >> k;
pt[0][0] = 1;
for (i = 1; i <= 2000; i++) {
for (j = 0; j <= i; j++) {
if (j == 0 || j == i) {
pt[i][j] = ... | [
"expression.operation.binary.add"
] | 798,319 | 798,320 | u940654002 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 2005;
ll n, k, fac[N], inv[N];
ll bpow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1LL)
res *= a;
a *= a;
b >>= 1LL;
if (a >= MOD)
a %= MOD;
if (res >= MOD)
res %= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 2005;
ll n, k, fac[N], inv[N];
ll bpow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1LL)
res *= a;
a *= a;
b >>= 1LL;
if (a >= MOD)
a %= MOD;
if (res >= MOD)
res %= ... | [
"expression.operation.binary.add"
] | 798,321 | 798,322 | u891061025 | cpp |
p02990 | // list(map(int, input().rstrip().split()))
//' '.join(map(str, res))
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h> //per fare input output con scanf and printf
#include <stdlib.h> //per fare qso... | // list(map(int, input().rstrip().split()))
//' '.join(map(str, res))
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h> //per fare input output con scanf and printf
#include <stdlib.h> //per fare qso... | [
"assignment.change"
] | 798,323 | 798,324 | u044976777 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <vector>
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... | #include <algorithm>
#include <iostream>
#include <vector>
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... | [
"call.add"
] | 798,325 | 798,326 | u904123392 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <vector>
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... | #include <algorithm>
#include <iostream>
#include <vector>
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... | [
"call.add",
"expression.operation.binary.add"
] | 798,327 | 798,326 | u904123392 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <vector>
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... | #include <algorithm>
#include <iostream>
#include <vector>
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... | [
"call.add"
] | 798,325 | 798,328 | u904123392 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <vector>
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... | #include <algorithm>
#include <iostream>
#include <vector>
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... | [
"call.add",
"expression.operation.binary.add"
] | 798,327 | 798,328 | u904123392 | cpp |
p02990 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ... | [
"expression.operation.binary.add"
] | 798,334 | 798,335 | u456333842 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define MOD (1000000007)
int C[2015][2015];
void pascal() {
// パスカルの三角形。 2010まで埋める
C[0][0] = 1;
for (int i = 1; i < 2010; i++) {
C[i][0] = 1;
for (int j = 1; j < i; j++) {
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
C[i][i] = 1;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
#define MOD (1000000007)
int64_t C[2015][2015];
void pascal() {
// パスカルの三角形。 2010まで埋める
C[0][0] = 1;
for (int i = 1; i < 2010; i++) {
C[i][0] = 1;
for (int j = 1; j < i; j++) {
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
C[i][i] = 1;
}
... | [
"variable_declaration.type.primitive.change"
] | 798,340 | 798,341 | u557168336 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int sz = 2005;
long long c[sz][sz];
int n, k;
int r, b;
long long m = 1e9 + 7;
long long add(long long a, long long b) { return (a % m + b % m) % m; }
long long mul(long long a, long long b) { return (a % m * b % m) % m; }
int main() {
// freopen("in.txt","r",stdin... | #include <bits/stdc++.h>
using namespace std;
const int sz = 2005;
long long c[sz][sz];
int n, k;
int r, b;
long long m = 1e9 + 7;
long long add(long long a, long long b) { return (a % m + b % m) % m; }
long long mul(long long a, long long b) { return (a % m * b % m) % m; }
int main() {
// freopen("in.txt","r",stdin... | [
"control_flow.loop.for.condition.change"
] | 798,342 | 798,343 | u353783395 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int sz = 2005;
long long c[sz][sz];
int n, k;
int r, b;
long long m = 1e9 + 7;
long long add(long long a, long long b) { return (a % m + b % m) % m; }
long long mul(long long a, long long b) { return (a % m * b % m) % m; }
int main() {
// freopen("in.txt","r",stdin... | #include <bits/stdc++.h>
using namespace std;
const int sz = 2005;
long long c[sz][sz];
int n, k;
int r, b;
long long m = 1e9 + 7;
long long add(long long a, long long b) { return (a % m + b % m) % m; }
long long mul(long long a, long long b) { return (a % m * b % m) % m; }
int main() {
// freopen("in.txt","r",stdin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 798,344 | 798,343 | u353783395 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"assignment.change"
] | 798,345 | 798,346 | u517411077 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
std::vector<vector<int64_t>> comb(2010);
int main() {
int64_t n, k;
cin >> n >> k;
comb[1] = {1, 1};
for (int i = 2; i < 2010; ++i) {
comb[i].resize(i + 1);
comb[i][0] = comb[i][i] = 1;
for (int j = 1; j < i; ++j) {
co... | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
std::vector<vector<int64_t>> comb(2010);
int main() {
int64_t n, k;
cin >> n >> k;
comb[1] = {1, 1};
for (int i = 2; i < 2010; ++i) {
comb[i].resize(i + 1);
comb[i][0] = comb[i][i] = 1;
for (int j = 1; j < i; ++j) {
co... | [
"expression.operation.binary.add"
] | 798,347 | 798,348 | u849073847 | cpp |
p02990 | // abc132d.cpp : Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define upto(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define oute(x) cout << (x) << endl
const ll MOD = 1000000007;
ll c[2001][2001];
void init(int N) {
r... | // abc132d.cpp : Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define upto(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define oute(x) cout << (x) << endl
const ll MOD = 1000000007;
ll c[2001][2001];
void init(int N) {
r... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 798,352 | 798,353 | u525065967 | cpp |
p02990 | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"control_flow.branch.if.condition.change"
] | 798,356 | 798,357 | u543167400 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll N, K;
vector<ll> ans;
ll fuct(ll n) {
if (n == 0 or n == 1)
return 1;
else
return n * fuct(n - 1) % MOD;
}
// aのb乗
ll calc(ll a, ll b) {
if (b == 0) {
return 1;
} else if (b == 1) {
return a;
} el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll N, K;
vector<ll> ans;
ll fuct(ll n) {
if (n == 0 or n == 1)
return 1;
else
return n * fuct(n - 1) % MOD;
}
// aのb乗
ll calc(ll a, ll b) {
if (b == 0) {
return 1;
} else if (b == 1) {
return a;
} el... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,362 | 798,363 | u003019316 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int comb[2001][2001];
void solve() {
memset(comb, 0, sizeof(comb));
comb[0][0] = 1;
comb[1][0] = 1;
comb[1][1] = 1;
for (int cnt0 = 2; cnt0 < 2001; cnt0++) {
for (int cnt1 = 0; cnt1 <= cnt0; cnt1++) {
if (cnt1 == 0 || cnt1... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long comb[2001][2001];
void solve() {
memset(comb, 0, sizeof(comb));
comb[0][0] = 1;
comb[1][0] = 1;
comb[1][1] = 1;
for (int cnt0 = 2; cnt0 < 2001; cnt0++) {
for (int cnt1 = 0; cnt1 <= cnt0; cnt1++) {
if (cnt1 == 0 |... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 798,372 | 798,373 | u998251394 | cpp |
p02990 | #include <iostream>
using namespace std;
long long mod = 1e9 + 7;
long long fact_arr[2007], inv_fact_arr[2007];
long long pow(long long n, long long r) {
if (r == 0) {
return 1;
}
n %= mod;
if (r % 2) {
return pow(n * n % mod, r / 2) % mod * n % mod;
} else {
return pow(n * n % mod, r / 2) % mod... | #include <iostream>
using namespace std;
long long mod = 1e9 + 7;
long long fact_arr[2007], inv_fact_arr[2007];
long long pow(long long n, long long r) {
if (r == 0) {
return 1;
}
n %= mod;
if (r % 2) {
return pow(n * n % mod, r / 2) % mod * n % mod;
} else {
return pow(n * n % mod, r / 2) % mod... | [
"expression.operation.binary.add"
] | 798,374 | 798,375 | u425351967 | cpp |
p02990 | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
long long c[2005][2005];
int n, k;
long long C(int N, int M) {
if (N < M)
return 0;
return c[N][M];
}
void woh(int N) {
for (int i = 1; i <= N; i++)
c[i][0] = c[i][i] = 1;
for (i... | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
long long c[2005][2005];
int n, k;
long long C(int N, int M) {
if (N < M)
return 0;
return c[N][M];
}
void woh(int N) {
for (int i = 0; i <= N; i++)
c[i][0] = c[i][i] = 1;
for (i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,388 | 798,389 | u516021252 | cpp |
p02990 | #include <cstdio>
using namespace std;
int c[2005][2005];
long long C(int n, int m) {
if (n > m) {
return 0;
}
return c[n][m];
}
int p = 1e9 + 7;
int main() {
int ans;
int n;
int k;
scanf("%d%d", &n, &k);
for (int i = 0; i <= n; i++) {
c[i][0] = 1;
c[i][i] = 1;
}
for (int i = 1; i <= n; ... | #include <cstdio>
using namespace std;
int c[2005][2005];
long long C(int n, int m) {
if (n < m) {
return 0;
}
return c[n][m];
}
int p = 1e9 + 7;
int main() {
int ans;
int n;
int k;
scanf("%d%d", &n, &k);
for (int i = 0; i <= n; i++) {
c[i][0] = 1;
c[i][i] = 1;
}
for (int i = 1; i <= n; ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,390 | 798,391 | u099913313 | cpp |
p02990 | #include <cstdio>
using namespace std;
int c[2005][2005];
long long C(int n, int m) {
if (n > m) {
return 0;
}
return c[n][m];
}
int p = 1e9 + 7;
int main() {
int ans;
int n;
int k;
scanf("%d%d", &n, &k);
for (int i = 0; i <= n; i++) {
c[i][0] = 1;
c[i][i] = 1;
}
for (int i = 1; i <= n; ... | #include <cstdio>
using namespace std;
int c[2005][2005];
long long C(int n, int m) {
if (n < m) {
return 0;
}
return c[n][m];
}
int p = 1e9 + 7;
int main() {
int ans;
int n;
int k;
scanf("%d%d", &n, &k);
for (int i = 0; i <= n; i++) {
c[i][0] = 1;
c[i][i] = 1;
}
for (int i = 1; i <= n; ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 798,392 | 798,391 | u099913313 | cpp |
p02990 | #include <cstdio>
#include <iostream>
using namespace std;
int N, K;
const long long mod = 1e9 + 7;
long long c[2010][2010];
int C(int n, int m) {
if (m > n)
return 0;
return c[n][m];
}
void q(int n) {
for (int i = 0; i <= n; i++)
c[i][0] = c[i][i] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1... | #include <cstdio>
#include <iostream>
using namespace std;
int N, K;
const long long mod = 1e9 + 7;
long long c[2010][2010];
long long C(int n, int m) {
if (m > n)
return 0;
return c[n][m];
}
void q(int n) {
for (int i = 0; i <= n; i++)
c[i][0] = c[i][i] = 1;
for (int i = 1; i <= n; i++)
for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,393 | 798,394 | u352610594 | cpp |
p02990 | /*silu1:dp
ba bLue rengdiaohou n-k+1 gekong,chakong,fencheng i fen;
ba k ge blueball fencheng i-1 fen,gong k-1 gekong;
Step1:zai redballs zhongxuancharu blueballs deweizhi;
Step2:zai blueballs zhongxuancharu redballs deweizhi;
Step3:qu i cidefanganshuji c[n-k+1][i]*c[k-1][i-1] zaiqu mod
*/
#include <iostream>
using na... | /*silu1:dp
ba bLue rengdiaohou n-k+1 gekong,chakong,fencheng i fen;
ba k ge blueball fencheng i-1 fen,gong k-1 gekong;
Step1:zai redballs zhongxuancharu blueballs deweizhi;
Step2:zai blueballs zhongxuancharu redballs deweizhi;
Step3:qu i cidefanganshuji c[n-k+1][i]*c[k-1][i-1] zaiqu mod
*/
#include <iostream>
using na... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,395 | 798,396 | u570203502 | cpp |
p02990 | // Author: Vamsi Krishna Reddy Satti
// With love for Competitive Programming!
#include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); ... | // Author: Vamsi Krishna Reddy Satti
// With love for Competitive Programming!
#include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); ... | [
"assignment.variable.change",
"identifier.change"
] | 798,397 | 798,398 | u060072952 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 798,403 | 798,404 | u155216115 | cpp |
p02990 | #include <iostream>
#define NMAX 2001
#define MOD 1000000007
using namespace std;
int n, k;
int pascal[NMAX][NMAX];
int main() {
cin >> n >> k;
int blueBalls = k;
int redBalls = n - k;
pascal[0][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= n; j++)
if (j - 1 >= 0)
pascal[i][... | #include <iostream>
#define NMAX 2001
#define MOD 1000000007
using namespace std;
int n, k;
long long pascal[NMAX][NMAX];
int main() {
cin >> n >> k;
int blueBalls = k;
int redBalls = n - k;
pascal[0][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= n; j++)
if (j - 1 >= 0)
pasc... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,423 | 798,424 | u885932660 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<long>> c(2003, vector<long>(2003, -1));
long com(int m, int l);
int main(void) {
int n, k, i;
cin >> n >> k;
for (i = 1; i <= k; i++)
cout << (com(k - 1, i - 1) * com(n - k + 1, i)) % mod << endl;
return 0;
}
long com(in... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<long>> c(2003, vector<long>(2003, -1));
long com(int m, int l);
int main(void) {
int n, k, i;
cin >> n >> k;
for (i = 1; i <= k; i++)
cout << (com(k - 1, i - 1) * com(n - k + 1, i)) % mod << endl;
return 0;
}
long com(in... | [
"control_flow.branch.if.condition.change"
] | 798,425 | 798,426 | u088895504 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<long>> c(2003, vector<long>(2003, -1));
long com(int m, int l);
int main(void) {
int n, k, i;
cin >> n >> k;
for (i = 1; i <= k; i++)
cout << com(k - 1, i - 1) * com(n - k + 1, i) % mod << endl;
return 0;
}
long com(int ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<long>> c(2003, vector<long>(2003, -1));
long com(int m, int l);
int main(void) {
int n, k, i;
cin >> n >> k;
for (i = 1; i <= k; i++)
cout << (com(k - 1, i - 1) * com(n - k + 1, i)) % mod << endl;
return 0;
}
long com(in... | [
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 798,427 | 798,426 | u088895504 | cpp |
p02990 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | [
"call.arguments.change"
] | 798,430 | 798,431 | u539402331 | cpp |
p02990 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | [
"expression.operation.binary.add"
] | 798,432 | 798,431 | u539402331 | cpp |
p02990 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | [
"variable_declaration.type.change"
] | 798,433 | 798,431 | u539402331 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | [
"expression.operation.binary.add"
] | 798,434 | 798,435 | u756614568 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
int64_t modinv(int64_t x, int64_t m) {
int64_t y = m, u = 1, v = 0;
while (y) {
int64_t t = x / y;
x -= t * y;
swap(x, y);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int64_t cm(int n, ... | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
int64_t modinv(int64_t x, int64_t m) {
int64_t y = m, u = 1, v = 0;
while (y) {
int64_t t = x / y;
x -= t * y;
swap(x, y);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int64_t cm(int n, ... | [
"call.arguments.change"
] | 798,437 | 798,438 | u211109468 | cpp |
p02990 | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,439 | 798,440 | u433172603 | cpp |
p02990 | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | #include <bits/stdc++.h>
#define me(a, x) memset(a, x, sizeof(a))
#define sc scanf
#define itn int
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it> void db(it *begin,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,439 | 798,441 | u433172603 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
... | [
"literal.number.change",
"call.arguments.change"
] | 798,446 | 798,447 | u538853954 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi ... | [
"assignment.change"
] | 798,448 | 798,449 | u284045566 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 798,450 | 798,449 | u284045566 | cpp |
p02990 | #include <iostream>
using namespace std;
const int M = 1000000007;
int a[2001][2001];
int n, k;
int main() {
cin >> n >> k;
a[0][0] = 1;
for (int i = 1; i <= n; i++) {
a[i][0] = 1;
for (int j = 1; j <= i; j++)
a[i][j] = (a[i - 1][j - 1] + a[i - 1][j]) % M;
}
for (int i = 1; i <= k; i++) {
... | #include <iostream>
using namespace std;
const int M = 1000000007;
long long a[2001][2001];
int n, k;
int main() {
cin >> n >> k;
a[0][0] = 1;
for (int i = 1; i <= n; i++) {
a[i][0] = 1;
for (int j = 1; j <= i; j++)
a[i][j] = (a[i - 1][j - 1] + a[i - 1][j]) % M;
}
for (int i = 1; i <= k; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,451 | 798,452 | u597243424 | cpp |
p02990 | #include <bits/stdc++.h>
#define nmax_def 2200
#define mod_def 1000000007
using namespace std;
typedef long long ll;
ll nCm_array[nmax_def][nmax_def];
void nCm(int N) {
int i, j;
for (i = 0; i < N; i++) {
for (j = 0; j <= i; j++) {
ll ans;
if ((j == 0) || (j == i))
ans = 1;
else if ((... | #include <bits/stdc++.h>
#define nmax_def 2200
#define mod_def 1000000007
using namespace std;
typedef long long ll;
ll nCm_array[nmax_def][nmax_def];
void nCm(int N) {
ll i, j;
for (i = 0; i < N; i++) {
for (j = 0; j <= i; j++) {
ll ans;
if ((j == 0) || (j == i))
ans = 1;
else if ((j... | [
"variable_declaration.type.change"
] | 798,453 | 798,454 | u541884637 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const auto INF = static_cast<ll>(1e15);
const auto MOD = static_cast<ll>(1e9 + 7);
/*********** Variables ***********/
ll N, K;
ll fac[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const auto INF = static_cast<ll>(1e15);
const auto MOD = static_cast<ll>(1e9 + 7);
/*********** Variables ***********/
ll N, K;
ll fac[... | [
"expression.operation.binary.add"
] | 798,455 | 798,456 | u634208461 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const auto INF = static_cast<ll>(1e15);
const auto MOD = static_cast<ll>(1e9 + 7);
/*********** Variables ***********/
ll N, K;
ll fac[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const auto INF = static_cast<ll>(1e15);
const auto MOD = static_cast<ll>(1e9 + 7);
/*********** Variables ***********/
ll N, K;
ll fac[... | [
"expression.operation.binary.add"
] | 798,457 | 798,458 | u634208461 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 2000
#define MOD 1000000007
#define LL long long
int n, k, r;
LL Comb[MAXN + 5][MAXN + 5];
int main() {
scanf("%d%d", &n, &k);
r = n - k;
for (int i = 0; i <= MAXN; i++)
for (int j = 0; j <= i; j++)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 2000
#define MOD 1000000007
#define LL long long
int n, k, r;
LL Comb[MAXN + 5][MAXN + 5];
int main() {
scanf("%d%d", &n, &k);
r = n - k;
for (int i = 0; i <= MAXN; i++)
for (int j = 0; j <= i; j++)
... | [
"assignment.change"
] | 798,459 | 798,460 | u294179241 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 2000
#define MOD 1000000007
#define LL long long
int n, k, r;
LL Comb[MAXN + 5][MAXN + 5];
int main() {
scanf("%d%d", &n, &k);
r = n - k;
for (int i = 0; i <= MAXN; i++)
for (int j = 0; j <= MAXN; j+... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 2000
#define MOD 1000000007
#define LL long long
int n, k, r;
LL Comb[MAXN + 5][MAXN + 5];
int main() {
scanf("%d%d", &n, &k);
r = n - k;
for (int i = 0; i <= MAXN; i++)
for (int j = 0; j <= i; j++)
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,461 | 798,460 | u294179241 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n, k;
long long F[N];
bool read() {
if (!(cin >> n >> k))
return false;
return true;
}
long long binpow(long long a, int n) {
auto res = 1ll;
for (; n > 0; n /= 2, a = a * a % MOD)... | #include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n, k;
long long F[N];
bool read() {
if (!(cin >> n >> k))
return false;
return true;
}
long long binpow(long long a, int n) {
auto res = 1ll;
for (; n > 0; n /= 2, a = a * a % MOD)... | [
"expression.operation.binary.add"
] | 798,462 | 798,463 | u138919616 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll factorial[10000];
void fac() {
factorial[0] = 1;
for (ll i = 1; i <= 2000; i++) {
factorial[i] = (factorial[i - 1] * i) % mod;
}
}
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll factorial[10000];
void fac() {
factorial[0] = 1;
for (ll i = 1; i <= 2000; i++) {
factorial[i] = (factorial[i - 1] * i) % mod;
}
}
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > ... | [
"assignment.add"
] | 798,471 | 798,472 | u428805520 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef unsigned long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return re... | #include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef unsigned long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return re... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 798,478 | 798,479 | u581018765 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,483 | 798,484 | u581018765 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,485 | 798,484 | u581018765 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | [
"control_flow.loop.for.condition.change"
] | 798,486 | 798,484 | u581018765 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change"
] | 798,487 | 798,484 | u581018765 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll ModPow(ll base, ll exp, ll mod) {
ll ret = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
ret = (ret * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ll ModInv(ll base, ll mod) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change"
] | 798,488 | 798,484 | u581018765 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
long long factorial(long long n, long long mod) {
long long ret = 1;
for (long long i = 1; i <= n; i++) {
ret = (ret * i) % mod;
}
return ret;
}
long long inv_mod(long long n, lo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
long long factorial(long long n, long long mod) {
long long ret = 1;
for (long long i = 1; i <= n; i++) {
ret = (ret * i) % mod;
}
return ret;
}
long long inv_mod(long long n, lo... | [
"expression.operation.binary.add"
] | 798,497 | 798,498 | u391752022 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 798,501 | 798,502 | u255001744 | cpp |
p02990 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define SIZE 2001
#define MOD 1000000007
using namespace std;
long long dp[SIZE][SIZE];
void makePasTri(int n) {
dp[0][0] = 1;
for (int i = 1; i <= n + 1; i++) {
dp[i][0] = 1;
for (int j = 1; j <= i; j++) {
dp[i][j] = (dp... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define SIZE 2001
#define MOD 1000000007
using namespace std;
long long dp[SIZE][SIZE];
void makePasTri(int n) {
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
dp[i][0] = 1;
for (int j = 1; j <= i; j++) {
dp[i][j] = (dp[i -... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 798,507 | 798,508 | u817999507 | cpp |
p02990 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
// combinationを計算
vector<vector<int>> comb(N + 1, vector<int>(N + 1, 1));
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= i - 1... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
// combinationを計算
vector<vector<ll>> comb(N + 1, vector<ll>(N + 1, 1));
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= i - 1; ... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 798,517 | 798,518 | u469953228 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define ref(i, a, b) for (int(i) = (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define ref(i, a, b) for (int(i) = (... | [
"assignment.change"
] | 798,525 | 798,526 | u361726856 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
int M = 1;
for (int i = 0; i < 9; i++) {
M *= 10;
}
M += 7;
int c[2][2000];
int d[2][2000];
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
int M = 1;
for (int i = 0; i < 9; i++) {
M *= 10;
}
M += 7;
long long int c[2][2000];
long long int d[2][2000];
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
if (j =... | [
"variable_declaration.type.widen.change"
] | 798,533 | 798,534 | u045575753 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"expression.operation.binary.add"
] | 798,535 | 798,536 | u568353080 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"literal.number.change",
"call.arguments.change"
] | 798,539 | 798,540 | u007637377 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define s 1000000007
long inverse(long n, long mod) {
long m = mod - 2;
long ans = 1;
long prod = n;
while (m != 0) {
if (m & 1) {
ans *= prod;
ans %= mod;
}
m >>= 1;
prod *= prod;
prod %= mod;
}
return ans;
}
long C(long n, lon... | #include <bits/stdc++.h>
using namespace std;
#define s 1000000007
long inverse(long n, long mod) {
long m = mod - 2;
long ans = 1;
long prod = n;
while (m != 0) {
if (m & 1) {
ans *= prod;
ans %= mod;
}
m >>= 1;
prod *= prod;
prod %= mod;
}
return ans;
}
long C(long n, lon... | [
"assignment.variable.change",
"identifier.change"
] | 798,543 | 798,544 | u801530021 | cpp |
p02990 | //
// Created by nhatminh2947 on 7/3/19.
//
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int dp[2001][2001];
int n, k;
int main() {
cin >> n >> k;
int blue = k;
int red = n - k;
for (int i = 0; i <= 2000; ++i) {
dp[i][0] = 1;
}
for (int i = 1; i <= 2000; ++i) {
for... | //
// Created by nhatminh2947 on 7/3/19.
//
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long dp[2001][2001];
int n, k;
int main() {
cin >> n >> k;
int blue = k;
int red = n - k;
for (int i = 0; i <= 2000; ++i) {
dp[i][0] = 1;
}
for (int i = 1; i <= 2000; ++i) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,546 | 798,547 | u694239956 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.