problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
bool A = true;
cin >> S;
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == S.at(i - 1)) {
cout << "Bad" << endl;
A = false;
}
}
if (A == true) {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
bool A = true;
cin >> S;
for (int i = 1; i < S.size(); i++) {
if (S.at(i) == S.at(i - 1)) {
cout << "Bad" << endl;
A = false;
break;
}
}
if (A == true) {
cout << "Good" << endl;
}
}
| [
"control_flow.break.add"
] | 799,919 | 799,920 | u991713078 | cpp |
p02993 | ///......เฆฌเฆฟเฆธเฆฎเฆฟเฆฒเงเฆฒเฆพเฆนเฆฟเฆฐ เฆฐเฆพเฆนเฆฎเฆพเฆจเฆฟเฆฐ เฆฐเฆพเฆนเฆฟเฆฎ......///
///......เฆชเฆฐเฆฎ เฆเฆฐเงเฆฃเฆพเฆฎเฆฏเฆผ เฆ
เฆธเงเฆฎ เฆฆเฆฏเฆผเฆพเฆฒเง เฆเฆฒเงเฆฒเฆพเฆนเฆคเฆพเฆฏเฆผเฆพเฆฒเฆพเฆฐ เฆจเฆพเฆฎเง เฆถเงเฆฐเง เฆเฆฐเฆเฆฟ.....///
/*
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ... | ///......เฆฌเฆฟเฆธเฆฎเฆฟเฆฒเงเฆฒเฆพเฆนเฆฟเฆฐ เฆฐเฆพเฆนเฆฎเฆพเฆจเฆฟเฆฐ เฆฐเฆพเฆนเฆฟเฆฎ......///
///......เฆชเฆฐเฆฎ เฆเฆฐเงเฆฃเฆพเฆฎเฆฏเฆผ เฆ
เฆธเงเฆฎ เฆฆเฆฏเฆผเฆพเฆฒเง เฆเฆฒเงเฆฒเฆพเฆนเฆคเฆพเฆฏเฆผเฆพเฆฒเฆพเฆฐ เฆจเฆพเฆฎเง เฆถเงเฆฐเง เฆเฆฐเฆเฆฟ.....///
/*
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ... | [
"literal.string.change",
"io.output.change"
] | 799,934 | 799,935 | u634819638 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a =... | [
"literal.string.change",
"io.output.change"
] | 799,940 | 799,941 | u609061751 | cpp |
p02993 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < s.size() - 1; ++i) {
if (prev == s[i]) {
cout << "Bad";
return 0;
}
prev = s[i];
}
cout << "Good";
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char prev = s[0];
for (int i = 1; i < s.size(); ++i) {
if (prev == s[i]) {
cout << "Bad";
return 0;
}
prev = s[i];
}
cout << "Good";
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 799,944 | 799,945 | u979271657 | cpp |
p02993 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [] | 799,946 | 799,947 | u838276016 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 799,964 | 799,965 | u962777012 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
break;
} else {
if (i == 2) {
cout << "Yes" << endl;
}
continue;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
break;
} else {
if (i == 2) {
cout << "Good" << endl;
}
continue;
}
}
}
| [
"literal.string.change",
"io.output.change"
] | 799,966 | 799,967 | u934776456 | cpp |
p02993 | #include "bits/stdc++.h"
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) || N.at(1) == N.at(2) || N.at(2) == N.at(3)) {
cout << "bad" << endl;
} else {
cout << "Good" << endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) || N.at(1) == N.at(2) || N.at(2) == N.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,980 | 799,981 | u476243674 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 799,982 | 799,983 | u538808095 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int a = 0;
cin >> s;
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
a = 1;
break;
}
}
if (a == 1)
cout << "bad" << endl;
else if (a == 0)
cout << "good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
int a = 0;
cin >> s;
for (int i = 1; i < 4; i++) {
if (s[i] == s[i - 1]) {
a = 1;
break;
}
}
if (a == 1)
cout << "Bad" << endl;
else if (a == 0)
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,987 | 799,988 | u507613987 | cpp |
p02993 | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | [
"control_flow.break.add"
] | 799,989 | 799,990 | u113081402 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
cout << "Good" << endl;
} else if (s[1] == s[2]) {
cout << "Good" << endl;
} else if (s[2] == s[3]) {
cout << "Good" << endl;
} else if (s[0] == s[1] && s[0] == s[2] && s[0] == s[3]) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1]) {
cout << "Bad" << endl;
} else if (s[1] == s[2]) {
cout << "Bad" << endl;
} else if (s[2] == s[3]) {
cout << "Bad" << endl;
} else if (s[0] == s[1] && s[0] == s[2] && s[0] == s[3]) {
cout << "B... | [
"literal.string.change",
"io.output.change"
] | 799,991 | 799,992 | u484265463 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 799,993 | 799,994 | u965418380 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 800,003 | 800,004 | u442557559 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | [
"literal.string.change",
"io.output.change"
] | 800,031 | 800,032 | u474760662 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
string s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;... | [
"literal.string.change",
"io.output.change"
] | 800,053 | 800,054 | u228943017 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3]) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
return 0;
}
| [] | 800,057 | 800,058 | u821989875 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define Sort(v, n) sort(v, v + n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define cY cout << "Yes";
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define Sort(v, n) sort(v, v + n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define cY cout << "Yes";
... | [] | 800,059 | 800,060 | u179643082 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = 1;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
bool ok = 0;
break;
}
}
if (!ok)
cout << "Bad";
else
cout << "Good";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ok = 1;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
ok = 0;
break;
}
}
if (!ok)
cout << "Bad";
else
cout << "Good";
return 0;
} | [] | 800,063 | 800,064 | u633066470 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,065 | 800,066 | u016183710 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S.at(i - 1) == S.at(i)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 1; i < 4; i++) {
if (S.at(i - 1) == S.at(i)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,068 | 800,069 | u045289115 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,071 | 800,072 | u929582923 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Good" : "Bsd") << endl
int main() {
string s;
cin >> s;
bool Good = true;
for (int i = 0; i < 4; i++) {
if (i == 3) {
} else {
if (s[1] == s[1 + i]) {
Good = false;
}
}
}
Yes(Good);
} | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Good" : "Bad") << endl
int main() {
string s;
cin >> s;
bool Good = true;
for (int i = 0; i < 4; i++) {
if (i == 3) {
} else {
if (s[i] == s[1 + i]) {
Good = false;
}
}
}
Yes(Good);
} | [
"preprocessor.define.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,083 | 800,084 | u420245204 | cpp |
p02993 | #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (... | #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 800,087 | 800,088 | u461913494 | cpp |
p02993 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | [
"literal.number.change",
"call.arguments.change"
] | 800,089 | 800,090 | u822725754 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool check = 1;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = 0;
}
if (check = 0)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool check = 1;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
check = 0;
}
if (check == 0)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,095 | 800,096 | u889173297 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
char s[4];
cin >> s[0];
string res = "true";
for (int i = 1; i < 4; i++) {
cin >> s[i];
if (s[i - 1] == s[i]) {
res = "false";
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
char s[4];
cin >> s[0];
string res = "Good";
for (int i = 1; i < 4; i++) {
cin >> s[i];
if (s[i - 1] == s[i]) {
res = "Bad";
b... | [
"literal.string.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 800,097 | 800,098 | u303621502 | cpp |
p02993 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string s;
cin >> s;
bool bad = true;
for (int ii = 0; ii < 3; ++ii) {
if (s[ii] == s[ii + 1]) {
bad = true;
}
}
if (bad) {
cout << "Bad" << endl;
} else {
cout << "Good... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
string s;
cin >> s;
bool bad = false;
for (int ii = 0; ii < 3; ++ii) {
if (s[ii] == s[ii + 1]) {
bad = true;
break;
}
}
if (bad) {
cout << "Bad" << endl;
} else {
... | [
"misc.opposites",
"variable_declaration.value.change"
] | 800,099 | 800,100 | u762158020 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,101 | 800,102 | u037563046 | cpp |
p02993 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2]... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,106 | 800,107 | u675042710 | cpp |
p02993 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"literal.string.change",
"io.output.change"
] | 800,108 | 800,109 | u880221923 | cpp |
p02993 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b;
cin >> a;
rep(i, 3) {
cin >> b;
if (a == b) {
cout << "Bad";
return 0;
}
a = b;
}
cout << "Good";
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
char a, b;
cin >> a;
rep(i, 3) {
cin >> b;
if (a == b) {
cout << "Bad";
return 0;
}
a = b;
}
cout << "Good";
} | [
"variable_declaration.type.primitive.change"
] | 800,110 | 800,111 | u683078179 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1])
answer = true;
}
if (answer)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = true;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1])
answer = false;
}
if (answer)
cout << "Good" << endl;
else
cout << "Bad" << endl;
return 0;
} | [
"misc.opposites",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change"
] | 800,112 | 800,113 | u023127434 | cpp |
p02993 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
cin.tie(0);
cout.tie(... | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 800,116 | 800,117 | u912401725 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] || s[1] == s[2] || s[2] == s[3] ? "Good" : "Bad")
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s[0] == s[1] || s[1] == s[2] || s[2] == s[3] ? "Bad" : "Good")
<< endl;
} | [
"literal.string.change",
"io.output.change"
] | 800,134 | 800,135 | u652660628 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3] || S[4] == S[5])
cout << "Bad";
else
cout << "Good";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] || S[1] == S[2] || S[2] == S[3] || S[3] == S[4])
cout << "Bad";
else
cout << "Good";
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,136 | 800,137 | u391725672 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == n.at(i + 1)) {
cout << "Bad" << endl;
} else if (i == 2) {
cout << "Good" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == n.at(i + 1)) {
cout << "Bad" << endl;
break;
} else if (i == 2) {
cout << "Good" << endl;
}
}
}
| [
"control_flow.break.add"
] | 800,138 | 800,139 | u755918658 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(23))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 800,149 | 800,150 | u080465055 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,161 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(0) == S.at(1) || S.at(1) == S.at(2)) || S.at(2) == S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,163 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 800,164 | 800,162 | u958873500 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,197 | 800,198 | u945761460 | cpp |
p02993 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | [
"control_flow.branch.if.condition.change"
] | 800,204 | 800,205 | u813728438 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,206 | 800,207 | u361948770 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 800,210 | 800,211 | u736265891 | cpp |
p02993 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 2) if (s[i]... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 3) if (s[i]... | [
"literal.number.change",
"call.arguments.change"
] | 800,212 | 800,213 | u252463862 | cpp |
p02993 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
char s[6];
cin >> s;
rep(i, 2) if (s[i... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define INF 999999999
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using llong = long long;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 3) if (s[i]... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change"
] | 800,214 | 800,213 | u252463862 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] = s[1])
cout << "Bad" << endl;
else if (s[1] = s[2])
cout << "Bad" << endl;
else if (s[2] = s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
else if (s[1] == s[2])
cout << "Bad" << endl;
else if (s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,217 | 800,218 | u186506670 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | [] | 800,226 | 800,227 | u164730704 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool ch... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 800,230 | 800,231 | u475503988 | cpp |
p02993 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
void _139() {
string s, t;
cin >> s;
cin >> t;
int count = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
count++;
}
cout << count << endl;
}
void _138() {
int a;
string s;
cin >> a;
cin >> s;
if (a >... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
void _139() {
string s, t;
cin >> s;
cin >> t;
int count = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
count++;
}
cout << count << endl;
}
void _138() {
int a;
string s;
cin >> a;
cin >> s;
if (a >... | [
"literal.string.change",
"io.output.change"
] | 800,232 | 800,233 | u243740419 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1))
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
} | [] | 800,240 | 800,241 | u726957641 | cpp |
p02993 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\n... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
char s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\... | [
"variable_declaration.type.primitive.change"
] | 800,244 | 800,245 | u489302942 | cpp |
p02993 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] = s[i + 1])
break;
}
if (i == 3)
cout << "Good\n"... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
char s[4];
for (int i = 0; i < 4; i++)
cin >> s[i];
int i;
for (i = 0; i < 3; i++) {
if (s[i] == s[i + 1])
break;
}
if (i == 3)
cout << "Good\... | [
"variable_declaration.type.primitive.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 800,246 | 800,245 | u489302942 | cpp |
p02993 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int flag;
for (int i = 1; i < (int)S.size(); i++) {
if (S[i - 1] == S[i])
flag = 1;
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int flag = 0;
for (int i = 1; i < (int)S.size(); i++) {
if (S[i - 1] == S[i])
flag = 1;
}
if (flag) {
cout << "Bad" << endl;
} else {
cout << "Good" << en... | [
"variable_declaration.value.change"
] | 800,249 | 800,250 | u848339218 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,251 | 800,252 | u739095155 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[3] == s[4]) {
cout << "Bad" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 800,253 | 800,252 | u739095155 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
if (s1 == s2 || s2 == s3 || s3 == s4) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
if (s1 == s2 || s2 == s3 || s3 == s4) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 800,254 | 800,255 | u443971699 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == S[i - 1]) {
cout << "Bad" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == S[i + 1]) {
cout << "Bad" << endl;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,262 | 800,263 | u578871832 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad";
else
cout << "Good";
return 0;
} | [] | 800,264 | 800,265 | u548977290 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, begin, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
rep(i, 0, 2) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, begin, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
rep(i, 0, 3) {
if (S.at(i) == S.at(i + 1)) {
cout << "Bad" << endl;
... | [
"literal.number.change",
"call.arguments.change"
] | 800,268 | 800,269 | u124659583 | cpp |
p02993 | // Security
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Goog" << endl;
return 0;
} | // Security
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 800,270 | 800,271 | u896325626 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool t = false;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
t = true;
true ? cout << "Ba... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
bool t = false;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3])
t = true;
t ? cout << "Bad"... | [
"control_flow.loop.for.condition.change"
] | 800,276 | 800,277 | u425758699 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 1; i < str.length(); i++) {
if (str[i] == str[i - 1]) {
cout << "Bad" << endl;
}
if (i == str.length() - 1) {
cout << "Good" << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 1; i < str.length(); i++) {
if (str[i] == str[i - 1]) {
cout << "Bad" << endl;
break;
}
if (i == str.length() - 1) {
cout << "Good" << endl;
}
}
return 0;
} | [
"control_flow.break.add"
] | 800,278 | 800,279 | u022890424 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 4; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 3; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 800,299 | 800,300 | u533566373 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 800,308 | 800,309 | u461336793 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[3] == s[4]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
return 0;
}
cout << "Good" << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 800,313 | 800,314 | u028510162 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string securityCode;
cin >> securityCode;
char prev = securityCode.at(0);
bool isBad = false;
for (int i = 1; i < 4; ++i) {
char comparing = securityCode.at(1);
if (comparing == prev) {
isBad = true;
break;
} else {
pre... | #include <bits/stdc++.h>
using namespace std;
int main() {
string securityCode;
cin >> securityCode;
char prev = securityCode.at(0);
bool isBad = false;
for (int i = 1; i < 4; ++i) {
char comparing = securityCode.at(i);
if (comparing == prev) {
isBad = true;
break;
} else {
pre... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 800,317 | 800,318 | u584797714 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad");
return 0;
} else {
printf("Good");
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 800,323 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 800,325 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
int all[4];
for (int i = 0; i < 4; i++)
scanf("%d", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
}
printf("Good\n");
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char all[4];
for (int i = 0; i < 4; i++)
scanf("%c", &all[i]);
if ((all[0] == all[1]) || (all[1] == all[2]) || (all[2] == all[3])) {
printf("Bad\n");
return 0;
} else {
printf("Good\n");
}
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"control_flow.branch.else.add"
] | 800,326 | 800,324 | u271369517 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i <= 2; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i <= 2; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 800,332 | 800,333 | u016119075 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] || s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[1] == s[2] || s[2] == s[3]) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 800,336 | 800,337 | u559578080 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
ans = true;
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
for (int i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
ans = true;
}
if (ans)
cout << "Bad" << endl;
else
cout << "Good" << endl;
cin >> S;... | [] | 800,344 | 800,345 | u742960659 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
bool ans = true;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3])
ans = true;
if (ans)
puts("Good");
else
puts("Bad");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
bool ans = false;
if (s[0] != s[1] && s[1] != s[2] && s[2] != s[3])
ans = true;
if (ans)
puts("Good");
else
puts("Bad");
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change"
] | 800,346 | 800,347 | u589238650 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
const int MAX = 510000;
const int MOD = 1... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1e9;
using namespace std;
typedef long long ll;
const int MAX = 510000;
const int MOD = 1... | [
"assignment.add"
] | 800,364 | 800,365 | u520841950 | cpp |
p02990 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
template <typename T_mc_data>
class ModComb {
private:
int max_n;
T_mc_data mod; // M
v... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
#include <vector>
template <typename T_mc_data>
class ModComb {
private:
int max_n;
T_mc_data mod; // M
v... | [] | 800,366 | 800,367 | u711582524 | cpp |
p02990 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
// const ll MOD = 1000000007;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 800,371 | 800,372 | u825215512 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i... | [
"assignment.change"
] | 800,376 | 800,377 | u042605975 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i... | [
"assignment.change"
] | 800,378 | 800,377 | u042605975 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ln cout << '\n'
#define ll long long
#d... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ln cout << '\n'
#define ll long long
#d... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 800,383 | 800,384 | u496074393 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operation.binary.add"
] | 800,388 | 800,389 | u155416173 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for... | [
"expression.operation.binary.add"
] | 800,390 | 800,391 | u944838431 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
long long inf = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
// typedef long long ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
long long inf = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
// typedef long long ... | [
"call.add",
"call.arguments.change"
] | 800,394 | 800,395 | u222293734 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv... | [
"expression.operation.binary.add"
] | 800,410 | 800,411 | u415916075 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
const int64_t MOD = 1e9 + 7;
int64_t fac[MAX] = {}, inv[MAX] = {}, finv[MAX] = {};
void make_table() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv... | [
"variable_declaration.type.primitive.change"
] | 800,412 | 800,411 | u415916075 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bใฎ็ฏๅฒ็ใซใใใ ใ้
ๅใ็จๆใใฆใใใฐๅๅ
ll mpow(ll x,
ll n) { // x^n(mod M) โๆฎ้ใซpow(x,n)ใงใฏๆบขใใฆใใพใใใ๏ผ้ๆmod่จ็ฎ
ll ans = 1;
while (n ... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bใฎ็ฏๅฒ็ใซใใใ ใ้
ๅใ็จๆใใฆใใใฐๅๅ
ll mpow(ll x,
ll n) { // x^n(mod M) โๆฎ้ใซpow(x,n)ใงใฏๆบขใใฆใใพใใใ๏ผ้ๆmod่จ็ฎ
ll ans = 1;
while (n ... | [] | 800,413 | 800,414 | u509420256 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4765
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 800,418 | 800,419 | u457283867 | cpp |
p02990 | //#typedef int ll
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
// namespace
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> 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.operation.binary.add"
] | 800,425 | 800,426 | u178152729 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [
"expression.operation.binary.add"
] | 800,427 | 800,428 | u926242698 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int M = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
long long int ans;
vector<vector<long long>> v(2001, vector<long long>(2001, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v... | #include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int M = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
long long int ans;
vector<vector<long long>> v(2001, vector<long long>(2001, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v... | [
"assignment.change"
] | 800,429 | 800,430 | u366677622 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.s... | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v... | [
"assignment.change"
] | 800,437 | 800,438 | u420528322 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.s... | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v... | [] | 800,439 | 800,438 | u420528322 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(i + 1);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v.s... | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
long long n, k, i, j;
cin >> n >> k;
vector<vector<long long>> v(2001);
for (i = 0; i < v.size(); i++) {
vector<long long> vv(2001, 0);
vv[0] = 1;
vv[i] = 1;
v[i] = vv;
}
for (i = 1; i < v... | [] | 800,440 | 800,441 | u420528322 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
long long modinv(long long a) {
long long b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
long long modinv(long long a) {
long long b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 800,442 | 800,443 | u251847465 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
namespace mod {
ll MOD = 1000000007;
// x+y
ll add(ll x, ll y) { return (x + y) % MOD; }
// x-y
ll sub(ll x, ll y) { return (x + MOD - (y % MOD)) % MOD; }
// x*y
ll mul(ll x, ll y) { return ((x % MOD) * (y % MOD)) ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
namespace mod {
ll MOD = 1000000007;
// x+y
ll add(ll x, ll y) { return (x + y) % MOD; }
// x-y
ll sub(ll x, ll y) { return (x + MOD - (y % MOD)) % MOD; }
// x*y
ll mul(ll x, ll y) { return ((x % MOD) * (y % MOD)) ... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 800,448 | 800,449 | u408650734 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
... | [
"assignment.change"
] | 800,452 | 800,453 | u991083615 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
in... | #include <bits/stdc++.h>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % 1000000007;
}
}
}
int ... | [
"assignment.change"
] | 800,466 | 800,467 | u339937125 | cpp |
p02990 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; ++i)
#define ll long long
using namespace std;
/*
//E
ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; ++i)
#define ll long long
using namespace std;
/*
//E
ll... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 800,470 | 800,471 | u693569496 | cpp |
p02990 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> nCk(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i <= n; i++) {
nCk[i][0] = 1;
nCk[i][i] = 1;
for... | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> nCk(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i <= n; i++) {
nCk[i][0] = 1;
nCk[i][i] = 1;
for... | [
"type_conversion.add"
] | 800,472 | 800,473 | u433162241 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.