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() {
vector<int> vec(4);
for (int i = 0; i < 4; i++) {
cin >> vec.at(i);
}
if (vec[0] == vec[1] || vec[1] == vec[2] || vec[2] == vec[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> vec(4);
for (int i = 0; i < 4; i++) {
cin >> vec.at(i);
}
if (vec[0] == vec[1] || vec[1] == vec[2] || vec[2] == vec[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"variable_declaration.type.primitive.change"
] | 801,122 | 801,123 | u121538479 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "Good";
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
ans = "Bad";
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "Good";
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
ans = "Bad";
break;
}
}
cout << ans << endl;
} | [] | 801,124 | 801,125 | u650773146 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> data(4);
for (int i = 0; i < 4; i++) {
cin >> data.at(i);
}
if (data.at(0) == data.at(1)) {
cout << "Bad" << endl;
} else if (data.at(1) == data.at(2)) {
cout << "Bad" << endl;
} else if (data.at(2) == data.at(3)) {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> data(4);
for (int i = 0; i < 4; i++) {
cin >> data.at(i);
}
if (data.at(0) == data.at(1)) {
cout << "Bad" << endl;
} else if (data.at(1) == data.at(2)) {
cout << "Bad" << endl;
} else if (data.at(2) == data.at(3)) {
c... | [
"variable_declaration.type.primitive.change"
] | 801,130 | 801,131 | u995485610 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = -1000;
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";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = -1000;
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";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,143 | 801,144 | u702142173 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ch = 1;
for (int i = 1; i < 3; i++)
if (s[i] == s[i - 1])
ch = 0;
if (ch)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ch = 1;
for (int i = 1; i < 4; i++)
if (s[i] == s[i - 1])
ch = 0;
if (ch)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,172 | 801,173 | u846947849 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
int l = s.size();
for (int i = 0; i < l - 1; i++) {
if (s[i] == s[i + 1]) {
flag = true;
} else {
continue;
}
}
if (flag = true) {
cout << "Bad" << endl;
} else {
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
int l = s.size();
for (int i = 0; i < l - 1; i++) {
if (s[i] == s[i + 1]) {
flag = true;
} else {
continue;
}
}
if (flag == true) {
cout << "Bad" << endl;
} else {
cout << ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 801,176 | 801,177 | u756698981 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int ans;
string s;
int main() {
cin >> s;
if (s[0] == s[1])
ans++;
if (s[1] == s[2])
ans++;
if (s[2] == s[3])
ans++;
if (ans == 3) {
cout << "Good";
} else {
cout << "Bad"; // 1ใ่กจ็คบใใใ
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int ans;
string s;
int main() {
cin >> s;
if (s[0] == s[1])
ans++;
if (s[1] == s[2])
ans++;
if (s[2] == s[3])
ans++;
if (ans == 0) {
cout << "Good";
} else {
cout << "Bad"; // 1ใ่กจ็คบใใใ
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 801,180 | 801,181 | u820341516 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int ans;
string s;
int main() {
cin >> s;
if (s[0] == s[1])
ans++;
if (s[1] == s[2])
ans++;
if (s[2] == s[3])
ans++;
if (ans == 3) {
cout << "Bad";
} else {
cout << "Good"; // 1ใ่กจ็คบใใใ
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int ans;
string s;
int main() {
cin >> s;
if (s[0] == s[1])
ans++;
if (s[1] == s[2])
ans++;
if (s[2] == s[3])
ans++;
if (ans == 0) {
cout << "Good";
} else {
cout << "Bad"; // 1ใ่กจ็คบใใใ
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 801,182 | 801,181 | u820341516 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ans;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
ans = "Bad";
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ans;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
ans = "Bad";
break;
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| [
"control_flow.break.add"
] | 801,191 | 801,192 | u736498127 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ans;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
ans = "Bad";
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
string ans;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
ans = "Bad";
break;
} else {
ans = "Good";
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,193 | 801,192 | u736498127 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
char cur = '#';
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == cur) {
cout << "bad";
return 0;
} else {
cur = S[i];
}
}
cout << "Good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
char cur = '#';
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == cur) {
cout << "Bad";
return 0;
} else {
cur = S[i];
}
}
cout << "Good";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,194 | 801,195 | u703503553 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string str;
bool flag = false;
cin >> str;
// cout << str;
for (int i = 1; i < 4; i++) {
if (str.c_str()[i] == str.c_str()[i - 1])
flag = true;
}
if (flag == false) {
cout << "good\n";
} else {
cout << "bad\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string str;
bool flag = false;
cin >> str;
// cout << str;
for (int i = 1; i < 4; i++) {
if (str.c_str()[i] == str.c_str()[i - 1])
flag = true;
}
if (flag == false) {
cout << "Good\n";
} else {
cout << "Bad\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,198 | 801,199 | u198979194 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bab" << endl;
else
cout << "Good" << endl;
} | #include <iostream>
#include <string>
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"
] | 801,209 | 801,210 | u098652914 | cpp |
p02993 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MOD (ll)1e9 + 7
#define sMO... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MOD (ll)1e9 + 7
#define sMO... | [
"variable_declaration.type.change"
] | 801,230 | 801,231 | u129134470 | cpp |
p02993 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
string s;
cin >> s;
string ans = "Good";
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
ans = "bad";
cout << ans << endl;
} | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
string s;
cin >> s;
string ans = "Good";
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
ans = "Bad";
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 801,241 | 801,242 | u677400065 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[1] == s[3])
cout << "Bad";
else
cout << "Good";
} | #include <bits/stdc++.h>
using namespace std;
main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,262 | 801,263 | u081396780 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
int32_t main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i - 1])
good = false;
}
if (good)
cout << "Good\n";
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
int32_t main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1])
good = false;
}
if (good)
cout << "Good\n";
else
cout << ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,268 | 801,269 | u455309216 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
if (s[1] == s[2])
cout << "Bad" << endl;
if (s[2] == s[3])
cout << "Bad" << endl;
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
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;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 801,270 | 801,271 | u962942039 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[3];
cin >> 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>
using namespace std;
int main() {
char S[4];
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 801,275 | 801,276 | u057109063 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[100];
bool x = true;
if (s[0] == s[1])
x = false;
if (s[1] == s[2])
x = false;
if (s[2] == s[3])
x = false;
if (x) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool x = true;
if (s[0] == s[1])
x = false;
if (s[1] == s[2])
x = false;
if (s[2] == s[3])
x = false;
if (x) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"variable_declaration.type.change"
] | 801,277 | 801,278 | u810066979 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int f = 0;
if (s[0] == s[1]) {
f = 1;
}
if (s[1] == s[2]) {
f = 1;
}
if (s[2] == s[3]) {
f = 1;
}
if (f == 1) {
cout << "Bad" << endl;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int f = 0;
if (s[0] == s[1]) {
f = 1;
}
if (s[1] == s[2]) {
f = 1;
}
if (s[2] == s[3]) {
f = 1;
}
if (f == 1) {
cout << "Bad" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 801,286 | 801,287 | u673521037 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int const INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, ans = "Good";
for (int i = 0; i < 3; i++)
if (s[i] == s[i + 1])
ans = "Bad";
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
Int const INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, ans = "Good";
cin >> s;
for (int i = 0; i < 3; i++)
if (s[i] == s[i + 1])
ans = "Bad";
cout << ans << '\n';
} | [] | 801,300 | 801,301 | u735089337 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == s[i - 1]) {
puts("Bad");
return 0;
}
}
puts("Good");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
puts("Bad");
return 0;
}
}
puts("Good");
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,307 | 801,308 | u699750662 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
vector<unsigned long long> next_p_mod(unsigned N,
long long mod) { // next_permutation
vector<unsigned long long> Next_p(N);
unsigned long long Next_p_buff = 1;
for (int i = 0; i < N; i++) {
Next_p_buff *= (i + 1) % mod;
... | #include <bits/stdc++.h>
using namespace std;
vector<unsigned long long> next_p_mod(unsigned N,
long long mod) { // next_permutation
vector<unsigned long long> Next_p(N);
unsigned long long Next_p_buff = 1;
for (int i = 0; i < N; i++) {
Next_p_buff *= (i + 1) % mod;
... | [
"literal.string.change",
"io.output.change"
] | 801,317 | 801,318 | u390712114 | 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";
else
cout << "Bad";
} | #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";
else
cout << "Bad";
} | [
"control_flow.branch.if.condition.change"
] | 801,330 | 801,331 | u278788045 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | [] | 801,332 | 801,333 | u791593901 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char s[4];
int flag = 0;
for (int i = 0; i < 3; i++)
cin >> s[i];
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
} else {
continue;
}
}
if (flag == 0) {
printf("Good"... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char s[4];
int flag = 0;
for (int i = 0; i < 4; i++)
cin >> s[i];
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
} else {
continue;
}
}
if (flag == 0) {
printf("Good"... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,337 | 801,338 | u029234056 | cpp |
p02993 | #include <iostream>
#include <string>
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;
} | #include <iostream>
#include <string>
using namespace std;
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;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 801,359 | 801,360 | u308077140 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 801,363 | 801,364 | u255001744 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
std::string s;
cin >> s;
cout << ((s[0] == s[1] || s[1] == s[2] || s[3] == s[4]) ? "Bad" : "Good")
<< endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
std::string s;
cin >> s;
cout << ((s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) ? "Bad" : "Good")
<< endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 801,369 | 801,370 | u603356062 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
string n;
int main() {
cin >> n;
if (n[3] == n[2] || n[2] == n[1] || n[1] == n[0]) {
cout << "BAD\n";
} else
cout << "GOOD\n";
}
| #include <bits/stdc++.h>
using namespace std;
string n;
int main() {
cin >> n;
if (n[3] == n[2] || n[2] == n[1] || n[1] == n[0]) {
cout << "Bad\n";
} else
cout << "Good\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,371 | 801,372 | u081652315 | cpp |
p02993 | #define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4 - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "good" << endl;
}
| #define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4 - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,375 | 801,376 | u692558379 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char t, k;
int m, i, d;
m = 0;
string S;
cin >> S;
for (i = 0; i <= 4; i++) {
d = i + 1;
t = S[i];
k = S[d];
if (t == k) {
m = 1;
}
}
if (m == 1) {
cout << "Bad";
} else {
cout << "Good";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
char t, k;
int m, i, d;
m = 0;
string S;
cin >> S;
for (i = 0; i <= 2; i++) {
d = i + 1;
t = S[i];
k = S[d];
if (t == k) {
m = 1;
}
}
if (m == 1) {
cout << "Bad";
} else {
cout << "Good";
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 801,379 | 801,380 | u122578548 | cpp |
p02993 | #include <iostream>
using namespace std;
#define number 4
int main() {
char s[number];
int flag = 0, i;
scanf("%s", s);
for (i = 0; i < number - 1; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
break;
}
}
if (flag == 0)
cout << "Good" << endl;
else
cout << "But" << endl;
retu... | #include <iostream>
using namespace std;
#define number 4
int main() {
char s[number];
int flag = 0, i;
scanf("%s", s);
for (i = 0; i < number - 1; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
break;
}
}
if (flag == 0)
cout << "Good" << endl;
else
cout << "Bad" << endl;
retu... | [
"literal.string.change",
"io.output.change"
] | 801,381 | 801,382 | u691257172 | cpp |
p02993 | #include <iostream>
using namespace std;
#define number 4
int main() {
char s[number];
int flag = 0, i;
scanf("%s", s);
for (i = 0; i < number - 1; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
break;
}
}
if (flag == 0)
cout << "good" << endl;
else
cout << "but" << endl;
retu... | #include <iostream>
using namespace std;
#define number 4
int main() {
char s[number];
int flag = 0, i;
scanf("%s", s);
for (i = 0; i < number - 1; i++) {
if (s[i] == s[i + 1]) {
flag = 1;
break;
}
}
if (flag == 0)
cout << "Good" << endl;
else
cout << "Bad" << endl;
retu... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,383 | 801,382 | u691257172 | cpp |
p02993 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
string S;
cin >> S;
char _s = S[0];
for (int i = 1; i < S.size(); i++) {
if (_s != S[i]) {
cout << "Bad" << endl;
return 0;
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
string S;
cin >> S;
char _s = S[0];
for (int i = 1; i < S.size(); i++) {
if (_s == S[i]) {
cout << "Bad" << endl;
return 0;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 801,392 | 801,393 | u465512973 | cpp |
p02993 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, p, n) for (ll i = p; i < ll(n... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, p, n) for (ll i = p; i < ll(n... | [
"literal.string.change",
"io.output.change"
] | 801,409 | 801,410 | u039041830 | cpp |
p02993 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
int main() {
std::string S;
std::cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
;
std::cout << "Bad" << std::endl;
exit(0);
std::cout << "Good" << std::endl;
}
} | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
int main() {
std::string S;
std::cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
std::cout << "Bad" << std::endl;
exit(0);
}
}
std::cout << "Good" << std::endl;
} | [] | 801,437 | 801,438 | u829249049 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
ans = true;
}
}
cout << (ans ? "Good" : "Bad") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
ans = true;
}
}
cout << (ans ? "Bad" : "Good") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 801,441 | 801,442 | u263351103 | cpp |
p02993 | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 1000005
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | [
"literal.string.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 801,443 | 801,444 | u533101919 | cpp |
p02993 | #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;
} | #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;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,445 | 801,446 | u016092854 | cpp |
p02993 | #include <stdio.h>
int main() {
char a, b, c, d;
scanf("%c%c%c%c", &a, &b, &c, &d);
if (a == b || b == c || c == d)
printf("BaD\n");
else
printf("Good\n");
return 0;
} | #include <stdio.h>
int main() {
char a, b, c, d;
scanf("%c%c%c%c", &a, &b, &c, &d);
if (a == b || b == c || c == d)
printf("Bad\n");
else
printf("Good\n");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 801,451 | 801,452 | u423624748 | cpp |
p02993 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
char x = s[0];
for (int i = 1; i < s.size(); i++) {
if... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
char x = s[0];
for (int i = 1; i < s.size(); i++) {
if... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,464 | 801,465 | u064087840 | cpp |
p02993 | #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
for (size_t i = 0; i < s.length() - 1; ++i) {
if (s.c_str()[i - 0] == s.c_str()[i - 1]) {
std::cout << "Bad" << std::endl;
return 0;
}
}
std::cout << "Good" << std::endl;
return 0;
}
| #include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
for (size_t i = 1; i < s.length(); ++i) {
if (s.c_str()[i - 0] == s.c_str()[i - 1]) {
std::cout << "Bad" << std::endl;
return 0;
}
}
std::cout << "Good" << std::endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 801,473 | 801,474 | u477096296 | cpp |
p02993 | #include <iostream>
using namespace std;
int main(void) {
string s;
bool flag = true;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
flag = false;
}
flag ? cout << "good" << endl : cout << "bad" << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
string s;
bool flag = true;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
flag = false;
}
flag ? cout << "Good" << endl : cout << "Bad" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 801,477 | 801,478 | u712322283 | cpp |
p02993 | #include <iostream>
using namespace std;
int main(void) {
string s;
cin >> s;
for (int i = 0; i < 4 - 1; ++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;
for (int i = 0; i < 4 - 1; ++i) {
if (s[i] == s[i + 1]) {
cout << "Bad\n";
return 0;
}
}
cout << "Good\n";
return 0;
} | [] | 801,481 | 801,482 | u030685402 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PR... | [
"call.arguments.change"
] | 801,483 | 801,484 | u833064541 | cpp |
p02993 | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i + 1]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Yes\n");
} | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i + 1]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Good\n");
} | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 801,485 | 801,486 | u716033247 | cpp |
p02993 | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i + 2]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Yes\n");
} | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i + 1]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Good\n");
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 801,487 | 801,486 | u716033247 | cpp |
p02993 | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Yes\n");
} | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
char inp[100];
int main(void) {
scanf("%s", inp);
for (int i = 0; inp[i + 1]; i++) {
if (inp[i] == inp[i + 1]) {
return !printf("Bad\n");
}
}
return !printf("Good\n");
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 801,488 | 801,486 | u716033247 | cpp |
p02993 | // Dedication has no limitation
// 24 June 2019
// Omori, Japan.
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1]) {
cnt++;
break;
cout << "Bad" << endl;
return 0;
}
}
cout ... | // Dedication has no limitation
// 24 June 2019
// Omori, Japan.
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1]) {
cnt++;
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << ... | [] | 801,492 | 801,493 | u553932989 | cpp |
p02993 | #include <bits/stdc++.h>
#define lld unsigned long long int
#define MAX 900000
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
using namespace std;
char a, b, c, d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
scanf(" %c%c%c%c", &a, &b, &c, &d);
i... | #include <bits/stdc++.h>
#define lld unsigned long long int
#define MAX 900000
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
using namespace std;
char a, b, c, d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
scanf(" %c%c%c%c", &a, &b, &c, &d);
i... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 801,499 | 801,500 | u688109846 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Good";
} else
cout << "Bad";
return 0;
} | #include <iostream>
#include <string>
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",
"io.output.change"
] | 801,509 | 801,510 | u809153881 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"literal.string.change",
"io.output.change"
] | 801,525 | 801,526 | u866107333 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
bool flag = false;
string code;
cin >> code;
for (int i = 0; i < 3; i++) {
if (code[i] == code[i + 1])
flag = true;
break;
}
if (flag)
cout << "Bad" << endl;
else
cout << "Good" << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
bool flag = false;
string code;
cin >> code;
for (int i = 0; i < 3; i++) {
if (code[i] == code[i + 1]) {
flag = true;
break;
}
}
if (flag)
cout << "Bad" << endl;
else
cout << "Good" <<... | [] | 801,528 | 801,529 | u806058793 | cpp |
p02993 | #include <iostream>
using namespace std;
string a;
int main() {
cin >> a;
cout << (a[0] == a[1] || a[1] == a[2] || a[2] == a[3] ? "Good" : "Bad");
return 0;
} | #include <iostream>
using namespace std;
string a;
int main() {
cin >> a;
cout << (a[0] == a[1] || a[1] == a[2] || a[2] == a[3] ? "Bad" : "Good");
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 801,530 | 801,531 | u093170535 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
char b[4];
string ans = "Good";
while (a != 3) {
cin >> b[a];
if (a > 0 && b[a] == b[a - 1]) {
ans = "Bad";
}
a++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
char b[4];
string ans = "Good";
while (a != 4) {
cin >> b[a];
if (a > 0 && b[a] == b[a - 1]) {
ans = "Bad";
}
a++;
}
cout << ans;
return 0;
} | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 801,537 | 801,538 | u651919714 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 3; i++) {
if (abs(n[i] - n[i + 1]) <= 1) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 3; i++) {
if (abs(n[i] - n[i + 1]) <= 0) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 801,548 | 801,549 | u352604942 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (abs(n[i] - n[i + 1]) <= 1) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 3; i++) {
if (abs(n[i] - n[i + 1]) <= 0) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 801,550 | 801,549 | u352604942 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (abs(n[i] - n[i - 1]) <= 1) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 3; i++) {
if (abs(n[i] - n[i + 1]) <= 0) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.numb... | 801,551 | 801,549 | u352604942 | cpp |
p02993 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e16
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Ye... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e16
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Ye... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 801,563 | 801,564 | u297203024 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
cout << str;
for (int i = 0; i < str.size() - 1; i++) {
if (str[i] == str[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size() - 1; i++) {
if (str[i] == str[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| [] | 801,565 | 801,566 | u986889396 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int flag = 0;
cin >> a;
for (int i = 0; i < 3; i++) {
if (a[i] == a[i + 1])
flag = 1;
}
if (flag == 1)
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int flag = 0;
cin >> a;
for (int i = 0; i < 3; i++) {
if (a[i] == a[i + 1])
flag = 1;
}
if (flag == 1)
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"
] | 801,573 | 801,574 | u488842804 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "good";
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
ans = "bad";
break;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "Good";
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
ans = "Bad";
break;
}
}
cout << ans;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 801,575 | 801,576 | u175695388 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
string s;
int cnt;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cnt++;
}
}
if (cnt = 0) {
cout << "Good" << endl;
} else
cout << "Bad" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
string s;
int cnt;
int main() {
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cnt++;
}
}
if (cnt == 0) {
cout << "Good" << endl;
} else
cout << "Bad" << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 801,577 | 801,578 | u294829559 | 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 << "Bad\n";
return 0;
} | #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";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 801,583 | 801,584 | u168474884 | cpp |
p02993 | /*author : Yashvardhan
Sunday, June 23, 2019
12:25 PM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#define mp make_pair
#define endl '\n'
#define al... | /*author : Yashvardhan
Sunday, June 23, 2019
12:25 PM
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#define mp make_pair
#define endl '\n'
#define al... | [
"literal.string.change",
"io.output.change"
] | 801,595 | 801,596 | u368039995 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
bool check = true;
for (int i = 0; i < x.length() - 1; i++) {
if (x[i] == x[i + 1])
check = false;
}
if (check) {
printf("Bad");
} else
printf("Good");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string x;
cin >> x;
bool check = true;
for (int i = 0; i < x.length() - 1; i++) {
if (x[i] == x[i + 1])
check = false;
}
if (!check) {
printf("Bad");
} else
printf("Good");
} | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 801,602 | 801,603 | u545854039 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
good = false;
}
}
cout << (good ? "YES\n" : "NO\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
good = false;
}
}
cout << (good ? "Good\n" : "Bad\n");
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 801,604 | 801,605 | u118501689 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool ans;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
ans = false;
}
if (ans)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool ans = true;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
ans = false;
}
if (ans)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"variable_declaration.value.change"
] | 801,606 | 801,607 | u726501606 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool ans;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
ans = false;
}
if (ans)
cout << "good" << endl;
else
cout << "bad" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool ans = true;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
ans = false;
}
if (ans)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"variable_declaration.value.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,608 | 801,607 | u726501606 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 801,613 | 801,614 | u170650966 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
signed main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Good" << endl;
return 0;
}
}
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
signed 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;
} | [
"literal.string.change",
"io.output.change"
] | 801,623 | 801,624 | u003019316 | cpp |
p02993 | #include <bits/stdc++.h>
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";
return 0;
} | #include <bits/stdc++.h>
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";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,625 | 801,626 | u453299312 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int flag = 1;
for (int i = 0; i < 3; i++)
if (s[i] = s[i + 1])
flag = 0;
string ans = flag ? "Good" : "Bad";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int flag = 1;
for (int i = 0; i < 3; i++)
if (s[i] == s[i + 1])
flag = 0;
string ans = flag ? "Good" : "Bad";
cout << ans << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 801,627 | 801,628 | u877476774 | cpp |
p02993 | // abc131_a
#include <bits/stdc++.h>
using namespace std;
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;
}
return 0;
} | // abc131_a
#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 << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,629 | 801,630 | u798557584 | cpp |
p02993 | #include <bits/stdc++.h>
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 << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
} | #include <bits/stdc++.h>
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;
} | [
"literal.string.change",
"io.output.change"
] | 801,637 | 801,638 | u372798233 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"function.return_value.change"
] | 801,639 | 801,640 | u239375815 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
for (int i = 0; i < (int)s.size() - 1; ++i)
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "good" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
for (int i = 0; i < (int)s.size() - 1; ++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"
] | 801,650 | 801,651 | u319799839 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
for (int i = 0; i < (int)s.size() - 1; ++i)
if (s[i] = s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "good" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
for (int i = 0; i < (int)s.size() - 1; ++i)
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,652 | 801,651 | u319799839 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
// input
string s;
// judge
bool isgood = true;
if (s[0] == s[1])
isgood = false;
if (s[1] == s[2])
isgood = false;
if (s[2] == s[3])
isgood = false;
// output
if (isgood) {
cout << "Good" << endl;
} else {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
// input
string s;
cin >> s;
// judge
bool isgood = true;
if (s[0] == s[1])
isgood = false;
if (s[1] == s[2])
isgood = false;
if (s[2] == s[3])
isgood = false;
// output
if (isgood) {
cout << "Good" << endl;
... | [] | 801,655 | 801,656 | u235837041 | cpp |
p02993 | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
}
if (flag) {
cout << "Good" << end... | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
}
if (flag) {
cout << "Bad" << endl... | [
"literal.string.change",
"io.output.change"
] | 801,663 | 801,664 | u514429645 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
char before;
bool frag = false;
cin >> s;
before = s[0];
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
cout << "Bad" << endl;
frag = true;
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
char before;
bool frag = false;
cin >> s;
before = s[0];
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
cout << "Bad" << endl;
frag = true;
... | [
"control_flow.break.add"
] | 801,669 | 801,670 | u206522261 | cpp |
p02993 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool flag;
for (int i = 1; i < S.length(); i++) {
if (S[i] == S[i - 1]) {
flag = true;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool flag = false;
for (int i = 1; i < S.length(); i++) {
if (S[i] == S[i - 1]) {
flag = t... | [
"variable_declaration.value.change"
] | 801,685 | 801,686 | u490963780 | cpp |
p02993 | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
struct P {
ll var1;
ll var2;
};
bool operator<(const P &one, const P &two) { return one.var1 < two.var1; };
bool operator>(const P &one, const P &two) { return one.var1 > two.var1; };
using namespace std;
signed main() ... | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
struct P {
ll var1;
ll var2;
};
bool operator<(const P &one, const P &two) { return one.var1 < two.var1; };
bool operator>(const P &one, const P &two) { return one.var1 > two.var1; };
using namespace std;
signed main() ... | [
"variable_declaration.value.change"
] | 801,689 | 801,690 | u310710814 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool k = true;
for (int i = 0; i < 3; i++) {
if (S.at(i) = S.at(i + 1)) {
k = false;
}
}
if (k) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool k = true;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
k = false;
break;
}
}
if (k) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 801,693 | 801,694 | u859765185 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int32_t main() {
fast;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int32_t main() {
fast;
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,699 | 801,700 | u670919462 | cpp |
p02993 | #include <iostream>
#include <string.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;
}
| #include <iostream>
#include <string.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",
"literal.string.case.change",
"io.output.change"
] | 801,718 | 801,719 | u573083749 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
string s;
cin >> s;
bool check = false;
for (int i = 0; i < 2; ++i)
... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
string s;
cin >> s;
bool check = false;
for (int i = 0; i < 3; ++i)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,722 | 801,723 | u341957179 | cpp |
p02993 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout <<... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
string s;
cin >> s;
for (int i = 0; i <= 2; i++) {
if (s[i] == s[i + 1]) {
cout <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,733 | 801,734 | u438308496 | cpp |
p02993 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | [
"literal.number.change",
"call.arguments.change"
] | 801,735 | 801,736 | u352350187 | cpp |
p02993 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,739 | 801,740 | u992394626 | cpp |
p02993 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to ... | [
"literal.string.change",
"io.output.change"
] | 801,745 | 801,746 | u580402951 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair;
#define pb push_back;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
rep(i, 3) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair;
#define pb push_back;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
rep1(i, 3) {
if (s... | [
"identifier.change",
"call.function.change"
] | 801,758 | 801,759 | u949755084 | cpp |
p02993 | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
string S;
int main() {
cin >> S;
bool is_bad = false;
for (int i = 0; i < 2; i++) {
if (S[i] == S[i + 1])
is_bad = true;
}
string ans;
if (is_... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
string S;
int main() {
cin >> S;
bool is_bad = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
is_bad = true;
}
string ans;
if (is_... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,764 | 801,765 | u378945900 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a;
if (a[0] == a[1] || a[1] == a[2] || a[3]) {
b = "Bad";
} else {
b = "Good";
}
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a;
if (a[0] == a[1] || a[1] == a[2] || a[2] == a[3]) {
b = "Bad";
} else {
b = "Good";
}
cout << b << endl;
} | [
"control_flow.branch.if.condition.change"
] | 801,766 | 801,767 | u552201227 | cpp |
p02993 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using nam... | [
"literal.string.change",
"io.output.change"
] | 801,768 | 801,769 | u090994275 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string t, ans;
int i;
ans = "Good";
cin >> t;
for (i = 1; i < t.size() - 1; i++) {
if (t.at(i) == t.at(i + 1)) {
ans = "Bad";
} else {
continue;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string t, ans;
int i;
ans = "Good";
cin >> t;
for (i = 0; i < t.size() - 1; i++) {
if (t.at(i) == t.at(i + 1)) {
ans = "Bad";
} else {
continue;
}
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 801,790 | 801,791 | u322067886 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int count = 0;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [] | 801,799 | 801,800 | u801530021 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int count = 0;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 4; i++) {
if (S[i] == S[i + 1]) {
count++;
}
}
if (count > 0) {
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,801 | 801,800 | u801530021 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.