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 <iostream>
#include <string>
using namespace std;
int main() {
int input1;
cin >> input1;
if (input1 > 3200) {
cout << "red" << endl;
} else {
string input2;
cin >> input2;
cout << input2 << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int input1;
cin >> input1;
if (input1 < 3200) {
cout << "red" << endl;
} else {
string input2;
cin >> input2;
cout << input2 << endl;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,469
| 734,470
|
u849829379
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int a1;
cin >> a1;
cin >> a;
if (a1 <= 3200) {
cout << "red";
} else {
cout << a;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int a1;
cin >> a1;
cin >> a;
if (a1 < 3200) {
cout << "red";
} else {
cout << a;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,479
| 734,480
|
u378795947
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"io.output.change"
] | 734,483
| 734,484
|
u532401120
|
cpp
|
p02933
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define roop(i, n) for (i = 0; i < n; i++)
using namespace std;
int myPower(int a, int n) { // aのn乗の計算
int x = 1;
while (n > 0) { // 全てのbitが捨てられるまで
if (n & 1) { // 一番右のbitが１のとき
x *= a;
}
a *= a;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる
}
return x;
}
int main() {
int a;
char s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define roop(i, n) for (i = 0; i < n; i++)
using namespace std;
int myPower(int a, int n) { // aのn乗の計算
int x = 1;
while (n > 0) { // 全てのbitが捨てられるまで
if (n & 1) { // 一番右のbitが１のとき
x *= a;
}
a *= a;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる
}
return x;
}
int main() {
int a;
char s[10];
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[] | 734,487
| 734,488
|
u924003610
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
|
[] | 734,489
| 734,490
|
u713603711
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a;
string s;
cin >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a;
string s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 734,505
| 734,506
|
u525288965
|
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,524
| 734,525
|
u528941312
|
cpp
|
p02933
|
#include <iostream>
#include <string>
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>
#include <string>
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,528
| 734,529
|
u423803491
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#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 <bits/stdc++.h>
#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,530
| 734,531
|
u673252469
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200)
cout << a << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#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",
"identifier.change",
"io.output.change"
] | 734,532
| 734,531
|
u673252469
|
cpp
|
p02933
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a >= 3200) {
std::cout << "red" << std::endl;
} else {
std::cout << s << std::endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a < 3200) {
std::cout << "red" << std::endl;
} else {
std::cout << s << std::endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,535
| 734,536
|
u914739916
|
cpp
|
p02933
|
// A.
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
string s;
int a;
cin >> s >> a;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
// A.
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
string s;
int a;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 734,539
| 734,540
|
u586336940
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "Red";
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,541
| 734,542
|
u910199116
|
cpp
|
p02933
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << (a <= 3200 ? s : "red");
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red");
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,543
| 734,544
|
u454826990
|
cpp
|
p02933
|
#include <iostream>
#include <string>
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>
#include <string>
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.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 734,547
| 734,548
|
u491400073
|
cpp
|
p02933
|
#include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// constexpr long long int MOD = 1000000007;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
// constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;
int N, M, K, H, W, L, R;
// long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
string s;
cin >> s;
if (N < 3200)
cout << "res\n";
else
cout << s << endl;
}
|
#include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
// constexpr long long int MOD = 1000000007;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
// constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;
int N, M, K, H, W, L, R;
// long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
string s;
cin >> s;
if (N < 3200)
cout << "red\n";
else
cout << s << endl;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,557
| 734,558
|
u468700753
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
s = "red";
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
s = "red";
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,559
| 734,560
|
u628047647
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a;
cin >> a;
string s;
cin >> s;
cout << (a >= 3200 ? "red" : s) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fol(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
typedef vector<P> vip;
int main() {
int a;
cin >> a;
string s;
cin >> s;
cout << (a < 3200 ? "red" : s) << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,561
| 734,562
|
u171026188
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
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;
}
|
[
"expression.operation.binary.add"
] | 734,567
| 734,568
|
u438621426
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
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,569
| 734,570
|
u927525869
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s;
else
cout << "red";
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
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,571
| 734,570
|
u927525869
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else if (a < 3200) {
cout << 'red' << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else if (a < 3200) {
cout << "red" << endl;
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,574
| 734,575
|
u294829559
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <string>
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;
}
|
[] | 734,578
| 734,579
|
u937660639
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n <= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,590
| 734,591
|
u952557476
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
char s;
cin >> a >> s;
if (a >= 3200)
cout << s;
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;
else
cout << "red" << endl;
}
|
[
"variable_declaration.type.change"
] | 734,594
| 734,595
|
u507188501
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ull unsigned long long
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
string s;
cin >> n >> s;
(n > 3200) ? cout << s : cout << "red";
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ull unsigned long long
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
string s;
cin >> n >> s;
(n >= 3200) ? cout << s : cout << "red";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 734,608
| 734,609
|
u867860100
|
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"
] | 734,612
| 734,613
|
u055711678
|
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;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "pink" << endl;
}
}
|
#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;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 734,618
| 734,619
|
u775556337
|
cpp
|
p02933
|
#include <stdio.h>
int main(void) {
int a;
char s[10];
2800 <= a, a < 5000;
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200)
printf("%s", s);
if (a < 3200)
printf("red¥n");
return 0;
}
|
#include <stdio.h>
int main(void) {
int a;
char s[10];
2800 <= a, a < 5000;
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200)
printf("%s", s);
if (a < 3200)
printf("red");
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 734,620
| 734,621
|
u158057857
|
cpp
|
p02933
|
/**************************************************************************
Coded by: Saba Karimi(_VINTAGE)
Institution: AIT PUNE
***************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define ld long double
#define int long long int
/**************************************************************************/
signed main() {
int a;
string s;
cin >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
|
/**************************************************************************
Coded by: Saba Karimi(_VINTAGE)
Institution: AIT PUNE
***************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define ld long double
#define int long long int
/**************************************************************************/
signed main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
|
[
"expression.operation.binary.add"
] | 734,622
| 734,623
|
u509167006
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
string a;
cin >> a;
if (s <= 3200) {
cout << "red" << endl;
} else {
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
string a;
cin >> a;
if (s < 3200) {
cout << "red" << endl;
} else {
cout << a << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,626
| 734,627
|
u676441479
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
string a;
cin >> a;
if (s >= 3200) {
cout << "red" << endl;
} else {
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
string a;
cin >> a;
if (s < 3200) {
cout << "red" << endl;
} else {
cout << a << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,628
| 734,627
|
u676441479
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << "s" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[] | 734,629
| 734,630
|
u631558039
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
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;
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"
] | 734,631
| 734,632
|
u925953803
|
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 << "pink" << 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;
}
}
|
[
"io.output.change"
] | 734,639
| 734,640
|
u633729147
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int, int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repv(i, a, b) for (int i = b - 1; i >= a; i--)
#define SET(A, val) memset(A, val, sizeof(A))
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int, int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repv(i, a, b) for (int i = b - 1; i >= a; i--)
#define SET(A, val) memset(A, val, sizeof(A))
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,641
| 734,642
|
u164644833
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a, s;
char str[100];
cin >> a >> str;
if (a >= 3600) {
cout << str << '\n';
}
if (a < 3600) {
cout << "red" << '\n';
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, s;
char str[1000];
cin >> a >> str;
if (a >= 3200) {
cout << str << '\n';
}
if (a < 3200) {
cout << "red" << '\n';
}
return 0;
}
|
[
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 734,652
| 734,653
|
u349056386
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(x) (x).begin(), (x).end()
#define OUT(a) cout << (a) << "\n"
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const ll MOD = 10e9 + 7;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
s = "red";
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(x) (x).begin(), (x).end()
#define OUT(a) cout << (a) << "\n"
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const ll MOD = 10e9 + 7;
int main() {
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,663
| 734,664
|
u860374704
|
cpp
|
p02933
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
char s[10];
cin >> a >> s;
if (a > 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
char s[10];
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,669
| 734,670
|
u264620408
|
cpp
|
p02933
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
char s[10];
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
char s[10];
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,671
| 734,670
|
u264620408
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[11];
cin >> a;
cin >> s;
a < 3200 ? cout << "red" : cout << a;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[11];
cin >> a;
cin >> s;
a < 3200 ? cout << "red" : cout << s;
return 0;
}
|
[
"identifier.change",
"expression.operation.binary.change"
] | 734,672
| 734,673
|
u094214579
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
char b;
cin >> a >> b;
if (a >= 3200) {
cout << b;
} else {
cout << "red";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
std::string b;
cin >> a >> b;
if (a >= 3200) {
cout << b;
} else {
cout << "red";
}
return 0;
}
|
[] | 734,676
| 734,677
|
u293317519
|
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";
}
return 0;
}
|
#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";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,686
| 734,687
|
u475787977
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0);
const int N = 200005;
const int MOD = 1e9 + 7;
const int inf = 1 << 28;
typedef long long ll;
double a[105];
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;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0);
const int N = 200005;
const int MOD = 1e9 + 7;
const int inf = 1 << 28;
typedef long long ll;
double a[105];
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,688
| 734,689
|
u613686673
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std::chrono;
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
#define maxn 300001
#define M 1000000007
#define int long long
#define inf 1e18
#define ninf -1e17
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef cc_hash_table<int, int, hash<int>> ht;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std::chrono;
using namespace std;
using namespace __gnu_pbds;
#define st first
#define nd second
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
#define maxn 300001
#define M 1000000007
#define int long long
#define inf 1e18
#define ninf -1e17
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef cc_hash_table<int, int, hash<int>> ht;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
}
|
[] | 734,690
| 734,691
|
u454937339
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s;
} else {
cout << "red";
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,692
| 734,693
|
u977660562
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[] | 734,696
| 734,697
|
u415046751
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string b;
cin >> a;
cin >> b;
if (a > 3200) {
cout << b << "\n";
} else {
cout << "red \n";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string b;
cin >> a;
cin >> b;
if (a >= 3200) {
cout << b << "\n";
} else {
cout << "red \n";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,698
| 734,699
|
u929298675
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[100];
cin >> a;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "pink";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[100];
cin >> a;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,700
| 734,701
|
u759372313
|
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";
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,712
| 734,713
|
u182367942
|
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 << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 734,716
| 734,717
|
u634715563
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
if (n <= 3200)
cout << "red";
else
cout << a;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
if (n < 3200)
cout << "red";
else
cout << a;
cout << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,720
| 734,721
|
u395509669
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a > 3200)
s = "red";
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a < 3200)
s = "red";
cout << s;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,728
| 734,729
|
u521057121
|
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;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 734,737
| 734,738
|
u677149659
|
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;
}
}
|
#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;
}
}
|
[
"variable_declaration.remove",
"variable_declaration.add",
"literal.string.change",
"io.output.change"
] | 734,741
| 734,738
|
u677149659
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
string s;
int n;
int main() {
cin >> n;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
string s;
int n;
int main() {
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[] | 734,762
| 734,763
|
u019229278
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red";
else
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,769
| 734,770
|
u222252114
|
cpp
|
p02933
|
#include <algorithm>
#include <float.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define loop(i, N) for (int i = 0; i < N; ++i)
int main(void) {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
}
|
#include <algorithm>
#include <float.h>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define loop(i, N) for (int i = 0; i < N; ++i)
int main(void) {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,771
| 734,772
|
u762914930
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s;
cout << (n >= 3200 ? "red" : s);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s;
cout << (n < 3200 ? "red" : s);
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,790
| 734,791
|
u777892860
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
cout << (n >= 3200 ? "red" : s);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s;
cout << (n < 3200 ? "red" : s);
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 734,792
| 734,791
|
u777892860
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m;
string s;
cin >> m >> s;
if (m >= 32)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m;
string s;
cin >> m >> s;
if (m >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,793
| 734,794
|
u614576698
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a;
cin >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
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"
] | 734,802
| 734,803
|
u320128666
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
string color;
cin >> A;
cin >> color;
if (A >= 3200) {
cout << "red" << endl;
} else {
cout << color << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
string color;
cin >> A;
cin >> color;
if (A >= 3200) {
cout << color << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 734,804
| 734,805
|
u636011245
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int a;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
}
|
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,806
| 734,807
|
u626342938
|
cpp
|
p02933
|
#include "assert.h"
#include "math.h"
#include <algorithm>
#include <bitset>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define BUFF ios::sync_with_stdio(false)
#define epsilon 1e-07
#define pi 2 * acos(0.0);
#define mod 1000000007 // 1e9+7
#define cerr \
if (false) \
cerr
#define watch(x) cerr << #x << " = " << x << endl;
#define inf std::numeric_limits<int>().max();
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << a << endl;
}
|
#include "assert.h"
#include "math.h"
#include <algorithm>
#include <bitset>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define BUFF ios::sync_with_stdio(false)
#define epsilon 1e-07
#define pi 2 * acos(0.0);
#define mod 1000000007 // 1e9+7
#define cerr \
if (false) \
cerr
#define watch(x) cerr << #x << " = " << x << endl;
#define inf std::numeric_limits<int>().max();
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[
"identifier.change",
"io.output.change"
] | 734,812
| 734,813
|
u058149584
|
cpp
|
p02933
|
#include <cstdio>
int main() {
int a;
char s;
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200)
printf("%s", s);
else
printf("red");
return 0;
}
|
#include <cstdio>
int main() {
int a;
char s[10];
scanf("%d", &a);
scanf("%s", s);
if (a >= 3200)
printf("%s", s);
else
printf("red");
return 0;
}
|
[] | 734,827
| 734,828
|
u561143568
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
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 <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
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,829
| 734,830
|
u983547593
|
cpp
|
p02933
|
#include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
// 2019-08-18 A
int main() {
long long int a;
cin >> a;
long long int s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
// 2019-08-18 A
int main() {
long long int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[] | 734,833
| 734,834
|
u913604515
|
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 << "red" << endl;
else
cout << s << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,835
| 734,836
|
u342143778
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define xmod int(1e9 + 7)
#define hmod 1223334444555553LL
using namespace std;
int n;
char s[1005];
int main() {
scanf("%d\n%s", &n, s);
if (n < 3200)
printf("Red\n");
else
printf("%s\n", s);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define xmod int(1e9 + 7)
#define hmod 1223334444555553LL
using namespace std;
int n;
char s[1005];
int main() {
scanf("%d\n%s", &n, s);
if (n < 3200)
printf("red\n");
else
printf("%s\n", s);
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 734,837
| 734,838
|
u600091451
|
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 << "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;
}
}
|
[] | 734,839
| 734,840
|
u939775002
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3199) {
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 > 3199) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 734,843
| 734,844
|
u871830386
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a <= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,847
| 734,848
|
u905654805
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a < 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[10];
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,849
| 734,848
|
u905654805
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
if (a >= 3200)
cout << s << endl;
else
cout << "red\n";
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red\n";
}
|
[
"expression.operation.binary.add"
] | 734,859
| 734,860
|
u752056358
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a;
string s;
int main(void) {
// Here your code !
scanf("%d", &a);
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 int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a;
string s;
int main(void) {
// Here your code !
scanf("%d", &a);
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,866
| 734,867
|
u497422208
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (3500 <= a) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (3200 <= a) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,870
| 734,871
|
u729695898
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
char str[100];
int a;
char r;
cin >> a;
cin >> str;
if (a >= 3200) {
for (int i = 0; str[i] != '\0'; i++) {
cout << str[i] << "\n";
}
} else {
cout << "red"
<< "\n";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
char str[100];
int a;
char r;
cin >> a;
cin >> str;
if (a >= 3200) {
for (int i = 0; str[i] != '\0'; i++) {
cout << str[i];
}
} else {
cout << "red"
<< "\n";
}
return 0;
}
|
[
"expression.operation.binary.remove"
] | 734,877
| 734,878
|
u705970433
|
cpp
|
p02933
|
/*
RAone00
Rohit sharma
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
#define pb push_back
#define debug(x) cout << (#x) << " is " << (x) << endl
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 1e5 + 10;
int main() {
fast_io();
int a;
cin >> a;
string s;
cin >> s;
if (a <= 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
}
|
/*
RAone00
Rohit sharma
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
#define pb push_back
#define debug(x) cout << (#x) << " is " << (x) << endl
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 1e5 + 10;
int main() {
fast_io();
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,881
| 734,882
|
u196762344
|
cpp
|
p02933
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200) {
cout << "red";
} else {
cout << s;
}
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,883
| 734,884
|
u148781101
|
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";
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;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,887
| 734,888
|
u506555633
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red";
} else {
cout << s;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,896
| 734,897
|
u666625234
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a, 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";
}
|
[] | 734,900
| 734,901
|
u924638591
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a, 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"
] | 734,902
| 734,901
|
u924638591
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
char *s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
char s[11];
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
[] | 734,906
| 734,907
|
u673928159
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
printf("red");
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
printf("red");
} else {
cout << s << endl;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,908
| 734,909
|
u737168568
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define faf ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define ll long long
#define pb push_back
#define mp make_pair
#define inff 100000
ll modo = 1e9 + 7;
int main() {
faf;
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "res";
else
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define faf ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define ll long long
#define pb push_back
#define mp make_pair
#define inff 100000
ll modo = 1e9 + 7;
int main() {
faf;
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 734,910
| 734,911
|
u793715260
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3000)
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;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,914
| 734,915
|
u032723841
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,922
| 734,923
|
u064061804
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
int main() {
ll A;
string S;
cin >> A;
cin >> S;
if (A <= 3200) {
cout << S << endl;
return 0;
}
cout << "red" << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
int main() {
ll A;
string S;
cin >> A;
cin >> S;
if (A >= 3200) {
cout << S << endl;
return 0;
}
cout << "red" << endl;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,924
| 734,925
|
u048791623
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int 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(void) {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,926
| 734,927
|
u088895504
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
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>
using namespace std;
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"
] | 734,928
| 734,929
|
u767785562
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f3f;
const int maxn = 1e5 + 500;
ll T, n, m;
int main() {
string s;
cin >> n >> s;
if (n < 3200)
cout << "RED\n";
else
cout << s << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f3f;
const int maxn = 1e5 + 500;
ll T, n, m;
int main() {
string s;
cin >> n >> s;
if (n < 3200)
cout << "red\n";
else
cout << s << endl;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,930
| 734,931
|
u269278772
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f3f;
const int maxn = 1e5 + 500;
ll T, n, m;
int main() {
string s;
cin >> n >> s;
if (n > 3200)
cout << "RED\n";
else
cout << s << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f3f;
const int maxn = 1e5 + 500;
ll T, n, m;
int main() {
string s;
cin >> n >> s;
if (n < 3200)
cout << "red\n";
else
cout << s << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,932
| 734,931
|
u269278772
|
cpp
|
p02933
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000009;
#define inl long long
using namespace std;
int gcd(int a, int b) {
while (a % b != 0) {
int c = 0;
c = a % b;
a = b;
b = c;
}
return b;
}
int kaizyo(int a) {
long long ans = 1;
for (int i = a; i > 0; i--) {
ans *= i;
ans = ans % 1000000007;
// cout << ans << endl;
}
ans = ans % 1000000007;
return ans;
}
int main() {
int N = 0;
string W;
cin >> N >> W;
if (N >= 3200) {
cout << "red" << endl;
return 0;
} else {
cout << W << endl;
return 0;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000009;
#define inl long long
using namespace std;
int gcd(int a, int b) {
while (a % b != 0) {
int c = 0;
c = a % b;
a = b;
b = c;
}
return b;
}
int kaizyo(int a) {
long long ans = 1;
for (int i = a; i > 0; i--) {
ans *= i;
ans = ans % 1000000007;
// cout << ans << endl;
}
ans = ans % 1000000007;
return ans;
}
int main() {
int N = 0;
string W;
cin >> N >> W;
if (N >= 3200) {
cout << W << endl;
return 0;
} else {
cout << "red" << endl;
return 0;
}
return 0;
}
|
[
"io.output.change"
] | 734,933
| 734,934
|
u019465635
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a <= 3200)
s = "red";
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
s = "red";
cout << s << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,945
| 734,946
|
u196798307
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
s = "red";
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
s = "red";
cout << s << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,947
| 734,946
|
u196798307
|
cpp
|
p02933
|
#define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define T \
long long t; \
cin >> t; \
while (t--)
#define foe(i) for (int i = 1; i <= n; i++)
#define fo(i) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "Red";
}
|
#define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define T \
long long t; \
cin >> t; \
while (t--)
#define foe(i) for (int i = 1; i <= n; i++)
#define fo(i) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 734,948
| 734,949
|
u535113145
|
cpp
|
p02933
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define FACSIZE 2002
ll invfac[FACSIZE];
ll fac[FACSIZE];
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
int main(void) {
ll a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
ll mod_pow(ll x, ll r) {
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0) {
ll t = mod_pow(x, r / 2) % mod;
return t * t % mod;
} else {
ll t = mod_pow(x, r / 2) % mod;
ll k = t * t % mod;
return k * x % mod;
}
}
ll mod_add(ll a, ll b) { return (a + b) % mod; }
ll mod_mul(ll a, ll b) { return (a * b) % mod; }
ll mod_div(ll a, ll b) { return mod_mul(a, mod_pow(b, mod - 2)); }
void make_fact(ll n) {
fac[0] = 1;
rep(i, n) { fac[i + 1] = mod_mul(fac[i], i + 1); }
}
void make_invfact(ll n) {
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--) {
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
int qp(int a, ll b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
} while (b >>= 1);
return ans;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define FACSIZE 2002
ll invfac[FACSIZE];
ll fac[FACSIZE];
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
int main(void) {
ll a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
ll mod_pow(ll x, ll r) {
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0) {
ll t = mod_pow(x, r / 2) % mod;
return t * t % mod;
} else {
ll t = mod_pow(x, r / 2) % mod;
ll k = t * t % mod;
return k * x % mod;
}
}
ll mod_add(ll a, ll b) { return (a + b) % mod; }
ll mod_mul(ll a, ll b) { return (a * b) % mod; }
ll mod_div(ll a, ll b) { return mod_mul(a, mod_pow(b, mod - 2)); }
void make_fact(ll n) {
fac[0] = 1;
rep(i, n) { fac[i + 1] = mod_mul(fac[i], i + 1); }
}
void make_invfact(ll n) {
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--) {
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
}
|
[
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 734,950
| 734,951
|
u242680486
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
string s;
cin >> a >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 734,955
| 734,956
|
u330689597
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.