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;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
#define EREP(a, b) for (register int a = head[b]; a; a = edge[a].nxt)
inline int rd() {
int x = 0;
char IO = getchar();
bool f = 0;
while ((IO < '0' || IO > '9') && IO != '-')
IO = getchar();
if (IO == '-')
f = 1, IO = getchar();
while (IO >= '0' && IO <= '9')
x = (x << 3) + (x << 1) + (IO ^ 48), IO = getchar();
return f ? -x : x;
}
long long a;
string b;
void _main() {
cin >> a;
cin >> b;
if (a >= 3200)
puts("red");
else
cout << b;
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
_main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
#define EREP(a, b) for (register int a = head[b]; a; a = edge[a].nxt)
inline int rd() {
int x = 0;
char IO = getchar();
bool f = 0;
while ((IO < '0' || IO > '9') && IO != '-')
IO = getchar();
if (IO == '-')
f = 1, IO = getchar();
while (IO >= '0' && IO <= '9')
x = (x << 3) + (x << 1) + (IO ^ 48), IO = getchar();
return f ? -x : x;
}
long long a;
string b;
void _main() {
cin >> a;
cin >> b;
if (a < 3200)
puts("red");
else
cout << b;
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
_main();
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,959
| 734,960
|
u608862204
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll a;
cin >> a;
string s;
cin >> s;
if (a <= 3200) {
cout << "red" << '\n';
} else {
cout << s << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red" << '\n';
} else {
cout << s << "\n";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,963
| 734,964
|
u508700891
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
void solve() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
int main() {
#ifdef LOCAL_ENV
cin.exceptions(ios::failbit);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
void solve() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
int main() {
#ifdef LOCAL_ENV
cin.exceptions(ios::failbit);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,965
| 734,966
|
u745250049
|
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 << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,967
| 734,968
|
u346214077
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
string s;
int a;
cin >> a >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
string s;
int a;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,969
| 734,970
|
u006069211
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a < 3200)
cout << s << "\n";
else
cout << "red"
<< "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red"
<< "\n";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,971
| 734,972
|
u257015873
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() { cout << "\n"; }
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head;
_cout(forward<Tail>(tail)...);
}
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define Sq(x) (x) * (x)
#define For(i, n) for (int i = 0; i < (n); i++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) \
vector<T> sxs(xs.size() + 1); \
For(i, (int)xs.size()) sxs[i + 1] = sxs[i] + xs[i]
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) \
Vec2(T, n, m, xs); \
For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) \
unordered_map<T, int> map; \
Rep(n) { \
Cin(T, x); \
map[x]++; \
}
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) \
{ \
for (const auto &e : xs) \
cout << e << " "; \
cout << "\n"; \
}
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
// constexpr int MOD = 1e9+7;
int main(void) {
Cin(int, a);
Cin(string, s);
string r = "red";
Cout((a >= 3200) ? r : s);
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() { cout << "\n"; }
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head;
_cout(forward<Tail>(tail)...);
}
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define Sq(x) (x) * (x)
#define For(i, n) for (int i = 0; i < (n); i++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) \
vector<T> sxs(xs.size() + 1); \
For(i, (int)xs.size()) sxs[i + 1] = sxs[i] + xs[i]
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) \
Vec2(T, n, m, xs); \
For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) \
unordered_map<T, int> map; \
Rep(n) { \
Cin(T, x); \
map[x]++; \
}
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) \
{ \
for (const auto &e : xs) \
cout << e << " "; \
cout << "\n"; \
}
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
// constexpr int MOD = 1e9+7;
int main(void) {
Cin(int, a);
Cin(string, s);
string r = "red";
Cout((a >= 3200) ? s : r);
}
|
[] | 735,027
| 735,033
|
u375405838
|
cpp
|
p02933
|
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << n << endl;
return 0;
}
|
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"io.output.change"
] | 735,037
| 735,039
|
u853418842
|
cpp
|
p02933
|
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << s << endl;
else
cout << n << endl;
return 0;
}
|
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 735,041
| 735,039
|
u853418842
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define mp make_pair
#define int ll
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename A, typename B> istream &operator>>(istream &, pair<A, B> &);
template <typename A> istream &operator>>(istream &, vector<A> &);
void add(int &, int);
int mul(int, int);
int powz(int, int);
template <typename A> ostream &operator<<(ostream &, vector<A> &);
const int N = 1000002;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << 'red';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int tc = 1;
//~ cin>>tc;
for (int _ = 0; _ < tc; _++) {
//~ cout<<"Case #"<<_+1<<": ";
solve();
if (_ != tc - 1)
cout << "\n";
}
}
int mul(int a, int b) { return ((a)*1ll * (b)) % mod; }
void add(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int powz(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = mul(res, a);
b /= 2;
a = mul(a, a);
}
return res;
}
template <typename A, typename B>
istream &operator>>(istream &input, pair<A, B> &x) {
input >> x.F >> x.S;
return input;
}
template <typename A> istream &operator>>(istream &input, vector<A> &x) {
for (auto &i : x)
input >> i;
return input;
}
template <typename A> ostream &operator<<(ostream &output, vector<A> &x) {
for (auto &i : x)
output << i << ' ';
return output;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define mp make_pair
#define int ll
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename A, typename B> istream &operator>>(istream &, pair<A, B> &);
template <typename A> istream &operator>>(istream &, vector<A> &);
void add(int &, int);
int mul(int, int);
int powz(int, int);
template <typename A> ostream &operator<<(ostream &, vector<A> &);
const int N = 1000002;
void solve() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int tc = 1;
//~ cin>>tc;
for (int _ = 0; _ < tc; _++) {
//~ cout<<"Case #"<<_+1<<": ";
solve();
if (_ != tc - 1)
cout << "\n";
}
}
int mul(int a, int b) { return ((a)*1ll * (b)) % mod; }
void add(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int powz(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = mul(res, a);
b /= 2;
a = mul(a, a);
}
return res;
}
template <typename A, typename B>
istream &operator>>(istream &input, pair<A, B> &x) {
input >> x.F >> x.S;
return input;
}
template <typename A> istream &operator>>(istream &input, vector<A> &x) {
for (auto &i : x)
input >> i;
return input;
}
template <typename A> ostream &operator<<(ostream &output, vector<A> &x) {
for (auto &i : x)
output << i << ' ';
return output;
}
|
[
"literal.string.change",
"io.output.change"
] | 735,043
| 735,046
|
u840813237
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define inf 1e16
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "Red";
else
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define inf 1e16
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define M 1000010
int main() {
IOS;
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,052
| 735,054
|
u742553775
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a <= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,055
| 735,057
|
u416521732
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
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"
] | 735,058
| 735,057
|
u416521732
|
cpp
|
p02933
|
#define C
#ifdef C
#include <stdio.h>
#define abs(a) ((a) < 0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
#endif
#ifdef Cpp
#include <bits/stdc++.h>
using namespace std;
#endif
#define freopen(x) \
freopen(x ".in", "r", stdin); \
freopen(x ".out", "w", stdout)
#define repl(i, t) for (int i = fi[t]; i; i = ne[i])
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define per(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define _r read()
#define readtype long long
typedef long long var;
const int INF = 0x3f3f3f3f;
readtype read();
char s[100000];
int main() {
int n = _r;
scanf("%s", s);
if (n <= 3200)
puts("red");
else
puts(s);
return 0;
}
readtype read() {
readtype a = 0, c = getchar(), s = 0;
while (!isdigit(c))
s |= c == '-', c = getchar();
while (isdigit(c))
a = a * 10 + c - 48, c = getchar();
return s ? -a : a;
}
|
#define C
#ifdef C
#include <stdio.h>
#define abs(a) ((a) < 0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
#endif
#ifdef Cpp
#include <bits/stdc++.h>
using namespace std;
#endif
#define freopen(x) \
freopen(x ".in", "r", stdin); \
freopen(x ".out", "w", stdout)
#define repl(i, t) for (int i = fi[t]; i; i = ne[i])
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define per(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define _r read()
#define readtype long long
typedef long long var;
const int INF = 0x3f3f3f3f;
readtype read();
char s[100000];
int main() {
int n = _r;
scanf("%s", s);
if (n < 3200)
puts("red");
else
puts(s);
return 0;
}
readtype read() {
readtype a = 0, c = getchar(), s = 0;
while (!isdigit(c))
s |= c == '-', c = getchar();
while (isdigit(c))
a = a * 10 + c - 48, c = getchar();
return s ? -a : a;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,059
| 735,061
|
u013079371
|
cpp
|
p02933
|
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repM(i, m, n) for (int i = n - 1; i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
// typedef pair<int,int> pii; using namespace std;
// d = distance(lower_bound(all(x)), upper_bound(all(x)));
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int A;
string B;
cin >> A >> B;
if (A >= 320)
cout << B << endl;
else
cout << "red" << endl;
}
|
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repM(i, m, n) for (int i = n - 1; i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
// typedef pair<int,int> pii; using namespace std;
// d = distance(lower_bound(all(x)), upper_bound(all(x)));
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int A;
string B;
cin >> A >> B;
if (A >= 3200)
cout << B << endl;
else
cout << "red" << endl;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,071
| 735,073
|
u548163222
|
cpp
|
p02933
|
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli cg(lli n) { return n ^ (n >> 1); }
lli SUM(lli a) { return (a * (a + 1) / 2); }
bool CAN(int x, int y, int n, int m) {
if (x >= 0 && y >= 0 && x < n && y < m) {
return true;
}
return false;
}
double her(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b) {
int p = 0;
string c;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
if (b.length() < a.length()) {
for (int i = b.length(); i < a.length(); i++) {
b += "0";
}
} else {
for (int i = a.length(); i < b.length(); i++) {
a += "0";
}
}
a += "0", b += "0";
for (int i = 0; i < a.length(); i++) {
c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
p = (a[i] + b[i] - '0' - '0' + p) / 10;
}
if (c[c.length() - 1] == '0')
c.erase(c.length() - 1, 1);
reverse(c.begin(), c.end());
return c;
}
string strmin(string a, string b) {
if (a.length() > b.length())
return b;
if (b.length() > a.length())
return a;
for (int i = 0; i < a.length(); i++) {
if (a[i] > b[i])
return b;
if (b[i] > a[i])
return a;
}
return a;
}
char vow[] = {'a', 'e', 'i', 'o', 'u'};
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int N = 1e6 + 30;
const lli mod = 1000000007;
int a;
string s;
int main() {
fastio;
cin >> a >> s;
if (a > 3200) {
cout << "red";
} else
cout << s;
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli cg(lli n) { return n ^ (n >> 1); }
lli SUM(lli a) { return (a * (a + 1) / 2); }
bool CAN(int x, int y, int n, int m) {
if (x >= 0 && y >= 0 && x < n && y < m) {
return true;
}
return false;
}
double her(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b) {
int p = 0;
string c;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
if (b.length() < a.length()) {
for (int i = b.length(); i < a.length(); i++) {
b += "0";
}
} else {
for (int i = a.length(); i < b.length(); i++) {
a += "0";
}
}
a += "0", b += "0";
for (int i = 0; i < a.length(); i++) {
c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
p = (a[i] + b[i] - '0' - '0' + p) / 10;
}
if (c[c.length() - 1] == '0')
c.erase(c.length() - 1, 1);
reverse(c.begin(), c.end());
return c;
}
string strmin(string a, string b) {
if (a.length() > b.length())
return b;
if (b.length() > a.length())
return a;
for (int i = 0; i < a.length(); i++) {
if (a[i] > b[i])
return b;
if (b[i] > a[i])
return a;
}
return a;
}
char vow[] = {'a', 'e', 'i', 'o', 'u'};
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int N = 1e6 + 30;
const lli mod = 1000000007;
int a;
string s;
int main() {
fastio;
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"
] | 735,082
| 735,084
|
u379679295
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll POSITIVE_INFINITY = 9223372036854775807;
const ll NEGATIVE_INFINITY = -9223372036854775807;
const ll MOD = 1000000007;
const ld PI = acos(-1.0);
template <typename T> inline T bigMod(T A, T B, T M = MOD) {
A %= M;
T ret = 1;
while (B) {
if (B & 1)
ret = (ret * A) % M;
A = (A * A) % M;
B = B >> 1;
}
return ret;
}
template <typename T> inline T invMod(T A, T M = MOD) {
return bigMod(A, M - 2, M);
}
const int N = 200005;
int main() {
FASTER;
ll n;
cin >> n;
string str;
cin >> str;
if (n < 3200) {
cout << "res\n";
} else {
cout << str << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll POSITIVE_INFINITY = 9223372036854775807;
const ll NEGATIVE_INFINITY = -9223372036854775807;
const ll MOD = 1000000007;
const ld PI = acos(-1.0);
template <typename T> inline T bigMod(T A, T B, T M = MOD) {
A %= M;
T ret = 1;
while (B) {
if (B & 1)
ret = (ret * A) % M;
A = (A * A) % M;
B = B >> 1;
}
return ret;
}
template <typename T> inline T invMod(T A, T M = MOD) {
return bigMod(A, M - 2, M);
}
const int N = 200005;
int main() {
FASTER;
ll n;
cin >> n;
string str;
cin >> str;
if (n < 3200) {
cout << "red\n";
} else {
cout << str << '\n';
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 735,089
| 735,092
|
u415956569
|
cpp
|
p02933
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
int a;
string ch;
int main() {
scanf("%d", &a);
cin >> ch;
if (a == 3200)
cout << ch;
else
puts("red");
// system("pause");
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
int a;
string ch;
int main() {
scanf("%d", &a);
cin >> ch;
if (a >= 3200)
cout << ch;
else
puts("red");
// system("pause");
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,975
| 734,976
|
u520815352
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<pli> vpli;
inline ll read() {
ll Hashimoto = 0;
bool Kanna = 1;
char I_Love = getchar();
while (I_Love < '0' || I_Love > '9') {
if (I_Love == '-')
Kanna = 0;
I_Love = getchar();
}
while (I_Love >= '0' && I_Love <= '9') {
Hashimoto = Hashimoto * 10 + I_Love - '0';
I_Love = getchar();
}
return (Kanna ? Hashimoto : -Hashimoto);
}
template <typename T1, typename T2> inline void Umax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T1, typename T2> inline void Umin(T1 &a, T2 b) {
if (a > b)
a = b;
}
#define I_Love_Hashimoto_Kanna main
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define filein(s) freopen(s, "r", stdin);
#define fileout(s) freopen(s, "w", stdout);
#define file freopen("I_Love_Hashimoto_Kanna.out", "w", stdout);
#define RE cout << "I_Love_Hashimoto_Kanna" << endl;
#define Tone(Kanna) cout << Kanna << endl;
#define Tall(Hashimoto, Kanna) \
for (int I_Love = 0; I_Love < (Kanna); ++I_Love) \
cout << Hashimoto[I_Love] << (I_Love == (Kanna)-1 ? "\n" : " ");
#define FOR(I_Love, Hashimoto, Kanna) \
for (int I_Love = Hashimoto; I_Love < (Kanna); ++I_Love)
#define MP(Hashimoto, Kanna) make_pair(Hashimoto, Kanna)
#define REV(Kanna) reverse(Kanna.begin(), Kanna.end());
#define SORT(Kanna) sort(Kanna.begin(), Kanna.end());
#define UNIQUE(Kanna) \
Kanna.erase(unique(Kanna.begin(), Kanna.end()), Kanna.end());
#define inf (1000000000)
#define linf (1000000000000000000ll)
#define mod (1000000007)
int a;
string s;
int I_Love_Hashimoto_Kanna() {
//完全想清楚了再开始写。
//写不顺、不知道怎么写、很乱的时候，停下来好好想想。
//做得慢总比做不出好。
fastio;
cin >> a >> s;
if (a <= 2300)
cout << s << endl;
else
cout << "red\n";
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<pli> vpli;
inline ll read() {
ll Hashimoto = 0;
bool Kanna = 1;
char I_Love = getchar();
while (I_Love < '0' || I_Love > '9') {
if (I_Love == '-')
Kanna = 0;
I_Love = getchar();
}
while (I_Love >= '0' && I_Love <= '9') {
Hashimoto = Hashimoto * 10 + I_Love - '0';
I_Love = getchar();
}
return (Kanna ? Hashimoto : -Hashimoto);
}
template <typename T1, typename T2> inline void Umax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T1, typename T2> inline void Umin(T1 &a, T2 b) {
if (a > b)
a = b;
}
#define I_Love_Hashimoto_Kanna main
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define filein(s) freopen(s, "r", stdin);
#define fileout(s) freopen(s, "w", stdout);
#define file freopen("I_Love_Hashimoto_Kanna.out", "w", stdout);
#define RE cout << "I_Love_Hashimoto_Kanna" << endl;
#define Tone(Kanna) cout << Kanna << endl;
#define Tall(Hashimoto, Kanna) \
for (int I_Love = 0; I_Love < (Kanna); ++I_Love) \
cout << Hashimoto[I_Love] << (I_Love == (Kanna)-1 ? "\n" : " ");
#define FOR(I_Love, Hashimoto, Kanna) \
for (int I_Love = Hashimoto; I_Love < (Kanna); ++I_Love)
#define MP(Hashimoto, Kanna) make_pair(Hashimoto, Kanna)
#define REV(Kanna) reverse(Kanna.begin(), Kanna.end());
#define SORT(Kanna) sort(Kanna.begin(), Kanna.end());
#define UNIQUE(Kanna) \
Kanna.erase(unique(Kanna.begin(), Kanna.end()), Kanna.end());
#define inf (1000000000)
#define linf (1000000000000000000ll)
#define mod (1000000007)
int a;
string s;
int I_Love_Hashimoto_Kanna() {
//完全想清楚了再开始写。
//写不顺、不知道怎么写、很乱的时候，停下来好好想想。
//做得慢总比做不出好。
fastio;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red\n";
return 0;
}
|
[] | 734,980
| 734,981
|
u004424779
|
cpp
|
p02933
|
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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 <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,984
| 734,985
|
u886790158
|
cpp
|
p02933
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 100020;
const int maxm = 1000020;
const int MOd = 998244353;
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
int a;
string s;
scanf("%d", &a);
cin >> s;
if (a <= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 100020;
const int maxm = 1000020;
const int MOd = 998244353;
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
int a;
string s;
scanf("%d", &a);
cin >> 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,988
| 734,989
|
u175295878
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long long
using namespace std;
const int mod = 998244353; // 1000000007;
int n, a;
string s;
main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base ::sync_with_stdio(false);
cin.tie();
cin >> a >> s;
if (a < 32000)
cout << "red";
else
cout << s;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long long
using namespace std;
const int mod = 998244353; // 1000000007;
int n, a;
string s;
main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base ::sync_with_stdio(false);
cin.tie();
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,992
| 734,993
|
u247347001
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long long
using namespace std;
const int mod = 998244353; // 1000000007;
int n, a;
string s;
main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base ::sync_with_stdio(false);
cin.tie();
cin >> a;
if (a < 32000)
cout << "red";
else
cout << s;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long long
using namespace std;
const int mod = 998244353; // 1000000007;
int n, a;
string s;
main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base ::sync_with_stdio(false);
cin.tie();
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,994
| 734,993
|
u247347001
|
cpp
|
p02933
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
#if _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
n < 3200 ? cout << "Red" : cout << s;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
#if _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
n < 3200 ? cout << "red" : cout << s;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 734,998
| 734,999
|
u196951291
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? ss : "red") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "red" : ss) << endl;
}
|
[] | 735,001
| 735,002
|
u168525123
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "pink" : "red") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "red" : ss) << endl;
}
|
[] | 735,003
| 735,002
|
u168525123
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << a << "\n";
} else {
cout << s << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red"
<< "\n";
}
}
|
[
"identifier.change",
"io.output.change"
] | 735,006
| 735,007
|
u915622184
|
cpp
|
p02933
|
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
ll gcd(ll a, ll b) {
ll tmp;
if (b > a) {
tmp = a;
a = b;
b = tmp;
}
while (a % b != 0) {
tmp = b;
b = a % b;
a = tmp;
}
return b;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main(void) {
int a;
string s;
cin >> s;
cin >> a;
if (a >= 3200)
std::cout << s << std::endl;
else
std::cout << "red" << std::endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
ll gcd(ll a, ll b) {
ll tmp;
if (b > a) {
tmp = a;
a = b;
b = tmp;
}
while (a % b != 0) {
tmp = b;
b = a % b;
a = tmp;
}
return b;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main(void) {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200)
std::cout << s << std::endl;
else
std::cout << "red" << std::endl;
return 0;
}
|
[] | 735,014
| 735,015
|
u131340563
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n <= 3200) {
cout << s << endl;
} else {
cout << "red";
}
}
|
#include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,016
| 735,017
|
u498834139
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n > 3200) {
cout << s << endl;
} else {
cout << "red";
}
}
|
#include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,018
| 735,017
|
u498834139
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
xx = xx * 10 + ch - '0';
ch = getchar();
}
return xx * ff;
}
long long READ() {
long long xx = 0, ff = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
xx = xx * 10 + ch - '0';
ch = getchar();
}
return xx * ff;
}
char one() {
char ch = getchar();
while (ch == ' ' || ch == '\n')
ch = getchar();
return ch;
}
int main() {
// freopen("in","r",stdin);
int a = read();
string s;
cin >> s;
if (a <= 3200)
cout << s << endl;
else
puts("red");
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
xx = xx * 10 + ch - '0';
ch = getchar();
}
return xx * ff;
}
long long READ() {
long long xx = 0, ff = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
xx = xx * 10 + ch - '0';
ch = getchar();
}
return xx * ff;
}
char one() {
char ch = getchar();
while (ch == ' ' || ch == '\n')
ch = getchar();
return ch;
}
int main() {
// freopen("in","r",stdin);
int a = read();
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
puts("red");
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,035
| 735,036
|
u129763512
|
cpp
|
p02933
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
typedef long long LL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
string inputString() {
string a;
cin >> a;
return a;
};
LL inputValue() {
LL a;
cin >> a;
return a;
};
vector<LL> inputVector(LL a) {
vector<LL> rv;
REP(i, a) {
LL input;
cin >> input;
rv.push_back(input);
}
return rv;
}
vector<string> inputVectorString(LL a) {
vector<string> rv;
REP(i, a) {
string input;
cin >> input;
rv.push_back(input);
}
return rv;
}
vector<vector<LL>> inputVector2D(LL a, LL b) {
vector<vector<LL>> rv;
REP(i, a) {
rv.push_back(vector<LL>());
REP(j, b) {
LL input;
cin >> input;
rv.at(i).push_back(input);
}
}
return rv;
}
#if 1
#define debug(d) debug1(__LINE__, #d, d)
void debug1(LL line, const char *name, vector<LL> &v) {
cout << line << ":" << name << ":vector<LL>(" << v.size() << ") ";
REP(i, (LL)v.size()) { cout << v.at(i) << " "; }
cout << endl;
}
void debug1(LL line, const char *name, LL i) {
cout << line << ":" << name << ":LL " << i << endl;
;
}
void debug1(LL line, const char *name, vector<string> &v) {
cout << line << ":" << name << ":vector<string>(" << v.size() << ") ";
REP(i, (LL)v.size()) { cout << v.at(i) << " "; }
cout << endl;
}
void debug1(LL line, const char *name, vector<vector<LL>> &v) {
cout << line << ":" << name << ":vector<vector<LL>>(" << v.size() << ") ";
REP(i, (LL)v.size()) {
REP(j, (LL)v.at(i).size()) { cout << v.at(i).at(j) << " "; }
cout << ", ";
}
cout << endl;
}
#else
#define debug(n)
#endif
int main(int argc, const char *argv[]) {
LL a = inputValue();
string s = inputString();
if (a >= 3200) {
cout << s << endl;
} else {
cout << a << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
typedef long long LL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
string inputString() {
string a;
cin >> a;
return a;
};
LL inputValue() {
LL a;
cin >> a;
return a;
};
vector<LL> inputVector(LL a) {
vector<LL> rv;
REP(i, a) {
LL input;
cin >> input;
rv.push_back(input);
}
return rv;
}
vector<string> inputVectorString(LL a) {
vector<string> rv;
REP(i, a) {
string input;
cin >> input;
rv.push_back(input);
}
return rv;
}
vector<vector<LL>> inputVector2D(LL a, LL b) {
vector<vector<LL>> rv;
REP(i, a) {
rv.push_back(vector<LL>());
REP(j, b) {
LL input;
cin >> input;
rv.at(i).push_back(input);
}
}
return rv;
}
#if 1
#define debug(d) debug1(__LINE__, #d, d)
void debug1(LL line, const char *name, vector<LL> &v) {
cout << line << ":" << name << ":vector<LL>(" << v.size() << ") ";
REP(i, (LL)v.size()) { cout << v.at(i) << " "; }
cout << endl;
}
void debug1(LL line, const char *name, LL i) {
cout << line << ":" << name << ":LL " << i << endl;
;
}
void debug1(LL line, const char *name, vector<string> &v) {
cout << line << ":" << name << ":vector<string>(" << v.size() << ") ";
REP(i, (LL)v.size()) { cout << v.at(i) << " "; }
cout << endl;
}
void debug1(LL line, const char *name, vector<vector<LL>> &v) {
cout << line << ":" << name << ":vector<vector<LL>>(" << v.size() << ") ";
REP(i, (LL)v.size()) {
REP(j, (LL)v.at(i).size()) { cout << v.at(i).at(j) << " "; }
cout << ", ";
}
cout << endl;
}
#else
#define debug(n)
#endif
int main(int argc, const char *argv[]) {
LL a = inputValue();
string s = inputString();
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"io.output.change"
] | 735,053
| 735,056
|
u548094461
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 1e6 + 10, mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << a;
}
// check for any potential overflow before submitting
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 1e6 + 10, mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
// check for any potential overflow before submitting
|
[
"identifier.change",
"io.output.change"
] | 735,060
| 735,062
|
u862720966
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
char str[5006];
int main() {
int n;
scanf("%d", &n);
scanf("%s", str + 1);
if (n > 3200)
puts("red");
else
cout << str + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[5006];
int main() {
int n;
scanf("%d", &n);
scanf("%s", str + 1);
if (n < 3200)
puts("red");
else
cout << str + 1;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,064
| 735,066
|
u765391939
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vector<int> to[2505];
vector<int> rto[2505];
bool reachablefrom1[2505];
bool reachableToN[2505];
bool ok[2505];
void dfs(int v) {
if (reachablefrom1[v])
return;
reachablefrom1[v] = true;
for (int u : to[v]) {
dfs(u);
}
}
void rdfs(int v) {
if (reachableToN[v])
return;
reachableToN[v] = true;
for (int u : rto[v]) {
rdfs(u);
}
}
int main() {
int a = in();
string s;
cin >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vector<int> to[2505];
vector<int> rto[2505];
bool reachablefrom1[2505];
bool reachableToN[2505];
bool ok[2505];
void dfs(int v) {
if (reachablefrom1[v])
return;
reachablefrom1[v] = true;
for (int u : to[v]) {
dfs(u);
}
}
void rdfs(int v) {
if (reachableToN[v])
return;
reachableToN[v] = true;
for (int u : rto[v]) {
rdfs(u);
}
}
int main() {
int a = in();
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,080
| 735,083
|
u526630579
|
cpp
|
p02933
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0) {
return -1;
}
return (x * y / gcd(x, y));
}
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCr(ll n, ll r) {
if (r * 2 > n)
r = n - r;
ll dividend = 1;
ll divisor = 1;
for (ll i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main(int argc, char *argv[]) {
ll result = 0;
ll a, s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0) {
return -1;
}
return (x * y / gcd(x, y));
}
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCr(ll n, ll r) {
if (r * 2 > n)
r = n - r;
ll dividend = 1;
ll divisor = 1;
for (ll i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main(int argc, char *argv[]) {
ll result = 0;
ll a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[] | 735,093
| 735,094
|
u050445028
|
cpp
|
p02933
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed 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"
] | 735,097
| 735,098
|
u942774736
|
cpp
|
p02933
|
#include <iostream>
#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 <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 735,099
| 735,100
|
u034810328
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9
// constexpr ll LLINF = 9223372036854775807; // 9 * 1e18
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
int a, b, c;
string s;
cin >> a; // >> b >> c;
cin >> s;
cout << (a <= 3200 ? "red" : s) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9
// constexpr ll LLINF = 9223372036854775807; // 9 * 1e18
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
int a, b, c;
string s;
cin >> a; // >> b >> c;
cin >> s;
cout << (a < 3200 ? "red" : s) << "\n";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 735,101
| 735,102
|
u993640894
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 32000) {
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 << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,105
| 735,106
|
u182800367
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 32000) {
cout << s << endl;
} else {
cout << "red";
}
return 0;
}
|
#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;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,107
| 735,106
|
u182800367
|
cpp
|
p02933
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a;
char s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a;
char s[10];
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
}
|
[] | 735,108
| 735,109
|
u817014213
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
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"
] | 735,124
| 735,125
|
u085481334
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a;
string res;
cin >> a >> res;
if (a >= 3200)
cout << a << endl;
else
cout << "red\n";
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a;
string res;
cin >> a >> res;
if (a >= 3200)
cout << res << endl;
else
cout << "red\n";
}
|
[
"identifier.change",
"io.output.change"
] | 735,130
| 735,131
|
u440249591
|
cpp
|
p02933
|
#include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s);
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s + 1);
return 0;
}
|
[
"expression.operation.binary.add"
] | 735,135
| 735,136
|
u595557971
|
cpp
|
p02933
|
#include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a >= 3200)
puts("red");
else
puts(s);
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s + 1);
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,137
| 735,136
|
u595557971
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
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;
return 0;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
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;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,138
| 735,139
|
u654240084
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
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;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[] | 735,142
| 735,143
|
u018434698
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red"
<< "\n";
} else
cout << s << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red"
<< "\n";
} else
cout << s << "\n";
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,144
| 735,145
|
u527398664
|
cpp
|
p02933
|
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[] | 735,150
| 735,151
|
u918357423
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
s = 'red';
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
s = "red";
}
cout << s << endl;
}
|
[
"literal.string.change",
"assignment.value.change"
] | 735,152
| 735,153
|
u539914590
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a, 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;
char s[10];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
|
[
"variable_declaration.remove",
"variable_declaration.add"
] | 735,154
| 735,155
|
u195094157
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int, int>
int num[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool uru(int checkyear) {
if (checkyear % 4 == 0) {
if (checkyear % 100 != 0 || checkyear % 400 == 0)
return true;
}
return false;
}
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
bool pairCompare(const pairint &firstElof, const pairint &secondElof) {
if (firstElof.second != secondElof.second)
return firstElof.second > secondElof.second;
else
return firstElof.first < secondElof.first;
}
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0, a = 0, b = 0;
string s;
std::vector<int> v;
std::cin >> x >> s;
if (a >= 3200)
std::cout << s << '\n';
else
std::cout << "red" << '\n';
}
|
#include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int, int>
int num[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool uru(int checkyear) {
if (checkyear % 4 == 0) {
if (checkyear % 100 != 0 || checkyear % 400 == 0)
return true;
}
return false;
}
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
bool pairCompare(const pairint &firstElof, const pairint &secondElof) {
if (firstElof.second != secondElof.second)
return firstElof.second > secondElof.second;
else
return firstElof.first < secondElof.first;
}
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0, a = 0, b = 0;
string s;
std::vector<int> v;
std::cin >> x >> s;
if (x >= 3200)
std::cout << s << '\n';
else
std::cout << "red" << '\n';
}
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 735,160
| 735,161
|
u893330446
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
if (n < 3200)
cout << "red";
else
cout << s;
}
|
#include <iostream>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
if (n < 3200)
cout << "red";
else
cout << s;
}
|
[
"expression.operation.binary.remove"
] | 735,164
| 735,165
|
u910994303
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lld long long int
#define ull unsigned long long int
ull power(ull x, ull y) {
ull temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ull gcdFactor(ull n) {
ull tmp = n, res = 0;
for (ull i = 1; i * i <= tmp; i++) {
if (tmp % i == 0) {
res++;
if (tmp / i != i)
res++;
}
}
return res;
}
#define ullmax ULLONG_MAX
void solution(void);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solution();
return 0;
}
// The difference between the novice and the master is that the master has
// failed more than the novice has tried It is not over when you lose it is over
// when you quit If you have time to think for a beautiful end, then live
// beautifully until the end
void solution() {
int a;
string st;
cin >> a;
cin >> st;
if (a < 3200)
cout << st;
else
cout << "red";
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lld long long int
#define ull unsigned long long int
ull power(ull x, ull y) {
ull temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ull gcdFactor(ull n) {
ull tmp = n, res = 0;
for (ull i = 1; i * i <= tmp; i++) {
if (tmp % i == 0) {
res++;
if (tmp / i != i)
res++;
}
}
return res;
}
#define ullmax ULLONG_MAX
void solution(void);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solution();
return 0;
}
// The difference between the novice and the master is that the master has
// failed more than the novice has tried It is not over when you lose it is over
// when you quit If you have time to think for a beautiful end, then live
// beautifully until the end
void solution() {
int a;
string st;
cin >> a;
cin >> st;
if (a >= 3200)
cout << st;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,168
| 735,169
|
u951746552
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
cout << ((a >= 3200) ? "red" : s) << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
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"
] | 735,172
| 735,173
|
u986399983
|
cpp
|
p02933
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << s << "\n";
else
cout << "red\n";
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << "\n";
else
cout << "red\n";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,178
| 735,179
|
u055148700
|
cpp
|
p02933
|
// Littleboy123 Template 1.1
#include <bits/stdc++.h>
using namespace std;
// pragmas
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
*/
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (c); ++(a))
#define FORN(a, b, c) for (ll(a) = (b); (a) > (c); --(a))
#define FORNE(a, b, c) for (ll(a) = (b); (a) >= (c); --(a))
#define COUT(a) cout << (a) << '\n'
#define MEM(a, b) memset((a), (b), sizeof((a)))
#define MAX(a, b) (a) = max((a), (b))
#define MIN(a, b) (a) = min((a), (b))
#define nl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
void init() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
// End of template
int main() {
init();
// debug
/*
ifstream in("input.in");
streambuf *cinbuf = std::cin.rdbuf();
cin.rdbuf(in.rdbuf());
ofstream out("out.txt");
streambuf *coutbuf = std::cout.rdbuf();
cout.rdbuf(out.rdbuf());
*/
// end debug
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s << nl;
} else {
cout << "red\n";
}
return 0;
}
|
// Littleboy123 Template 1.1
#include <bits/stdc++.h>
using namespace std;
// pragmas
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
*/
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (c); ++(a))
#define FORN(a, b, c) for (ll(a) = (b); (a) > (c); --(a))
#define FORNE(a, b, c) for (ll(a) = (b); (a) >= (c); --(a))
#define COUT(a) cout << (a) << '\n'
#define MEM(a, b) memset((a), (b), sizeof((a)))
#define MAX(a, b) (a) = max((a), (b))
#define MIN(a, b) (a) = min((a), (b))
#define nl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
void init() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
// End of template
int main() {
init();
// debug
/*
ifstream in("input.in");
streambuf *cinbuf = std::cin.rdbuf();
cin.rdbuf(in.rdbuf());
ofstream out("out.txt");
streambuf *coutbuf = std::cout.rdbuf();
cout.rdbuf(out.rdbuf());
*/
// end debug
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << nl;
} else {
cout << "red\n";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,180
| 735,181
|
u398659810
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0);
#define show(x) cout << #x << " = " << x << "\n"
#define mem(a, b) memset(a, b, sizeof a)
#define popcnt(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define mod(x, m) ((x % m + m) % m)
#define SZ(a) (int)a.size()
#define ll long long
#define ld long double
#define vii vector<ll>
#define dqi deque<ll>
#define sii set<ll>
#define vpi vector<pii>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pi pair<int, int>
#define pb push_back
#define F first
#define S second
#define L length()
#define OO (ll)1e18
#define lSOne(x) (x & -x)
#define EPS 1e-20
using namespace std;
using namespace __gnu_pbds;
void ONLINE__JUDGE();
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
pii swapii(pii pr) { return {pr.S, pr.F}; }
ll binEXP(ll x, ll pw, ll MOD = LLONG_MAX);
int dx[] = {0, 0, -1, +1, -1, +1, -1, +1};
int dy[] = {-1, +1, 0, 0, -1, +1, +1, -1};
const ll MOD = 1e9 + 7;
const ll MAX = 100 + 9;
ll x;
string s;
int main() {
FASTIO // ONLINE__JUDGE();
cin >>
x >> s;
if (x > 3200)
cout << s;
else
cout << "red";
return 0;
}
void ONLINE__JUDGE() {
#ifndef ONLINE_JUDGE
freopen("inp.c", "r", stdin);
// freopen( "OutPut.txt" , "w" , stdout );
#endif // ONLINE_JUDGE
}
ll binEXP(ll x, ll pw, ll MOD) {
ll res = 1;
while (pw > 0) {
pw % 2 ? res *= x : 0;
x *= x;
x %= MOD;
pw /= 2;
res %= MOD;
}
return res %= MOD;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0);
#define show(x) cout << #x << " = " << x << "\n"
#define mem(a, b) memset(a, b, sizeof a)
#define popcnt(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define mod(x, m) ((x % m + m) % m)
#define SZ(a) (int)a.size()
#define ll long long
#define ld long double
#define vii vector<ll>
#define dqi deque<ll>
#define sii set<ll>
#define vpi vector<pii>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pi pair<int, int>
#define pb push_back
#define F first
#define S second
#define L length()
#define OO (ll)1e18
#define lSOne(x) (x & -x)
#define EPS 1e-20
using namespace std;
using namespace __gnu_pbds;
void ONLINE__JUDGE();
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
pii swapii(pii pr) { return {pr.S, pr.F}; }
ll binEXP(ll x, ll pw, ll MOD = LLONG_MAX);
int dx[] = {0, 0, -1, +1, -1, +1, -1, +1};
int dy[] = {-1, +1, 0, 0, -1, +1, +1, -1};
const ll MOD = 1e9 + 7;
const ll MAX = 100 + 9;
ll x;
string s;
int main() {
FASTIO // ONLINE__JUDGE();
cin >>
x >> s;
if (x >= 3200)
cout << s;
else
cout << "red";
return 0;
}
void ONLINE__JUDGE() {
#ifndef ONLINE_JUDGE
freopen("inp.c", "r", stdin);
// freopen( "OutPut.txt" , "w" , stdout );
#endif // ONLINE_JUDGE
}
ll binEXP(ll x, ll pw, ll MOD) {
ll res = 1;
while (pw > 0) {
pw % 2 ? res *= x : 0;
x *= x;
x %= MOD;
pw /= 2;
res %= MOD;
}
return res %= MOD;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,192
| 735,193
|
u302539304
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef long long ll;
int main(void) {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "Red" << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef long long ll;
int main(void) {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,197
| 735,198
|
u744305661
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 32)
cout << s;
else
cout << "red";
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,201
| 735,202
|
u278557567
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int N;
cin >> N;
string S;
cin >> S;
if (S.size() < 3200) {
cout << "red";
} else {
cout << S;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int N;
cin >> N;
string S;
cin >> S;
if (N < 3200) {
cout << "red";
} else {
cout << S;
}
return 0;
}
|
[
"control_flow.branch.if.condition.change",
"call.remove"
] | 735,205
| 735,206
|
u444804755
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n;
string st;
cin >> n >> st;
if (n < 3200)
cout << "Red";
else
cout << st;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n;
string st;
cin >> n >> st;
if (n < 3200)
cout << "red";
else
cout << st;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,207
| 735,208
|
u791542693
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
const long long MOD = 1000000007;
const long long MAX = 100005;
const long double PI = 3.14159265359;
const long double G = 9.807;
const long long INF = 1e18;
const long double EPS = 1e-6;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
bool isprime(ll a) {
if (a == 2)
return 1;
if (!(a & 1))
return 0;
for (ll i = 3; i * i <= a; i += 2)
if (a % i == 0)
return 0;
return 1;
}
ll mpow(ll base, ll exponent, ll modulus) {
if (modulus == 1)
return 0;
long long result = 1;
base = base % modulus;
while (exponent) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
ll minv(ll a, ll mod) {
ll _gcd = gcd(a, mod);
assert(_gcd == 1);
return mpow(a, mod - 2, mod);
}
/*
ll ncr(ll N,ll K){
if(N<K)return 0;
if(K==0)return 1;
if(N==0)return 0;
ll den=1;
for(ll i=1;i<=K;i++)den*=i;
ll num=1;
while(K--){
num*=N;
if(num%den==0){
num/=den;
den=1;
}
N--;
}
return num;
}
*/
ll a;
string s;
int main() {
FAST;
cin >> a;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
const long long MOD = 1000000007;
const long long MAX = 100005;
const long double PI = 3.14159265359;
const long double G = 9.807;
const long long INF = 1e18;
const long double EPS = 1e-6;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
bool isprime(ll a) {
if (a == 2)
return 1;
if (!(a & 1))
return 0;
for (ll i = 3; i * i <= a; i += 2)
if (a % i == 0)
return 0;
return 1;
}
ll mpow(ll base, ll exponent, ll modulus) {
if (modulus == 1)
return 0;
long long result = 1;
base = base % modulus;
while (exponent) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
ll minv(ll a, ll mod) {
ll _gcd = gcd(a, mod);
assert(_gcd == 1);
return mpow(a, mod - 2, mod);
}
/*
ll ncr(ll N,ll K){
if(N<K)return 0;
if(K==0)return 1;
if(N==0)return 0;
ll den=1;
for(ll i=1;i<=K;i++)den*=i;
ll num=1;
while(K--){
num*=N;
if(num%den==0){
num/=den;
den=1;
}
N--;
}
return num;
}
*/
ll a;
string s;
int main() {
FAST;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"expression.operation.binary.add"
] | 735,213
| 735,214
|
u091650402
|
cpp
|
p02929
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
long divd = 1000000007;
int d[N];
d[0] = 1;
int ln = 1;
for (int i = 1; i < 2 * N; i++) { // at d, pos means L , -1 means R
if (S[i] != S[i - 1]) {
if (d[i - 1] > 0) {
ln++;
d[i] = ln;
} else {
d[i] = -1;
}
} else {
if (d[i - 1] > 0) {
d[i] = -1;
} else {
ln++;
d[i] = ln;
}
}
}
long ans = 1;
if (S[0] == 'W' || S[N - 1] == 'W' || ln != N)
cout << 0 << endl;
else {
for (int i = 0; i < 2 * N; i++) {
if (d[i] > 0) {
ans *= (2 * N - 1) - i - 2 * (ln - d[i]);
ans %= divd;
}
}
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= divd;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
long divd = 1000000007;
int d[2 * N];
d[0] = 1;
int ln = 1;
for (int i = 1; i < 2 * N; i++) {
if (S[i] != S[i - 1]) {
if (d[i - 1] > 0) {
ln++;
d[i] = ln;
} else {
d[i] = -1;
}
} else {
if (d[i - 1] > 0) {
d[i] = -1;
} else {
ln++;
d[i] = ln;
}
}
}
long ans = 1;
if (S[0] == 'W' || S[2 * N - 1] == 'W' || ln != N)
cout << 0 << endl;
else {
for (int i = 0; i < 2 * N; i++) {
if (d[i] > 0) {
ans *= (2 * N - 1) - i - 2 * (ln - d[i]);
ans %= divd;
}
}
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= divd;
}
cout << ans << endl;
}
return 0;
}
|
[
"control_flow.branch.if.condition.change"
] | 735,234
| 735,235
|
u552137999
|
cpp
|
p02929
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
int N;
cin >> N;
int x = 1e6;
char a[x];
rep(i, 2 * N) { cin >> a[i]; }
if (a[0] == 'W' or a[2 * N] == 'W') {
cout << 0 << endl;
return 0;
}
bool lor = true;
int left = 1;
ll ans = 1;
ll mod = 1e9 + 7;
for (int i = 1; i < 2 * N; i++) {
if (a[i] == a[i - 1]) {
lor = !lor;
}
if (lor == true) {
left++;
} else {
ans *= left;
ans %= mod;
left--;
}
if (left < 1) {
cout << 0 << endl;
return 0;
}
}
if (left != 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= mod;
}
cout << ans % mod << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
int N;
cin >> N;
int x = 1e6;
char a[x];
rep(i, 2 * N) { cin >> a[i]; }
if (a[0] == 'W' or a[2 * N] == 'W') {
cout << 0 << endl;
return 0;
}
bool lor = true;
int left = 1;
ll ans = 1;
ll mod = 1e9 + 7;
for (int i = 1; i < 2 * N; i++) {
if (a[i] == a[i - 1]) {
lor = !lor;
}
if (lor == true) {
left++;
} else {
ans *= left;
ans %= mod;
left--;
}
if (left < 0) {
cout << 0 << endl;
return 0;
}
}
if (left != 0) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= mod;
}
cout << ans % mod << endl;
}
|
[
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,264
| 735,265
|
u652150585
|
cpp
|
p02929
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << char(_.first) << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int INF = 1e9;
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll _n) : num((_n + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
// https://twitter.com/tempura_cpp/status/1165292041779073029
/*Cで僕が考えたこと
・累積的な何かを考えるとよさそう
・[L, R]の反転は、[0, R]の反転と[0, L-1]の反転に分解できる
・つまりそれぞれの頂点xは[0,
x]の反転として使う(Rにする)か[0,x-1]の反転として使う(Lにする)かのどちらか
・ある点yを見たとき、yより小さいやつについてはどっちの選択をしてもyには影響しない
・yより大きいやつについてはどっちを選択してもyを反転することになる
・つまり点yを反転するかしないかの選択肢は頂点yをLで使うかRで使うかのみで決まる
・したがってそれぞれの頂点についてLかRかが定まる
・LかRかが決まったあとはRと組み合わせられるのは自分より小さいやつなので順番に数えていけばいい
・操作の順番は自由なので最後にN!かけてできあがり
*/
int main() {
ll N;
string S;
cin >> N >> S;
modint cntl = 1;
modint ans = 1;
rep1(i, 2 * N) {
if (cntl % 2 == 0) {
if (S[i] == 'W') { //偶数回ひっくり返したい
//今Rにすればちょうど良い
ans *= cntl;
cntl -= 1;
if (cntl < 0) {
break;
}
} else { //奇数回ひっくり返したい
// Lにしておけばよくね
cntl += 1;
}
} else {
if (S[i] == 'W') { //偶数回ひっくり返したい
cntl += 1;
} else { //奇数回ひっくり返したい
//今Rにすれば、ちょうど良い
// Rにしたときは、その前のK個のLとの組み合わせがあるので、
ans *= cntl;
cntl -= 1;
if (cntl < 0) {
break;
}
}
}
}
if (cntl < 0) {
cout << 0 << endl;
return 0;
}
ans *= fact(N);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << char(_.first) << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
using P = pair<int, int>; // P.first, P.second
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int INF = 1e9;
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<modint> factorial;
modint() : num(0){};
modint(ll _n) : num((_n + MOD) % MOD) {}
modint(const modint &r) : num(r.num) {}
operator ll() const { return (num + MOD) % MOD; }
friend istream &operator>>(istream &is, modint &r) {
ll num_;
is >> num_;
r = num_;
return is;
}
modint operator+(const modint &r) const { return modint(num + r.num); }
modint operator-(const modint &r) const { return modint(num - r.num); }
modint operator*(const modint &r) const { return modint(num * r.num); }
template <typename T> modint operator^(const T &r) const {
if (r == 0)
return 1;
return (((*this) * (*this)) ^ (r / 2)) * modint(r & 1 ? num : 1);
}
modint operator/(const modint &r) const { return num * (r ^ (MOD - 2)); }
modint operator+=(const modint &r) { return *this = *this + r; }
modint operator-=(const modint &r) { return *this = *this - r; }
modint operator*=(const modint &r) { return *this = *this * r; }
modint operator/=(const modint &r) { return *this = *this / r; }
template <typename T> modint operator^=(const T &r) {
return *this = *this ^ r;
}
static modint fact(int n) {
if ((int)factorial.size() <= n)
factorial.resize(n + 1);
if (factorial[n])
return factorial[n];
if (n == 0)
return 1;
return factorial[n] = modint(n) * fact(n - 1);
}
static modint C(ll n, ll r) {
return n >= r ? fact(n) / (fact(n - r) * fact(r)) : modint(0);
}
};
vector<modint> modint::factorial;
#define fact(n) modint::fact(n)
#define C(n, r) modint::C(n, r)
#define H(a, b) C(a + b, a)
// https://twitter.com/tempura_cpp/status/1165292041779073029
/*Cで僕が考えたこと
・累積的な何かを考えるとよさそう
・[L, R]の反転は、[0, R]の反転と[0, L-1]の反転に分解できる
・つまりそれぞれの頂点xは[0,
x]の反転として使う(Rにする)か[0,x-1]の反転として使う(Lにする)かのどちらか
・ある点yを見たとき、yより小さいやつについてはどっちの選択をしてもyには影響しない
・yより大きいやつについてはどっちを選択してもyを反転することになる
・つまり点yを反転するかしないかの選択肢は頂点yをLで使うかRで使うかのみで決まる
・したがってそれぞれの頂点についてLかRかが定まる
・LかRかが決まったあとはRと組み合わせられるのは自分より小さいやつなので順番に数えていけばいい
・操作の順番は自由なので最後にN!かけてできあがり
*/
int main() {
ll N;
string S;
cin >> N >> S;
modint cntl = 0;
modint ans = 1;
rep(i, 2 * N) {
if (cntl % 2 == 0) {
if (S[i] == 'W') { //偶数回ひっくり返したい
//今Rにすればちょうど良い
ans *= cntl;
cntl -= 1;
if (cntl < 0) {
break;
}
} else { //奇数回ひっくり返したい
// Lにしておけばよくね
cntl += 1;
}
} else {
if (S[i] == 'W') { //偶数回ひっくり返したい
cntl += 1;
} else { //奇数回ひっくり返したい
//今Rにすれば、ちょうど良い
// Rにしたときは、その前のK個のLとの組み合わせがあるので、
ans *= cntl;
cntl -= 1;
if (cntl < 0) {
break;
}
}
}
}
if (cntl != 0) {
cout << 0 << endl;
return 0;
}
ans *= fact(N);
cout << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,267
| 735,268
|
u106297876
|
cpp
|
p02929
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
long long int mod = 1e9 + 7;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
} else {
long long int l = 1, r = 0; //
long long int sum = 1;
char a = 'L';
for (int i = 1; i < 2 * N; i++) {
// cout << a << endl;
if ((s[i - 1] == 'B' && s[i] == 'W') ||
(s[i - 1] == 'W' && s[i] == 'B')) {
if (a == 'R') {
r++;
sum *= l;
sum = sum % mod;
l--;
a = 'R';
} else {
l++;
a = 'L';
}
} else {
if (a == 'R') {
l++;
a = 'L';
} else {
r++;
sum *= l;
sum = sum % mod;
l--;
a = 'R';
}
}
}
// cout << a << endl;
// cout << l << r << endl;
if (l != 0 || r != N) {
cout << 0 << endl;
} else {
long long int num = 1;
for (int i = 1; i <= N; i++) {
num *= i;
num = num % mod;
}
sum *= num;
sum = num % mod;
cout << sum << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
long long int mod = 1e9 + 7;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
} else {
long long int l = 1, r = 0; //
long long int sum = 1;
char a = 'L';
for (int i = 1; i < 2 * N; i++) {
// cout << a << endl;
if ((s[i - 1] == 'B' && s[i] == 'W') ||
(s[i - 1] == 'W' && s[i] == 'B')) {
if (a == 'R') {
r++;
sum *= l;
sum = sum % mod;
l--;
a = 'R';
} else {
l++;
a = 'L';
}
} else {
if (a == 'R') {
l++;
a = 'L';
} else {
r++;
sum *= l;
sum = sum % mod;
l--;
a = 'R';
}
}
}
// cout << a << endl;
// cout << l << r << endl;
if (l != 0 || r != N) {
cout << 0 << endl;
} else {
long long int num = 1;
for (int i = 1; i <= N; i++) {
num *= i;
num = num % mod;
}
sum *= num;
sum = sum % mod;
cout << sum << endl;
}
}
}
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 735,269
| 735,270
|
u422506696
|
cpp
|
p02929
|
#include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1, tmp;
string lr;
string s;
cin >> n >> s;
ll lsum[n * 2], rsum[2 * n];
fill(lsum, lsum + 2 * n, 0);
fill(rsum, rsum + 2 * n, 0);
if (s[0] == 'W' || s[2 * n - 1] == 'W') {
cout << "0\n";
return 0;
}
lsum[0] = 1;
for (int i = 1; i <= n * 2; i++) {
lsum[i] = lsum[i - 1];
rsum[i] = rsum[i - 1];
if (i % 2 == 0) {
if (s[i] == 'W') {
rsum[i]++;
lr += "r";
} else {
lsum[i]++;
lr += "l";
}
} else {
if (s[i] == 'W') {
lsum[i]++;
lr += "l";
} else {
rsum[i]++;
lr += "r";
}
}
}
if (rsum[n * 2 - 1] != lsum[n * 2 - 1]) {
cout << "0\n";
return 0;
}
for (int i = 0; i < n * 2; i++) {
if (lr[i] == 'r') {
ans *= (lsum[i - 1] - rsum[i - 1]);
ans %= MOD;
}
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
}
|
#include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1, tmp;
string lr;
string s;
cin >> n >> s;
ll lsum[n * 2], rsum[2 * n];
fill(lsum, lsum + 2 * n, 0);
fill(rsum, rsum + 2 * n, 0);
if (s[0] == 'W' || s[2 * n - 1] == 'W') {
cout << "0\n";
return 0;
}
lsum[0] = 1;
for (int i = 1; i <= n * 2; i++) {
lsum[i] = lsum[i - 1];
rsum[i] = rsum[i - 1];
if (i % 2 == 0) {
if (s[i] == 'W') {
rsum[i]++;
lr += "r";
} else {
lsum[i]++;
lr += "l";
}
} else {
if (s[i] == 'W') {
lsum[i]++;
lr += "l";
} else {
rsum[i]++;
lr += "r";
}
}
}
if (rsum[n * 2 - 1] != lsum[n * 2 - 1]) {
cout << "0\n";
return 0;
}
for (int i = 0; i < n * 2; i++) {
if (lr[i] == 'r') {
ans *= (lsum[i] - rsum[i]);
ans %= MOD;
}
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
}
|
[
"expression.operation.binary.remove"
] | 735,304
| 735,305
|
u352248517
|
cpp
|
p02929
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll modpow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
ll ans = 1;
ll cnt = 0;
for (int i = 0; i < 2 * n; i++) {
if (cnt % 2 == 0) {
if (s[i] == 'W') {
if (cnt == 0) {
ans = 0;
break;
}
(ans *= cnt) %= MOD;
cnt--;
} else {
cnt++;
}
} else {
if (s[i] == 'W') {
cnt++;
} else {
if (cnt == 0) {
ans = 0;
break;
}
(ans *= cnt) %= MOD;
cnt--;
}
}
}
if (ans == 0) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
(ans *= i) %= MOD;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll modpow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
ll ans = 1;
ll cnt = 0;
for (int i = 0; i < 2 * n; i++) {
if (cnt % 2 == 0) {
if (s[i] == 'W') {
if (cnt == 0) {
ans = 0;
break;
}
(ans *= cnt) %= MOD;
cnt--;
} else {
cnt++;
}
} else {
if (s[i] == 'W') {
cnt++;
} else {
if (cnt == 0) {
ans = 0;
break;
}
(ans *= cnt) %= MOD;
cnt--;
}
}
}
if (ans == 0 || cnt > 0) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
(ans *= i) %= MOD;
}
cout << ans << endl;
return 0;
}
|
[
"control_flow.branch.if.condition.change"
] | 735,314
| 735,315
|
u553623615
|
cpp
|
p02929
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
string ss;
rep(i, 2 * n) {
if ((t + (s[i] == 'B' ? 1 : 0)) % 2 == 1) {
ss.push_back('r');
t++;
} else {
ss.push_back('l');
t--;
}
}
int r = 0;
long long ans = 1;
if (t == 0)
ans = 0;
rep(i, 2 * n) {
if (ss[i] == 'l') {
ans *= r--;
// ans %= MOD;
} else
r++;
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
string ss;
rep(i, 2 * n) {
if ((t + (s[i] == 'B' ? 1 : 0)) % 2 == 1) {
ss.push_back('r');
t++;
} else {
ss.push_back('l');
t--;
}
}
int r = 0;
long long ans = 1;
if (t != 0)
ans = 0;
rep(i, 2 * n) {
if (ss[i] == 'l') {
ans *= r--;
ans %= MOD;
} else
r++;
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 735,320
| 735,319
|
u321761416
|
cpp
|
p02929
|
#include <iostream>
#include <string.h>
using namespace std;
#define MOD 1000000007
main() {
int n;
int a[200010];
bool b;
long long ans, k, l;
string s;
cin >> n >> s;
k = 0;
b = false;
for (int i = 0; i < n * 2; i++) {
if (s[i] == 'B') {
b = true;
if (k % 2 == 0) {
a[i] = 1;
k++;
} else {
a[i] = 2;
k--;
}
} else {
if (k % 2 == 0) {
if (k == 0) {
a[i] = 0;
} else {
a[i] = 2;
k--;
}
} else {
a[i] = 1;
k++;
}
}
}
if (k != 0 || b == false) {
cout << 0;
return 0;
}
k = l = 0;
ans = 1;
for (int i = 0; i < n * 2; i++) {
if (a[i] == 1)
k++;
else if (a[i] == 2) {
ans *= k;
ans %= MOD;
k--;
l++;
}
}
for (int i = 2; i <= l; i++) {
ans *= i;
ans %= MOD;
}
cout << ans;
}
|
#include <iostream>
#include <string.h>
using namespace std;
#define MOD 1000000007
main() {
int n;
int a[200010];
bool b;
long long ans, k, l;
string s;
cin >> n >> s;
k = 0;
b = false;
for (int i = 0; i < n * 2; i++) {
if (s[i] == 'B') {
b = true;
if (k % 2 == 0) {
a[i] = 1;
k++;
} else {
a[i] = 2;
k--;
}
} else {
if (k % 2 == 0) {
if (k == 0) {
cout << 0;
return 0;
} else {
a[i] = 2;
k--;
}
} else {
a[i] = 1;
k++;
}
}
}
if (k != 0 || b == false) {
cout << 0;
return 0;
}
k = l = 0;
ans = 1;
for (int i = 0; i < n * 2; i++) {
if (a[i] == 1)
k++;
else if (a[i] == 2) {
ans *= k;
ans %= MOD;
k--;
l++;
}
}
for (int i = 2; i <= l; i++) {
ans *= i;
ans %= MOD;
}
cout << ans;
}
|
[
"assignment.change",
"assignment.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 735,321
| 735,322
|
u771099984
|
cpp
|
p02929
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
bool cmp(pii a, pii b) { return a.S < b.S; }
int fac(int n) {
int ans = 1;
For(i, 2, n) ans = (ans * i) % MOD;
return ans;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vector<bool> v(n * 2);
v[0] = true;
int t = 0;
For(i, 1, n * 2 - 1) {
if (s[i] != s[i - 1])
v[i] = v[i - 1];
else
v[i] = !v[i - 1];
if (v[i])
t++;
}
if (s[0] == 'W' || s[n * 2 - 1] == 'W' || t != n) {
cout << "0\n";
return 0;
}
int l = 0;
int ans = 1;
for (auto i : v) {
if (i)
l++;
else {
ans = (ans * l) % MOD;
l--;
}
}
cout << (ans * fac(n)) % MOD << "\n";
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
bool cmp(pii a, pii b) { return a.S < b.S; }
int fac(int n) {
int ans = 1;
For(i, 2, n) ans = (ans * i) % MOD;
return ans;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vector<bool> v(n * 2);
v[0] = true;
int t = 1;
For(i, 1, n * 2 - 1) {
if (s[i] != s[i - 1])
v[i] = v[i - 1];
else
v[i] = !v[i - 1];
if (v[i])
t++;
}
if (s[0] == 'W' || s[n * 2 - 1] == 'W' || t != n) {
cout << "0\n";
return 0;
}
int l = 0;
int ans = 1;
for (auto i : v) {
if (i)
l++;
else {
ans = (ans * l) % MOD;
l--;
}
}
cout << (ans * fac(n)) % MOD << "\n";
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 735,336
| 735,337
|
u055148700
|
cpp
|
p02929
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 5100
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
ll f(ll x) {
if (x == 0)
return 1;
if (x == 1)
return 1;
else
(x % MOD) * (f(x - 1) % MOD) % MOD;
}
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll cnt = 0;
ll ans = 1;
rep(i, s.size()) {
if (i == s.size() - 1) {
if (cnt != 1 || s[i] == 'W') {
cout << 0 << endl;
return 0;
}
} else {
if (s[i] == 'W') {
if ((cnt + 1) % 2 == 1) {
ans *= cnt;
ans %= MOD;
cnt--;
} else {
cnt++;
}
} else {
if ((cnt + 1) % 2 == 1) {
cnt++;
} else {
ans *= cnt;
ans %= MOD;
cnt--;
}
}
if (cnt == -1) {
cout << 0 << endl;
return 0;
}
// cout << cnt << endl;
}
}
cout << (ans * f(n)) % MOD << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 5100
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
ll f(ll x) {
if (x == 0)
return 1;
else if (x == 1)
return 1;
else
return (x % MOD) * (f(x - 1) % MOD) % MOD;
}
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll cnt = 0;
ll ans = 1;
rep(i, s.size()) {
if (i == s.size() - 1) {
if (cnt != 1 || s[i] == 'W') {
cout << 0 << endl;
return 0;
}
} else {
if (s[i] == 'W') {
if ((cnt + 1) % 2 == 1) {
ans *= cnt;
ans %= MOD;
cnt--;
} else {
cnt++;
}
} else {
if ((cnt + 1) % 2 == 1) {
cnt++;
} else {
ans *= cnt;
ans %= MOD;
cnt--;
}
}
if (cnt == -1) {
cout << 0 << endl;
return 0;
}
// cout << cnt << endl;
}
}
cout << (ans * f(n)) % MOD << endl;
}
|
[
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.return.add"
] | 735,346
| 735,347
|
u242679311
|
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 << "red" << endl;
}
if (a >= 3200) {
cout << s << endl;
}
}
|
[
"io.output.change"
] | 735,359
| 735,360
|
u173178820
|
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 << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
}
if (a >= 3200) {
cout << s << endl;
}
}
|
[
"literal.string.change",
"io.output.change"
] | 735,361
| 735,360
|
u173178820
|
cpp
|
p02933
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
char s[100];
cin >> n;
cin >> s;
if (n >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
char s[100];
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,364
| 735,365
|
u409617391
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
string s;
cin >> a >> s;
// cout<<"a="<<a<<",s="<<s<<endl;
if (a >= 3200) {
cout << s << endl;
} else {
cout << a << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
string s;
cin >> a >> s;
// cout<<"a="<<a<<",s="<<s<<endl;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"io.output.change"
] | 735,373
| 735,374
|
u074351677
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a < 3200) {
cout << 'red';
return 0;
}
string s;
cin >> s;
cout << s;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a < 3200) {
cout << "red";
return 0;
}
string s;
cin >> s;
cout << s;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 735,379
| 735,380
|
u780842141
|
cpp
|
p02933
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a;
string str;
cin >> a;
cin >> str;
if (a == 3200) {
cout << str << endl;
} else
cout << "red" << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a;
string str;
cin >> a;
cin >> str;
if (a >= 3200) {
cout << str << endl;
} else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,381
| 735,382
|
u848361297
|
cpp
|
p02933
|
/*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
ll a;
string s;
cin >> a >> s;
//出力
if (a >= 3200)
printf("%s\n", s.c_str());
else
printf("Red\n");
}
|
/*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
ll a;
string s;
cin >> a >> s;
//出力
if (a >= 3200)
printf("%s\n", s.c_str());
else
printf("red\n");
}
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 735,402
| 735,403
|
u757738907
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
cin >> s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
[] | 735,404
| 735,405
|
u533620702
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
if (T <= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
cin >> s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,406
| 735,405
|
u533620702
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n > 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,409
| 735,410
|
u744950774
|
cpp
|
p02933
|
#include <bits/stdc++.h>
constexpr long long INFL = 1LL << 60;
constexpr int INF = 1 << 30;
using namespace std;
using ll = long long;
using P = tuple<int, int>;
using iarr = valarray<int>;
int main() {
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
constexpr long long INFL = 1LL << 60;
constexpr int INF = 1 << 30;
using namespace std;
using ll = long long;
using P = tuple<int, int>;
using iarr = valarray<int>;
int main() {
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"
] | 735,421
| 735,422
|
u784751818
|
cpp
|
p02933
|
#include <stdio.h>
int main() {
int a;
char s[10];
scanf("%d", &a);
scanf("%s", s);
if (a < 3200) {
printf("%s", s);
} else {
printf("%d", a);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a;
char s[10];
scanf("%d", &a);
scanf("%s", s);
if (a < 3200) {
printf("red");
} else {
printf("%s", s);
}
return 0;
}
|
[
"call.add",
"control_flow.branch.else.add",
"call.remove"
] | 735,423
| 735,424
|
u592268075
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#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 input(v, n) \
for (ll i = 0; i < n; i++) \
cin >> v[i]
#define output(v, n) \
for (ll i = 0; i < n; i++) \
cout << v[i] << " "
#define ll long long
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define FOR0(i, n) for (ll i = 0; i < n; i++)
#define N 100001
// a new data structure that return number of elements less than k in O(logn)
// time
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// Driver function to sort the vector elements
// by second element of pairs
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
// Driver function to sort the vector elements by
// first element of pair in descending order
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
// Driver function to sort the vector elements by
// second element of pair in descending order
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
/* Iterative Function to calculate (x^y)%p in O(log y) */
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// algorithm to get updated array after array range
// add operation in constant time
// ll arr[N];
// void add(ll arr[], ll N, ll lo, ll hi, ll val)
// {
// arr[lo] += val;
// if (hi != N - 1)
// arr[hi + 1] -= val;
// }
// // Utility method to get actual array from operation array
// void updateArray(ll arr[], ll N)
// {
// // convert array into prefix sum array
// for (ll i = 1; i < N; i++)
// arr[i] += arr[i - 1];
// }
// // method to print final updated array
// void finalArr(ll arr[], ll N)
// {
// updateArray(arr, N);
// }
// Euler tour tree
// int visited[100001]={0};
// vector<ll > adj[100001];
// vector< ll > ett;
// void dfs(ll i)
// {
//
// s.insert(i);
// ett.pb(i);
// for(ll j=0; j<adj[i].size(); j++)
// {
// if(visited[ adj[i][j] ]==0)
// {
// dfs(adj[i][j]);
// }
// }
// ett.pb(i);
// }
// void SieveOfEratosthenes(ll n)
// {
// // Create a boolean array "prime[0..n]" and initialize
// // all entries it as true. A value in prime[i] will
// // finally be false if i is Not a prime, else true.
// bool prime[n+1];
// memset(prime, true, sizeof(prime));
// for (ll p=2; p*p<=n; p++)
// {
// // If prime[p] is not changed, then it is a prime
// if (prime[p] == true)
// {
// // Update all multiples of p greater than or
// // equal to the square of it
// // numbers which are multiple of p and are
// // less than p^2 are already been marked.
// for (ll i=p*p; i<=n; i += p)
// prime[i] = false;
// }
// }
// // Print all prime numbers
// for (ll p=2; p<=n; p++)
// if (prime[p])
// cout << p << " ";
// }
// Segment tree
// vector<ll> tree1(N, 0);
// void build(ll node, ll start, ll end)
// {
// if(start == end)
// {
// // Leaf node will have a single element
// tree1[node]=arr[start];
// }
// else
// {
// ll mid = (start + end) / 2;
// // Recurse on the left child
// build(2*node, start, mid);
// // Recurse on the right child
// build(2*node+1, mid+1, end);
// // Internal node will have the sum of both of its children
// tree1[node] = tree1[2*node] + tree1[2*node+1] ;
// }
// }
// ll query(ll node, ll start, ll end, ll l, ll r)
// {
// if(r < start or end < l)
// {
// // range represented by a node is completely outside the given range
// return 0;
// }
// if(l <= start and end <= r)
// {
// // range represented by a node is completely inside the given range
// return tree1[node];
// }
// // range represented by a node is partially inside and partially outside
// the given range ll mid = (start + end) / 2; ll p1 = query(2*node, start,
// mid, l, r); ll p2 = query(2*node+1, mid+1, end, l, r); return (p1 + p2);
// }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s;
} else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#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 input(v, n) \
for (ll i = 0; i < n; i++) \
cin >> v[i]
#define output(v, n) \
for (ll i = 0; i < n; i++) \
cout << v[i] << " "
#define ll long long
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define FOR0(i, n) for (ll i = 0; i < n; i++)
#define N 100001
// a new data structure that return number of elements less than k in O(logn)
// time
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// Driver function to sort the vector elements
// by second element of pairs
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
// Driver function to sort the vector elements by
// first element of pair in descending order
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
// Driver function to sort the vector elements by
// second element of pair in descending order
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
/* Iterative Function to calculate (x^y)%p in O(log y) */
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// algorithm to get updated array after array range
// add operation in constant time
// ll arr[N];
// void add(ll arr[], ll N, ll lo, ll hi, ll val)
// {
// arr[lo] += val;
// if (hi != N - 1)
// arr[hi + 1] -= val;
// }
// // Utility method to get actual array from operation array
// void updateArray(ll arr[], ll N)
// {
// // convert array into prefix sum array
// for (ll i = 1; i < N; i++)
// arr[i] += arr[i - 1];
// }
// // method to print final updated array
// void finalArr(ll arr[], ll N)
// {
// updateArray(arr, N);
// }
// Euler tour tree
// int visited[100001]={0};
// vector<ll > adj[100001];
// vector< ll > ett;
// void dfs(ll i)
// {
//
// s.insert(i);
// ett.pb(i);
// for(ll j=0; j<adj[i].size(); j++)
// {
// if(visited[ adj[i][j] ]==0)
// {
// dfs(adj[i][j]);
// }
// }
// ett.pb(i);
// }
// void SieveOfEratosthenes(ll n)
// {
// // Create a boolean array "prime[0..n]" and initialize
// // all entries it as true. A value in prime[i] will
// // finally be false if i is Not a prime, else true.
// bool prime[n+1];
// memset(prime, true, sizeof(prime));
// for (ll p=2; p*p<=n; p++)
// {
// // If prime[p] is not changed, then it is a prime
// if (prime[p] == true)
// {
// // Update all multiples of p greater than or
// // equal to the square of it
// // numbers which are multiple of p and are
// // less than p^2 are already been marked.
// for (ll i=p*p; i<=n; i += p)
// prime[i] = false;
// }
// }
// // Print all prime numbers
// for (ll p=2; p<=n; p++)
// if (prime[p])
// cout << p << " ";
// }
// Segment tree
// vector<ll> tree1(N, 0);
// void build(ll node, ll start, ll end)
// {
// if(start == end)
// {
// // Leaf node will have a single element
// tree1[node]=arr[start];
// }
// else
// {
// ll mid = (start + end) / 2;
// // Recurse on the left child
// build(2*node, start, mid);
// // Recurse on the right child
// build(2*node+1, mid+1, end);
// // Internal node will have the sum of both of its children
// tree1[node] = tree1[2*node] + tree1[2*node+1] ;
// }
// }
// ll query(ll node, ll start, ll end, ll l, ll r)
// {
// if(r < start or end < l)
// {
// // range represented by a node is completely outside the given range
// return 0;
// }
// if(l <= start and end <= r)
// {
// // range represented by a node is completely inside the given range
// return tree1[node];
// }
// // range represented by a node is partially inside and partially outside
// the given range ll mid = (start + end) / 2; ll p1 = query(2*node, start,
// mid, l, r); ll p2 = query(2*node+1, mid+1, end, l, r); return (p1 + p2);
// }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else
cout << "red" << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,431
| 735,432
|
u816958587
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#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 input(v, n) \
for (ll i = 0; i < n; i++) \
cin >> v[i]
#define output(v, n) \
for (ll i = 0; i < n; i++) \
cout << v[i] << " "
#define ll long long
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define FOR0(i, n) for (ll i = 0; i < n; i++)
#define N 100001
// a new data structure that return number of elements less than k in O(logn)
// time
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// Driver function to sort the vector elements
// by second element of pairs
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
// Driver function to sort the vector elements by
// first element of pair in descending order
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
// Driver function to sort the vector elements by
// second element of pair in descending order
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
/* Iterative Function to calculate (x^y)%p in O(log y) */
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// algorithm to get updated array after array range
// add operation in constant time
// ll arr[N];
// void add(ll arr[], ll N, ll lo, ll hi, ll val)
// {
// arr[lo] += val;
// if (hi != N - 1)
// arr[hi + 1] -= val;
// }
// // Utility method to get actual array from operation array
// void updateArray(ll arr[], ll N)
// {
// // convert array into prefix sum array
// for (ll i = 1; i < N; i++)
// arr[i] += arr[i - 1];
// }
// // method to print final updated array
// void finalArr(ll arr[], ll N)
// {
// updateArray(arr, N);
// }
// Euler tour tree
// int visited[100001]={0};
// vector<ll > adj[100001];
// vector< ll > ett;
// void dfs(ll i)
// {
//
// s.insert(i);
// ett.pb(i);
// for(ll j=0; j<adj[i].size(); j++)
// {
// if(visited[ adj[i][j] ]==0)
// {
// dfs(adj[i][j]);
// }
// }
// ett.pb(i);
// }
// void SieveOfEratosthenes(ll n)
// {
// // Create a boolean array "prime[0..n]" and initialize
// // all entries it as true. A value in prime[i] will
// // finally be false if i is Not a prime, else true.
// bool prime[n+1];
// memset(prime, true, sizeof(prime));
// for (ll p=2; p*p<=n; p++)
// {
// // If prime[p] is not changed, then it is a prime
// if (prime[p] == true)
// {
// // Update all multiples of p greater than or
// // equal to the square of it
// // numbers which are multiple of p and are
// // less than p^2 are already been marked.
// for (ll i=p*p; i<=n; i += p)
// prime[i] = false;
// }
// }
// // Print all prime numbers
// for (ll p=2; p<=n; p++)
// if (prime[p])
// cout << p << " ";
// }
// Segment tree
// vector<ll> tree1(N, 0);
// void build(ll node, ll start, ll end)
// {
// if(start == end)
// {
// // Leaf node will have a single element
// tree1[node]=arr[start];
// }
// else
// {
// ll mid = (start + end) / 2;
// // Recurse on the left child
// build(2*node, start, mid);
// // Recurse on the right child
// build(2*node+1, mid+1, end);
// // Internal node will have the sum of both of its children
// tree1[node] = tree1[2*node] + tree1[2*node+1] ;
// }
// }
// ll query(ll node, ll start, ll end, ll l, ll r)
// {
// if(r < start or end < l)
// {
// // range represented by a node is completely outside the given range
// return 0;
// }
// if(l <= start and end <= r)
// {
// // range represented by a node is completely inside the given range
// return tree1[node];
// }
// // range represented by a node is partially inside and partially outside
// the given range ll mid = (start + end) / 2; ll p1 = query(2*node, start,
// mid, l, r); ll p2 = query(2*node+1, mid+1, end, l, r); return (p1 + p2);
// }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a;
string s;
cin >> a >> s;
if (a <= 3200) {
cout << s;
} else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#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 input(v, n) \
for (ll i = 0; i < n; i++) \
cin >> v[i]
#define output(v, n) \
for (ll i = 0; i < n; i++) \
cout << v[i] << " "
#define ll long long
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define FOR0(i, n) for (ll i = 0; i < n; i++)
#define N 100001
// a new data structure that return number of elements less than k in O(logn)
// time
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// Driver function to sort the vector elements
// by second element of pairs
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
// Driver function to sort the vector elements by
// first element of pair in descending order
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
// Driver function to sort the vector elements by
// second element of pair in descending order
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
/* Iterative Function to calculate (x^y)%p in O(log y) */
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// algorithm to get updated array after array range
// add operation in constant time
// ll arr[N];
// void add(ll arr[], ll N, ll lo, ll hi, ll val)
// {
// arr[lo] += val;
// if (hi != N - 1)
// arr[hi + 1] -= val;
// }
// // Utility method to get actual array from operation array
// void updateArray(ll arr[], ll N)
// {
// // convert array into prefix sum array
// for (ll i = 1; i < N; i++)
// arr[i] += arr[i - 1];
// }
// // method to print final updated array
// void finalArr(ll arr[], ll N)
// {
// updateArray(arr, N);
// }
// Euler tour tree
// int visited[100001]={0};
// vector<ll > adj[100001];
// vector< ll > ett;
// void dfs(ll i)
// {
//
// s.insert(i);
// ett.pb(i);
// for(ll j=0; j<adj[i].size(); j++)
// {
// if(visited[ adj[i][j] ]==0)
// {
// dfs(adj[i][j]);
// }
// }
// ett.pb(i);
// }
// void SieveOfEratosthenes(ll n)
// {
// // Create a boolean array "prime[0..n]" and initialize
// // all entries it as true. A value in prime[i] will
// // finally be false if i is Not a prime, else true.
// bool prime[n+1];
// memset(prime, true, sizeof(prime));
// for (ll p=2; p*p<=n; p++)
// {
// // If prime[p] is not changed, then it is a prime
// if (prime[p] == true)
// {
// // Update all multiples of p greater than or
// // equal to the square of it
// // numbers which are multiple of p and are
// // less than p^2 are already been marked.
// for (ll i=p*p; i<=n; i += p)
// prime[i] = false;
// }
// }
// // Print all prime numbers
// for (ll p=2; p<=n; p++)
// if (prime[p])
// cout << p << " ";
// }
// Segment tree
// vector<ll> tree1(N, 0);
// void build(ll node, ll start, ll end)
// {
// if(start == end)
// {
// // Leaf node will have a single element
// tree1[node]=arr[start];
// }
// else
// {
// ll mid = (start + end) / 2;
// // Recurse on the left child
// build(2*node, start, mid);
// // Recurse on the right child
// build(2*node+1, mid+1, end);
// // Internal node will have the sum of both of its children
// tree1[node] = tree1[2*node] + tree1[2*node+1] ;
// }
// }
// ll query(ll node, ll start, ll end, ll l, ll r)
// {
// if(r < start or end < l)
// {
// // range represented by a node is completely outside the given range
// return 0;
// }
// if(l <= start and end <= r)
// {
// // range represented by a node is completely inside the given range
// return tree1[node];
// }
// // range represented by a node is partially inside and partially outside
// the given range ll mid = (start + end) / 2; ll p1 = query(2*node, start,
// mid, l, r); ll p2 = query(2*node+1, mid+1, end, l, r); return (p1 + p2);
// }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else
cout << "red" << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,433
| 735,432
|
u816958587
|
cpp
|
p02933
|
#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;
}
|
#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;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,434
| 735,435
|
u805131136
|
cpp
|
p02933
|
#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;
}
|
#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;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,436
| 735,435
|
u805131136
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,442
| 735,443
|
u048128931
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
main() {
int a;
int s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,444
| 735,443
|
u048128931
|
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;
}
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.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,445
| 735,446
|
u904123392
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
long long int a;
cin >> a;
cin >> S;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
long long int a;
cin >> a;
cin >> S;
if (a >= 3200) {
cout << S << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 735,449
| 735,450
|
u443479321
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n <= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n >= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,457
| 735,458
|
u208664517
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n <= 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n >= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 735,459
| 735,458
|
u208664517
|
cpp
|
p02933
|
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n <= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,460
| 735,461
|
u819553900
|
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 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;
} else if (a < 3200) {
cout << "red" << endl;
}
}
|
[] | 735,468
| 735,469
|
u572559885
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
typedef pair<int, int> p;
int jyo(int x, int y) { // xのｙ乗
int ans = 1;
for (int i = 0; i < y; i++) {
ans *= x;
}
return ans;
}
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << 'red';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
typedef pair<int, int> p;
int jyo(int x, int y) { // xのｙ乗
int ans = 1;
for (int i = 0; i < y; i++) {
ans *= x;
}
return ans;
}
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
cout << endl;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 735,475
| 735,476
|
u029166898
|
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"
] | 735,477
| 735,478
|
u674491576
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.