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 8
values |
|---|---|---|---|---|---|---|---|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
char s[10];
cin >> a >> s;
if (3200 < a) {
printf("red");
} else {
printf("%s", s);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
char s[10];
cin >> a >> s;
if (3200 > a) {
printf("red");
} else {
printf("%s", s);
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,842
| 733,843
|
u038326140
|
cpp
|
p02933
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a <= 3200) {
cout << "res" << endl;
} else {
cout << s << endl;
}
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
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",
"literal.string.change",
"io.output.change"
] | 733,844
| 733,845
|
u157759251
|
cpp
|
p02933
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "res" << endl;
} else {
cout << s << endl;
}
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve();
signed main() {
#ifdef LOCAL
freopen("file1.txt", "r", stdin);
freopen("file2.txt", "w", stderr);
#endif
srand(time(0));
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(15);
solve();
}
const int INF = 1e18, MAXN = 1e5 + 10;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 733,846
| 733,845
|
u157759251
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
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;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,860
| 733,861
|
u272156949
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (s.size() <= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"expression.operation.binary.remove"
] | 733,866
| 733,867
|
u545770260
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,874
| 733,875
|
u561186440
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int N;
cin >> N >> s;
if (N >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int N;
cin >> N >> s;
if (N >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 733,876
| 733,877
|
u938317342
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
string 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() {
long long a;
string s;
cin >> a >> s;
if (a < 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,888
| 733,889
|
u750655014
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << (a >= 3200 ? "red" : s) << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << (a < 3200 ? "red" : s) << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 733,894
| 733,895
|
u949798495
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define YES cout << "yes" << endl
int main() {
int n;
cin >> n;
string str;
cin >> str;
if (n <= 3200) {
cout << str << endl;
} else {
cout << "red " << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define YES cout << "yes" << endl
int main() {
int n;
cin >> n;
string str;
cin >> str;
if (n >= 3200) {
cout << str << endl;
} else {
cout << "red " << endl;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,899
| 733,900
|
u645892144
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"io.output.change"
] | 733,902
| 733,903
|
u986276444
|
cpp
|
p02933
|
#include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int INF = 100000000;
using namespace std;
int main() {
#ifdef LOCAL
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "pink" << endl;
}
return 0;
}
|
#include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int INF = 100000000;
using namespace std;
int main() {
#ifdef LOCAL
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 733,904
| 733,905
|
u214712859
|
cpp
|
p02933
|
#include <stdio.h>
int a;
int main(void) {
char str[8];
scanf("%d\n%s", &a, str);
if (a >= 2300) {
printf("%s", str);
} else {
printf("red\n");
}
}
|
#include <stdio.h>
int a;
int main() {
char str[10000];
scanf("%d\n%s", &a, str);
if (a >= 3200) {
printf("%s\n", str);
} else {
printf("red\n");
}
}
|
[
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 733,919
| 733,920
|
u481397767
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define PB(x) push_back(x)
#define SIZE(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define PB(x) push_back(x)
#define SIZE(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
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,934
| 733,935
|
u013120980
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (3200 <= a) {
cout << s;
} else {
cout << 'red';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (3200 <= a) {
cout << s;
} else {
cout << "red";
}
}
|
[
"literal.string.change",
"io.output.change"
] | 733,941
| 733,942
|
u757777793
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (3200 <= a) {
cout << s;
} else {
cout << 'red';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (3200 <= a) {
cout << s;
} else {
cout << "red";
}
}
|
[
"literal.string.change",
"io.output.change"
] | 733,941
| 733,943
|
u757777793
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> 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;
cin >> s;
if (a < 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,955
| 733,956
|
u468443183
|
cpp
|
p02933
|
#include <iostream>
int main() {
int a;
scanf("%d", &a);
char *s;
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
}
|
#include <iostream>
int main() {
int a;
scanf("%d", &a);
char s[10];
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
}
|
[] | 733,960
| 733,961
|
u339419997
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s;
} else {
cout << "red";
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,964
| 733,965
|
u090445726
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
cin >> s;
if (a < 3200)
cout << 'red';
else
cout << s;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
cin >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
|
[
"literal.string.change",
"io.output.change"
] | 733,968
| 733,969
|
u680788721
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3900)
cout << "red\n";
else
cout << s << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 733,980
| 733,981
|
u338847482
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n > 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,993
| 733,994
|
u712243469
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << 'red' << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 733,995
| 733,996
|
u518574248
|
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"
] | 734,002
| 734,003
|
u971421535
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,011
| 734,012
|
u386662710
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a <= 3200) {
cout << "red" << endl;
} else if (a > 3200) {
cout << s << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else if (a >= 3200) {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,013
| 734,014
|
u891807037
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a <= 3200) {
cout << s << endl;
} else if (a > 3200) {
cout << s << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else if (a >= 3200) {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 734,015
| 734,014
|
u891807037
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long long
#define repb(i, a, b) for (int i = a; i <= b; i++)
#define CloseIo ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int main() {
int a;
string s;
cin >> a >> s;
string ans = (a > 3200) ? "red" : s;
cout << ans;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long long
#define repb(i, a, b) for (int i = a; i <= b; i++)
#define CloseIo ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int main() {
int a;
string s;
cin >> a >> s;
string ans = (a < 3200) ? "red" : s;
cout << ans;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 734,018
| 734,019
|
u680195439
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << 'red';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
[
"literal.string.change",
"io.output.change"
] | 734,020
| 734,021
|
u628597699
|
cpp
|
p02933
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
string s, ans;
cin >> a >> s;
if (a >= 3200) {
ans = s;
} else {
ans = 'red';
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
string s, ans;
cin >> a >> s;
if (a >= 3200) {
ans = s;
} else {
ans = "red";
}
cout << ans << endl;
return 0;
}
|
[
"literal.string.change",
"assignment.value.change"
] | 734,022
| 734,023
|
u313578168
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << '[';
for (const T &i : a)
out << i << ',';
out << ']';
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &a) {
out << '{';
for (const T &i : a)
out << i << ',';
out << '}';
return out;
}
template <class T, class S>
ostream &operator<<(ostream &out, const map<T, S> &a) {
out << '{';
for (auto &i : a)
out << i << ',';
out << '}';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << '[';
for (const T &i : a)
out << i << ',';
out << ']';
return out;
}
template <class T> ostream &operator<<(ostream &out, const set<T> &a) {
out << '{';
for (const T &i : a)
out << i << ',';
out << '}';
return out;
}
template <class T, class S>
ostream &operator<<(ostream &out, const map<T, S> &a) {
out << '{';
for (auto &i : a)
out << i << ',';
out << '}';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 734,041
| 734,042
|
u333917945
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <unordered_map>
#define lli long long int
#define fl(i, a, b) for (int i = a; i < b; ++i)
#define fl2(i, a, b) for (int i = a; i <= b; ++i)
#define rfl(i, a, b) for (int i = a; i > b; --i)
#define rfl2(i, a, b) for (int i = a; i >= b; ++i)
#define all(v) ((v).begin(), (v).end())
#define all2(v) ((a) + 0, (a) + n);
#define sz(s) (s).size()
#define OO (lli)1e18
#define MIN INT_MIN
#define f first
#define s second
#define mp make_pair
#define pb puch_back
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
using namespace std;
lli power(lli x, lli y) {
lli i, power = 1;
if (y == 0)
return 1;
for (i = 1; i <= y; i++)
power = power * x;
return power;
}
int32_t main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
// freopen("overcode.in","r",stdin);
// freopen("output.txt", "w", stdout);
clock_t z = clock();
int x;
string str;
cin >> x >> str;
cout << (x <= 3200 ? str : "red") << '\n';
debug("Total Time: %.3f\n", (double)(clock() - z) / CLOCKS_PER_SEC);
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#define lli long long int
#define fl(i, a, b) for (int i = a; i < b; ++i)
#define fl2(i, a, b) for (int i = a; i <= b; ++i)
#define rfl(i, a, b) for (int i = a; i > b; --i)
#define rfl2(i, a, b) for (int i = a; i >= b; ++i)
#define all(v) ((v).begin(), (v).end())
#define all2(v) ((a) + 0, (a) + n);
#define sz(s) (s).size()
#define OO (lli)1e18
#define MIN INT_MIN
#define f first
#define s second
#define mp make_pair
#define pb puch_back
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
using namespace std;
lli power(lli x, lli y) {
lli i, power = 1;
if (y == 0)
return 1;
for (i = 1; i <= y; i++)
power = power * x;
return power;
}
int32_t main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
// freopen("overcode.in","r",stdin);
// freopen("output.txt", "w", stdout);
clock_t z = clock();
int x;
string str;
cin >> x >> str;
cout << (x >= 3200 ? str : "red") << '\n';
debug("Total Time: %.3f\n", (double)(clock() - z) / CLOCKS_PER_SEC);
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,045
| 734,046
|
u678284395
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a <= 3200)
cout << at;
else
cout << s;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a < 3200)
cout << at;
else
cout << s;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,068
| 734,069
|
u262303450
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a <= 3200)
cout << at;
else
cout << a;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a < 3200)
cout << at;
else
cout << s;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 734,070
| 734,069
|
u262303450
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a < 3200)
cout << at;
else
cout << a;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s, at = "red";
cin >> a >> s;
if (a < 3200)
cout << at;
else
cout << s;
return 0;
}
|
[
"identifier.change",
"io.output.change"
] | 734,071
| 734,069
|
u262303450
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int a;
string s;
void solve() {
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
int main() {
cin >> a >> s;
solve();
}
|
#include <iostream>
using namespace std;
int a;
string s;
void solve() {
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
int main() {
cin >> a >> s;
solve();
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,074
| 734,075
|
u550178285
|
cpp
|
p02933
|
#include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep(i, a, b) for (auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define print(v) \
{ \
for (auto x : v) \
cout << x << ' '; \
cout << endl; \
}
#define printn(v, n) \
{ \
for (int _i = 0; _i < n; _i++) \
cout << *(v + _i) << ' '; \
cout << endl; \
}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
const int MAXN = 1000 + 20;
int n, m;
double a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << n << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep(i, a, b) for (auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define print(v) \
{ \
for (auto x : v) \
cout << x << ' '; \
cout << endl; \
}
#define printn(v, n) \
{ \
for (int _i = 0; _i < n; _i++) \
cout << *(v + _i) << ' '; \
cout << endl; \
}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
const int MAXN = 1000 + 20;
int n, m;
double a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"identifier.change",
"io.output.change"
] | 734,089
| 734,090
|
u096453658
|
cpp
|
p02933
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, s;
cin >> a;
cin >> s;
if (3200 <= a) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (3200 <= a) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[] | 734,091
| 734,092
|
u616901930
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
fast ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
fast ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"io.output.change"
] | 734,098
| 734,099
|
u015580732
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
#define coutd \
if (DEBUG) \
cout
#define ff first
#define ss second
#define debug(x) cout << "> x:" << x << endl;
#define len(x) int(x.size())
#define all(x) x.begin(), x.end()
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
const double PI = acos(-1);
const double EPS = 1e-9;
int main() {
ios::sync_with_stdio(0);
int a;
string st;
cin >> a >> st;
if (not a < 3200) {
cout << st << endl;
} else {
cout << "red\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
#define coutd \
if (DEBUG) \
cout
#define ff first
#define ss second
#define debug(x) cout << "> x:" << x << endl;
#define len(x) int(x.size())
#define all(x) x.begin(), x.end()
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
const double PI = acos(-1);
const double EPS = 1e-9;
int main() {
ios::sync_with_stdio(0);
int a;
string st;
cin >> a >> st;
if (not(a < 3200)) {
cout << st << endl;
} else {
cout << "red\n";
}
}
|
[
"control_flow.branch.if.condition.change"
] | 734,100
| 734,101
|
u808092084
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << a << endl;
else
cout << s << endl;
}
|
#include <iostream>
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.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 734,120
| 734,121
|
u362444129
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
int main() {
int n;
char s[20];
cin >> n >> s;
if (n > 3200)
printf("red\n");
else
printf("%s\n", s);
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
int main() {
int n;
char s[20];
cin >> n >> s;
if (n < 3200)
printf("red\n");
else
printf("%s\n", s);
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,122
| 734,123
|
u335768052
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,124
| 734,125
|
u429559781
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << "red";
} else {
cout << "pink";
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
[
"io.output.change",
"literal.string.change"
] | 734,126
| 734,127
|
u165212329
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define int long long
#define double long double
const int INF = (int)1e18 + 18;
const int maxn = (int)1e6 + 6;
using namespace std;
int a;
string s;
signed main() {
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
const int INF = (int)1e18 + 18;
const int maxn = (int)1e6 + 6;
using namespace std;
int a;
string s;
signed main() {
cin >> a >> s;
if (a >= 3200)
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"
] | 734,128
| 734,129
|
u699731638
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << 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;
}
|
[
"control_flow.branch.else.add"
] | 734,137
| 734,138
|
u818939493
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int num{0};
string color;
cin >> num >> color;
if (num < 3200) {
cout << "pink" << endl;
} else {
cout << color;
}
}
|
#include <iostream>
using namespace std;
int main() {
int num{0};
string color;
cin >> num >> color;
if (num < 3200) {
cout << "red" << endl;
} else {
cout << color;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 734,144
| 734,145
|
u963215078
|
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;
cin >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,146
| 734,147
|
u428138851
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, m) for (int i = n; i < m; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(c) c.begin(), c.end()
#define desc_sort(v) sort(v.rbegin(), v.rend())
#define tr(c, i) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define M 1000000007
#define pushll(head, d) push_into_linkedlist(&head, d)
#define popll(head) dp_delete_first(&head)
#define eol cout << "\n"
#define N 1000000
typedef set<int> si;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<vector<int>> vii;
int main() {
ios int T = 1;
// cin>>T;
while (T--) {
int n;
string s;
cin >> n >> s;
if (n > 3200)
cout << s;
else
cout << "red";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, m) for (int i = n; i < m; i++)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(c) c.begin(), c.end()
#define desc_sort(v) sort(v.rbegin(), v.rend())
#define tr(c, i) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define M 1000000007
#define pushll(head, d) push_into_linkedlist(&head, d)
#define popll(head) dp_delete_first(&head)
#define eol cout << "\n"
#define N 1000000
typedef set<int> si;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<vector<int>> vii;
int main() {
ios int T = 1;
// cin>>T;
while (T--) {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,148
| 734,149
|
u618848374
|
cpp
|
p02933
|
#ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;
/*
__attribute__((constructor))
void initial()
{
cin.tie(NULL);
ios::sync_with_stdio(false);
}
*/
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int a, s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;
/*
__attribute__((constructor))
void initial()
{
cin.tie(NULL);
ios::sync_with_stdio(false);
}
*/
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[] | 734,152
| 734,153
|
u528744583
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
double pi = 3.141592653589793;
ll mod = 1000000007;
ll INF = 1000000001;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "pink" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
double pi = 3.141592653589793;
ll mod = 1000000007;
ll INF = 1000000001;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,156
| 734,157
|
u033602950
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
cout << ((n > 3200) ? s : "red");
}
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
cout << ((n >= 3200) ? s : "red");
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,161
| 734,162
|
u747201517
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
cout << ((n > 3200) ? "red" : s);
}
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
cout << ((n >= 3200) ? s : "red");
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,163
| 734,162
|
u747201517
|
cpp
|
p02933
|
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
std::vector<int> enum_div(int n) // nの約数を列挙
{
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
int main() {
ll A;
cin >> A;
string S;
cin >> S;
if (A >= 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
// cout<<ans<<endl;
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
std::vector<int> enum_div(int n) // nの約数を列挙
{
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
int main() {
ll A;
cin >> A;
string S;
cin >> S;
if (A < 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
// cout<<ans<<endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,176
| 734,177
|
u043443359
|
cpp
|
p02933
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
cin >> s;
if (a > 3200) {
cout << "red" << endl;
return 0;
} else {
cout << s << endl;
return 0;
}
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
return 0;
} else {
cout << s << endl;
return 0;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,178
| 734,179
|
u337355231
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define N 1e10 + 7
#define mp(a, b) make_pair(a, b)
#define inf 1e10
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red" << endl;
} else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define N 1e10 + 7
#define mp(a, b) make_pair(a, b)
#define inf 1e10
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a;
string s;
cin >> a >> s;
if (a < 3200)
{
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,184
| 734,185
|
u120250419
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll a;
cin >> a;
string str;
cin >> str;
cout << (a >= 3200 ? str : "Red") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll a;
cin >> a;
string str;
cin >> str;
cout << (a >= 3200 ? str : "red") << endl;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,189
| 734,190
|
u382880969
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << "red";
}
if (n < 3200) {
cout << s;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
}
if (n >= 3200) {
cout << s;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,205
| 734,206
|
u392722358
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n;
string s;
cin >> n >> s;
if (n > 3200) {
cout << "red";
}
if (n <= 3200) {
cout << s;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
}
if (n >= 3200) {
cout << s;
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,207
| 734,206
|
u392722358
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <iostream>
using namespace std;
int main() {
string s;
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[] | 734,208
| 734,209
|
u367199607
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y)); //整数型のまま切り上げ演算する
#define PI 3.14159265359
typedef long long LL;
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline T gcd(T x, T y) {
if (y == 0) {
return x;
} else if (x == 0) {
return y;
}
return gcd(y, x % y);
}
template <class T> inline T lcm(T x, T y) { return (x * y) / gcd(x, y); }
template <class T> inline vector<T> convert_to_binary_number(T x) {
vector<T> binary_num;
while (x != 1) {
binary_num.push_back(x % 2);
x /= 2;
}
binary_num.push_back(1);
return binary_num;
}
template <class T> inline void print_vector(vector<T> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
cout << endl;
}
const LL MOD = 1e9 + 7;
const LL INF = 1LL << 60;
int main(void) {
int a;
string s;
cin >> a >> s;
if (3200 <= a)
cout << s << endl;
else
cout << 'red' << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y)); //整数型のまま切り上げ演算する
#define PI 3.14159265359
typedef long long LL;
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline T gcd(T x, T y) {
if (y == 0) {
return x;
} else if (x == 0) {
return y;
}
return gcd(y, x % y);
}
template <class T> inline T lcm(T x, T y) { return (x * y) / gcd(x, y); }
template <class T> inline vector<T> convert_to_binary_number(T x) {
vector<T> binary_num;
while (x != 1) {
binary_num.push_back(x % 2);
x /= 2;
}
binary_num.push_back(1);
return binary_num;
}
template <class T> inline void print_vector(vector<T> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
cout << endl;
}
const LL MOD = 1e9 + 7;
const LL INF = 1LL << 60;
int main(void) {
int a;
string s;
cin >> a >> s;
if (3200 <= a)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,212
| 734,213
|
u139235669
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int num;
string str;
cin >> num >> str;
if (num >= 3500) {
cout << str << endl;
} else {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int num;
string str;
cin >> num >> str;
if (num >= 3200) {
cout << str << endl;
} else {
cout << "red" << endl;
}
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,220
| 734,221
|
u538853954
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sync \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
int powm(int base, int exp, int mod = MOD) {
int ans = 1;
while (exp) {
if (exp & 1)
ans = (ans * base) % mod;
exp >>= 1, base = (base * base) % mod;
}
return ans;
}
int32_t main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sync \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
int powm(int base, int exp, int mod = MOD) {
int ans = 1;
while (exp) {
if (exp & 1)
ans = (ans * base) % mod;
exp >>= 1, base = (base * base) % mod;
}
return ans;
}
int32_t main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"io.output.change"
] | 734,227
| 734,228
|
u112934680
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
#include <string>
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#include <string>
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,233
| 734,234
|
u553183019
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
#include <string>
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 300) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#include <string>
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[] | 734,235
| 734,234
|
u553183019
|
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;
}
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;
}
|
[
"control_flow.branch.else.add"
] | 734,245
| 734,246
|
u005469124
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
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;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,250
| 734,251
|
u787696070
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
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;
}
}
|
[] | 734,257
| 734,258
|
u617323246
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a;
string str;
int main() {
ios::sync_with_stdio(NULL);
cin.tie(nullptr), cout.tie(nullptr);
cin >> a >> str;
cout << (a >= 32 ? str : "red") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a;
string str;
int main() {
ios::sync_with_stdio(NULL);
cin.tie(nullptr), cout.tie(nullptr);
cin >> a >> str;
cout << (a >= 3200 ? str : "red") << endl;
return 0;
}
|
[
"literal.number.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,265
| 734,266
|
u019624819
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[] | 734,272
| 734,273
|
u433048345
|
cpp
|
p02933
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string x;
int t;
cin >> t >> x;
if (t < 3200) {
cout << x << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string x;
int t;
cin >> t >> x;
if (t >= 3200) {
cout << x << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,283
| 734,284
|
u711431224
|
cpp
|
p02933
|
#include <iostream>
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 <iostream>
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;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,289
| 734,290
|
u495284745
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int num = 0;
string str;
cin >> num;
cin >> str;
if (num >= 3200) {
cout << "red" << endl;
} else {
cout << str << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int num = 0;
string str;
cin >> num;
cin >> str;
if (num >= 3200) {
cout << str << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"control_flow.branch.else.add"
] | 734,291
| 734,292
|
u725048312
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
char s;
cin >> a >> s;
cout << (a < 3200 ? 'red' : s) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << (a < 3200 ? "red" : s) << endl;
}
|
[
"variable_declaration.type.change",
"literal.string.change",
"io.output.change"
] | 734,295
| 734,296
|
u745852541
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int i;
string s;
cin >> i;
cin >> s;
if (i < 32000) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int i;
string s;
cin >> i;
cin >> s;
if (i < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,297
| 734,298
|
u306033313
|
cpp
|
p02933
|
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int a;
cin >> s >> a;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int a;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"expression.operation.binary.remove"
] | 734,305
| 734,306
|
u358748139
|
cpp
|
p02933
|
#include <iostream>
int main(int argc, char *argv[]) {
int a;
std::string s;
std::cin >> a >> s;
if (a > 3200) {
s = "red";
}
std::cout << s << std::endl;
return 0;
}
|
#include <iostream>
int main(int argc, char *argv[]) {
int a;
std::string s;
std::cin >> a >> s;
if (a < 3200) {
s = "red";
}
std::cout << s << std::endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,307
| 734,308
|
u925609541
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long l;
int main() {
l a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red";
} else
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long l;
int main() {
l a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else
cout << s;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,309
| 734,310
|
u692290528
|
cpp
|
p02933
|
#include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
int a;
char s[10];
cin >> a;
cin >> s;
if (a > 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
int a;
char s[10];
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,321
| 734,322
|
u223511989
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a == 3200)
cout << "s" << endl;
if (a > 3200)
cout << "s" << endl;
if (a < 3200)
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;
if (a > 3200)
cout << s << endl;
if (a < 3200)
cout << "red" << endl;
}
|
[] | 734,325
| 734,326
|
u789417760
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
}
if (a << 3200) {
cout << "red";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
}
if (a < 3200) {
cout << "red";
}
}
|
[
"misc.typo",
"control_flow.branch.if.condition.change"
] | 734,328
| 734,329
|
u707810208
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define rev1(i, n) for (int i = n; i > 0; i--)
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int, int>>
#define vb vector<bool>
#define pii pair<int, int>
#define F first
#define S second
#define INF 1e9 + 7
typedef long long int ll;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << 'red';
else
cout << s;
}
signed main() {
// your code goes here
IOS ll t = 1;
// cin>>t;
rep1(i, t) { solve(); }
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define rev1(i, n) for (int i = n; i > 0; i--)
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int, int>>
#define vb vector<bool>
#define pii pair<int, int>
#define F first
#define S second
#define INF 1e9 + 7
typedef long long int ll;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
signed main() {
// your code goes here
IOS ll t = 1;
// cin>>t;
rep1(i, t) { solve(); }
}
|
[
"literal.string.change",
"io.output.change"
] | 734,339
| 734,340
|
u557492306
|
cpp
|
p02933
|
///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld", &a)
#define sf2(a, b) scanf("%lld %lld", &a, &b)
#define sf3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pf(a) printf("%lld", a)
#define pf2(a, b) printf("%lld %lld", a, b)
#define pf3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main() {
timesave;
long a;
string s;
while (cin >> s) {
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}
}
|
///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld", &a)
#define sf2(a, b) scanf("%lld %lld", &a, &b)
#define sf3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pf(a) printf("%lld", a)
#define pf2(a, b) printf("%lld %lld", a, b)
#define pf3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main() {
timesave;
long a;
string s;
while (cin >> a >> s) {
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
}
|
[
"control_flow.loop.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,348
| 734,349
|
u701011345
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << s << 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 << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,350
| 734,351
|
u814501862
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << s << 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 << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,352
| 734,351
|
u814501862
|
cpp
|
p02933
|
// Contest.cpp : アプリケーションのエントリ ポイントを定義します。
//
#include "algorithm"
#include "iostream"
#include "string"
#include "vector"
using namespace std;
int main() {
/*int n,k;
cin >> n;
vector<char>s(n);
for (int j = 0; j < n; j++) cin >> s[j];
cin >> k;
for (int i = 0; i < n; i++)
{
if (s[i] != s[k-1]) {
s[i] = '*';
}
}
for (int l = 0; l < n; l++)
{
cout << s[l] ;
}*/
int m, d;
cin >> m >> d;
if (m < 3200) {
cout << "red" << endl;
} else
cout << d << endl;
}
|
// Contest.cpp : アプリケーションのエントリ ポイントを定義します。
//
#include "algorithm"
#include "iostream"
#include "string"
#include "vector"
using namespace std;
int main() {
/*int n,k;
cin >> n;
vector<char>s(n);
for (int j = 0; j < n; j++) cin >> s[j];
cin >> k;
for (int i = 0; i < n; i++)
{
if (s[i] != s[k-1]) {
s[i] = '*';
}
}
for (int l = 0; l < n; l++)
{
cout << s[l] ;
}*/
int m;
string d;
cin >> m >> d;
if (m < 3200) {
cout << "red" << endl;
} else
cout << d << endl;
}
|
[] | 734,354
| 734,355
|
u157146122
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[20];
cin >> a >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[20];
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"control_flow.branch.else.add"
] | 734,377
| 734,378
|
u587152464
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
puts("red");
else
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
puts("red");
else
cout << s;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,381
| 734,380
|
u630713695
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,384
| 734,385
|
u174762441
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"variable_declaration.type.change"
] | 734,386
| 734,385
|
u174762441
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector<pair<long long int, long long int>>
#define all(cont) cont.begin(), cont.end()
#define EPS 1e-9
#define MOD 1000000007
#define range
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#pragma GCC optimize("Ofast")
int main() {
// freopen("input.txt","r",stdin);
IOS;
clock_t clk = clock();
int a;
string s;
cin >> a;
cin >> s;
cout << ((a < 3200) ? "Red" : s) << endl;
cerr << endl
<< setprecision(10) << fixed << (double)(clock() - clk) / CLOCKS_PER_SEC;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector<pair<long long int, long long int>>
#define all(cont) cont.begin(), cont.end()
#define EPS 1e-9
#define MOD 1000000007
#define range
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#pragma GCC optimize("Ofast")
int main() {
// freopen("input.txt","r",stdin);
IOS;
clock_t clk = clock();
int a;
string s;
cin >> a;
cin >> s;
cout << ((a < 3200) ? "red" : s) << endl;
cerr << endl
<< setprecision(10) << fixed << (double)(clock() - clk) / CLOCKS_PER_SEC;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,394
| 734,395
|
u257373249
|
cpp
|
p02933
|
#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;
}
|
#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.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,406
| 734,407
|
u625176086
|
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 if (a < 3200) {
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 if (a < 3200) {
cout << "red" << endl;
}
}
|
[
"io.output.change"
] | 734,411
| 734,412
|
u622879241
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,413
| 734,414
|
u655991569
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
char s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
[
"variable_declaration.type.change"
] | 734,419
| 734,420
|
u808056523
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
char s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "s" << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
[
"variable_declaration.type.change"
] | 734,421
| 734,420
|
u808056523
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int s;
int main() {
cin >> n >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, q;
string s;
int main() {
cin >> n >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
[
"variable_declaration.type.change"
] | 734,426
| 734,427
|
u442426004
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
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"
] | 734,428
| 734,429
|
u542886675
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
s = "red";
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
int a;
string s;
cin >> a >> s;
if (a < 3200)
s = "red";
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,445
| 734,446
|
u980655160
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3199) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3199) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 734,457
| 734,458
|
u154931839
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.