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 |
|---|---|---|---|---|---|---|---|
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
bool A = true;
cin >> S;
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == S.at(i - 1)) {
cout << "Bad" << endl;
A = false;
}
}
if (A == true) {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
bool A = true;
cin >> S;
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == S.at(i - 1)) {
cout << "Bad" << endl;
A = false;
break;
}
}
if (A == true) {
cout << "Good" << endl;
}
}
| [
"control_flow.break.add"
] | 799,919 | 799,920 | u991713078 | cpp |
p02993 | ///......เฆฌเฆฟเฆธเฆฎเฆฟเฆฒเงเฆฒเฆพเฆนเฆฟเฆฐ เฆฐเฆพเฆนเฆฎเฆพเฆจเฆฟเฆฐ เฆฐเฆพเฆนเฆฟเฆฎ......///
///......เฆชเฆฐเฆฎ เฆเฆฐเงเฆฃเฆพเฆฎเฆฏเฆผ เฆ
เฆธเงเฆฎ เฆฆเฆฏเฆผเฆพเฆฒเง เฆเฆฒเงเฆฒเฆพเฆนเฆคเฆพเฆฏเฆผเฆพเฆฒเฆพเฆฐ เฆจเฆพเฆฎเง เฆถเงเฆฐเง เฆเฆฐเฆเฆฟ.....///
/*
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <set>
///...define...///
#define S scanf
#define P printf
#define D double
#define ll long long
#define ull unsigned long long
///...Input...///
#define S1(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL1(a) scanf("%lld", &a)
#define SL2(a, b) scanf("%lld%lld", &a, &b)
#define SL3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
///...Declared Input...///
#define DI(X) \
int X; \
scanf("%d", &X)
#define DII(X, Y) \
int X, Y; \
scanf("%d%d", &X, &Y)
#define DIII(X, Y, Z) \
int X, Y, Z; \
scanf("%d%d%d", &X, &Y, &Z)
#define DLI(X) \
ll X; \
scanf("%lld", &X)
#define DLII(X, Y) \
ll X, Y; \
scanf("%lld%lld", &X, &Y)
#define DLIII(X, Y, Z) \
ll X, Y, Z; \
scanf("%lld%lld%lld", &X, &Y, &Z)
///...Loop...///
#define fai(i, a) for (int i = 0; i < a; i++)
#define faj(j, a) for (int j = 0; j < a; j++)
#define fab(a, b) for (int i = a; i <= b; i++)
#define rfai(i, a) for (int i = a - 1; i >= 0; i--)
#define fabi(a, b, inc) for (int i = a; i <= b; i += inc)
#define fabd(a, b, dec) for (int i = a; i >= b; i -= dec)
///...Minimum/Maximum...///
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mxe(a, n) (*max_element(a, a + n))
#define mne(a, n) (*min_element(a, a + n))
///...PrintCase...///
#define PC(a) printf("Case %d: ", a)
#define PCN(a) printf("Case %d:\n", a)
#define PCH(a) printf("Case #%d: ", a)
///...Pair...///
#define ff first
#define ss second
#define MP make_pair
#define vec vector<int>
#define vv vector<vi>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
///...Other Operations...///
#define pi 2.0 * acos(0.0)
#define eps 1e-11
#define sqr(n) n *n
#define all(a) a.begin(), a.end()
#define nl "\n"
#define check P("here\n")
#define gch getchar()
#define pb push_back
#define pp pop_back
#define sz() size()
#define SUM(a, n) accumulate(a, a + n, 0)
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
///...define mathematics...///
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define MAX 1000000
using namespace std;
///...Mathematics...///
template <typename T> T BigMod(T b, T p, T m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
T s = BigMod(b, p / 2, m);
return ((s % m) * (s % m)) % m;
}
return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T> T POW(T B, T P) {
if (P == 0)
return 1;
if (P & 1)
return B * POW(B, P - 1);
else
return sqr(POW(B, P / 2));
}
template <typename T> T gcd(T a, T b) {
if (a < 0)
return gcd(-a, b);
if (b < 0)
return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
if (a < 0)
return lcm(-a, b);
if (b < 0)
return lcm(a, -b);
return a * (b / gcd(a, b));
}
///...String Operation...///
int toInt(string s) {
int sm;
stringstream ss(s);
ss >> sm;
return sm;
}
ll toLlint(string s) {
ll sm;
stringstream ss(s);
ss >> sm;
return sm;
}
bool isVowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
return true;
return false;
}
template <class T> string NTS(T Number) {
stringstream ss;
ss << Number;
return ss.str();
}
bool isprime(int w) {
if (w == 0)
return false;
if (w == 1)
return false;
int sqrtw = int(sqrt((double)w));
for (int q = 2; q <= sqrtw; q++) {
if (w % q == 0)
return false;
}
return true;
}
#define IOS \
{ \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
}
///.............End Of Template..............////
int b2d(long long n) {
int decimalNumber = 0, i = 0, remainder;
while (n != 0) {
remainder = n % 10;
n /= 10;
decimalNumber += remainder * pow(2, i);
++i;
}
return decimalNumber;
}
int main() {
IOS;
string xx;
cin >> xx;
fai(i, xx.sz()) {
if (xx[i] == xx[i + 1]) {
cout << "Bad";
exit(0);
}
}
cout << "Yes";
} | ///......เฆฌเฆฟเฆธเฆฎเฆฟเฆฒเงเฆฒเฆพเฆนเฆฟเฆฐ เฆฐเฆพเฆนเฆฎเฆพเฆจเฆฟเฆฐ เฆฐเฆพเฆนเฆฟเฆฎ......///
///......เฆชเฆฐเฆฎ เฆเฆฐเงเฆฃเฆพเฆฎเฆฏเฆผ เฆ
เฆธเงเฆฎ เฆฆเฆฏเฆผเฆพเฆฒเง เฆเฆฒเงเฆฒเฆพเฆนเฆคเฆพเฆฏเฆผเฆพเฆฒเฆพเฆฐ เฆจเฆพเฆฎเง เฆถเงเฆฐเง เฆเฆฐเฆเฆฟ.....///
/*
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <set>
///...define...///
#define S scanf
#define P printf
#define D double
#define ll long long
#define ull unsigned long long
///...Input...///
#define S1(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL1(a) scanf("%lld", &a)
#define SL2(a, b) scanf("%lld%lld", &a, &b)
#define SL3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
///...Declared Input...///
#define DI(X) \
int X; \
scanf("%d", &X)
#define DII(X, Y) \
int X, Y; \
scanf("%d%d", &X, &Y)
#define DIII(X, Y, Z) \
int X, Y, Z; \
scanf("%d%d%d", &X, &Y, &Z)
#define DLI(X) \
ll X; \
scanf("%lld", &X)
#define DLII(X, Y) \
ll X, Y; \
scanf("%lld%lld", &X, &Y)
#define DLIII(X, Y, Z) \
ll X, Y, Z; \
scanf("%lld%lld%lld", &X, &Y, &Z)
///...Loop...///
#define fai(i, a) for (int i = 0; i < a; i++)
#define faj(j, a) for (int j = 0; j < a; j++)
#define fab(a, b) for (int i = a; i <= b; i++)
#define rfai(i, a) for (int i = a - 1; i >= 0; i--)
#define fabi(a, b, inc) for (int i = a; i <= b; i += inc)
#define fabd(a, b, dec) for (int i = a; i >= b; i -= dec)
///...Minimum/Maximum...///
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mxe(a, n) (*max_element(a, a + n))
#define mne(a, n) (*min_element(a, a + n))
///...PrintCase...///
#define PC(a) printf("Case %d: ", a)
#define PCN(a) printf("Case %d:\n", a)
#define PCH(a) printf("Case #%d: ", a)
///...Pair...///
#define ff first
#define ss second
#define MP make_pair
#define vec vector<int>
#define vv vector<vi>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
///...Other Operations...///
#define pi 2.0 * acos(0.0)
#define eps 1e-11
#define sqr(n) n *n
#define all(a) a.begin(), a.end()
#define nl "\n"
#define check P("here\n")
#define gch getchar()
#define pb push_back
#define pp pop_back
#define sz() size()
#define SUM(a, n) accumulate(a, a + n, 0)
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
///...define mathematics...///
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define MAX 1000000
using namespace std;
///...Mathematics...///
template <typename T> T BigMod(T b, T p, T m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
T s = BigMod(b, p / 2, m);
return ((s % m) * (s % m)) % m;
}
return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T> T POW(T B, T P) {
if (P == 0)
return 1;
if (P & 1)
return B * POW(B, P - 1);
else
return sqr(POW(B, P / 2));
}
template <typename T> T gcd(T a, T b) {
if (a < 0)
return gcd(-a, b);
if (b < 0)
return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
if (a < 0)
return lcm(-a, b);
if (b < 0)
return lcm(a, -b);
return a * (b / gcd(a, b));
}
///...String Operation...///
int toInt(string s) {
int sm;
stringstream ss(s);
ss >> sm;
return sm;
}
ll toLlint(string s) {
ll sm;
stringstream ss(s);
ss >> sm;
return sm;
}
bool isVowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
return true;
return false;
}
template <class T> string NTS(T Number) {
stringstream ss;
ss << Number;
return ss.str();
}
bool isprime(int w) {
if (w == 0)
return false;
if (w == 1)
return false;
int sqrtw = int(sqrt((double)w));
for (int q = 2; q <= sqrtw; q++) {
if (w % q == 0)
return false;
}
return true;
}
#define IOS \
{ \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
}
///.............End Of Template..............////
int b2d(long long n) {
int decimalNumber = 0, i = 0, remainder;
while (n != 0) {
remainder = n % 10;
n /= 10;
decimalNumber += remainder * pow(2, i);
++i;
}
return decimalNumber;
}
int main() {
IOS;
string xx;
cin >> xx;
fai(i, xx.sz()) {
if (xx[i] == xx[i + 1]) {
cout << "Bad";
exit(0);
}
}
cout << "Good";
} | [
"literal.string.change",
"io.output.change"
] | 799,934 | 799,935 | u634819638 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Good" << endl;
exit(0);
}
}
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
exit(0);
}
}
cout << "Good" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 799,940 | 799,941 | u609061751 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < s.size() - 1; ++i) {
if (prev == s[i]) {
cout << "Bad";
return 0;
}
prev = s[i];
}
cout << "Good";
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < s.size(); ++i) {
if (prev == s[i]) {
cout << "Bad";
return 0;
}
prev = s[i];
}
cout << "Good";
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 799,944 | 799,945 | u979271657 | cpp |
p02993 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [] | 799,946 | 799,947 | u838276016 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 799,964 | 799,965 | u962777012 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
break;
} else {
if (i == 2) {
cout << "Yes" << endl;
}
continue;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
break;
} else {
if (i == 2) {
cout << "Good" << endl;
}
continue;
}
}
}
| [
"literal.string.change",
"io.output.change"
] | 799,966 | 799,967 | u934776456 | cpp |
p02993 | #include "bits/stdc++.h"
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) || N.at(1) == N.at(2) || N.at(2) == N.at(3)) {
cout << "bad" << endl;
} else {
cout << "Good" << endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) || N.at(1) == N.at(2) || N.at(2) == N.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,980 | 799,981 | u476243674 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 799,982 | 799,983 | u538808095 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int a = 0;
cin >> s;
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
a = 1;
break;
}
}
if (a == 1)
cout << "bad" << endl;
else if (a == 0)
cout << "good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int a = 0;
cin >> s;
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
a = 1;
break;
}
}
if (a == 1)
cout << "Bad" << endl;
else if (a == 0)
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,987 | 799,988 | u507613987 | cpp |
p02993 | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
// #ifndef RAHUL
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
string s;
cin >> s;
bool flag = 0;
for (int i = 0; i < 3; ++i) {
/* code */
if (s[i] == s[i + 1]) {
flag = 1;
cout << "Bad" << endl;
}
}
if (flag == 0) {
cout << "Good" << endl;
}
return 0;
} | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<string>
#define lin1(x) \
ll int x; \
x = scan();
#define lin2(x, y) \
ll int x, y; \
x = scan(), y = scan();
#define lin3(x, y, z) \
ll int x, y, z; \
x = scan(), y = scan(), z = scan();
#define pb(x) push_back(x)
#define makep(x, y) make_pair(x, y)
#define mx(a, b) (a) > (b) ? (a) : (b)
#define mn(a, b) (a) < (b) ? (a) : (b)
#define fori(s, e) for (i = s; i <= e; i++)
#define forj(s, e) for (j = s; j <= e; j++)
#define fork(s, e) for (k = s; k <= e; k++)
#define rep(i, s, e) for (int i = s; i <= e; i++)
#define brep(i, s, e) for (int i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x));
#define bits1(x) __builtin_popcount(x)
#define pi 3.14159265358979323846264338327950
#define MOD7 1000000007
#define MOD9 1000000009
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
using namespace std::tr1;
int main() {
// #ifndef RAHUL
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
string s;
cin >> s;
bool flag = 0;
for (int i = 0; i < 3; ++i) {
/* code */
if (s[i] == s[i + 1]) {
flag = 1;
cout << "Bad" << endl;
break;
}
}
if (flag == 0) {
cout << "Good" << endl;
}
return 0;
} | [
"control_flow.break.add"
] | 799,989 | 799,990 | u113081402 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
cout << "Good" << endl;
} else if (s[1] == s[2]) {
cout << "Good" << endl;
} else if (s[2] == s[3]) {
cout << "Good" << endl;
} else if (s[0] == s[1] && s[0] == s[2] && s[0] == s[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
// aaab
// aaba
// abaa
// baaa
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
cout << "Bad" << endl;
} else if (s[1] == s[2]) {
cout << "Bad" << endl;
} else if (s[2] == s[3]) {
cout << "Bad" << endl;
} else if (s[0] == s[1] && s[0] == s[2] && s[0] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
// aaab
// aaba
// abaa
// baaa
} | [
"literal.string.change",
"io.output.change"
] | 799,991 | 799,992 | u484265463 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 799,993 | 799,994 | u965418380 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 800,003 | 800,004 | u442557559 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,031 | 800,032 | u474760662 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
string s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 800,053 | 800,054 | u228943017 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
}
| [] | 800,057 | 800,058 | u821989875 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define Sort(v, n) sort(v, v + n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define cY cout << "Yes";
#define cN cout << "No";
#define cA(a) cout << a;
const ll MOD = 1000000007;
int main() {
string s;
int ans = 0;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define Sort(v, n) sort(v, v + n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define cY cout << "Yes";
#define cN cout << "No";
#define cA(a) cout << a;
const ll MOD = 1000000007;
int main() {
string s;
int ans = 0;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
}
| [] | 800,059 | 800,060 | u179643082 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = 1;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
bool ok = 0;
break;
}
}
if (!ok)
cout << "Bad";
else
cout << "Good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = 1;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
ok = 0;
break;
}
}
if (!ok)
cout << "Bad";
else
cout << "Good";
return 0;
} | [] | 800,063 | 800,064 | u633066470 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,065 | 800,066 | u016183710 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S.at(i - 1) == S.at(i)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S.at(i - 1) == S.at(i)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,068 | 800,069 | u045289115 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
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;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main() {
gearup;
string s;
cin >> s;
bool is_res = true;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1])
is_res = false;
}
cout << (is_res ? "Good" : "Bad") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
// cout<<fixed<<setprecision(10);
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;
}
template <class T> void debug(T v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main() {
gearup;
string s;
cin >> s;
bool is_res = true;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1])
is_res = false;
}
cout << (is_res ? "Good" : "Bad") << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,071 | 800,072 | u929582923 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Good" : "Bsd") << endl
int main() {
string s;
cin >> s;
bool Good = true;
for (int i = 0; i < 4; i++) {
if (i == 3) {
} else {
if (s[1] == s[1 + i]) {
Good = false;
}
}
}
Yes(Good);
} | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Good" : "Bad") << endl
int main() {
string s;
cin >> s;
bool Good = true;
for (int i = 0; i < 4; i++) {
if (i == 3) {
} else {
if (s[i] == s[1 + i]) {
Good = false;
}
}
}
Yes(Good);
} | [
"preprocessor.define.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,083 | 800,084 | u420245204 | cpp |
p02993 | #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#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 < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
forn(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
puts("Bad");
break;
}
}
puts("Good");
return 0;
}
| #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#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 < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
forn(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
puts("Bad");
return 0;
}
}
puts("Good");
return 0;
}
| [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 800,087 | 800,088 | u461913494 | cpp |
p02993 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define ll long long
using vt = ll; //ใใใงๆฐๅคใฎๅใๅคใใใใ
#define rep(i, n) for (vt i = 0; i < (vt)(n); i++)
#define reps(i, s, n) for (vt i = (vt)(s); i < (vt)(n); i++)
#define all(v) v.begin(), v.end()
#define P pair<int, int>
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
rep(i, 2) {
if (s.at(i) == s.at(i + 1)) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define ll long long
using vt = ll; //ใใใงๆฐๅคใฎๅใๅคใใใใ
#define rep(i, n) for (vt i = 0; i < (vt)(n); i++)
#define reps(i, s, n) for (vt i = (vt)(s); i < (vt)(n); i++)
#define all(v) v.begin(), v.end()
#define P pair<int, int>
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s.at(i) == s.at(i + 1)) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 800,089 | 800,090 | u822725754 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool check = 1;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = 0;
}
if (check = 0)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool check = 1;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = 0;
}
if (check == 0)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,095 | 800,096 | u889173297 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
char s[4];
cin >> s[0];
string res = "true";
for (int i = 1; i < 4; i++) {
cin >> s[i];
if (s[i - 1] == s[i]) {
res = "false";
break;
}
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
char s[4];
cin >> s[0];
string res = "Good";
for (int i = 1; i < 4; i++) {
cin >> s[i];
if (s[i - 1] == s[i]) {
res = "Bad";
break;
}
}
cout << res << endl;
} | [
"literal.string.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 800,097 | 800,098 | u303621502 | cpp |
p02993 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string s;
cin >> s;
bool bad = true;
for (int ii = 0; ii < 3; ++ii) {
if (s[ii] == s[ii + 1]) {
bad = true;
}
}
if (bad) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string s;
cin >> s;
bool bad = false;
for (int ii = 0; ii < 3; ++ii) {
if (s[ii] == s[ii + 1]) {
bad = true;
break;
}
}
if (bad) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change"
] | 800,099 | 800,100 | u762158020 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,101 | 800,102 | u037563046 | cpp |
p02993 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[3] == S[4])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,106 | 800,107 | u675042710 | cpp |
p02993 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 800,108 | 800,109 | u880221923 | cpp |
p02993 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b;
cin >> a;
rep(i, 3) {
cin >> b;
if (a == b) {
cout << "Bad";
return 0;
}
a = b;
}
cout << "Good";
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
char a, b;
cin >> a;
rep(i, 3) {
cin >> b;
if (a == b) {
cout << "Bad";
return 0;
}
a = b;
}
cout << "Good";
} | [
"variable_declaration.type.primitive.change"
] | 800,110 | 800,111 | u683078179 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1])
answer = true;
}
if (answer)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = true;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1])
answer = false;
}
if (answer)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | [
"misc.opposites",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change"
] | 800,112 | 800,113 | u023127434 | cpp |
p02993 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
cout << (s[0] == s[1] && s[1] == s[2] || s[2] == s[3] ? "Bad" : "Good")
<< endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
cout << (s[0] == s[1] || s[1] == s[2] || s[2] == s[3] ? "Bad" : "Good")
<< endl;
return 0;
}
| [
"misc.opposites",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 800,116 | 800,117 | u912401725 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] || s[1] == s[2] || s[2] == s[3] ? "Good" : "Bad")
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] || s[1] == s[2] || s[2] == s[3] ? "Bad" : "Good")
<< endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,134 | 800,135 | u652660628 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3] || S[4] == S[5])
cout << "Bad";
else
cout << "Good";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3] || S[3] == S[4])
cout << "Bad";
else
cout << "Good";
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,136 | 800,137 | u391725672 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == n.at(i + 1)) {
cout << "Bad" << endl;
} else if (i == 2) {
cout << "Good" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == n.at(i + 1)) {
cout << "Bad" << endl;
break;
} else if (i == 2) {
cout << "Good" << endl;
}
}
}
| [
"control_flow.break.add"
] | 800,138 | 800,139 | u755918658 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(23))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 800,149 | 800,150 | u080465055 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,161 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(0) == S.at(1) || S.at(1) == S.at(2)) || S.at(2) == S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,163 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,164 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,197 | 800,198 | u945761460 | cpp |
p02993 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// ----GCC ONLY---- //
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// ---- ---- //
#define ll long long
#define PB push_back
#define MOD 10000007
#define PI 3.14159265359
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] != s[1] && s[1] != s[2] && s[3])
puts("Good");
else
puts("Bad");
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// ----GCC ONLY---- //
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// ---- ---- //
#define ll long long
#define PB push_back
#define MOD 10000007
#define PI 3.14159265359
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3])
puts("Good");
else
puts("Bad");
} | [
"control_flow.branch.if.condition.change"
] | 800,204 | 800,205 | u813728438 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,206 | 800,207 | u361948770 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 800,210 | 800,211 | u736265891 | cpp |
p02993 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 2) if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 3) if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 800,212 | 800,213 | u252463862 | cpp |
p02993 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
char s[6];
cin >> s;
rep(i, 2) if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 3) if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change"
] | 800,214 | 800,213 | u252463862 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] = s[1])
cout << "Bad" << endl;
else if (s[1] = s[2])
cout << "Bad" << endl;
else if (s[2] = s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
else if (s[1] == s[2])
cout << "Bad" << endl;
else if (s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,217 | 800,218 | u186506670 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [] | 800,226 | 800,227 | u164730704 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
string ans = "Good";
rep(i, 3) if (s[i] != s[i + 1]) ans = "Bad";
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
string ans = "Good";
rep(i, 3) if (s[i] == s[i + 1]) ans = "Bad";
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,230 | 800,231 | u475503988 | cpp |
p02993 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
void _139() {
string s, t;
cin >> s;
cin >> t;
int count = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
count++;
}
cout << count << endl;
}
void _138() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
void _137() {
int a, b;
cin >> a >> b;
int add = a + b;
int mult = a * b;
int sub = a - b;
cout << max(add, max(mult, sub)) << endl;
}
void _136() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
void _135() {
long long a, b;
cin >> a >> b;
if (abs(a - b) % 2 != 0)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
}
void _134() {
int r;
cin >> r;
cout << 3 * r * r << endl;
}
void _133() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
}
void _132() {
string s;
cin >> s;
char c[2];
memset(c, 0, sizeof(c));
int count[2];
memset(count, 0, sizeof(count));
c[0] = s[0];
count[0] = 1;
for (int i = 1; i < 4; ++i) {
if (s[i] == c[0])
count[0]++;
else {
if (c[1] == 0) {
c[1] = s[i];
count[1] = 1;
} else {
if (s[i] == c[1]) {
count[1]++;
} else {
cout << "No" << endl;
return;
}
}
}
}
if (count[0] == 2 && count[1] == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void _131() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < 4; ++i) {
if (s[i] == prev) {
cout << "Bad" << endl;
return;
} else
prev = s[i];
}
cout << "Yes" << endl;
}
void _130() {}
int main() {
_131();
return 0;
}
| #include <cstring>
#include <iostream>
#include <string>
using namespace std;
void _139() {
string s, t;
cin >> s;
cin >> t;
int count = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
count++;
}
cout << count << endl;
}
void _138() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
void _137() {
int a, b;
cin >> a >> b;
int add = a + b;
int mult = a * b;
int sub = a - b;
cout << max(add, max(mult, sub)) << endl;
}
void _136() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
void _135() {
long long a, b;
cin >> a >> b;
if (abs(a - b) % 2 != 0)
cout << "IMPOSSIBLE" << endl;
else
cout << (a + b) / 2 << endl;
}
void _134() {
int r;
cin >> r;
cout << 3 * r * r << endl;
}
void _133() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
}
void _132() {
string s;
cin >> s;
char c[2];
memset(c, 0, sizeof(c));
int count[2];
memset(count, 0, sizeof(count));
c[0] = s[0];
count[0] = 1;
for (int i = 1; i < 4; ++i) {
if (s[i] == c[0])
count[0]++;
else {
if (c[1] == 0) {
c[1] = s[i];
count[1] = 1;
} else {
if (s[i] == c[1]) {
count[1]++;
} else {
cout << "No" << endl;
return;
}
}
}
}
if (count[0] == 2 && count[1] == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void _131() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < 4; ++i) {
if (s[i] == prev) {
cout << "Bad" << endl;
return;
} else
prev = s[i];
}
cout << "Good" << endl;
}
void _130() {}
int main() {
_131();
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 800,232 | 800,233 | u243740419 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1))
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [] | 800,240 | 800,241 | u726957641 | cpp |
p02993 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\n";
else
cout << "Bad\n";
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
char s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\n";
else
cout << "Bad\n";
return;
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 800,244 | 800,245 | u489302942 | cpp |
p02993 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] = s[i + 1])
break;
}
if (i == 3)
cout << "Good\n";
else
cout << "Bad\n";
return;
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
char s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\n";
else
cout << "Bad\n";
return;
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.primitive.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,246 | 800,245 | u489302942 | cpp |
p02993 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int flag;
for (int i = 1; i < (int)S.size(); i++) {
if (S[i - 1] == S[i])
flag = 1;
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 1; i < (int)S.size(); i++) {
if (S[i - 1] == S[i])
flag = 1;
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 800,249 | 800,250 | u848339218 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,251 | 800,252 | u739095155 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[3] == s[4]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,253 | 800,252 | u739095155 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
if (s1 == s2 || s2 == s3 || s3 == s4) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
if (s1 == s2 || s2 == s3 || s3 == s4) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 800,254 | 800,255 | u443971699 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == S[i - 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,262 | 800,263 | u578871832 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
return 0;
} | [] | 800,264 | 800,265 | u548977290 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, begin, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
rep(i, 0, 2) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, begin, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
rep(i, 0, 3) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 800,268 | 800,269 | u124659583 | cpp |
p02993 | // Security
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Goog" << endl;
return 0;
} | // Security
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,270 | 800,271 | u896325626 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool t = false;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
t = true;
true ? cout << "Bad" : cout << "Good";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool t = false;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
t = true;
t ? cout << "Bad" : cout << "Good";
cout << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 800,276 | 800,277 | u425758699 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 1; i < str.length(); i++) {
if (str[i] == str[i - 1]) {
cout << "Bad" << endl;
}
if (i == str.length() - 1) {
cout << "Good" << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 1; i < str.length(); i++) {
if (str[i] == str[i - 1]) {
cout << "Bad" << endl;
break;
}
if (i == str.length() - 1) {
cout << "Good" << endl;
}
}
return 0;
} | [
"control_flow.break.add"
] | 800,278 | 800,279 | u022890424 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 4; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 3; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,299 | 800,300 | u533566373 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
string S;
cin >> S;
bool bad = false;
for (string::iterator it = S.begin(); it != S.end(); it++) {
if (it == S.begin())
continue;
if (*it == *(it - 1)) {
bad = true;
break;
}
}
if (bad) {
cout << "bad";
} else {
cout << "good";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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 C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
int main() {
string S;
cin >> S;
bool bad = false;
for (string::iterator it = S.begin(); it != S.end(); it++) {
if (it == S.begin())
continue;
if (*it == *(it - 1)) {
bad = true;
break;
}
}
if (bad) {
cout << "Bad";
} else {
cout << "Good";
}
cout << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,308 | 800,309 | u461336793 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[3] == s[4]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,313 | 800,314 | u028510162 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string securityCode;
cin >> securityCode;
char prev = securityCode.at(0);
bool isBad = false;
for (int i = 1; i < 4; ++i) {
char comparing = securityCode.at(1);
if (comparing == prev) {
isBad = true;
break;
} else {
prev = comparing;
}
}
cout << (isBad ? "Bad" : "Good") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string securityCode;
cin >> securityCode;
char prev = securityCode.at(0);
bool isBad = false;
for (int i = 1; i < 4; ++i) {
char comparing = securityCode.at(i);
if (comparing == prev) {
isBad = true;
break;
} else {
prev = comparing;
}
}
cout << (isBad ? "Bad" : "Good") << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 800,317 | 800,318 | u584797714 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad");
return 0;
} else {
printf("Good");
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 800,323 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 800,325 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
}
printf("Good\n");
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"control_flow.branch.else.add"
] | 800,326 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i <= 2; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i <= 2; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,332 | 800,333 | u016119075 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] || s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 800,336 | 800,337 | u559578080 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
ans = true;
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
cin >> S;
}
| [] | 800,344 | 800,345 | u742960659 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
bool ans = true;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3])
ans = true;
if (ans)
puts("Good");
else
puts("Bad");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3])
ans = true;
if (ans)
puts("Good");
else
puts("Bad");
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change"
] | 800,346 | 800,347 | u589238650 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
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() {
int N, K;
cin >> N >> K;
COMinit();
FOR(i, 1, K + 1) {
ll cnt = COM(K - 1, i - 1) * COM(N - K + 1, i);
cout << cnt << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
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() {
int N, K;
cin >> N >> K;
COMinit();
FOR(i, 1, K + 1) {
ll cnt = COM(K - 1, i - 1) * COM(N - K + 1, i);
cnt = cnt % MOD;
cout << cnt << endl;
}
return 0;
} | [
"assignment.add"
] | 800,364 | 800,365 | u520841950 | cpp |
p02990 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
template <typename T_mc_data>
class ModComb {
private:
int max_n;
T_mc_data mod; // M
vector<vector<T_mc_data>> table;
public:
// ๅผๆฐ: n ใฎๆๅคงๅคใM ใฏ mod ใฎๅค
ModComb(int n, T_mc_data M = 0) : table(n + 1, vector<T_mc_data>(n + 1)) {
max_n = n;
mod = M;
for (int i = 0; i <= n; i++) {
table[i][0] = 1;
table[i][i] = 1;
for (int j = 1; j < i; j++) {
table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]);
if (mod != 0) {
table[i][j] %= mod;
}
}
/*
// ใใใใฐๅบๅ
for(int j = 0; j <= i; j++) {
cout << table[i][j] << " ";
}
cout << endl;
*/
}
}
// aCb ใๆฑใใ
T_mc_data calc(T_mc_data a, T_mc_data b) {
if (a > max_n || a < b || a < 0)
return 0; // error
if (a == 0 && b == 0)
return 1;
return table[a][b];
}
};
/////
int main() {
int N, K;
cin >> N >> K;
ll mod = 1000000007;
ModComb<ll> mc(N);
rep(i, K) {
ll ans = 0;
// (N-K+1)C(i+1) ่ตคใ็ณใฎ้ใซ้ใ็ณใๅ
ฅใใ็ทๆฐ
IFD cout << "i: " << i << endl
<< N - K + 1 << " " << i + 1 << " " << K - 1 << endl;
ans = mc.calc(N - K + 1, i + 1);
if (i != 0) {
// (K-1)C(i) ้ใ็ณใฎๅกใใจใซไฝๅใใคใซใใใใฎ็ทๆฐ
ans = ans * mc.calc(K - 1, i) % mod;
}
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
template <typename T_mc_data>
class ModComb {
private:
int max_n;
T_mc_data mod; // M
vector<vector<T_mc_data>> table;
public:
// ๅผๆฐ: n ใฎๆๅคงๅคใM ใฏ mod ใฎๅค
ModComb(int n, T_mc_data M = 0) : table(n + 1, vector<T_mc_data>(n + 1)) {
max_n = n;
mod = M;
for (int i = 0; i <= n; i++) {
table[i][0] = 1;
table[i][i] = 1;
for (int j = 1; j < i; j++) {
table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]);
if (mod != 0) {
table[i][j] %= mod;
}
}
/*
// ใใใใฐๅบๅ
for(int j = 0; j <= i; j++) {
cout << table[i][j] << " ";
}
cout << endl;
*/
}
}
// aCb ใๆฑใใ
T_mc_data calc(T_mc_data a, T_mc_data b) {
if (a > max_n || a < b || a < 0)
return 0; // error
if (a == 0 && b == 0)
return 1;
return table[a][b];
}
};
/////
int main() {
int N, K;
cin >> N >> K;
ll mod = 1000000007;
ModComb<ll> mc(N, mod);
rep(i, K) {
ll ans = 0;
// (N-K+1)C(i+1) ่ตคใ็ณใฎ้ใซ้ใ็ณใๅ
ฅใใ็ทๆฐ
IFD cout << "i: " << i << endl
<< N - K + 1 << " " << i + 1 << " " << K - 1 << endl;
ans = mc.calc(N - K + 1, i + 1);
if (i != 0) {
// (K-1)C(i) ้ใ็ณใฎๅกใใจใซไฝๅใใคใซใใใใฎ็ทๆฐ
ans = ans * mc.calc(K - 1, i) % mod;
}
cout << ans << endl;
}
return 0;
}
| [] | 800,366 | 800,367 | u711582524 | cpp |
p02990 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4001][4001];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
modint c[4002][4002];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
modint comb(int n, int k) { return c[n][k]; }
modint f2(int n, int k) { return comb(n + k - 1, k - 1); }
modint f(int n, int k) {
if (n < k)
return 0;
if (n == 0 && k == 0)
return 1;
if (k < 1)
return 0;
return f2(n - k, k);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
modint blue = f(k, i);
modint red = 0;
red += f(n - k, i - 1);
red += f(n - k, i);
red += f(n - k, i);
red += f(n - k, i + 1);
modint ans = blue * red;
cout << ans << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 800,371 | 800,372 | u825215512 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 (k == 0)
return 1;
if ((n == 0) && (k == 0))
return 1;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll n, k;
cin >> n >> k;
cin.ignore();
ll ans;
for (ll i = 1; i <= k; i++) {
if (n - k >= i - 1) {
ans = COM(n - k + 1, i) * COM(k - 1, i - 1);
cout << ans << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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(ll n, ll k) {
if (n < k)
return 0;
if (k == 0)
return 1;
if ((n == 0) && (k == 0))
return 1;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll n, k;
cin >> n >> k;
cin.ignore();
ll ans;
for (ll i = 1; i <= k; i++) {
if (n - k >= i - 1) {
ans = COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD;
cout << ans << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| [
"assignment.change"
] | 800,376 | 800,377 | u042605975 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 (k == 0)
return 1;
if ((n == 0) && (k == 0))
return 1;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * (finv[n - k] % MOD)) % MOD;
}
int main() {
COMinit();
ll n, k;
cin >> n >> k;
cin.ignore();
ll ans;
for (ll i = 1; i <= k; i++) {
if (n - k >= i - 1) {
ans = COM(n - k + 1, i) * COM(k - 1, i - 1);
cout << ans << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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(ll n, ll k) {
if (n < k)
return 0;
if (k == 0)
return 1;
if ((n == 0) && (k == 0))
return 1;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll n, k;
cin >> n >> k;
cin.ignore();
ll ans;
for (ll i = 1; i <= k; i++) {
if (n - k >= i - 1) {
ans = COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD;
cout << ans << endl;
} else {
cout << 0 << endl;
}
}
return 0;
}
| [
"assignment.change"
] | 800,378 | 800,377 | u042605975 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ln cout << '\n'
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (n); ++i)
// ASCII a=97, A=65
// int H[N]; rep(i,N) scanf("%d", &H[i]);
// int max_x = *std::max_element(x.begin(), x.end());
// int min_y = *std::min_element(y.begin(), y.end());
// sort(vec.begin(), vec.end()); std::greater<>()
// reverse(vec.begin(), vec.end());
// scanf("%s",s);
// printf("%d\n",end-start+1);
// ceil (a + (b - 1)) / b
using namespace std;
using Edge = pair<int, ll>;
using Graph = vector<vector<Edge>>;
using pll = pair<long long, long long>;
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;
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(int n) : par(n, -1) { }
// void init(int n) { par.assign(n, -1); }
// int rt(int x) {
// if (par[x] < 0) return x;
// else return par[x] = rt(par[x]);
// }
// bool issame(int x, int y) {
// return rt(x) == rt(y);
// }
// bool unite(int x, int y) {
// x = rt(x);
// y = rt(y);
// if (x == y) return false;
// if (par[x] > par[y]) swap(x, y);
// par[x] += par[y];
// par[y] = x;
// return true;
// }
// int size(int x) {
// return -par[rt(x)];
// }
// };
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
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;
cout << ans << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ln cout << '\n'
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (n); ++i)
// ASCII a=97, A=65
// int H[N]; rep(i,N) scanf("%d", &H[i]);
// int max_x = *std::max_element(x.begin(), x.end());
// int min_y = *std::min_element(y.begin(), y.end());
// sort(vec.begin(), vec.end()); std::greater<>()
// reverse(vec.begin(), vec.end());
// scanf("%s",s);
// printf("%d\n",end-start+1);
// ceil (a + (b - 1)) / b
using namespace std;
using Edge = pair<int, ll>;
using Graph = vector<vector<Edge>>;
using pll = pair<long long, long long>;
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;
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(int n) : par(n, -1) { }
// void init(int n) { par.assign(n, -1); }
// int rt(int x) {
// if (par[x] < 0) return x;
// else return par[x] = rt(par[x]);
// }
// bool issame(int x, int y) {
// return rt(x) == rt(y);
// }
// bool unite(int x, int y) {
// x = rt(x);
// y = rt(y);
// if (x == y) return false;
// if (par[x] > par[y]) swap(x, y);
// par[x] += par[y];
// par[y] = x;
// return true;
// }
// int size(int x) {
// return -par[rt(x)];
// }
// };
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
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;
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.unary.arithmetic.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 800,383 | 800,384 | u496074393 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1000000007;
typedef long long ll;
typedef pair<ll, ll> p;
typedef vector<ll> vv;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
int n1, k1;
int fact[2001];
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
// a x + b y = gcd(a, b)
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
int mod_inverse(int a, int m) {
int x, y;
if (extgcd(a, m, x, y) == 1)
return (x + m) % m;
else
return 0; // unsolvable
}
int mod_fact(int n, int p, int &e) {
e = 0;
if (n == 0)
return 1;
int res = mod_fact(n / p, p, e);
e += n / p;
if (n / p % 2 != 0)
return res * (p - fact[n % p] % p);
return res * fact[n % p] % p;
}
int mod_comb(int n, int k, int p) {
if (n < 0 || k < 0 || n < k)
return 0;
int e1, e2, e3;
int a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2),
a3 = mod_fact(n - k, p, e3);
if (e1 > e2 + e3)
return 0;
return a1 * mod_inverse(a2 * a3 % p, p) % p;
}
ll modinv(ll a) {
ll b = mod, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return (u + mod) % mod;
}
ll moddevide(ll a, ll b) { return (a * modinv(b)) % mod; }
ll modncr(ll n, ll r) {
ll i, plus = 1;
for (i = 0; i < r; i++) {
plus = (plus * (n - i)) % mod;
plus = moddevide(plus, i + 1);
}
return plus;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n1 >> k1;
for (int i = 1; i <= k1; i++) {
cout << modncr(k1 - 1, i - 1) * modncr(n1 - k1 + 1, i) << "\n";
}
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1000000007;
typedef long long ll;
typedef pair<ll, ll> p;
typedef vector<ll> vv;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
int n1, k1;
int fact[2001];
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
// a x + b y = gcd(a, b)
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
int mod_inverse(int a, int m) {
int x, y;
if (extgcd(a, m, x, y) == 1)
return (x + m) % m;
else
return 0; // unsolvable
}
int mod_fact(int n, int p, int &e) {
e = 0;
if (n == 0)
return 1;
int res = mod_fact(n / p, p, e);
e += n / p;
if (n / p % 2 != 0)
return res * (p - fact[n % p] % p);
return res * fact[n % p] % p;
}
int mod_comb(int n, int k, int p) {
if (n < 0 || k < 0 || n < k)
return 0;
int e1, e2, e3;
int a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2),
a3 = mod_fact(n - k, p, e3);
if (e1 > e2 + e3)
return 0;
return a1 * mod_inverse(a2 * a3 % p, p) % p;
}
ll modinv(ll a) {
ll b = mod, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return (u + mod) % mod;
}
ll moddevide(ll a, ll b) { return (a * modinv(b)) % mod; }
ll modncr(ll n, ll r) {
ll i, plus = 1;
for (i = 0; i < r; i++) {
plus = (plus * (n - i)) % mod;
plus = moddevide(plus, i + 1);
}
return plus;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n1 >> k1;
for (int i = 1; i <= k1; i++) {
cout << modncr(k1 - 1, i - 1) * modncr(n1 - k1 + 1, i) % mod << "\n";
}
}
| [
"expression.operation.binary.add"
] | 800,388 | 800,389 | u155416173 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SP << " " <<
LL mod = 1000000007;
const int MAX = 5000;
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() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N, K;
cin >> N >> K;
COMinit();
LL blue = K;
LL red = N - K;
FOR(i, 1, K + 1) {
// blue-i , i-1
// red-i+1,i
cout << COM(blue - 1, blue - i) * COM(red + 1, red - i + 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SP << " " <<
LL mod = 1000000007;
const int MAX = 5000;
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() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N, K;
cin >> N >> K;
COMinit();
LL blue = K;
LL red = N - K;
FOR(i, 1, K + 1) {
// blue-i , i-1
// red-i+1,i
cout << (COM(blue - 1, blue - i) * COM(red + 1, red - i + 1)) % MOD << endl;
}
}
| [
"expression.operation.binary.add"
] | 800,390 | 800,391 | u944838431 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
long long inf = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
// typedef long long ll;
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
//้
ๅใฎSIZEใฏๅ้กใใจใซๅฎ็พฉใใๅฟ
่ฆใใใใ
const int SIZE = 3000;
long long inv[SIZE + 1]; //ๅiใฎ้ๅ
ใๆ ผ็ดใใ้
ๅใ
long long kai[SIZE + 1]; // i!ใฎmodใๆ ผ็ดใใ้
ๅใ
long long invkai[SIZE + 1]; //ๅi!ใฎ้ๅ
ใๆ ผ็ดใใ้
ๅใ
const int MOD = i_7;
void invinit() { //ไธใฎ้
ๅใๅๆๅใใ้ขๆฐใ
inv[1] = 1;
for (int i = 2; i <= SIZE; i++) {
inv[i] = MOD - ((MOD / i) * inv[MOD % i]) % MOD;
}
kai[0] = invkai[0] = 1;
for (int i = 1; i <= SIZE; i++) {
kai[i] = (kai[i - 1] * i) % MOD;
invkai[i] = (invkai[i - 1] * inv[i]) % MOD;
}
}
long long comb(long long a, long long b) {
if (b < 0 || a < b) {
return 0;
}
return mod(kai[a] * mod(invkai[b] * invkai[a - b]));
}
int main() {
long long n, k;
cin >> n >> k;
invinit();
long long res;
for (long long i = 1; i <= k; i++) {
res = comb(k - 1, i - 1) * comb(n - k + 1, i);
cout << res << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
long long inf = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
// typedef long long ll;
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
//้
ๅใฎSIZEใฏๅ้กใใจใซๅฎ็พฉใใๅฟ
่ฆใใใใ
const int SIZE = 3000;
long long inv[SIZE + 1]; //ๅiใฎ้ๅ
ใๆ ผ็ดใใ้
ๅใ
long long kai[SIZE + 1]; // i!ใฎmodใๆ ผ็ดใใ้
ๅใ
long long invkai[SIZE + 1]; //ๅi!ใฎ้ๅ
ใๆ ผ็ดใใ้
ๅใ
const int MOD = i_7;
void invinit() { //ไธใฎ้
ๅใๅๆๅใใ้ขๆฐใ
inv[1] = 1;
for (int i = 2; i <= SIZE; i++) {
inv[i] = MOD - ((MOD / i) * inv[MOD % i]) % MOD;
}
kai[0] = invkai[0] = 1;
for (int i = 1; i <= SIZE; i++) {
kai[i] = (kai[i - 1] * i) % MOD;
invkai[i] = (invkai[i - 1] * inv[i]) % MOD;
}
}
long long comb(long long a, long long b) {
if (b < 0 || a < b) {
return 0;
}
return mod(kai[a] * mod(invkai[b] * invkai[a - b]));
}
int main() {
long long n, k;
cin >> n >> k;
invinit();
long long res;
for (long long i = 1; i <= k; i++) {
res = mod(comb(k - 1, i - 1) * comb(n - k + 1, i));
cout << res << endl;
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 800,394 | 800,395 | u222293734 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
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;
}
}
int64_t 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() {
make_table();
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;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
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;
}
}
int64_t 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() {
make_table();
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;
}
} | [
"expression.operation.binary.add"
] | 800,410 | 800,411 | u415916075 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
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;
}
}
int64_t 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() {
make_table();
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;
}
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
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;
}
}
int64_t 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() {
make_table();
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;
}
} | [
"variable_declaration.type.primitive.change"
] | 800,412 | 800,411 | u415916075 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
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ใๆก็จ
}
for (ll i = 1; i <= k; i++) {
ll ans = (comb(k - 1, i - 1) % M) * (comb(n - k + 1, i) % M);
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
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ใๆก็จ
}
for (ll i = 1; i <= k; i++) {
ll ans = (comb(k - 1, i - 1) * comb(n - k + 1, i)) % M;
cout << ans << endl;
}
return 0;
}
| [] | 800,413 | 800,414 | u509420256 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
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 <= n; 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;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
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;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,418 | 800,419 | u457283867 | cpp |
p02990 | //#typedef int ll
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
// namespace
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pint;
// const
const int inf = 1e9;
const ll mod = ((ll)1e9 + 7);
// loop
#define rep(i, n) for (int i = 0, i##_mx = n; i < i##_mx; i++)
#define brep(i, b, e) for (int i = b; i < e; i++)
#define erep(i, b, e) for (int i = b; i <= e; i++)
#define rrep(i, b, e) for (int i = b; i >= e; i--)
// STL
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(v) (v).begin(), (v).end()
// sort
#define vsort(v, b) sort(all(v), [](auto l, auto r) { return (b); })
// access
#define gt(i, n) get<n>(i)
// function
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 prime(vint &v, int n) {
brep(i, 2, n) {
bool fg = false;
for (auto e : v) {
if (i % e == 0) {
fg = true;
}
}
if (fg) {
continue;
}
v.pb(i);
}
}
void in(vint &v) {
for (auto &i : v) {
cin >> i;
}
}
void in(vll &v) {
for (auto &i : v) {
cin >> i;
}
}
ll egcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = egcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
signed main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
ll blue = 1, red = n - k + 1;
ll x, y;
erep(i, 1, k) {
cout << blue * red << endl;
blue *= k - i;
blue %= mod;
egcd(i, mod, x, y);
while (x < 0) {
x += mod;
}
blue *= x;
blue %= mod;
red *= n - k - i + 1;
red %= mod;
egcd(i + 1, mod, x, y);
while (x < 0) {
x += mod;
}
red *= x;
red %= mod;
}
return 0;
} | //#typedef int ll
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
// namespace
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pint;
// const
const int inf = 1e9;
const ll mod = ((ll)1e9 + 7);
// loop
#define rep(i, n) for (int i = 0, i##_mx = n; i < i##_mx; i++)
#define brep(i, b, e) for (int i = b; i < e; i++)
#define erep(i, b, e) for (int i = b; i <= e; i++)
#define rrep(i, b, e) for (int i = b; i >= e; i--)
// STL
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(v) (v).begin(), (v).end()
// sort
#define vsort(v, b) sort(all(v), [](auto l, auto r) { return (b); })
// access
#define gt(i, n) get<n>(i)
// function
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 prime(vint &v, int n) {
brep(i, 2, n) {
bool fg = false;
for (auto e : v) {
if (i % e == 0) {
fg = true;
}
}
if (fg) {
continue;
}
v.pb(i);
}
}
void in(vint &v) {
for (auto &i : v) {
cin >> i;
}
}
void in(vll &v) {
for (auto &i : v) {
cin >> i;
}
}
ll egcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = egcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
signed main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
ll blue = 1, red = n - k + 1;
ll x, y;
erep(i, 1, k) {
cout << (blue * red) % mod << endl;
blue *= k - i;
blue %= mod;
egcd(i, mod, x, y);
while (x < 0) {
x += mod;
}
blue *= x;
blue %= mod;
red *= n - k - i + 1;
red %= mod;
egcd(i + 1, mod, x, y);
while (x < 0) {
x += mod;
}
red *= x;
red %= mod;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 800,425 | 800,426 | u178152729 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define srtarr(x, n) sort(x, x + n)
#define dsrtarr(x, n) sort(x, x + n, greater<>());
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
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;
}
using namespace std;
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
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;
}
ll fact(ll k) {
ll sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
sum %= MOD;
}
return sum;
}
int main() {
int n, k, r;
cin >> n >> k;
COMinit();
r = n - k;
reps(i, k) { cout << COM(r + 1, i) * COM(k - 1, i - 1) << endl; }
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define srtarr(x, n) sort(x, x + n)
#define dsrtarr(x, n) sort(x, x + n, greater<>());
#define m0(x) memset(x, 0, sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define mod 1000000007
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;
}
using namespace std;
/* 1..10
* rep: 0 1 2 3 4 5 6 7 8 9
* reps: 1 2 3 4 5 6 7 8 9 10
* rrep: 9 8 7 6 5 4 3 2 1 0
* rreps: 10 9 8 7 6 5 4 3 2 1
*/
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;
}
ll fact(ll k) {
ll sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
sum %= MOD;
}
return sum;
}
int main() {
int n, k, r;
cin >> n >> k;
COMinit();
r = n - k;
reps(i, k) { cout << COM(r + 1, i) * COM(k - 1, i - 1) % MOD << endl; }
}
| [
"expression.operation.binary.add"
] | 800,427 | 800,428 | u926242698 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int M = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
long long int ans;
vector<vector<long long>> v(2001, vector<long long>(2001, 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]) % M;
}
}
for (int i = 1; i <= K; i++) {
if (N - K + 1 < i)
ans = 0;
else {
ans = v[N - K + 1][i] * v[K - 1][i - 1];
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int M = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
long long int ans;
vector<vector<long long>> v(2001, vector<long long>(2001, 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]) % M;
}
}
for (int i = 1; i <= K; i++) {
if (N - K + 1 < i)
ans = 0;
else {
ans = (v[N - K + 1][i] * v[K - 1][i - 1]) % M;
}
cout << ans << endl;
}
return 0;
}
| [
"assignment.change"
] | 800,429 | 800,430 | u366677622 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]);
}
}
for (i = 1; i <= k; i++) {
long long ans;
ans = v[k - 1][i - 1] * v[n - k + 1][i];
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
}
for (i = 1; i <= k; i++) {
long long ans;
ans = v[k - 1][i - 1] * v[n - k + 1][i];
ans %= mod;
cout << ans << endl;
}
return 0;
} | [
"assignment.change"
] | 800,437 | 800,438 | u420528322 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
}
for (i = 1; i <= k; i++) {
long long ans;
ans = v[k - 1][i - 1] * v[n - k + 1][i];
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
}
for (i = 1; i <= k; i++) {
long long ans;
ans = v[k - 1][i - 1] * v[n - k + 1][i];
ans %= mod;
cout << ans << endl;
}
return 0;
} | [] | 800,439 | 800,438 | u420528322 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
}
for (i = 1; i <= k; i++) {
long long ans;
long long ab, cd;
ab = v[k - 1][i - 1] % mod;
cd = v[n - k + 1][i] % mod;
ans = ab * cd;
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.size(); i++) {
for (j = 1; j < i; j++) {
v[i][j] = (v[i - 1][j - 1] + v[i - 1][j]) % mod;
}
}
for (i = 1; i <= k; i++) {
long long ans;
long long ab, cd;
ab = v[k - 1][i - 1] % mod;
cd = v[n - k + 1][i] % mod;
ans = ab * cd;
ans %= mod;
cout << ans << endl;
}
return 0;
} | [] | 800,440 | 800,441 | u420528322 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
long long modinv(long long a) {
long long b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
long long moddevide(long long a, long long b) { return (a * modinv(b)) % mod; }
long long modncr(long long n, long long r) {
long long i, plus = 1;
for (i = 0; i < r; i++) {
plus = (plus * (n - i)) % mod;
plus = moddevide(plus, i + 1);
}
return plus;
}
int main() {
ll i, N, K;
cin >> N >> K;
for (i = 1; i < K; i++)
cout << (modncr(K - 1, i) * modncr(N - K + 1, i + 1)) % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
long long modinv(long long a) {
long long b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
long long moddevide(long long a, long long b) { return (a * modinv(b)) % mod; }
long long modncr(long long n, long long r) {
long long i, plus = 1;
for (i = 0; i < r; i++) {
plus = (plus * (n - i)) % mod;
plus = moddevide(plus, i + 1);
}
return plus;
}
int main() {
ll i, N, K;
cin >> N >> K;
for (i = 0; i < K; i++)
cout << (modncr(K - 1, i) * modncr(N - K + 1, i + 1)) % mod << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 800,442 | 800,443 | u251847465 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
namespace mod {
ll MOD = 1000000007;
// x+y
ll add(ll x, ll y) { return (x + y) % MOD; }
// x-y
ll sub(ll x, ll y) { return (x + MOD - (y % MOD)) % MOD; }
// x*y
ll mul(ll x, ll y) { return ((x % MOD) * (y % MOD)) % MOD; }
// x^y
ll power(ll x, ll y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % MOD;
} else if (y % 2 == 0) {
ll pow = power(x, y / 2);
return (pow * pow) % MOD;
} else {
ll pow = power(x, y / 2);
return (((pow * pow) % MOD) * x) % MOD;
}
}
// x/y
ll div(ll x, ll y) { return mul(x, power(y, MOD - 2)); }
//้ไนx~y xใใyใพใงใใใ
ll fact(ll x, ll y) {
if (x < y) {
return 0;
} else if (x == y) {
return x;
} else {
return mul(x, fact(x - 1, y));
}
}
//็ตใฟๅใใ nCr
ll conbi(ll n, ll r) {
if (r == 0)
return 1;
return div(fact(n, n - r + 1), fact(r, 1));
}
//้ ๅ nPr
ll perm(ll n, ll r) { return fact(n, n - r + 1); }
//้่ค็ตๅใ nHr
ll homo(ll n, ll r) { return conbi((n + r - 1), r); }
} // namespace mod
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << mod::conbi(k - 1, i - 1) * mod::conbi(n - k + 1, i) << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
namespace mod {
ll MOD = 1000000007;
// x+y
ll add(ll x, ll y) { return (x + y) % MOD; }
// x-y
ll sub(ll x, ll y) { return (x + MOD - (y % MOD)) % MOD; }
// x*y
ll mul(ll x, ll y) { return ((x % MOD) * (y % MOD)) % MOD; }
// x^y
ll power(ll x, ll y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % MOD;
} else if (y % 2 == 0) {
ll pow = power(x, y / 2);
return (pow * pow) % MOD;
} else {
ll pow = power(x, y / 2);
return (((pow * pow) % MOD) * x) % MOD;
}
}
// x/y
ll div(ll x, ll y) { return mul(x, power(y, MOD - 2)); }
//้ไนx~y xใใyใพใงใใใ
ll fact(ll x, ll y) {
if (x < y) {
return 0;
} else if (x == y) {
return x;
} else {
return mul(x, fact(x - 1, y));
}
}
//็ตใฟๅใใ nCr
ll conbi(ll n, ll r) {
if (r == 0)
return 1;
return div(fact(n, n - r + 1), fact(r, 1));
}
//้ ๅ nPr
ll perm(ll n, ll r) { return fact(n, n - r + 1); }
//้่ค็ตๅใ nHr
ll homo(ll n, ll r) { return conbi((n + r - 1), r); }
} // namespace mod
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cout << mod::mul(mod::conbi(k - 1, i - 1), mod::conbi(n - k + 1, i))
<< '\n';
}
} | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 800,448 | 800,449 | u408650734 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<P> VP;
typedef vector<PL> VPL;
typedef vector<string> VS;
const ll M = (ll)1e9 + 7;
vector<ll> fac(300001);
vector<ll> ifac(300001);
ll mpow(ll x, ll n) {
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) {
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() {
cin.tie(0);
ios::sync_with_stdio(false);
int 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;
ifac[i + 1] = ifac[i] * mpow(i + 1, M - 2) % M;
}
FOR(i, 1, k) {
ll devide_cnt = comb(k - 1, i - 1);
ll ans = devide_cnt * comb(n - k + 1, i);
cout << ans << ln;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<P> VP;
typedef vector<PL> VPL;
typedef vector<string> VS;
const ll M = (ll)1e9 + 7;
vector<ll> fac(300001);
vector<ll> ifac(300001);
ll mpow(ll x, ll n) {
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) {
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() {
cin.tie(0);
ios::sync_with_stdio(false);
int 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;
ifac[i + 1] = ifac[i] * mpow(i + 1, M - 2) % M;
}
FOR(i, 1, k) {
ll devide_cnt = comb(k - 1, i - 1);
ll ans = devide_cnt * comb(n - k + 1, i) % M;
cout << ans << ln;
}
return 0;
}
| [
"assignment.change"
] | 800,452 | 800,453 | u991083615 | cpp |
p02990 | #include <bits/stdc++.h>
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 n, k;
cin >> n >> k;
vector<vector<long long>> v(n + 1, vector<long long>(n + 1));
comb(v);
for (int i = 1; i <= k; i++) {
if (n - k >= i - 1)
cout << v[k - 1][i - 1] * v[n - k + 1][i] % 1000000007 << endl;
else
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
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 n, k;
cin >> n >> k;
vector<vector<long long>> v(n + 1, vector<long long>(n + 1));
comb(v);
for (int i = 1; i <= k; i++) {
if (n - k >= i - 1)
cout << v[k - 1][i - 1] * v[n - k + 1][i] % 1000000007 << endl;
else
cout << 0 << endl;
}
} | [
"assignment.change"
] | 800,466 | 800,467 | u339937125 | cpp |
p02990 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; ++i)
#define ll long long
using namespace std;
/*
//E
ll d[300000];
int main(void) {
ll n, m;
cin >> n >> m;
vector<vector<ll>> edge = vector<vector<ll>>(3 * n);
rep(i, 0, m) {
ll u, v;
cin >> u >> v;
rep(j, 0, 3) {
ll u0 = (u - 1)*3;
ll v0 = (v - 1)*3;
edge[u0 + j].push_back(v0 + (1+j) % 3);
}
}
ll s, t;
cin >> s >> t;
s = (s-1)*3;
t = (t-1)*3;
rep(i, 0, 300000) {
d[i] = 1e8;
}
d[s] = 0;
queue<ll> q = queue<ll>();
q.push(s);
ll ans = -1;
while (q.size() > 0) {
ll v = q.front();
q.pop();
for (auto& nv : edge[v]) {
if (d[nv] > d[v] + 1) {
d[nv] = d[v] + 1;
if (nv == t) break;
q.push(nv);
}
}
if (d[t] != 1e8) {
ans = d[t] / 3;
break;
}
}
cout << ans << endl;
}
*/
// D
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(void) {
COMinit();
ll n, k;
cin >> n >> k;
rep(i, 1, k + 1) {
if (n - k + 1 >= k) {
cout << COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD << endl;
} else
cout << 0 << endl;
}
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; ++i)
#define ll long long
using namespace std;
/*
//E
ll d[300000];
int main(void) {
ll n, m;
cin >> n >> m;
vector<vector<ll>> edge = vector<vector<ll>>(3 * n);
rep(i, 0, m) {
ll u, v;
cin >> u >> v;
rep(j, 0, 3) {
ll u0 = (u - 1)*3;
ll v0 = (v - 1)*3;
edge[u0 + j].push_back(v0 + (1+j) % 3);
}
}
ll s, t;
cin >> s >> t;
s = (s-1)*3;
t = (t-1)*3;
rep(i, 0, 300000) {
d[i] = 1e8;
}
d[s] = 0;
queue<ll> q = queue<ll>();
q.push(s);
ll ans = -1;
while (q.size() > 0) {
ll v = q.front();
q.pop();
for (auto& nv : edge[v]) {
if (d[nv] > d[v] + 1) {
d[nv] = d[v] + 1;
if (nv == t) break;
q.push(nv);
}
}
if (d[t] != 1e8) {
ans = d[t] / 3;
break;
}
}
cout << ans << endl;
}
*/
// D
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(void) {
COMinit();
ll n, k;
cin >> n >> k;
rep(i, 1, k + 1) {
if (n - k + 1 >= i) {
cout << COM(n - k + 1, i) * COM(k - 1, i - 1) % MOD << endl;
} else
cout << 0 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 800,470 | 800,471 | u693569496 | cpp |
p02990 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> nCk(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i <= n; i++) {
nCk[i][0] = 1;
nCk[i][i] = 1;
for (int j = 1; j <= i - 1; j++) {
nCk[i][j] = (nCk[i - 1][j - 1] + nCk[i - 1][j]) % 1000000007;
}
}
for (int i = 1; i <= k; i++)
cout << nCk[k - 1][i - 1] * nCk[n - k + 1][i] % 1000000007 << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> nCk(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i <= n; i++) {
nCk[i][0] = 1;
nCk[i][i] = 1;
for (int j = 1; j <= i - 1; j++) {
nCk[i][j] = (nCk[i - 1][j - 1] + nCk[i - 1][j]) % 1000000007;
}
}
for (int i = 1; i <= k; i++)
cout << (long long)nCk[k - 1][i - 1] * nCk[n - k + 1][i] % 1000000007
<< endl;
return 0;
}
| [
"type_conversion.add"
] | 800,472 | 800,473 | u433162241 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.