problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02990 | #include <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));
for (int i = 0; i <= n; i++) {
nCk[i][0] = 1;
nCk[i][i] = 1;
for (i... | #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... | [
"call.arguments.add"
] | 800,474 | 800,473 | u433162241 | cpp |
p02990 | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | [
"assignment.change"
] | 800,488 | 800,489 | u026686258 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
long long factorial(long long i) { // 階乗
if (i > 0)
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
long long factorial(long long i) { // 階乗
if (i > 0)
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 800,492 | 800,493 | u017293723 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
long long factorial(long long i) { // 階乗
if (i > 0)
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
long long factorial(long long i) { // 階乗
if (i > 0)
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 800,494 | 800,493 | u017293723 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"assignment.add"
] | 800,497 | 800,498 | u532894762 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (in... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,515 | 800,516 | u706695185 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (in... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,517 | 800,518 | u706695185 | cpp |
p02990 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <numeric>
using namespace std;
const u_int64_t D = 1'000'000'007LL;
u_int64_t dpow(const u_int64_t x, const u_int64_t y) {
if (y == 0LL) {
return 1;
} else if (y % 2LL == 0) {
return dpow(x * x % D, y / 2LL);
} else {
return x * d... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <numeric>
using namespace std;
const u_int64_t D = 1'000'000'007LL;
u_int64_t dpow(const u_int64_t x, const u_int64_t y) {
if (y == 0LL) {
return 1;
} else if (y % 2LL == 0) {
return dpow(x * x % D, y / 2LL);
} else {
return x * d... | [
"expression.operation.binary.add"
] | 800,519 | 800,520 | u395676079 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,523 | 800,524 | u616547520 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,525 | 800,524 | u616547520 | cpp |
p02990 |
#include <iostream>
using namespace std;
long long C[2000][2000];
int main() {
long mod = 1E9 + 7;
int N, K;
cin >> N >> K;
C[0][0] = 1;
C[1][0] = 1;
C[1][1] = 1;
for (int i = 2; i < 2000; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;... |
#include <iostream>
using namespace std;
long long C[2005][2005];
int main() {
long mod = 1E9 + 7;
int N, K;
cin >> N >> K;
C[0][0] = 1;
C[1][0] = 1;
C[1][1] = 1;
for (int i = 2; i < 2005; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,528 | 800,529 | u811978802 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
static const int mod = 1e9 + 7;
using ll = long long;
vector<vector<ll>> comb(int n, int r) {
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) ... | #include <iostream>
#include <vector>
using namespace std;
static const int mod = 1e9 + 7;
using ll = long long;
vector<vector<ll>> comb(int n, int r) {
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) ... | [
"assignment.change"
] | 800,533 | 800,534 | u024469792 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<str> vst;
typedef vector<ll> vll;
ll mod = 1000000007, INF = 10000000000000000;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll fac[200100];
ll inv[200100];
ll facinv[200100];
void ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<str> vst;
typedef vector<ll> vll;
ll mod = 1000000007, INF = 10000000000000000;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll fac[200100];
ll inv[200100];
ll facinv[200100];
void ... | [
"call.add"
] | 800,535 | 800,536 | u061912210 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvw... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvw... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 800,558 | 800,559 | u811472478 | cpp |
p02990 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | [
"expression.operation.binary.add"
] | 800,560 | 800,561 | u783861517 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 1; i < S.size(); ++i) {
if (S.at(i - 1) == S.at(i)) {
cout << "Bad" << endl;
flag = true;
}
}
if (!flag) {
cout << "Good" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 1; i < S.size(); ++i) {
if (S.at(i - 1) == S.at(i) && flag == false) {
cout << "Bad" << endl;
flag = true;
}
}
if (!flag) {
cout << "Good" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 800,588 | 800,589 | u308463793 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == s.at(i + 1)) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 800,590 | 800,591 | u296160120 | cpp |
p02993 | #include <algorithm>
#include <cstdio>
using namespace std;
char ch, la;
int main() {
while (scanf("%c", &ch) != EOF) {
if (ch == la) {
printf("Bad");
return 0;
}
}
printf("Good");
} | #include <algorithm>
#include <cstdio>
using namespace std;
char ch, la;
int main() {
while (scanf("%c", &ch) != EOF) {
if (ch == la) {
printf("Bad");
return 0;
}
la = ch;
}
printf("Good");
} | [
"assignment.add"
] | 800,612 | 800,613 | u880272923 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int p = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "bad";
p = 1;
break;
} else
p++;
}
if (p != 1)
cout << "good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int p = 0;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
p = 1;
break;
} else
p++;
}
if (p != 1)
cout << "Good";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,618 | 800,619 | u236966848 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int p = 0;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "bad";
p = 1;
break;
} else
p++;
}
if (p != 1)
cout << "good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int p = 0;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
p = 1;
break;
} else
p++;
}
if (p != 1)
cout << "Good";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,620 | 800,619 | u236966848 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, n, m, i, j, t[200005];
string s, q;
int main() {
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Hard";
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, n, m, i, j, t[200005];
string s, q;
int main() {
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
} | [
"literal.string.change",
"io.output.change"
] | 800,629 | 800,630 | u030094335 | cpp |
p02993 | // AUTHOR:: MOHAMMAD FAISAL
// BEGINNING WITH THE NAME OF ALMIGHTY GOD ALLAH
#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 << "Good";
else
cout << "Bad";
return 0;
} | // AUTHOR:: MOHAMMAD FAISAL
// BEGINNING WITH THE NAME OF ALMIGHTY GOD ALLAH
#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";
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,633 | 800,634 | u993949676 | 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 << "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;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 800,641 | 800,642 | u251410638 | 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"
] | 800,650 | 800,651 | u313124728 | cpp |
p02993 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char s[5];
cin >> s;
bool flag = false;
for (int i = 1; i < 4; i++) {
if (s[i - 1] == s[i])
flag = true;
}
if (flag)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char s[5];
cin >> s;
bool flag = false;
for (int i = 1; i < 4; i++) {
if (s[i - 1] == s[i])
flag = true;
}
if (!flag)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 800,654 | 800,655 | u094619686 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
}
| #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\n";
return 0;
}
}
cout << "Good\n";
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,661 | 800,662 | u352248517 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == s[i + 1]) {
good = false;
break;
}
}
if (good) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
good = false;
break;
}
}
if (good) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,681 | 800,682 | u045368371 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char input[100];
int i = 0;
cin >> input;
if (input[0] == input[1] || input[1] == input[2] || input[2] == input[3]) {
i++;
} else if (i == 0) {
cout << "Good" << endl;
} else if (i != 0) {
cout << "Bad" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char input[100];
int i = 0;
cin >> input;
if (input[0] == input[1] || input[1] == input[2] || input[2] == input[3]) {
i++;
}
if (i == 0) {
cout << "Good" << endl;
} else if (i != 0) {
cout << "Bad" << endl;
}
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 800,692 | 800,693 | u705509942 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "bad";
return 0;
}
}
cout << "good";
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,694 | 800,695 | u724012411 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "Good";
cin >> s;
for (int i = 0; i < 2; i++) {
if (s.at(i) == s.at(i + 1)) {
ans = "Bad";
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "Good";
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == s.at(i + 1)) {
ans = "Bad";
break;
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,696 | 800,697 | u071019032 | cpp |
p02993 | //
// respect the past, embrace the future
//
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#includ... | //
// respect the past, embrace the future
//
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#includ... | [
"expression.operation.unary.add"
] | 800,700 | 800,701 | u656672211 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool A = false;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == S.at(i + 1))
A = true;
}
if (A == true)
cout << "Bad" << endl;
else if (A == false)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool A = false;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == S.at(i + 1))
A = true;
}
if (A == true)
cout << "Bad" << endl;
else if (A == false)
cout << "Good" << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 800,702 | 800,703 | u429665788 | cpp |
p02993 | #include <iostream>
using namespace std;
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;
}
| #include <iostream>
using namespace std;
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;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,708 | 800,709 | u767923114 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int flag = 0;
for (int i = 0; i < 4; i++) {
if (i < 3) {
if (s[i] == s[i + 1])
flag = 1;
}
}
if (flag == 1)
cout << "Bad";
else
cout << "Bad";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int flag = 0;
for (int i = 0; i < 4; i++) {
if (i < 3) {
if (s[i] == s[i + 1])
flag = 1;
}
}
if (flag == 1)
cout << "Bad";
else
cout << "Good";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,712 | 800,713 | u056766050 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 1; i < s.length(); ++i) {
if (s[i] == s[i - 1]) {
cout << "Bad\n";
}
return 0;
}
cout << "Good\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 1; i < s.length(); ++i) {
if (s[i] == s[i - 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
}
| [] | 800,714 | 800,715 | u031432512 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<char> s(4);
rep(i, 4) cin >> s.at(i);
string ans;
rep(i, 3) {
if (s.at(i) != s.at(i + 1)) {
ans = "Yes";
} else {
ans = "No";
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<char> s(4);
rep(i, 4) cin >> s.at(i);
string ans;
rep(i, 3) {
if (s.at(i) != s.at(i + 1)) {
ans = "Good";
} else {
ans = "Bad";
break;
}
}
cout << ans << endl;
} | [
"literal.string.change",
"assignment.value.change"
] | 800,719 | 800,720 | u902140923 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string ans = "Good";
vector<int> s;
rep(i, 4) { cin >> s[i]; }
rep(i, 3) {
if (s[i] == s[i + 1])
ans = "Bad";
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string ans = "Good";
string s;
rep(i, 4) { cin >> s[i]; }
rep(i, 3) {
if (s[i] == s[i + 1])
ans = "Bad";
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 800,721 | 800,722 | u405620865 | 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;
void solve() {
char ch[4 + 1];
scanf("%s", &ch);
string ans = "Good";
if (ch[0] == ch[1] || ch[1] == ch[2] || ch[3] == ch[4]) {
ans = "Bad";
}
cout << ans << "\n";
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
void solve() {
char ch[4 + 1];
scanf("%s", &ch);
string ans = "Good";
if (ch[0] == ch[1] || ch[1] == ch[2] || ch[2] == ch[3]) {
ans = "Bad";
}
cout << ans << "\n";
}
int main() {
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,727 | 800,728 | u794280735 | cpp |
p02993 | #include "bits/stdc++.h"
#pragma once
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) or s.at(1) == s.at(2) or s.at(2) == s.at(3))
puts("Bad");
else
puts("No");
} | #include "bits/stdc++.h"
#pragma once
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) or s.at(1) == s.at(2) or s.at(2) == s.at(3))
puts("Bad");
else
puts("Good");
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 800,729 | 800,730 | u102067593 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(0) == a.at(1) || a.at(1) == a.at(2) || a.at(0) == a.at(1)) {
cout << "Bad" << endl;
}
else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(0) == a.at(1) || a.at(1) == a.at(2) || a.at(2) == a.at(3)) {
cout << "Bad" << endl;
}
else {
cout << "Good" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 800,735 | 800,736 | u165771525 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b = 0, min = 1000000000;
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
b = 1;
}
if (b == 1)
cout << "Good\n";
else
cout << "Bad\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b = 0;
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
b = 1;
}
if (b != 1)
cout << "Good\n";
else
cout << "Bad\n";
}
| [
"variable_declaration.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,740 | 800,741 | u240895927 | cpp |
p02993 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i - 1] == s[i]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 800,742 | 800,743 | u154833883 | cpp |
p02993 | #include <iostream>
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 << "Go" << endl;
}
| #include <iostream>
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,746 | 800,747 | u902803949 | cpp |
p02993 | #include <iostream>
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 <iostream>
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",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,748 | 800,747 | u902803949 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if ((s[0] == s[1]) || (s[1] == s[2]) || (s[2] == s[3]))
cout << "Bud" << endl;
else
cout << "Good" << endl;
}
| #include <iostream>
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,749 | 800,747 | u902803949 | cpp |
p02993 | #include <iostream>
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 << "Bud" << endl;
}
| #include <iostream>
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",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,750 | 800,747 | u902803949 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
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;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
for (int i = 0; i < 3; i++)
if (s[i] == s[i + 1]) {
cout << "Bad\n";
;
return 0;
}
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change",
"expression.operation.binary.remove"
] | 800,757 | 800,758 | u931911335 | cpp |
p02993 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,759 | 800,760 | u834415466 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool f = true;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
f = false;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool f = true;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
f = false;
... | [
"control_flow.break.add"
] | 800,773 | 800,774 | u979078704 | cpp |
p02993 | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define orta ((bas + son) / 2)
#define ort ((bas + son + 1ll) / 2ll)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace st... | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k + k)
#define sag (k + k + 1)
#define orta ((bas + son) / 2)
#define ort ((bas + son + 1ll) / 2ll)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace st... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,775 | 800,776 | u863190862 | cpp |
p02993 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<bool> vb... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<bool> vb... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,777 | 800,778 | u376082984 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [] | 800,785 | 800,786 | u033627628 | cpp |
p02993 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
string str;
int flag = 0;
for (int i = 1; i < 4; i++) {
if (str[i - 1] == str[i])
flag = 1;
}
if (flag == 1)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
string str;
cin >> str;
int flag = 0;
for (int i = 1; i < 4; i++) {
if (str[i - 1] == str[i])
flag = 1;
}
if (flag == 1)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [] | 800,791 | 800,792 | u163149221 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string a;
cin >> a;
if (a[0] != a[1] && a[1] != a[2]) {
if (a[2] != a[3])
cout << "Good" << endl;
else
cout << "Bad" << endl;
} else
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string a;
cin >> a;
if (a[0] != a[1] && a[1] != a[2]) {
if (a[2] != a[3])
cout << "Good" << endl;
else
cout << "Bad" << endl;
} else
cout << "Bad" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,802 | 800,803 | u551813187 | 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;
cin >> s;
rep(i, 2) {
if ((int)s.at(i) == (int)s.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
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;
rep(i, 3) {
if ((int)s.at(i) == (int)s.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 800,804 | 800,805 | u399819590 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char c = s[0];
for (int i = 1; i < 3; i++) {
if (c == s[i]) {
cout << "Bad" << endl;
return 0;
}
c = s[i];
}
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char c = s[0];
for (int i = 1; i < 4; i++) {
if (c == s[i]) {
cout << "Bad" << endl;
return 0;
}
c = s[i];
}
cout << "Good" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,809 | 800,810 | u632094970 | cpp |
p02993 | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
using namespace std;
// typedef
typedef ... | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
using namespace std;
// typedef
typedef ... | [
"expression.operation.binary.remove"
] | 800,817 | 800,818 | u226951654 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s.at(0) == s.at(1)) {
a++;
break;
}
if (s.at(i) == s.at(i + 1) || s.at(i + 1) == s.at(i + 2)) {
a++;
break;
}
}
if (a == 0)
cout << "Bad" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s.at(0) == s.at(1)) {
a++;
break;
}
if (s.at(i) == s.at(i + 1) || s.at(i + 1) == s.at(i + 2)) {
a++;
break;
}
}
if (a == 0)
cout << "Good"... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,819 | 800,820 | u814465158 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool judge = true;
for (int i = 0; i < 4; i++) {
if (S[i] == S[(i + 1) % 4]) {
judge = false;
}
}
cout << (judge ? "Good" : "Bad") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool judge = true;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
judge = false;
}
}
cout << (judge ? "Good" : "Bad") << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 800,823 | 800,824 | u267265758 | cpp |
p02993 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
int S[10];
scanf("%s", S);
if (S[0] == S[1... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
char S[10];
scanf("%s", S);
if (S[0] == S[... | [
"variable_declaration.type.primitive.change"
] | 800,827 | 800,828 | u103357948 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
int main() {
vector<int> s(4);... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
int main() {
vector<char> s(4)... | [
"variable_declaration.type.primitive.change"
] | 800,831 | 800,832 | u726450206 | cpp |
p02993 | /// A drunk man will find his way home, but a drunk bird may get lost forever...
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define int long long
#define sz(x) (int)x.size()
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
strin... | /// A drunk man will find his way home, but a drunk bird may get lost forever...
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define int long long
#define sz(x) (int)x.size()
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
strin... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,837 | 800,838 | u361937441 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int i;
for (i = 0; i < l - 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int i;
for (i = 0; i < l - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,845 | 800,846 | u621527413 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int i;
for (i = 0; i < l - 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int i;
for (i = 0; i < l - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 800,847 | 800,846 | u621527413 | cpp |
p02993 | // atcoder/abc131/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | // atcoder/abc131/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | [
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 800,848 | 800,849 | u768334187 | 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;
break;
} else {
if (i == 2) {
cout << "good" << endl;
} else {
continue;
}
}
}
} | #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;
break;
} else {
if (i == 2) {
cout << "Good" << endl;
} else {
continue;
}
}
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,862 | 800,863 | u747415691 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 1; i < 3; i++) {
if (S[i - 1] == S[i] and S[i + 1] == S[i]) {
flag++;
break;
}
}
if (flag != 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 1; i < 3; i++) {
if (S[i - 1] == S[i] or S[i + 1] == S[i]) {
flag++;
break;
}
}
if (flag != 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 800,866 | 800,867 | u938317342 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define COUT(n) cout << n << " " << flush
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
int main() {
bool f = true;
char s[5];
cin >> s;
FOR(3) {
if ... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define COUT(n) cout << n << " " << flush
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
int main() {
bool f = true;
char s[5];
cin >> s;
FOR(3) {
if ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,868 | 800,869 | u273004731 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int arr[4];
for (int i = 0; i < 4; i++)
cin >> arr[i];
if (arr[0] == arr[1] || arr[1] == arr[2] || arr[2] == arr[3])
cout << "bad";
else
cout << "good";
return 0;
} | #include <iostream>
using namespace std;
int main() {
char arr[4];
for (int i = 0; i < 4; i++)
cin >> arr[i];
if (arr[0] == arr[1] || arr[1] == arr[2] || arr[2] == arr[3])
cout << "Bad";
else
cout << "Good";
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,870 | 800,871 | u871166059 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
bool flag = true;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = false;
break;
}
}
if (flag) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = true;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = false;
break;
}
}
if (flag) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
} | [] | 800,889 | 800,890 | u522506260 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 1; i <= 3; i++) {
if (a[i] == a[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 1; i <= 3; i++) {
if (a[i] == a[i - 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,907 | 800,908 | u847127726 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
} | #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";
return 0;
}
}
cout << "Good";
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,909 | 800,910 | u534015096 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout << "bad";
return 0;
}
}
cout << "good";
} | #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";
return 0;
}
}
cout << "Good";
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,911 | 800,910 | u534015096 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
if (s[0] == s[1]) {
cout << "Bad" << endl;
a++;
}
if (s[1] == s[2]) {
cout << "Bad" << endl;
a++;
}
if (s[2] == s[3]) {
cout << "Bad" << endl;
a++;
}
if (a == 0) {
cout... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
if (s[0] == s[1]) {
cout << "Bad" << endl;
a++;
} else if (s[1] == s[2]) {
cout << "Bad" << endl;
a++;
} else if (s[2] == s[3]) {
cout << "Bad" << endl;
a++;
}
if (a == 0) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 800,912 | 800,913 | u738164318 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char a = S[0];
char b = S[1];
char c = S[2];
char d = S[3];
if (a == b || b == c || c == d) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char a = S[0];
char b = S[1];
char c = S[2];
char d = S[3];
if (a == b || b == c || c == d) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,914 | 800,915 | u101777447 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b ... | [
"call.arguments.change"
] | 800,921 | 800,922 | u790461875 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
}
else {
cout << "Good" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
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;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 800,923 | 800,924 | u625522718 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char s[4];
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char s[4];
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[... | [
"literal.string.change",
"io.output.change"
] | 800,929 | 800,930 | u026620445 | cpp |
p02993 | #define DBG 0 // submission 0
#if DBG == 1
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
int main() {
// long long ans = 0,sum = 0;
// long long N,K;
int i, j, k, tmp = 0;
string S;
... | #define DBG 0 // submission 0
#if DBG == 1
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
int main() {
// long long ans = 0,sum = 0;
// long long N,K;
int i, j, k, tmp = 0;
string S;
... | [
"literal.string.change",
"io.output.change"
] | 800,935 | 800,936 | u099619676 | 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 << "Yes" << endl;
else
cout << "No" << 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 << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 800,946 | 800,947 | u854161810 | cpp |
p02993 | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "bad" << endl;
return 0;
}
}
cout << "good" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,948 | 800,949 | u762674876 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> num(4);
for (int &x : num) {
cin >> x;
}
for (int i = 0; i < 3; i++) {
if (num[i + 1] == num[i]) {
cout << "Bad" << endl;
;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> num(4);
for (char &x : num) {
cin >> x;
}
for (int i = 0; i < 3; i++) {
if (num[i + 1] == num[i]) {
cout << "Bad" << endl;
;
return 0;
}
}
cout << "Good" << endl;
} | [
"variable_declaration.type.primitive.change"
] | 800,954 | 800,955 | u351265848 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + ... | [
"literal.number.change",
"call.arguments.change"
] | 800,960 | 800,961 | u620242073 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
vector<char> s(4);
rep(i, 4) cin >> s.at(i);
rep(i, 3) {
if (s.at(i) == s.at(i + 1))
cout << "B... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
vector<char> s(4);
rep(i, 4) cin >> s.at(i);
rep(i, 3) {
if (s.at(i) == s.at(i + 1)) {
cout << ... | [] | 800,980 | 800,981 | u376234649 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "Good";
cin >> s;
int num = s.size();
char tem = s[0];
for (int i = 1; i < num - 1; ++i) {
if (tem == s[i]) {
ans = "Bad";
}
tem = s[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "Good";
cin >> s;
int num = s.size();
char tem = s[0];
for (int i = 1; i < num; ++i) {
if (tem == s[i]) {
ans = "Bad";
}
tem = s[i];
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 801,006 | 801,007 | u812874294 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
using namespace std;
int main(void) {
// Your code here!
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad";
} else {
cout << "God";
}
cout << endl;
}
| #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
using namespace std;
int main(void) {
// Your code here!
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad";
} else {
cout << "Good";
}
cout << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 801,012 | 801,013 | u361036928 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
flag = true;
break;
}
}
if (flag == true)
cout << 'Bad' << endl;
else
cout << 'Good' << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
flag = true;
break;
}
}
if (flag == true)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 801,026 | 801,027 | u204523044 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
flag = true;
break;
}
}
if (flag == true)
cout << 'Bad' << endl;
else
cout << 'Bad' << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
flag = true;
break;
}
}
if (flag == true)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 801,028 | 801,027 | u204523044 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool hantei = false;
for (int i = 0; i < 2; i++) {
if (S.at(i) == S.at(i + 1)) {
hantei = true;
break;
}
}
if (hantei) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool hantei = false;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
hantei = true;
break;
}
}
if (hantei) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,042 | 801,043 | u776056110 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define unsigned long ul
#define long long ll
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define unsigned long ul
#define long long ll
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 801,048 | 801,049 | u948212340 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s;
cin >> s;
int lastDigit = -1;
for (auto &x : s) {
int curDigit = x - '0';
if (lastDigit == curDigit) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s;
cin >> s;
int lastDigit = -1;
for (auto &x : s) {
int curDigit = x - '0';
if (lastDigit == curDigit) {
cout << "Bad\n";
return 0;
}
lastDigit = curDigit;
... | [
"assignment.add"
] | 801,052 | 801,053 | u804448625 | cpp |
p02993 | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S, ans;
cin >> S;
repeat(i, 3) {
if (S[i] == S[i + 1]) {
ans = "Bad";
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S, ans;
cin >> S;
repeat(i, 3) {
if (S[i] == S[i + 1]) {
ans = "Bad";
break;
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| [
"control_flow.break.add"
] | 801,065 | 801,066 | u726060136 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
bool flag = true;
int c, c2 = 'a';
for (int i = 0; i < 4; i++) {
cin >> c;
if (c == c2)
flag = false;
c2 = c;
}
if (flag)
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #include <iostream>
using namespace std;
int main() {
bool flag = true;
char c, c2 = 'a';
for (int i = 0; i < 4; i++) {
cin >> c;
if (c == c2)
flag = false;
c2 = c;
}
if (flag)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 801,075 | 801,076 | u716314620 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
#include <cmath>
#include <cstdio>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
//#include <iomanip>
#include <cctype>
#include <stdlib.... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
#include <cmath>
#include <cstdio>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
//#include <iomanip>
#include <cctype>
#include <stdlib.... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 801,077 | 801,078 | u565624841 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> S(4);
for (int i = 0; i < 3; i++) {
cin >> S.at(i);
}
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() {
vector<char> S(4);
for (int i = 0; i < 4; i++) {
cin >> S.at(i);
}
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;
}
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,079 | 801,080 | u083447997 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> S(4);
for (int i = 0; i < 4; i++) {
cin >> S.at(i);
}
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() {
vector<char> S(4);
for (int i = 0; i < 4; i++) {
cin >> S.at(i);
}
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;
}
}
| [
"variable_declaration.type.primitive.change"
] | 801,081 | 801,080 | u083447997 | cpp |
p02993 | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int flag = 0;
int s1, s2;
for (int i = 0; i < 3; i++) {
s1 = s[i] - '0';
s2 = s[i + 1] - '0';
if (abs(s1 - s2) == 1) {
flag = 1;
}
}
if (flag == 1) {
cout << "Bad" << endl;
} else {
cout << "Goo... | #include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int flag = 0;
int s1, s2;
for (int i = 0; i < 3; i++) {
s1 = s[i] - '0';
s2 = s[i + 1] - '0';
if (abs(s1 - s2) == 0) {
flag = 1;
}
}
if (flag == 1) {
cout << "Bad" << endl;
} else {
cout << "Goo... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 801,086 | 801,087 | u297292406 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool isgood;
if (s[0] == s[1])
isgood = false;
if (s[1] == s[2])
isgood = false;
if (s[2] == s[3])
isgood = false;
cout << (isgood ? "Good" : "Bad") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool isgood = true;
if (s[0] == s[1])
isgood = false;
if (s[1] == s[2])
isgood = false;
if (s[2] == s[3])
isgood = false;
cout << (isgood ? "Good" : "Bad") << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 801,101 | 801,102 | u162080911 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < s.size() - 1; i++)
flag = flag || (s[i] == s[i + 1]);
if (flag) {
cout <... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < s.size() - 1; i++)
flag = flag || (s[i] == s[i + 1]);
if (flag) {
cout <... | [
"literal.string.change",
"io.output.change"
] | 801,107 | 801,108 | u735008991 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int count = 1;
for (int i = 1; i < 4; i++) {
if (s[i] == s[i + 1]) {
count = 0;
}
}
if (count == 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int count = 1;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
count = 0;
}
}
if (count == 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 801,111 | 801,112 | u374765578 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.