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 |
|---|---|---|---|---|---|---|---|
p02933 | #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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,715 | 732,716 | u272628953 | cpp |
p02933 | #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... | [
"io.output.change"
] | 732,717 | 732,718 | u311099484 | cpp |
p02933 |
#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...... | [
"variable_declaration.type.change"
] | 732,727 | 732,728 | u089177147 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
if (a >= 3200)
cout << b << endl;
else
cout << "s" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
if (a >= 3200)
cout << b << endl;
else
cout << "red" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 732,739 | 732,740 | u079532978 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
} | [] | 732,745 | 732,746 | u425231382 | cpp |
p02933 | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | [
"literal.string.change",
"io.output.change"
] | 732,749 | 732,750 | u915716225 | cpp |
p02933 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << "red";
} else {
cout << s;
}
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,756 | 732,757 | u329845662 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << a;
} else
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red";
} else
cout << s;
} | [
"io.output.change"
] | 732,778 | 732,777 | u479329399 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cout << "\n";
cin >> s;
if (a > 3200) {
cout << s;
}
else {
cout << "red";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cout << "\n";
cin >> s;
if (a >= 3200) {
cout << s;
}
else {
cout << "red";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,779 | 732,780 | u831336344 | cpp |
p02933 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if (n > 3200)
cout << s << endl;
else
cout << "red" << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,784 | 732,785 | u849151695 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,786 | 732,787 | u225581241 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
} | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
} | [] | 732,790 | 732,791 | u323819429 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
s = "red";
cout << s << 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() {
int n;
string s;
cin >> n >> s;
if (n < 3200)
s = "red";
cout << s << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,796 | 732,797 | u730499268 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a <= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,802 | 732,803 | u894339989 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,804 | 732,803 | u894339989 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,805 | 732,806 | u104074027 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,807 | 732,808 | u126236540 | cpp |
p02933 | #include <iostream>
#include <string>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a < 3200) {
std::cout << s << std::endl;
} else {
std::cout << "red" << std::endl;
}
return 0;
} | #include <iostream>
#include <string>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a >= 3200) {
std::cout << s << std::endl;
} else {
std::cout << "red" << std::endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,809 | 732,810 | u225053756 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
cout << ((a < 3200) ? s : "red") << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
cout << ((a >= 3200) ? s : "red") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 732,819 | 732,820 | u529722835 | cpp |
p02933 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 732,830 | 732,831 | u437229403 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
short int r;
string s;
cin >> r >> s;
if (r >= 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
short int r;
string s;
cin >> r >> s;
if (r < 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,834 | 732,835 | u669403424 | cpp |
p02933 | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200)... | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,840 | 732,841 | u928591554 | cpp |
p02930 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int calc(int x) {
int ans = 0;
while (x) {
ans++;
x >>= 1;
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++)
printf("%d ", calc(i ^ j));
prin... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int calc(int x) {
int ans = 0;
while (x) {
ans++;
x >>= 1;
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++)
printf("%d ", calc(i ^ j));
p... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 732,850 | 732,851 | u656762776 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#de... | #include <bits/stdc++.h>
using namespace std;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#de... | [
"assignment.change"
] | 732,858 | 732,859 | u430870052 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int x, y, w;
node() = default;
node(int _x, int _y, int _w) : x(_x), y(_y), w(_w) {}
bool friend operator<(const node &a, const node &b) { return a.w > b.w; }
};
int n, h, w;
int fa[maxn * 2], sz[maxn * 2];
int find(int x) { r... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int x, y, w;
node() = default;
node(int _x, int _y, int _w) : x(_x), y(_y), w(_w) {}
bool friend operator<(const node &a, const node &b) { return a.w > b.w; }
};
int n, h, w;
int fa[maxn * 2], sz[maxn * 2];
int find(int x) { r... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 732,860 | 732,861 | u639210885 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, h, w, f[N << 1], si[N << 1];
bool vis[N << 1];
struct node {
int a, x, y;
bool operator<(const node &o) const { return a > o.a; }
} a[N];
int getf(int x) { return f[x] == x ? f[x] : f[x] = getf(f[x]); }
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, h, w, f[N << 1], si[N << 1];
bool vis[N << 1];
struct node {
int a, x, y;
bool operator<(const node &o) const { return a > o.a; }
} a[N];
int getf(int x) { return f[x] == x ? f[x] : f[x] = getf(f[x]); }
int main() {
... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 732,862 | 732,863 | u676323984 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | [
"assignment.value.change",
"identifier.change"
] | 732,871 | 732,872 | u379947938 | cpp |
p02931 | // luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int r, c, v;
} e[200001];
bool cmp(edge a, edge b) { return a.v > b.v; }
int fa[200001];
int siz[200001];
int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); }
signed main() {
int n, h, w;
scan... | // luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int r, c, v;
} e[200001];
bool cmp(edge a, edge b) { return a.v > b.v; }
int fa[200001];
int siz[200001];
int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); }
signed main() {
int n, h, w;
scan... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 732,877 | 732,878 | u413057858 | cpp |
p02931 | // orz dxm
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define y0 yORZDXM
#define y1 yORZDXM
#define y2 yORZDXM
ty... | // orz dxm
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define y0 yORZDXM
#define y1 yORZDXM
#define y2 yORZDXM
ty... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 732,879 | 732,880 | u904221771 | cpp |
p02931 | #include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {... | #include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 732,883 | 732,884 | u580537908 | cpp |
p02931 | #include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {... | #include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 732,885 | 732,884 | u580537908 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 732,886 | 732,887 | u096883693 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"call.arguments.change"
] | 732,892 | 732,893 | u895971408 | cpp |
p02931 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
// Verified: AOJ-DSL1A
class UFSet {
private:
vector<int> ranks;
vector<int> prevs;
public:
UFSet(int n) : ranks(n), prevs(n) {
for (int i = 0; i < n; i++)
prevs[i] = i;
}
// Returns a root of a tree which x belongs to.
in... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
// Verified: AOJ-DSL1A
class UFSet {
private:
vector<int> ranks;
vector<int> prevs;
public:
UFSet(int n) : ranks(n), prevs(n) {
for (int i = 0; i < n; i++)
prevs[i] = i;
}
// Returns a root of a tree which x belongs to.
in... | [
"variable_declaration.value.change"
] | 732,894 | 732,895 | u771276542 | cpp |
p02931 | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 732,905 | 732,906 | u880862257 | cpp |
p02933 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define rbg rbegin()
#define red rend()
#define all... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define rbg rbegin()
#define red rend()
#define all... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 732,913 | 732,914 | u891346638 | cpp |
p02933 | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | [
"io.output.change"
] | 732,915 | 732,916 | u102842945 | cpp |
p02933 | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | [
"io.output.change",
"literal.string.change"
] | 732,917 | 732,916 | u102842945 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 732,922 | 732,923 | u650236619 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string S;
cin >> S;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string S;
cin >> S;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,951 | 732,952 | u319965179 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "Red" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 732,957 | 732,958 | u170385544 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 732,959 | 732,960 | u893584578 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "s" << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [] | 732,963 | 732,964 | u587669944 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"expression.operation.binary.remove"
] | 732,981 | 732,982 | u998008108 | cpp |
p02933 |
#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 <iomanip>
#include <iostream>
... |
#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 <iomanip>
#include <iostream>
... | [
"assignment.value.change",
"identifier.change"
] | 732,987 | 732,988 | u927801748 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << a << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 732,991 | 732,992 | u150155436 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a >> str;
if (a > 3200)
cout << str;
else
cout << "red";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a >> str;
if (a >= 3200)
cout << str;
else
cout << "red";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,993 | 732,994 | u367131219 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| [] | 732,995 | 732,996 | u834753207 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red" << endl;
}
else {
cout << s << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
}
| [
"control_flow.branch.else.add"
] | 733,003 | 733,004 | u516876944 | cpp |
p02933 | #include <bits/stdc++.h>
#define cs \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define cs \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,012 | 733,013 | u668974816 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N >= 3200)
cout << "red" << endl;
else
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,040 | 733,041 | u161593842 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N >> R;
if (N >= 3200)
cout << "red" << endl;
else
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,042 | 733,041 | u161593842 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N >> R;
if (N >= 3200)
cout << "Red" << endl;
else
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,043 | 733,041 | u161593842 | cpp |
p02933 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "reb\n";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 733,044 | 733,045 | u535565217 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << a << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
... | [
"identifier.change",
"io.output.change"
] | 733,049 | 733,050 | u842897677 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "res" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 733,056 | 733,057 | u471069244 | cpp |
p02933 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,060 | 733,061 | u485925545 | cpp |
p02933 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 320)
cout << "red" << endl;
else
cout << s << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
| [] | 733,062 | 733,061 | u485925545 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a <= 3200)
cout << s;
else
cout << "red";
}
| #include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,063 | 733,064 | u272107664 | cpp |
p02933 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,079 | 733,080 | u728095140 | cpp |
p02933 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "Red" << endl;
} else {
cout << s << endl;
}
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,081 | 733,080 | u728095140 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,084 | 733,085 | u387371565 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
| [
"io.output.change"
] | 733,090 | 733,091 | u525560003 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#def... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,102 | 733,103 | u203197031 | cpp |
p02933 | #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(), (... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 733,106 | 733,107 | u461913494 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
if (a >= 3200) {
string s;
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
if (a >= 3200) {
string s;
cin >> s;
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| [] | 733,113 | 733,114 | u037563046 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N <= 3200)
cout << "red" << endl;
else
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N < 3200)
cout << "red" << endl;
else
cout << S << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,120 | 733,121 | u889173297 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N >= 3200)
cout << "red" << endl;
else
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N < 3200)
cout << "red" << endl;
else
cout << S << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,122 | 733,121 | u889173297 | cpp |
p02933 | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n),... | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n),... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,123 | 733,124 | u671267423 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? "red" : "pink") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
} | [
"io.output.change",
"literal.string.change"
] | 733,125 | 733,126 | u717762991 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a < 3200 ? "red" : "pink") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 733,127 | 733,126 | u717762991 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,130 | 733,131 | u293523151 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << a << endl;
} else {
cout << "red" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 733,132 | 733,133 | u068713120 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s;
} else {
cout << "red" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,140 | 733,141 | u633728454 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << s << '\n';
else
cout << "red\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << '\n';
else
cout << "red\n";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,148 | 733,149 | u338339091 | cpp |
p02933 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red";
} else {
cout << s;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,150 | 733,151 | u726771425 | cpp |
p02933 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red";
} else {
cout << s;
}
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,152 | 733,151 | u726771425 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
} | [
"control_flow.branch.else.add"
] | 733,167 | 733,168 | u492707675 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,169 | 733,170 | u607728868 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [] | 733,171 | 733,172 | u808743599 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (int)v.size()
#define UNIQUE(v) v.erase(uni... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (int)v.size()
#define UNIQUE(v) v.erase(uni... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 733,178 | 733,179 | u281168735 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 733,192 | 733,193 | u271369517 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
getline(cin, s);
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| [
"call.remove",
"call.arguments.change"
] | 733,199 | 733,200 | u457196771 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,215 | 733,216 | u275786410 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) // 不小于 3200
{
cout << s << endl;
} else { // 小于 3200
cout << "red\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) // 不小于 3200
{
cout << s << endl;
} else { // 小于 3200
cout << "red\n";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,221 | 733,222 | u440588451 | cpp |
p02933 |
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s;
} else if (a < 3200) {
cout << "red";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else if (a <= 3200) {
cout << "red";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,223 | 733,224 | u079905062 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int s;
string a;
cin >> s >> a;
if (s >= 3200)
cout << s << a << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int s;
string a;
cin >> s >> a;
if (s >= 3200) {
cout << a << endl;
} else
cout << "red" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 733,226 | 733,227 | u589238650 | cpp |
p02933 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,231 | 733,232 | u047655753 | cpp |
p02933 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,233 | 733,232 | u047655753 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,234 | 733,235 | u559578080 | cpp |
p02933 | #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++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << "r... | #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++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200)
cout << "re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,251 | 733,252 | u491314298 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
return 0;
}
| [] | 733,257 | 733,258 | u550374978 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
} | [] | 733,259 | 733,260 | u702701631 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << "red";
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
} | [
"io.output.change"
] | 733,262 | 733,260 | u702701631 | cpp |
p02933 |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,273 | 733,274 | u084466852 | cpp |
p02933 |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,275 | 733,274 | u084466852 | cpp |
p02933 |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(),... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,276 | 733,274 | u084466852 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N > 3199)
cout << "red" << endl;
else
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N > 3199)
cout << S << endl;
else
cout << "red" << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 733,283 | 733,284 | u762476457 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 733,287 | 733,288 | u539011156 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const int MOD = 1000000007;
int main() {
int a;
string s;
std::cin >> a >> s;
if (a <=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const int MOD = 1000000007;
int main() {
int a;
string s;
std::cin >> a >> s;
if (a < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,290 | 733,291 | u539011156 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.