problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
break;
} else if (i = 2) {
cout << "Good" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
break;
} else if (i == 2) {
cout << "Good" << endl;
}
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 801,802 | 801,803 | u201743726 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
char c;
string s;
int j = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
c = s[i];
if (c != 0) {
if (c == s[i - 1]) {
cout << "bad" << endl;
break;
} else {
j++;
}
} else {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
char c;
string s;
int j = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
c = s[i];
if (c != 0) {
if (c == s[i - 1]) {
cout << "Bad" << endl;
break;
} else {
j++;
}
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,804 | 801,805 | u286539644 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
for (int i = 0; i < 4; i++) {
cin >> str[i];
}
if (str[0] == str[1] || str[1] == str[2] || str[2] == str[3]) {
cout << "bad" << endl;
} else {
cout << "good" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
for (int i = 0; i < 4; i++) {
cin >> str[i];
}
if (str[0] == str[1] || str[1] == str[2] || str[2] == str[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,808 | 801,809 | u136685537 | cpp |
p02993 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
for (int i = 0; i <= 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,812 | 801,813 | u192912097 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
string flag("good");
cin >> str;
for (int i = 1; i < 4; ++i)
if (str[i] == str[i - 1]) {
flag = "bad";
break;
}
cout << flag << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
string flag("Good");
cin >> str;
for (int i = 1; i < 4; ++i)
if (str[i] == str[i - 1]) {
flag = "Bad";
break;
}
cout << flag << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"assignment.value.change"
] | 801,814 | 801,815 | u568120967 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
string flag("good");
cin >> str;
for (int i = 1; i < 4; ++i)
if (str[i] == str[i - 1]) {
flag = "bad";
break;
}
cout << flag;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
string flag("Good");
cin >> str;
for (int i = 1; i < 4; ++i)
if (str[i] == str[i - 1]) {
flag = "Bad";
break;
}
cout << flag << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"assignment.value.change",
"io.output.newline.add"
] | 801,816 | 801,815 | u568120967 | cpp |
p02993 | #include <iostream>
int main(int argc, char **argv) {
std::string S;
std::cin >> S;
int ans = 0;
const char *wp = S.c_str();
for (int i = 1; i < S.length() - 1; i++) {
if (*(wp + i - 1) == *(wp + i)) {
ans = 1;
break;
}
}
std::printf("%s\n", ans == 0 ? "Good" : "Bad");
return 0;
} | #include <iostream>
int main(int argc, char **argv) {
std::string S;
std::cin >> S;
int ans = 0;
const char *wp = S.c_str();
for (int i = 1; i < S.length(); i++) {
if (*(wp + i - 1) == *(wp + i)) {
ans = 1;
break;
}
}
std::printf("%s\n", ans == 0 ? "Good" : "Bad");
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 801,831 | 801,832 | u842396874 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[5];
scanf("%s", a);
for (int i = 0; i < 2; i++) {
if (a[i] == a[i + 1]) {
printf("Bad");
return 0;
}
}
printf("Good");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[5];
scanf("%s", a);
for (int i = 0; i < 3; i++) {
if (a[i] == a[i + 1]) {
printf("Bad");
return 0;
}
}
printf("Good");
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,840 | 801,841 | u858741867 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i - 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,853 | 801,854 | u557831058 | 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;
break;
}
}
if (flag == 0) {
cout << "BAD" << endl;
} else {
cout << "GOOD" << endl;
}
return 0;
}
| #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;
break;
}
}
if (flag == 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,855 | 801,856 | u425436575 | 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;
}
}
if (flag == 0) {
cout << "BAD" << endl;
} else {
cout << "GOOD" << endl;
}
return 0;
}
| #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;
break;
}
}
if (flag == 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,857 | 801,856 | u425436575 | cpp |
p02993 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; ++i) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
retur... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
retur... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,879 | 801,880 | u582817680 | cpp |
p02993 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | [
"literal.string.change",
"io.output.change"
] | 801,885 | 801,886 | u054652697 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
bool a = false;
cin >> s;
for (int i = 0; i < 2; ++i) {
if (s[i] == s[i + 1]) {
a = true;
}
}
if (a) {
cout << "Bad";
} else {
cout << "Good";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
bool a = false;
cin >> s;
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1]) {
a = true;
}
}
if (a) {
cout << "Bad";
} else {
cout << "Good";
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,887 | 801,888 | u915047926 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
S... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
S... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 801,893 | 801,894 | u119996667 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
// Data types macros
typedef long long ll;
typedef vector<int> vec;
typedef unsigned long long ull;
typedef unsigned int ui;
// loop macros
#define f(i, s, e) for (long long i = s; i < e; i++)
#define fe(i, s, e) for (long long i = s; i <= e; i++)
#define fr(i, s, e) for... | #include <bits/stdc++.h>
using namespace std;
// Data types macros
typedef long long ll;
typedef vector<int> vec;
typedef unsigned long long ull;
typedef unsigned int ui;
// loop macros
#define f(i, s, e) for (long long i = s; i < e; i++)
#define fe(i, s, e) for (long long i = s; i <= e; i++)
#define fr(i, s, e) for... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,899 | 801,900 | u797339743 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
bool good = false;
cin >> s;
if (s[0] == s[1]) {
} else if (s[1] == s[2]) {
} else if (s[2] == s[3]) {
} else {
good = true;
}
cout << (good == true ? "good" : "bad");
} | #include <iostream>
using namespace std;
int main() {
string s;
bool good = false;
cin >> s;
if (s[0] == s[1]) {
} else if (s[1] == s[2]) {
} else if (s[2] == s[3]) {
} else {
good = true;
}
cout << (good == true ? "Good" : "Bad");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,910 | 801,911 | u492321750 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string in;
cin >> in;
bool is_bad = false;
for (int i = 1; i < 3; ++i) {
if (in[i] == in[i - 1])
is_bad = true;
}
if (is_bad)
cout << "Bad";
else
cout << "Good";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string in;
cin >> in;
bool is_bad = false;
for (int i = 1; i < 4; ++i) {
if (in[i] == in[i - 1])
is_bad = true;
}
if (is_bad)
cout << "Bad";
else
cout << "Good";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,922 | 801,923 | u115641970 | cpp |
p02993 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char n[5];
cin >> n;
if (n[0] == n[1] || n[1] == n[2] || n[2] == n[3])
cout << "Good";
else
cout << "Bad";
return 0;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char n[5];
cin >> n;
if (n[0] == n[1] || n[1] == n[2] || n[2] == n[3])
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"
] | 801,926 | 801,927 | u387480576 | cpp |
p02993 | // shan61916
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
... | // shan61916
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
... | [] | 801,928 | 801,929 | u032226420 | cpp |
p02993 | /*
Mbak Rose Dong
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, x, y, ans, curr, temp;
string a;
cin >> a;
bool can = 1;
for (i = 0; i < 3; i++) {
if (a[i] == a[i + 1])
can = 0;
}
if (can)
cout << "good";
else
cout << "bad";
return 0;
}
| /*
Mbak Rose Dong
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, x, y, ans, curr, temp;
string a;
cin >> a;
bool can = 1;
for (i = 0; i < 3; i++) {
if (a[i] == a[i + 1])
can = 0;
}
if (can)
cout << "Good";
else
cout << "Bad";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,934 | 801,935 | u389388073 | cpp |
p02993 | // A
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool isgood = true;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1])
isgood = false;
}
if (isgood) {
cout << 'Good' << endl;
} else {
cout << 'Bad' << endl;
}
} | // A
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool isgood = true;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1])
isgood = false;
}
if (isgood) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"io.output.change",
"literal.string.change"
] | 801,936 | 801,937 | u295656477 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string n, ret = "Good";
cin >> n;
for (int i = 1; i < 3; ++i)
if (n[i] == n[i - 1])
ret = "Bad";
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string n, ret = "Good";
cin >> n;
for (int i = 1; i < 4; ++i)
if (n[i] == n[i - 1])
ret = "Bad";
cout << ret << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 801,938 | 801,939 | u343441882 | cpp |
p02993 | /// ..:: In The Name Of God ::..
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define endl '\n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#define... | /// ..:: In The Name Of God ::..
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define endl '\n'
#define INF 2e9
#define int ll
#define vi vector<int>
#define vii vector<pii>
#define... | [
"control_flow.loop.for.condition.change",
"call.remove"
] | 801,972 | 801,973 | u809816772 | cpp |
p02993 |
#include <bits/stdc++.h>
using namespace std;
char S[10];
int main() {
int i;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> S;
for (i = 0; i < 0; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char S[10];
int main() {
int i;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> S;
for (i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 801,984 | 801,985 | u627562722 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) (v).begin(), (v).end()
const int M = 1e6 + 7;
int main() {
string s;
cin >> s;
int f = 0;
for (int i = 0; i + 1 < s.size(); i++) {
if (s[i] == s[i + 1]) {
f = 1;
break;
}
}
cout << (f... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) (v).begin(), (v).end()
const int M = 1e6 + 7;
int main() {
string s;
cin >> s;
int f = 0;
for (int i = 0; i + 1 < s.size(); i++) {
if (s[i] == s[i + 1]) {
f = 1;
break;
}
}
cout << (f... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 801,993 | 801,994 | u149999193 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
++counter;
}
if (counter == 0)
cout << "good" << endl;
else
cout << "bad" << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
++counter;
}
if (counter == 0)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,001 | 802,002 | u923435485 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
++counter;
}
if (counter == 0)
cout << 'good' << endl;
else
cout << 'bad' << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
++counter;
}
if (counter == 0)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
}
| [] | 802,003 | 802,002 | u923435485 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[4];
int c = 0;
string str;
cin >> str;
for (int i = 0; i < 4; i++) {
a[i] = (int)(str[i] - '0');
}
for (int j = 1; j < 4; j++) {
if (a[j] - a[j - 1] == 0) {
cout << "bad" << endl;
break... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[4];
int c = 0;
string str;
cin >> str;
for (int i = 0; i < 4; i++) {
a[i] = (int)(str[i] - '0');
}
for (int j = 1; j < 4; j++) {
if (a[j] - a[j - 1] == 0) {
cout << "Bad" << endl;
break... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,004 | 802,005 | u267434042 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char a, b;
cin >> a;
for (int i = 0; i < 2; i++) {
cin >> b;
if (b == a) {
cout << "Bad" << endl;
return 0;
}
a = b;
}
cout << "Good" << endl;
} | #include <iostream>
using namespace std;
int main() {
char a, b;
cin >> a;
for (int i = 0; i < 3; i++) {
cin >> b;
if (b == a) {
cout << "Bad" << endl;
return 0;
}
a = b;
}
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,008 | 802,009 | u505825680 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char a, b;
cin >> a;
for (int i = 0; i < 3; i++) {
cin >> b;
if (b == a) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <iostream>
using namespace std;
int main() {
char a, b;
cin >> a;
for (int i = 0; i < 3; i++) {
cin >> b;
if (b == a) {
cout << "Bad" << endl;
return 0;
}
a = b;
}
cout << "Good" << endl;
} | [
"assignment.add"
] | 802,010 | 802,009 | u505825680 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char str[10];
cin >> str;
int sign;
sign = 0;
if ((str[0] == str[1]) || (str[1] == str[2]) || (str[2] == str[3])) {
cout << "bad\n";
} else {
cout << "good\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
char str[10];
cin >> str;
int sign;
sign = 0;
if ((str[0] == str[1]) || (str[1] == str[2]) || (str[2] == str[3])) {
cout << "Bad\n";
} else {
cout << "Good\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,018 | 802,019 | u477710819 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
char a[N];
int main() {
cin >> a;
int flag = 0;
for (int i = 1; i < 3; i++) {
if (a[i] == a[i - 1])
flag = 1;
}
if (flag)
cout << "Bad" << endl;
else
cout << "Good" << endl;
// cout << "Hello world!" << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
char a[N];
int main() {
cin >> a;
int flag = 0;
for (int i = 1; i <= 3; i++) {
if (a[i] == a[i - 1])
flag = 1;
}
if (flag)
cout << "Bad" << endl;
else
cout << "Good" << endl;
// cout << "Hello world!" << endl;
retu... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,021 | 802,022 | u469341018 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[10];
scanf("%s", s);
for (int i = 0; i < 2; i++)
if (s[i] == s[i + 1])
return puts("Bad"), 0;
puts("Good");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char s[10];
scanf("%s", s);
for (int i = 0; i <= 2; i++)
if (s[i] == s[i + 1])
return puts("Bad"), 0;
puts("Good");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,030 | 802,031 | u699602362 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
else if (s[1] == s[2])
cout << "Bad" << endl;
else if (s[3] == s[4])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,035 | 802,036 | u335770593 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool jud = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
cout << "Bad" << endl;
jud = true;
}
}
if (!jud)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool jud = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
cout << "Bad" << endl;
jud = true;
break;
}
}
if (!jud)
cout << "Good" << endl;
}
| [
"control_flow.break.add"
] | 802,045 | 802,046 | u222866518 | cpp |
p02993 | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char a = s[0];
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
return 0;
cout << "Good" << endl;
return 0;
}
| #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char a = s[0];
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
}
| [
"function.return_value.change"
] | 802,068 | 802,069 | u679071799 | cpp |
p02993 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.string.change",
"io.output.change"
] | 802,074 | 802,075 | u519950235 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
if (S[0] != S[1] && S[1] != S[2] && S[2] != S[3])
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #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;
} | [] | 802,089 | 802,090 | u221582238 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,091 | 802,092 | u983540695 | cpp |
p02993 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
for (int i(0); i < 2; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
for (int i(0); i <= 2; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,093 | 802,094 | u991846372 | cpp |
p02993 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string S;
cin ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string S;
cin ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,109 | 802,110 | u027284591 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define pb push_back
#define endl '\n'
///(Moan) ey (hoe) pakhi jeno (Oral) dibe <3
void fuck() {
string s;
int i, flag = 1;
cin >> s;
for (i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
flag = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define pb push_back
#define endl '\n'
///(Moan) ey (hoe) pakhi jeno (Oral) dibe <3
void fuck() {
string s;
int i, flag = 1;
cin >> s;
for (i = 0; i <= 2; i++) {
if (s[i] == s[i + 1]) {
flag = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,114 | 802,115 | u100452936 | cpp |
p02993 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string num;
cin >> num;
bool ans = false;
for (int i = 0; i < 2; i++) {
if (num.at(i) == num.at(i + 1)) {
ans = true;
break;
}
}
if (ans == true) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
string num;
cin >> num;
bool ans = false;
for (int i = 0; i < 3; i++) {
if (num.at(i) == num.at(i + 1)) {
ans = true;
break;
}
}
if (ans == true) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,116 | 802,117 | u229148215 | 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 (S[i] == S[i + 1]) {
flag = 1;
} else {
}
}
if (flag == 1) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
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 (S[i] == S[i + 1]) {
flag = 1;
} else {
}
}
if (flag == 1) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 802,124 | 802,125 | u453634104 | cpp |
p02993 | // Last Change: 06/22/2019 21:11:48.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <str... | // Last Change: 06/22/2019 21:12:19.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <str... | [
"literal.string.change",
"io.output.change"
] | 802,132 | 802,133 | u915934642 | cpp |
p02993 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
string str;
bool check() {
REP(i, 3) {
if (str[i] == str[i + 1])
return true;
}
return false;
}
int main() {
cin >> str;
if (check())
cout << "Bad" << endl;
... |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
string str;
bool check() {
REP(i, 3) {
if (str[i] == str[i + 1])
return true;
}
return false;
}
int main() {
cin >> str;
if (check())
cout << "Bad" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 802,145 | 802,146 | u538853954 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool flag;
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == s.at(i - 1)) {
flag = 1;
}
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "Good" ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = 0;
for (int i = 1; i < s.size(); i++) {
if (s.at(i) == s.at(i - 1)) {
flag = 1;
}
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "G... | [
"variable_declaration.value.change"
] | 802,153 | 802,154 | u066926272 | cpp |
p02993 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,157 | 802,158 | u802406405 | cpp |
p02993 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [] | 802,166 | 802,167 | u539339654 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define pb(x) push_back(x)
#define int long long
signed main... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define pb(x) push_back(x)
#define int long long
signed main... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 802,172 | 802,173 | u785975381 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int a, b, c, n, m, ans = 0;
string s, t, u;
cin ... | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int a, b, c, n, m, ans = 0;
string s, t, u;
cin ... | [
"literal.number.change",
"call.arguments.change"
] | 802,176 | 802,177 | u022832318 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
string a;
int main() {
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == a[i + 1]) {
cout << "bad";
return 0;
}
}
cout << "good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string a;
int main() {
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == a[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,180 | 802,181 | u730153732 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i < n; i++) ... | [
"variable_declaration.type.primitive.change"
] | 802,186 | 802,187 | u139300044 | cpp |
p02993 | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool good = false;
for (int i = 0; i < s.size() - 1; ++i) {
good |= (s[i] == s[i + 1]);
}
cout << (good ? "Good" : "Bad") << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool good = false;
for (int i = 0; i < s.size() - 1; ++i) {
good |= (s[i] == s[i + 1]);
}
cout << (good ? "Bad" : "Good") << endl;
} | [
"literal.string.change",
"io.output.change"
] | 802,190 | 802,191 | u169848474 | cpp |
p02993 |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 9999999999;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define pb push_back... |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 9999999999;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define pb push_back... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,192 | 802,193 | u435416250 | cpp |
p02993 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 802,194 | 802,195 | u419874471 | cpp |
p02993 | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | [] | 802,196 | 802,197 | u421588660 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#define REP(i, x, n) for (ll i = x; i < (ll)n; ++i)
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#define REP(i, x, n) for (ll i = x; i < (ll)n; ++i)
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] ==... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,198 | 802,199 | u059082716 | cpp |
p02993 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,200 | 802,201 | u285118720 | cpp |
p02993 | //#typedef int ll
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
// namespace
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vi... | //#typedef int ll
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
// namespace
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vi... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,202 | 802,203 | u178152729 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool f = true;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
f = false;
}
cout << (f ? "Good" : "Bad") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool f = true;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
f = false;
}
cout << (f ? "Good" : "Bad") << endl;
} | [] | 802,210 | 802,211 | u339937125 | cpp |
p02993 | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
bool flag = true;
rep(i, 3) {
if (S[i] == S[i + 1]) {
bool flag... | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
bool flag = true;
rep(i, 3) {
if (S[i] == S[i + 1]) {
flag = fa... | [] | 802,212 | 802,213 | u575279726 | cpp |
p02993 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <math.h>
using namespace ::std;
int main() {
string S;
cin >> S;
int check = 0;
if (S[0] == S[1]) {
check = 1;
} else if (S[1] == S[2]) {
check = 1;
} else if (S[2] == S[3]) {
check = 1;
}
if (check == 1) {
cout << "bad... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <math.h>
using namespace ::std;
int main() {
string S;
cin >> S;
int check = 0;
if (S[0] == S[1]) {
check = 1;
} else if (S[1] == S[2]) {
check = 1;
} else if (S[2] == S[3]) {
check = 1;
}
if (check == 1) {
cout << "Bad... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,220 | 802,221 | u319945100 | cpp |
p02993 | #include <cstdio>
using namespace std;
int main() {
char s[9];
scanf("%s", s);
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1]) {
puts("bad");
return 0;
}
}
puts("good");
}
| #include <cstdio>
using namespace std;
int main() {
char s[9];
scanf("%s", s);
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1]) {
puts("Bad");
return 0;
}
}
puts("Good");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 802,224 | 802,225 | u127130661 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
int s, i;
cin >> S, s = S.length();
for (i = 0; i < s; i++)
if (S[i] == S[i + 1]) {
cout << "bad";
return 0;
}
cout << "good";
} | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
int s, i;
cin >> S, s = S.length();
for (i = 0; i < s; i++)
if (S[i] == S[i + 1]) {
cout << "Bad";
return 0;
}
cout << "Good";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,235 | 802,236 | u680068823 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,239 | 802,240 | u172369914 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR1(i, n) for (i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR1(i, n) for (i... | [
"control_flow.branch.if.condition.change"
] | 802,241 | 802,242 | u863044225 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define f(i, q) for (int i = 0; i < q; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool flg = true;
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == s.at(i)) {
flg = false;
break;
}
}
if (flg) {
puts("Goods");
... | #include <bits/stdc++.h>
using namespace std;
#define f(i, q) for (int i = 0; i < q; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool flg = true;
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == s.at(i)) {
flg = false;
break;
}
}
if (flg) {
puts("Good");
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 802,245 | 802,246 | u279545555 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
string s;
cin >> s;
for (int i = 1; i < 4; ++i) {
if (s[i] == s[i - 1]) {
cout << "Bad" << endl;
break;
}
}
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
string s;
cin >> s;
for (int i = 1; i < 4; ++i) {
if (s[i] == s[i - 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 802,257 | 802,258 | u554964974 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,259 | 802,260 | u742642200 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
int flag = 1;
cin >> s;
for (int i = 0; i < strlen(s) - 1; i++) {
if (s[i] == s[i + 1])
flag = 0;
}
if (flag == 0)
cout << "bad";
else
cout << "good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
int flag = 1;
cin >> s;
for (int i = 0; i < strlen(s) - 1; i++) {
if (s[i] == s[i + 1])
flag = 0;
}
if (flag == 0)
cout << "Bad";
else
cout << "Good";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,261 | 802,262 | u828835146 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
for (ll i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "BAD" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
for (ll i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,268 | 802,269 | u955243910 | cpp |
p02993 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
char tmp = 0;
for (int i = 0; i < s.size(); i++) {
if (tmp == s[i]) {
cout << "Bad" << endl;
return 0;
}
tmp = s[i];
}
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
char tmp = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (tmp == s[i]) {
cout << "Bad" << endl;
return 0;
}
tmp = s[i];
}
cout << "Good" << endl;
return 0;
} | [] | 802,270 | 802,271 | u675512317 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define Re register
#define U unsigned
#define forn(i, a, b) for (Re int i = a; i <= b; ++i)
#define nfor(i, a, b) for (Re int i = a; i >= b; --i)
#define CLR(i, a) memset(i, a, sizeof(i))
#define BR printf("--------------------\n")
#define pb push_ba... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define Re register
#define U unsigned
#define forn(i, a, b) for (Re int i = a; i <= b; ++i)
#define nfor(i, a, b) for (Re int i = a; i >= b; --i)
#define CLR(i, a) memset(i, a, sizeof(i))
#define BR printf("--------------------\n")
#define pb push_ba... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,272 | 802,273 | u696356788 | cpp |
p02993 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (in... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (in... | [] | 802,278 | 802,279 | u434662823 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define maxn 300005
#define ll long long
int n, m, flag;
char a[10];
int main() {
scanf("%s", a);
for (int i = 2; i < strlen(a); i++)
if (a[i] == a[i - 1]) {
flag = 1;
break;
}
if (flag == 0)
printf("Good");
else
printf("Bad");
return... | #include <bits/stdc++.h>
using namespace std;
#define maxn 300005
#define ll long long
int n, m, flag;
char a[10];
int main() {
scanf("%s", a);
for (int i = 1; i < strlen(a); i++)
if (a[i] == a[i - 1]) {
flag = 1;
break;
}
if (flag == 0)
printf("Good");
else
printf("Bad");
return... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 802,282 | 802,283 | u354176216 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
;
int main() {
int v;
string A;
cin >> A;
int j = A.size();
for (int i = 0; i < j - 1; i++) {
if (A[i] == A[i + 1]) {
cout << "Bad" << endl;
v = 0;
break;
}
}
if (v != 0)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
;
int main() {
int v = 0;
string A;
cin >> A;
int j = A.size();
for (int i = 0; i < j - 1; i++) {
if (A[i] == A[i + 1]) {
cout << "Bad" << endl;
v = 1;
break;
}
}
if (v != 1)
cout << "Good" << endl;
}
| [
"variable_declaration.value.change",
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 802,284 | 802,285 | u618604643 | 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 << "Bad";
return 0;
}
}
cout << "Yes";
return 0;
}
| #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";
return 0;
}
}
cout << "Good";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 802,288 | 802,289 | u265392294 | cpp |
p02993 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long int
#define INF INT_MAX
#define mod
#define chutiyaap \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long int
#define INF INT_MAX
#define mod
#define chutiyaap \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"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.change"
] | 802,298 | 802,299 | u776675173 | 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";
else
cout << "GOOD";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,300 | 802,301 | u229370339 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [] | 802,302 | 802,303 | u096883693 | 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 << "Nice" << endl;
}
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" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 802,304 | 802,305 | u188117876 | cpp |
p02993 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(10);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
for (int ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
int main() {
// cout << setprecision(10);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
for (int ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,306 | 802,307 | u188208110 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,314 | 802,315 | u063404629 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
bool check;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = true;
}
if (check)
cout << "Bad" << endl;
else
cout << "Good" << endl;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
bool check = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = true;
}
if (check)
cout << "Bad" << endl;
else
cout << "Good" <... | [
"variable_declaration.value.change"
] | 802,318 | 802,319 | u650243369 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,327 | 802,328 | u760200622 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
cin >> s;
for (int i = 3; i >= 0; i--) {
if (s[i] == s[i - 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
cin >> s;
for (int i = 3; i >= 1; i--) {
if (s[i] == s[i - 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,329 | 802,330 | u973152737 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
l... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,333 | 802,334 | u777137418 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 802,337 | 802,338 | u465317453 | cpp |
p02993 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#inc... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#inc... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 802,339 | 802,340 | u579875569 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < 2; ++i) {
if (s[i] == s[i + 1])
good = false;
}
cout << (good ? "Good" : "Bad") << endl;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool good = true;
for (int i = 0; i < 3; ++i) {
if (s[i] == s[i + 1])
good = false;
}
cout << (good ? "Good" : "Bad") << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 802,343 | 802,344 | u532096498 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
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;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 802,345 | 802,346 | u954976049 | cpp |
p02994 | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
if (l >= 0) {
for (int i = 1; i < n; i++) {
ans += l + i;
}
} else if (l <= 0 && n + l >= 0) {
for (int j = 0; j < n; j++) {
if (l + j != 0)
ans += l + j;
}
} else {
for (int k... | #include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int ans = 0;
if (l >= 0) {
for (int i = 1; i < n; i++) {
ans += l + i;
}
} else if (l < 0 && n + l > 0) {
for (int j = 0; j < n; j++) {
if (l + j != 0)
ans += l + j;
}
} else {
for (int k =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,352 | 802,353 | u415325136 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 802,354 | 802,355 | u276588887 | cpp |
p02994 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, l, x = 1000, s;
cin >> n >> l;
for (int i = 0; i < n; i++) {
if (abs(l + i) < abs(x)) {
x = l + i;
}
}
s = n * l + (n * (... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, l, x = 1000, s;
cin >> n >> l;
for (int i = 0; i < n; i++) {
if (abs(l + i) < abs(x)) {
x = l + i;
}
}
s = n * l + (n * (... | [
"expression.operation.binary.remove"
] | 802,356 | 802,357 | u000113982 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L;
int N;
int sum = 0;
int a;
int b = 1000000;
scanf("%d %d", &L, &N);
for (int i = 1; i <= N; i++) {
a = 0;
a = L + i - 1;
sum += a;
if (abs(a) < abs(b)) {
b = a;
}
}
printf("%d", sum - b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int L;
int N;
int sum = 0;
int a;
int b = 1000000;
scanf("%d %d", &N, &L);
for (int i = 1; i <= N; i++) {
a = 0;
a = L + i - 1;
sum += a;
if (abs(a) < abs(b)) {
b = a;
}
}
printf("%d", sum - b);
} | [
"identifier.change",
"call.arguments.change"
] | 802,365 | 802,366 | u863370423 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
int main() {
ll n, l;
cin >> n >> l;
ll a[n], ans = 0;
rep(i, n) {
a[i] = i + l;
ans += a[i];
}
if (-1 * n > l)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
int main() {
ll n, l;
cin >> n >> l;
ll a[n], ans = 0;
rep(i, n) {
a[i] = i + l;
ans += a[i];
}
if (-1 * n >= l)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 802,367 | 802,368 | u395125142 | cpp |
p02994 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l <= 0 && n + l - 1 >= 0)
cout << ((n + 2 * l - 1) * n) / 2;
else if (l < 0)
cout << ((n + 2 * l - 1) * n) / 2 - n + l - 1;
else
cout << ((n + 2 * l - 1) * n) / 2 - l;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
if (l <= 0 && n + l - 1 >= 0)
cout << ((n + 2 * l - 1) * n) / 2;
else if (l < 0)
cout << ((n + 2 * l - 1) * n) / 2 - (n + l - 1);
else
cout << ((n + 2 * l - 1) * n) / 2 - l;
return 0;
} | [] | 802,379 | 802,380 | u054782559 | cpp |
p02994 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 802,385 | 802,386 | u022890424 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.