problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02990 | void solve();
int main() {
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
#include <algorithm>
#include <assert.h>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <set>
#include <string>
#include ... | void solve();
int main() {
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
#include <algorithm>
#include <assert.h>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <set>
#include <string>
#include ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,027 | 799,028 | u457790148 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 200005;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
ll ans;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 2005;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
ll ans;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = M... | [
"literal.number.change",
"variable_declaration.value.change",
"function.return_value.change"
] | 799,032 | 799,033 | u045547337 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 799,034 | 799,035 | u759266806 | cpp |
p02990 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define fin \
{ ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
#define fin \
{ ... | [
"expression.operation.binary.add"
] | 799,043 | 799,044 | u942774736 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 5, mod = 1e9 + 7;
int CC[maxn][maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < maxn; ++i) {
CC[i][0] = CC[i][i] = 1;
for (int j = 1; j < i; ++j) {
CC[i][j] = (CC[i - 1][j] + CC[i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 5, mod = 1e9 + 7;
ll CC[maxn][maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < maxn; ++i) {
CC[i][0] = CC[i][i] = 1;
for (int j = 1; j < i; ++j) {
CC[i][j] = (CC[i - 1][j] + CC[i -... | [
"variable_declaration.type.change"
] | 799,045 | 799,046 | u187582424 | cpp |
p02990 | #include <bits/stdc++.h>
#define LL long long
#define M 1000005
using namespace std;
const int P = 1e9 + 7;
int C[2005][2005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i -... | #include <bits/stdc++.h>
#define LL long long
#define M 1000005
using namespace std;
const int P = 1e9 + 7;
int C[2005][2005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i -... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 799,047 | 799,048 | u837479063 | cpp |
p02990 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 799,049 | 799,050 | u708618797 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
bool f[314514];
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> v(314514);
vector<ll> dis(314514, 1e9);
ll p = 100000;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
v[a].push_back(b + p);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
bool f[314514];
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> v(314514);
vector<ll> dis(314514, 1e9);
ll p = 100000;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
v[a].push_back(b + p);
... | [
"assignment.change"
] | 799,056 | 799,057 | u774202056 | cpp |
p02991 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tim... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <tim... | [
"expression.operation.binary.remove"
] | 799,066 | 799,067 | u539145601 | cpp |
p02991 | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 799,076 | 799,077 | u048773461 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define A... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define A... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 799,097 | 799,098 | u211259428 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define A... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define A... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 799,099 | 799,098 | u211259428 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 799,100 | 799,101 | u382423941 | cpp |
p02991 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"expression.operation.binary.add"
] | 799,104 | 799,105 | u089177147 | cpp |
p02991 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"literal.number.change",
"variable_declaration.value.change"
] | 799,106 | 799,105 | u089177147 | cpp |
p02991 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | [
"literal.number.change",
"variable_declaration.value.change"
] | 799,107 | 799,105 | u089177147 | cpp |
p02991 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [
"assignment.change"
] | 799,110 | 799,111 | u664394831 | cpp |
p02991 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operation.binary.add"
] | 799,112 | 799,113 | u673211643 | cpp |
p02991 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 799,114 | 799,113 | u673211643 | cpp |
p02991 | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 799,119 | 799,120 | u554988565 | cpp |
p02991 | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 799,121 | 799,120 | u554988565 | cpp |
p02991 | /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
... | /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 799,122 | 799,123 | u579670739 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 1e9 + 7;
int n, m, s, t;
vector<int> g[N];
int dist[N][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
}
cin >> s >> ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 1e9 + 7;
int n, m, s, t;
vector<int> g[N];
int dist[N][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
}
cin >> s >> ... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 799,128 | 799,129 | u408861977 | cpp |
p02991 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
int main(void) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
int main(void) {
... | [
"expression.operation.binary.add"
] | 799,158 | 799,159 | u088895504 | cpp |
p02991 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << "... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << "... | [
"call.remove"
] | 799,162 | 799,163 | u899645116 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S, T;
cin >> N >> M;
vector<vector<int>> graph(N);
vector<long long int> len(3 * N, -1);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
graph[u].push_back(v);
}
cin >> S >> T;
S--;
T--;
qu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S, T;
cin >> N >> M;
vector<vector<int>> graph(N);
vector<long long int> len(3 * N, -1);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
graph[u].push_back(v);
}
cin >> S >> T;
S--;
T--;
q... | [
"expression.operation.binary.add"
] | 799,164 | 799,165 | u926416331 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S, T;
cin >> N >> M;
vector<vector<int>> graph(N);
vector<int> len(3 * N, -1);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
graph[u].push_back(v);
}
cin >> S >> T;
S--;
T--;
queue<int> Q... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S, T;
cin >> N >> M;
vector<vector<int>> graph(N);
vector<long long int> len(3 * N, -1);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
graph[u].push_back(v);
}
cin >> S >> T;
S--;
T--;
q... | [
"variable_declaration.type.widen.change",
"expression.operation.binary.add"
] | 799,166 | 799,165 | u926416331 | cpp |
p02991 | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,174 | 799,175 | u325959156 | cpp |
p02991 | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | [
"control_flow.branch.if.condition.change"
] | 799,176 | 799,175 | u325959156 | cpp |
p02991 | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 20;
int n, m, u, v, dp[N][3], source, dest;
queue<pair<int, int>> q;
bool vis[N][3];
vector<int> adj[N];
void add(int node, int mod, int dist) {
q.push({node, mod});
dp[node][mod] = dist;
vis[node][mod] = true;
}
int main() {
scanf("%d%d", &n... | [
"control_flow.branch.if.condition.change"
] | 799,177 | 799,175 | u325959156 | cpp |
p02991 | #include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cnt(n, 0);
vector<vector<int>> g0(n);
// vector<vector<int> > g1(n);
// vector<vector<int> > g2(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> ... | #include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> cnt(n, 0);
vector<vector<int>> g0(n);
// vector<vector<int> > g1(n);
// vector<vector<int> > g2(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> ... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 799,182 | 799,183 | u303059352 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define MAX 100000
#define INF -1
int n;
vector<ll> g[3 * MAX];
ll d[3 * MAX];
void bfs(int s) {
queue<int> q;
fill(d, d + 3 * MAX, INF);
q.push(s);
d[s] = 0;
while (!q.empty()) {
int u = q.front();
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define MAX 100000
#define INF -1
int n;
vector<int> g[4 * MAX];
int d[4 * MAX];
void bfs(int s) {
queue<int> q;
fill(d, d + 4 * MAX, INF);
q.push(s);
d[s] = 0;
while (!q.empty()) {
int u = q.front();... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 799,184 | 799,185 | u348670055 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
/*
sからtへの3の倍数の経路のうち最小のものを出力する
1 -> 2 を
1 -> 5
2 -> 6
3 -> 4
深さ優先探索
進められる辺がなくなるまで、以下を繰り返す
1.
スタート地点から伸びる辺を選択し、sを訪問済みにセットして、辺の先の... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
/*
sからtへの3の倍数の経路のうち最小のものを出力する
1 -> 2 を
1 -> 5
2 -> 6
3 -> 4
深さ優先探索
進められる辺がなくなるまで、以下を繰り返す
1.
スタート地点から伸びる辺を選択し、sを訪問済みにセットして、辺の先の... | [
"variable_declaration.type.change",
"call.function.change"
] | 799,186 | 799,187 | u272496669 | cpp |
p02991 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int INF = 1 << 29;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> G[100000];
rep(i, m) {
int u, v;
scanf("%d%d", &u, &v);
u--;
v--;
G[u].emplace_back(v);
}
int s, t;
scanf... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int INF = 1 << 29;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> G[100000];
rep(i, m) {
int u, v;
scanf("%d%d", &u, &v);
u--;
v--;
G[u].emplace_back(v);
}
int s, t;
scanf... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,188 | 799,189 | u781095600 | cpp |
p02991 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugv(v) ... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugv(v) ... | [
"variable_declaration.type.change",
"call.function.change"
] | 799,212 | 799,213 | u936790121 | cpp |
p02991 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugv(v) ... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugv(v) ... | [
"variable_declaration.type.change",
"call.function.change"
] | 799,212 | 799,214 | u936790121 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define forn(i,... | #include <bits/stdc++.h>
using namespace std;
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define forn(i,... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 799,224 | 799,225 | u339747464 | cpp |
p02991 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int inf = 1e8;
int dist[100010][3];
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> to(N);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
to[u].push_back(v);... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int inf = 1e8;
int dist[100010][3];
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> to(N);
for (int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
to[u].push_back(v);... | [
"identifier.change"
] | 799,226 | 799,227 | u904123392 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
struct element {
int node;
int step;
};
deque<element> que;
vector<int> edges[100001 + 1];
int n, m, s, t;
bool done[100001][3];
void extend(int node, int step) {
vector<int> next_nodes = edges[node];
int next_nstep = step + 1;
for (unsigned int i = 0; i < ne... | #include <bits/stdc++.h>
using namespace std;
struct element {
int node;
int step;
};
deque<element> que;
vector<int> edges[100001 + 1];
int n, m, s, t;
bool done[100001][3];
void extend(int node, int step) {
vector<int> next_nodes = edges[node];
int next_nstep = step + 1;
for (unsigned int i = 0; i < ne... | [
"assignment.change"
] | 799,228 | 799,229 | u052546116 | cpp |
p02991 | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
using Graph = std::vector<std::vector<int>>;
int main() {
int N, M;
std::cin >> N >> M;
Graph G(N);
rep(i, N) {
int u, v;
std::cin >> u >> v;
G[u - 1].push_back(v - ... | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
using Graph = std::vector<std::vector<int>>;
int main() {
int N, M;
std::cin >> N >> M;
Graph G(N);
rep(i, M) {
int u, v;
std::cin >> u >> v;
G[u - 1].push_back(v - ... | [] | 799,256 | 799,257 | u575279726 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, ii> iii;
typedef pair<int, iii> iiii;
typedef pair<double, ii> dii;
typedef long long ll;
typedef pair<ll, ii> lii;
const int INF = 1000000000;
const double EPS = 1e-9;
#define LSO... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, ii> iii;
typedef pair<int, iii> iiii;
typedef pair<double, ii> dii;
typedef long long ll;
typedef pair<ll, ii> lii;
const int INF = 1000000000;
const double EPS = 1e-9;
#define LSO... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 799,265 | 799,266 | u514760660 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, ii> iii;
typedef pair<int, iii> iiii;
typedef pair<double, ii> dii;
typedef long long ll;
typedef pair<ll, ii> lii;
const int INF = 1000000000;
const double EPS = 1e-9;
#define LSO... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, ii> iii;
typedef pair<int, iii> iiii;
typedef pair<double, ii> dii;
typedef long long ll;
typedef pair<ll, ii> lii;
const int INF = 1000000000;
const double EPS = 1e-9;
#define LSO... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 799,267 | 799,266 | u514760660 | cpp |
p02991 | #include "bits/stdc++.h"
// Custom Header {{{
#define ALL(x) x.begin(), x.end()
#define rep(i, s, n) for (int i(s); i < int(n); ++i)
#define endl '\n'
#ifndef YDK
#define eprintf(...)
#endif
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const... | #include "bits/stdc++.h"
// Custom Header {{{
#define ALL(x) x.begin(), x.end()
#define rep(i, s, n) for (int i(s); i < int(n); ++i)
#define endl '\n'
#ifndef YDK
#define eprintf(...)
#endif
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 799,277 | 799,278 | u897304429 | cpp |
p02991 | #include "bits/stdc++.h"
// Custom Header {{{
#define ALL(x) x.begin(), x.end()
#define rep(i, s, n) for (int i(s); i < int(n); ++i)
#define endl '\n'
#ifndef YDK
#define eprintf(...)
#endif
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const... | #include "bits/stdc++.h"
// Custom Header {{{
#define ALL(x) x.begin(), x.end()
#define rep(i, s, n) for (int i(s); i < int(n); ++i)
#define endl '\n'
#ifndef YDK
#define eprintf(...)
#endif
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 799,279 | 799,278 | u897304429 | cpp |
p02991 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"literal.number.change",
"assignment.value.change"
] | 799,287 | 799,288 | u716566635 | cpp |
p02991 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change"
] | 799,289 | 799,288 | u716566635 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 15;
const int inf = 0x3f3f3f3f;
int head[maxn], n, m, u, v, s, t, cnt;
struct edge {
int to, nxt, w;
} e[maxn << 1];
inline void add(int u, int v, int _w) {
e[++cnt].to = v;
e[cnt].nxt = head[u];
e[cnt].w = _w;
head[u] = cnt;
}
int dp[maxn]... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 15;
const int inf = 0x3f3f3f3f;
int head[maxn], n, m, u, v, s, t, cnt;
struct edge {
int to, nxt, w;
} e[maxn << 2];
inline void add(int u, int v, int _w) {
e[++cnt].to = v;
e[cnt].nxt = head[u];
e[cnt].w = _w;
head[u] = cnt;
}
int dp[maxn]... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change"
] | 799,307 | 799,308 | u593546783 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 799,317 | 799,318 | u484460274 | cpp |
p02991 | #include <cstdio>
#include <iostream>
#include <list>
#include <map>
using namespace std;
int N, M;
int S, T;
int ans = -1;
int d[3][100001];
map<int, list<int>> e;
list<pair<int, int>> queue;
int f(int q, int steps, int count) {
for (auto i = e[q].begin(); i != e[q].end(); ++i) {
if (steps == 0 && d[1][*i] <... | #include <cstdio>
#include <iostream>
#include <list>
#include <map>
using namespace std;
int N, M;
int S, T;
int ans = -1;
int d[3][100001];
map<int, list<int>> e;
list<pair<int, int>> queue;
int f(int q, int steps, int count) {
for (auto i = e[q].begin(); i != e[q].end(); ++i) {
if (steps == 0 && d[1][*i] <... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 799,321 | 799,322 | u426462442 | cpp |
p02991 | #include <iostream>
#include <queue>
using namespace std;
int n, m, S, T;
vector<vector<int>> graph(300010);
vector<int> dist(300010);
void BFS() {
queue<int> que;
dist[3 * S] = 0;
que.push(3 * S);
while (!que.empty()) {
int f = que.front();
que.pop();
for (auto t : graph[f]) {
if (dist[t] =... | #include <iostream>
#include <queue>
using namespace std;
int n, m, S, T;
vector<vector<int>> graph(333333);
vector<int> dist(333333, -1);
void BFS() {
queue<int> que;
dist[3 * S] = 0;
que.push(3 * S);
while (!que.empty()) {
int f = que.front();
que.pop();
for (auto t : graph[f]) {
if (dist[... | [
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 799,350 | 799,351 | u957318593 | cpp |
p02991 | /* -*- coding: utf-8 -*-
*
* e.cc: E - Hopscotch Addict
*/
#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>
#i... | /* -*- coding: utf-8 -*-
*
* e.cc: E - Hopscotch Addict
*/
#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>
#i... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 799,360 | 799,361 | u744314647 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 799,362 | 799,363 | u426855695 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"io.output.change"
] | 799,364 | 799,363 | u426855695 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"io.output.change"
] | 799,365 | 799,363 | u426855695 | cpp |
p02991 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re... | [
"expression.operation.binary.remove"
] | 799,366 | 799,363 | u426855695 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int dist[100005][3];
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> to(n);
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d %d", &a, &b);
--a;
--b;
to[a].push_back(b);
}
int s, t;
scanf("%... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int dist[100005][3];
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> to(n);
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d %d", &a, &b);
--a;
--b;
to[a].push_back(b);
}
int s, t;
scanf("%... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 799,371 | 799,372 | u559765551 | cpp |
p02991 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1001001001;
int dist[100005][3];
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].pus... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1001001001;
int dist[100005][3];
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].pus... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 799,378 | 799,379 | u457283867 | cpp |
p02991 | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
template <typename W>
// example const ll inf=1e15;
void dij... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
template <typename W>
// example const ll inf=1e15;
void dij... | [
"expression.operation.binary.add"
] | 799,380 | 799,381 | u817142576 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i)... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i)... | [
"call.function.change"
] | 799,383 | 799,384 | u994831328 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a,... | [
"expression.operation.binary.add"
] | 799,487 | 799,488 | u943094398 | cpp |
p02991 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
vector<pair<int, int>> edges[100000][3];
int d[100000][3];
bool decided[100000][3];
void dijikstra(i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
vector<pair<int, int>> edges[100000][3];
int d[100000][3];
bool decided[100000][3];
void dijikstra(i... | [
"expression.operation.binary.add"
] | 799,489 | 799,490 | u623349537 | cpp |
p02991 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 799,493 | 799,494 | u323491962 | cpp |
p02991 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.... | 799,495 | 799,494 | u323491962 | cpp |
p02991 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
#define faltu \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 799,496 | 799,494 | u323491962 | cpp |
p02991 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 799,499 | 799,500 | u836644468 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,503 | 799,504 | u337054478 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 799,505 | 799,506 | u372786981 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1e5 + 10, inf = 1e8;
int n, m;
vector<int> g[maxn];
int d[maxn][3];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0, u, v; i < m; ++i) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
}
int s, t;
scanf("%d%d", &s, &t);
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1e5 + 10, inf = 1e8;
int n, m;
vector<int> g[maxn];
int d[maxn][3];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0, u, v; i < m; ++i) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
}
int s, t;
scanf("%d%d", &s, &t);
for (int i = 1;... | [] | 799,516 | 799,517 | u129325320 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b, c) for (int a = b, a##end = c; a <= a##end; ++a)
#define drep(a, b, c) for (int a = b, a##end = c; a >= a##end; --a)
char IO;
int rd() {
int s = 0, f = 0;
while (IO = getchar(), IO < '0' || IO > '9')
if (IO == '-')
f ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b, c) for (int a = b, a##end = c; a <= a##end; ++a)
#define drep(a, b, c) for (int a = b, a##end = c; a >= a##end; --a)
char IO;
int rd() {
int s = 0, f = 0;
while (IO = getchar(), IO < '0' || IO > '9')
if (IO == '-')
f ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 799,525 | 799,526 | u891465773 | cpp |
p02991 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
const int INF = 1e9;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
g.resize(n);
rep(i, m) {
int u, v;
cin >> u >> v;
u--, v--;
g[u].push_back(v);
}
int s, t;
cin >> s ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
const int INF = 1e9;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
g.resize(n);
rep(i, m) {
int u, v;
cin >> u >> v;
u--, v--;
g[u].push_back(v);
}
int s, t;
cin >> s ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 799,534 | 799,535 | u241615199 | cpp |
p02991 | /*
author: madhav_1999 aka orthodoxparadox
29-Jun-2019
17:51:15
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#define ll... | /*
author: madhav_1999 aka orthodoxparadox
29-Jun-2019
17:51:15
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#define ll... | [
"function.parameters.parameter.add",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 799,536 | 799,537 | u202833686 | cpp |
p02993 | #define mod 1000000007
#define PI acos(-1)
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 0x7fffffffffffffff;
const int inf = 0x7fffffff;
const... | #define mod 1000000007
#define PI acos(-1)
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 0x7fffffffffffffff;
const int inf = 0x7fffffff;
const... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 799,592 | 799,593 | u353919145 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
const long long int sMod = 998244353;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = p... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
const long long int sMod = 998244353;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = p... | [
"control_flow.branch.if.condition.change"
] | 799,599 | 799,600 | u377907412 | cpp |
p02993 | #include <stdio.h>
#include <string.h>
int main() {
char s[5];
int i, k;
scanf("%s", s);
k = 1;
// k=strlen(s);
for (i = 0; i < 4; i++) {
if (s[i + 1] == s[i]) {
k++;
}
}
if (k >= 2) {
printf("bad");
} else {
printf("good");
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
char s[5];
int i, k;
scanf("%s", s);
// gets(s);
k = 1;
// k=strlen(s);
for (i = 0; i < 4; i++) {
if (s[i + 1] == s[i]) {
k++;
}
}
if (k >= 2) {
printf("Bad");
} else {
printf("Good");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 799,601 | 799,602 | u089230684 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<ll> vec(4);
for (ll i = 0; i < 4; i++) {
cin >> vec.at(i);
}
for (ll i = 0; i < 3; i++) {
if (vec.at(i) == vec.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<char> vec(4);
for (ll i = 0; i < 4; i++) {
cin >> vec.at(i);
}
for (ll i = 0; i < 3; i++) {
if (vec.at(i) == vec.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return... | [] | 799,610 | 799,611 | u883297128 | cpp |
p02993 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
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>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
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"
] | 799,616 | 799,617 | u629603666 | cpp |
p02993 | #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() {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1])
cout << "Bad" << endl;
return 0;
}
... | #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() {
string s;
cin >> s;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
... | [] | 799,624 | 799,625 | u395125142 | cpp |
p02993 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool isgood = true;
if (s[0] == s[1]) {
isgood = false;
}
if (s[1] == s[2]) {
isgood = false;
}
if (s[2] == s[3]) {
isgood = false;
}
if (isgood) {
cout... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool isgood = true;
if (s[0] == s[1]) {
isgood = false;
}
if (s[1] == s[2]) {
isgood = false;
}
if (s[2] == s[3]) {
isgood = false;
}
if (isgood) {
cou... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,626 | 799,627 | u662332836 | cpp |
p02993 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
else if (s[1] == s[2])
cout << "Bad" << endl;
else if (s[2] == s[3])
cout << ... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1])
cout << "Bad" << endl;
else if (s[1] == s[2])
cout << "Bad" << endl;
else if (s[2] == s[3])
cout << ... | [
"literal.string.change",
"io.output.change"
] | 799,628 | 799,629 | u337018543 | 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;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,636 | 799,637 | u596234104 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool a = true;
for (int i = 0; i < 3; i++) {
if (s.at(i) == s.at(i + 1)) {
a = false;
break;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool a = true;
for (int i = 0; i < 3; i++) {
if (s.at(i) == s.at(i + 1)) {
a = false;
break;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| [] | 799,657 | 799,658 | u758405447 | 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 << "Yes" << 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"
] | 799,667 | 799,668 | u856957535 | 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"
] | 799,669 | 799,668 | u856957535 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
bool isgood = true;
if (n[0] == n[1])
isgood = false;
if (n[1] == n[2])
isgood = false;
if (n[2] == n[3])
isgood = false;
if (isgood) {
cout << "good" << endl;
} else {
cout << "bad" << endl;
}
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
bool isgood = true;
if (n[0] == n[1])
isgood = false;
if (n[1] == n[2])
isgood = false;
if (n[2] == n[3])
isgood = false;
if (isgood) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,673 | 799,674 | u321280590 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
bool isgood = true;
if (n[0] == n[1])
isgood = false;
if (n[1] == n[2])
isgood = false;
if (n[2] == n[3])
isgood = false;
if (isgood) {
cout << "good" << endl;
} else {
cout << "bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
bool isgood = true;
if (n[0] == n[1])
isgood = false;
if (n[1] == n[2])
isgood = false;
if (n[2] == n[3])
isgood = false;
if (isgood) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 799,675 | 799,674 | u321280590 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can = true;
for (int i = 0; i < 2; i++) {
char X = S.at(i);
char Y = S.at(i + 1);
if (X == Y) {
can = false;
break;
}
}
if (can)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can = true;
for (int i = 0; i < 3; i++) {
char X = S.at(i);
char Y = S.at(i + 1);
if (X == Y) {
can = false;
break;
}
}
if (can)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 799,696 | 799,697 | u430394202 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can = true;
for (int i = 0; i < 2; i++) {
char X = S.at(i);
char Y = S.at(i + 1);
if (X != Y) {
can = false;
break;
}
}
if (can)
cout << "Good" << endl;
else
cout << "Bad" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can = true;
for (int i = 0; i < 3; i++) {
char X = S.at(i);
char Y = S.at(i + 1);
if (X == Y) {
can = false;
break;
}
}
if (can)
cout << "Good" << endl;
else
cout << "Bad" << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,698 | 799,697 | u430394202 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 799,715 | 799,716 | u972911059 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[2] == s[3] || s[1] == s[2]) {
cout << "Bat" << endl;
} else
cout << "Good" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[2] == s[3] || s[1] == s[2])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 799,719 | 799,720 | u497715246 | cpp |
p02993 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[2] == s[3] || s[1] == s[2]) {
cout << "Bat" << endl;
} else
cout << "Good" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] || s[2] == s[3] || s[1] == s[2])
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 799,721 | 799,720 | u497715246 | cpp |
p02993 | #include <iostream>
#include <map>
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main() {
string S;
cin >> S;
bool flag = true;
REP(i, S.length() - 1) {
if (S[i] == S[i + 1]) {
bool flag = false;
... | #include <iostream>
#include <map>
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main() {
string S;
cin >> S;
bool flag = true;
REP(i, S.length() - 1) {
if (S[i] == S[i + 1]) {
flag = false;
... | [
"literal.string.change",
"call.arguments.change"
] | 799,722 | 799,723 | u568426505 | cpp |
p02993 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [] | 799,726 | 799,727 | u272628953 | cpp |
p02993 | #include <iostream>
using namespace std;
int main() {
char S[4];
int i, a = 0;
cin >> S;
for (i = 0; i < 3; i++) {
if (S[i] == S[i + 1])
a = 1;
break;
}
if (a == 1)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
char S[4];
int i, a = 0;
cin >> S;
for (i = 0; i < 3; i++) {
if (S[i] == S[i + 1]) {
a = 1;
break;
}
}
if (a == 1)
cout << "Bad" << endl;
else
cout << "Good" << endl;
return 0;
}
| [] | 799,728 | 799,729 | u018679195 | cpp |
p02993 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [] | 799,735 | 799,736 | u926006934 | cpp |
p02993 | // Made by Luis Miguel Baez
// es.luismiguelbaez@gmail.com
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull uns... | // Made by Luis Miguel Baez
// es.luismiguelbaez@gmail.com
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n, k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull uns... | [
"control_flow.loop.for.condition.change"
] | 799,745 | 799,746 | u192061265 | 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 << "Yes" << endl;
else
cout << "No" << 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"
] | 799,753 | 799,754 | u553321223 | cpp |
p02993 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"literal.string.change",
"io.output.change"
] | 799,881 | 799,882 | u311099484 | cpp |
p02993 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
for (int i = 1; i < 4; i++) {
if (S[i] == S[i - 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int 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;
}
| [] | 799,883 | 799,884 | u060116081 | cpp |
p02993 | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
bool flag = 0;
for (size_t i = 0; i < S.size() - 1; i++) {
if (S[i] == S[i + 1]) {
flag = 1;
break;
} else {
continue;
}
}
if (flag) {
std::cout << "BAD";
} else {
std::cout << "GOOD";
... | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
bool flag = 0;
for (size_t i = 0; i < S.size() - 1; i++) {
if (S[i] == S[i + 1]) {
flag = 1;
break;
} else {
continue;
}
}
if (flag) {
std::cout << "Bad";
} else {
std::cout << "Good";
... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 799,885 | 799,886 | u080498875 | 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"
] | 799,917 | 799,918 | u836743234 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.