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 <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
// map<string>a
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
//組み合わせ
void recursive_comb(vector<int> indexes, int s, int rest,
std::function<void(vector<int>)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(int n, int k, std::function<void(vector<int>)> f) {
vector<int> indexes(k);
recursive_comb(indexes, n - 1, k, f);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
int main() {
string s;
int a;
cin >> a >> s;
if (a >= 3200) {
cout << "red";
} else {
cout << s;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
// map<string>a
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
//組み合わせ
void recursive_comb(vector<int> indexes, int s, int rest,
std::function<void(vector<int>)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(int n, int k, std::function<void(vector<int>)> f) {
vector<int> indexes(k);
recursive_comb(indexes, n - 1, k, f);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
int main() {
string s;
int a;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,715
| 732,716
|
u272628953
|
cpp
|
p02933
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "pink";
} else {
cout << "red";
}
return 0;
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[
"io.output.change"
] | 732,717
| 732,718
|
u311099484
|
cpp
|
p02933
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
int s;
cin >> s;
if (N < 3200)
print("red");
else
print(s);
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
string s;
cin >> s;
if (N < 3200)
print("red");
else
print(s);
}
|
[
"variable_declaration.type.change"
] | 732,727
| 732,728
|
u089177147
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
if (a >= 3200)
cout << b << endl;
else
cout << "s" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
if (a >= 3200)
cout << b << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 732,739
| 732,740
|
u079532978
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[] | 732,745
| 732,746
|
u425231382
|
cpp
|
p02933
|
#include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define fwd(i, a, n) for (int i = a; i <= n; i++)
#define bak(i, a, n) for (int i = a; i >= n; i--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pi;
typedef set<int> si;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
// power
ull power(ull x, ull y) {
if (y == 0)
return 1;
else {
if (y % 2 == 0)
return power(x * x, y / 2);
else
return x * power(x * x, (y - 1) / 2);
}
}
// Modular Exponentiation
ll mod_power(ll x, ll y, ll m) {
ll r = 1; // Initialize result
x = x % m; // Update x if it is more than or equal to m
if (x == 0)
return 0; // In case x is divisible by m;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
r = (r * x) % m;
// y must be even now
y = y / 2;
x = (x * x) % m;
}
return r;
}
// GCD
ull gcd(ull x, ull y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// EXTENDED_EUCLID
vector<ll> extended_Euclid(ll a, ll b) {
vector<ll> v(3);
if (b == 0) {
v[0] = a;
v[1] = 1;
v[2] = 0;
return v;
} else {
vector<ll> v1 = extended_Euclid(b, a % b); // recursive call
v[0] = v1[0];
v[1] = v1[2];
v[2] = v1[1] - (a / b) * v1[2];
return v;
}
}
// DFS ( number of connected components )
// vector<vector<ll> >adj(200001);
// bool visited[200001];
/*ll dfs(int x,int c){ // x - > node c - > number
of edges in the component if(visited[x])return c; else{ visited[x]=true; int
y=c; for(int i=0;i<adj[x].size();i++){ if(!visited[adj[x][i]]){ c+=1; int
d=dfs(adj[x][i],y); c+=d;
}
}
return c;
}
}
*/
// SIEVE
/*
bool isPrime[100001];
void sieve(int N) {
for(int i = 0; i <= N;++i) {
isPrime[i]=true;
}
isPrime[0]=false;
isPrime[1]=false;
for(int i = 2; i * i <= N; ++i) {
if(isPrime[i] == true) {
for(int j = i * i; j <= N ;j += i)
isPrime[j] = false;
}
}
}
*/
// Binary Search
/*
ll bin_search(ll y){
while(lo<hi){
x=lo+(hi-lo)/2;
if(condition){
.....
}
else{
// increase lo or decrease hi suitably
}
}
}
*/
int main() {
boost;
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << 'red' << endl;
else
cout << s << endl;
}
}
/* Be careful about integer ranges;
Check the corner cases before submitting.
*/
|
#include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define fwd(i, a, n) for (int i = a; i <= n; i++)
#define bak(i, a, n) for (int i = a; i >= n; i--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pi;
typedef set<int> si;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
// power
ull power(ull x, ull y) {
if (y == 0)
return 1;
else {
if (y % 2 == 0)
return power(x * x, y / 2);
else
return x * power(x * x, (y - 1) / 2);
}
}
// Modular Exponentiation
ll mod_power(ll x, ll y, ll m) {
ll r = 1; // Initialize result
x = x % m; // Update x if it is more than or equal to m
if (x == 0)
return 0; // In case x is divisible by m;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
r = (r * x) % m;
// y must be even now
y = y / 2;
x = (x * x) % m;
}
return r;
}
// GCD
ull gcd(ull x, ull y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// EXTENDED_EUCLID
vector<ll> extended_Euclid(ll a, ll b) {
vector<ll> v(3);
if (b == 0) {
v[0] = a;
v[1] = 1;
v[2] = 0;
return v;
} else {
vector<ll> v1 = extended_Euclid(b, a % b); // recursive call
v[0] = v1[0];
v[1] = v1[2];
v[2] = v1[1] - (a / b) * v1[2];
return v;
}
}
// DFS ( number of connected components )
// vector<vector<ll> >adj(200001);
// bool visited[200001];
/*ll dfs(int x,int c){ // x - > node c - > number
of edges in the component if(visited[x])return c; else{ visited[x]=true; int
y=c; for(int i=0;i<adj[x].size();i++){ if(!visited[adj[x][i]]){ c+=1; int
d=dfs(adj[x][i],y); c+=d;
}
}
return c;
}
}
*/
// SIEVE
/*
bool isPrime[100001];
void sieve(int N) {
for(int i = 0; i <= N;++i) {
isPrime[i]=true;
}
isPrime[0]=false;
isPrime[1]=false;
for(int i = 2; i * i <= N; ++i) {
if(isPrime[i] == true) {
for(int j = i * i; j <= N ;j += i)
isPrime[j] = false;
}
}
}
*/
// Binary Search
/*
ll bin_search(ll y){
while(lo<hi){
x=lo+(hi-lo)/2;
if(condition){
.....
}
else{
// increase lo or decrease hi suitably
}
}
}
*/
int main() {
boost;
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
}
/* Be careful about integer ranges;
Check the corner cases before submitting.
*/
|
[
"literal.string.change",
"io.output.change"
] | 732,749
| 732,750
|
u915716225
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200) {
cout << "red";
} else {
cout << s;
}
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,756
| 732,757
|
u329845662
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << a;
} else
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red";
} else
cout << s;
}
|
[
"io.output.change"
] | 732,778
| 732,777
|
u479329399
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cout << "\n";
cin >> s;
if (a > 3200) {
cout << s;
}
else {
cout << "red";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cout << "\n";
cin >> s;
if (a >= 3200) {
cout << s;
}
else {
cout << "red";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,779
| 732,780
|
u831336344
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if (n > 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,784
| 732,785
|
u849151695
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
ll 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;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
ll 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"
] | 732,786
| 732,787
|
u225581241
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[] | 732,790
| 732,791
|
u323819429
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
s = "red";
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200)
s = "red";
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,796
| 732,797
|
u730499268
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a <= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,802
| 732,803
|
u894339989
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,804
| 732,803
|
u894339989
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e18 + 5;
const int mod = 1e9 + 7;
const int N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
void solve() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
}
signed main() {
speed;
int t = 1;
// cin>>t;
while (t--)
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e18 + 5;
const int mod = 1e9 + 7;
const int N = 2e5 + 314;
const long double pi = 3.1415926535897932384626433832795;
void solve() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
signed main() {
speed;
int t = 1;
// cin>>t;
while (t--)
solve();
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,805
| 732,806
|
u104074027
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll sum(int n) {
if (n == 0) {
return n;
} else {
return sum(n / 10) + n % 10;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll sum(int n) {
if (n == 0) {
return n;
} else {
return sum(n / 10) + n % 10;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,807
| 732,808
|
u126236540
|
cpp
|
p02933
|
#include <iostream>
#include <string>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a < 3200) {
std::cout << s << std::endl;
} else {
std::cout << "red" << std::endl;
}
return 0;
}
|
#include <iostream>
#include <string>
int main() {
int a;
std::string s;
std::cin >> a >> s;
if (a >= 3200) {
std::cout << s << std::endl;
} else {
std::cout << "red" << std::endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,809
| 732,810
|
u225053756
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
cout << ((a < 3200) ? s : "red") << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
cout << ((a >= 3200) ? s : "red") << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 732,819
| 732,820
|
u529722835
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << endl
#define debug4(x, y, z, o) \
cout << "DEBUG " << x << " " << y << " " << z << " " << o << endl
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> ppi;
typedef vector<vector<int>> mat;
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int32_t main() {
int a;
string s;
cin >> a >> s;
cout << (a < 3200 ? s : "red") << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define int long long
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << endl
#define debug4(x, y, z, o) \
cout << "DEBUG " << x << " " << y << " " << z << " " << o << endl
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> ppi;
typedef vector<vector<int>> mat;
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int32_t main() {
int a;
string s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 732,830
| 732,831
|
u437229403
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
short int r;
string s;
cin >> r >> s;
if (r >= 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
short int r;
string s;
cin >> r >> s;
if (r < 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,834
| 732,835
|
u669403424
|
cpp
|
p02933
|
#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
s = "red";
}
cout << s;
}
|
#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
s = "red";
}
cout << s;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,840
| 732,841
|
u928591554
|
cpp
|
p02930
|
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int calc(int x) {
int ans = 0;
while (x) {
ans++;
x >>= 1;
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++)
printf("%d ", calc(i ^ j));
printf("\n");
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int calc(int x) {
int ans = 0;
while (x) {
ans++;
x >>= 1;
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++)
printf("%d ", calc(i ^ j));
printf("\n");
}
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 732,850
| 732,851
|
u656762776
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
Fora(iiii, a) cout << iiii << ' '; \
cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' '; \
cout << endl;
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 2e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e18 + 7;
const ll infll = 1e18 + 7;
int n, h, w, ans;
vector<pair<int, pii>> edges;
bool ck[N];
struct disjoint_set_union {
int par[N];
void init() { msetn1(par); }
int root(int x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool merge(int x, int y) {
if ((x = root(x)) == (y = root(y))) {
if (ck[x])
return 0;
ck[x] = 1;
return 1;
}
if (ck[x] && ck[y])
return 0;
par[x] += par[y];
par[y] = x;
ck[y] |= ck[x];
return 1;
}
} dsu;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> h >> w;
For(i, 0, n) {
int x, y, z;
cin >> x >> y >> z;
y += h;
edges.pb({z, {x, y}});
}
sort(rbend(edges));
dsu.init();
Fora(edge, edges) {
if (dsu.merge(edge.se.fi, edge.se.se)) {
ans += edge.fi;
}
}
cout << ans;
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/
|
#include <bits/stdc++.h>
using namespace std;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
Fora(iiii, a) cout << iiii << ' '; \
cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' '; \
cout << endl;
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 2e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e18 + 7;
const ll infll = 1e18 + 7;
int n, h, w, ans;
vector<pair<int, pii>> edges;
bool ck[N];
struct disjoint_set_union {
int par[N];
void init() { msetn1(par); }
int root(int x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool merge(int x, int y) {
if ((x = root(x)) == (y = root(y))) {
if (ck[x])
return 0;
ck[x] = 1;
return 1;
}
if (ck[x] && ck[y])
return 0;
par[x] += par[y];
par[y] = x;
ck[x] |= ck[y];
return 1;
}
} dsu;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> h >> w;
For(i, 0, n) {
int x, y, z;
cin >> x >> y >> z;
y += h;
edges.pb({z, {x, y}});
}
sort(rbend(edges));
dsu.init();
Fora(edge, edges) {
if (dsu.merge(edge.se.fi, edge.se.se)) {
ans += edge.fi;
}
}
cout << ans;
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/
|
[
"assignment.change"
] | 732,858
| 732,859
|
u430870052
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int x, y, w;
node() = default;
node(int _x, int _y, int _w) : x(_x), y(_y), w(_w) {}
bool friend operator<(const node &a, const node &b) { return a.w > b.w; }
};
int n, h, w;
int fa[maxn * 2], sz[maxn * 2];
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> h >> w;
vector<node> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].x >> a[i].y >> a[i].w;
a[i].y += h;
}
sort(a.begin(), a.end());
for (int i = 1; i <= h + w; ++i) {
fa[i] = i;
sz[i] = 1;
}
long long ans = 0;
for (int i = 0; i < n; ++i) {
int x = find(a[i].x), y = find(a[i].y);
if (x != y) {
fa[x] = y;
sz[x] += sz[y];
}
if (sz[x]) {
--sz[x];
ans += a[i].w;
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int x, y, w;
node() = default;
node(int _x, int _y, int _w) : x(_x), y(_y), w(_w) {}
bool friend operator<(const node &a, const node &b) { return a.w > b.w; }
};
int n, h, w;
int fa[maxn * 2], sz[maxn * 2];
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> h >> w;
vector<node> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].x >> a[i].y >> a[i].w;
a[i].y += h;
}
sort(a.begin(), a.end());
for (int i = 1; i <= h + w; ++i) {
fa[i] = i;
sz[i] = 1;
}
long long ans = 0;
for (int i = 0; i < n; ++i) {
int x = find(a[i].x), y = find(a[i].y);
if (x != y) {
fa[x] = y;
sz[y] += sz[x];
}
if (sz[y]) {
--sz[y];
ans += a[i].w;
}
}
cout << ans << '\n';
return 0;
}
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 732,860
| 732,861
|
u639210885
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, h, w, f[N << 1], si[N << 1];
bool vis[N << 1];
struct node {
int a, x, y;
bool operator<(const node &o) const { return a > o.a; }
} a[N];
int getf(int x) { return f[x] == x ? f[x] : f[x] = getf(f[x]); }
int main() {
scanf("%d%d%d", &n, &h, &w);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].a), a[i].y += n;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n << 1; i++)
f[i] = i, si[i] = 1;
ll ans = 0;
for (int i = 1; i <= n; i++) {
int fx = getf(a[i].x), fy = getf(a[i].y);
if (fx != fy) {
f[fy] = fx;
si[fx] += si[fy];
}
if (si[fx]) {
ans += a[i].a;
si[fx]--;
}
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, h, w, f[N << 1], si[N << 1];
bool vis[N << 1];
struct node {
int a, x, y;
bool operator<(const node &o) const { return a > o.a; }
} a[N];
int getf(int x) { return f[x] == x ? f[x] : f[x] = getf(f[x]); }
int main() {
scanf("%d%d%d", &n, &h, &w);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].a), a[i].y += h;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= h + w; i++)
f[i] = i, si[i] = 1;
ll ans = 0;
for (int i = 1; i <= n; i++) {
int fx = getf(a[i].x), fy = getf(a[i].y);
if (fx != fy) {
f[fy] = fx;
si[fx] += si[fy];
}
if (si[fx]) {
ans += a[i].a;
si[fx]--;
}
}
printf("%lld\n", ans);
}
|
[
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 732,862
| 732,863
|
u676323984
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
#define dmp(x) cerr << __LINE__ << " " << #x << " " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
struct UnionFind {
vector<int> par, rank, sz;
void init(int n) {
par.resize(n);
sz.resize(n, 1);
rank.resize(n, 0);
for (int i = 0; i < n; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
par[x] = y;
sz[y] += sz[x];
rank[y] += rank[x];
}
bool same(int x, int y) { return find(x) == find(y); }
} uf;
int N;
int H, W;
struct edge {
int f, t;
ll c;
edge() {}
edge(int f, int t, int c) : f(f), t(t), c(c) {}
bool operator<(const edge &a) const { return c > a.c; }
};
vector<edge> es;
int main() {
fastio();
cin >> N >> H >> W;
uf.init(2 * N);
for (int i = 0; i < N; i++) {
int r, c, a;
cin >> r >> c >> a;
r--;
c--;
c += N;
es.pb(edge(r, c, a));
}
sort(all(es));
ll ans = 0ll;
for (int i = 0; i < es.size(); i++) {
edge e = es[i];
int f = uf.find(e.f);
int t = uf.find(e.t);
if (f == t) {
if (uf.sz[f] > uf.rank[f]) {
ans += e.c;
uf.rank[f]++;
}
} else {
if (uf.sz[f] + uf.sz[t] >= uf.rank[f] + uf.rank[t] + 1) {
ans += e.c;
uf.unite(f, t);
uf.rank[t]++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
#define dmp(x) cerr << __LINE__ << " " << #x << " " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
struct UnionFind {
vector<int> par, rank, sz;
void init(int n) {
par.resize(n);
sz.resize(n, 1);
rank.resize(n, 0);
for (int i = 0; i < n; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
par[x] = y;
sz[y] += sz[x];
rank[y] += rank[x];
}
bool same(int x, int y) { return find(x) == find(y); }
} uf;
int N;
int H, W;
struct edge {
int f, t;
ll c;
edge() {}
edge(int f, int t, int c) : f(f), t(t), c(c) {}
bool operator<(const edge &a) const { return c > a.c; }
};
vector<edge> es;
int main() {
fastio();
cin >> N >> H >> W;
uf.init(H + W);
for (int i = 0; i < N; i++) {
int r, c, a;
cin >> r >> c >> a;
r--;
c--;
c += H;
es.pb(edge(r, c, a));
}
sort(all(es));
ll ans = 0ll;
for (int i = 0; i < es.size(); i++) {
edge e = es[i];
int f = uf.find(e.f);
int t = uf.find(e.t);
if (f == t) {
if (uf.sz[f] > uf.rank[f]) {
ans += e.c;
uf.rank[f]++;
}
} else {
if (uf.sz[f] + uf.sz[t] >= uf.rank[f] + uf.rank[t] + 1) {
ans += e.c;
uf.unite(f, t);
uf.rank[t]++;
}
}
}
cout << ans << endl;
return 0;
}
|
[
"assignment.value.change",
"identifier.change"
] | 732,871
| 732,872
|
u379947938
|
cpp
|
p02931
|
// luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int r, c, v;
} e[200001];
bool cmp(edge a, edge b) { return a.v > b.v; }
int fa[200001];
int siz[200001];
int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); }
signed main() {
int n, h, w;
scanf("%lld%lld%lld", &n, &h, &w);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld%lld", &e[i].r, &e[i].c, &e[i].v);
e[i].c += 100000;
}
sort(e + 1, e + n + 1, cmp);
int ans = 0;
for (int i = 1; i <= n + 100000; i++)
fa[i] = i, siz[i] = 1;
for (int i = 1; i <= n; i++) {
int f1 = find(e[i].r), f2 = find(e[i].c);
if (f1 == f2) {
if (siz[f1] >= 1) {
siz[f1]--;
ans += e[i].v;
}
} else if (siz[f1] + siz[f2] >= 1) {
fa[f1] = f2;
siz[f2] += siz[f1] - 1;
ans += e[i].v;
}
}
printf("%lld", ans);
return 0;
}
|
// luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int r, c, v;
} e[200001];
bool cmp(edge a, edge b) { return a.v > b.v; }
int fa[200001];
int siz[200001];
int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); }
signed main() {
int n, h, w;
scanf("%lld%lld%lld", &n, &h, &w);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld%lld", &e[i].r, &e[i].c, &e[i].v);
e[i].c += h;
}
sort(e + 1, e + n + 1, cmp);
int ans = 0;
for (int i = 1; i <= w + h; i++)
fa[i] = i, siz[i] = 1;
for (int i = 1; i <= n; i++) {
int f1 = find(e[i].r), f2 = find(e[i].c);
if (f1 == f2) {
if (siz[f1] >= 1) {
siz[f1]--;
ans += e[i].v;
}
} else if (siz[f1] + siz[f2] >= 1) {
fa[f1] = f2;
siz[f2] += siz[f1] - 1;
ans += e[i].v;
}
}
printf("%lld", ans);
return 0;
}
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 732,877
| 732,878
|
u413057858
|
cpp
|
p02931
|
// orz dxm
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define y0 yORZDXM
#define y1 yORZDXM
#define y2 yORZDXM
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
int n, h, w;
ll ans;
class Edge {
public:
int u, v, w;
bool operator<(const Edge &e) const {
return MP(w, MP(u, v)) < MP(e.w, MP(e.u, e.v));
}
} ed[maxn];
class Dsu {
private:
int fa[maxn << 1], cyc[maxn << 1];
public:
inline void init() {
FOR(i, 0, maxn << 1) fa[i] = i, cyc[i] = false;
return;
}
inline int find(int u) { return (u == fa[u]) ? u : (fa[u] = find(fa[u])); }
inline int combine(int u, int v, int w) {
u = find(u), v = find(v);
if (u == v) {
if (!cyc[u]) {
cyc[u] = true;
return w;
}
return 0;
}
if (cyc[u] && cyc[v])
return 0;
fa[u] = v;
cyc[v] |= cyc[v];
return w;
}
} dsu;
int main() {
scanf("%d%d%d", &n, &h, &w);
dsu.init();
FOR(i, 0, n) {
scanf("%d%d%d", &ed[i].u, &ed[i].v, &ed[i].w);
--ed[i].u, --ed[i].v;
ed[i].v += h;
}
sort(ed, ed + n);
reverse(ed, ed + n);
FOR(i, 0, n) ans += dsu.combine(ed[i].u, ed[i].v, ed[i].w);
printf("%lld\n", ans);
return 0;
}
|
// orz dxm
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define PB push_back
#define fst first
#define snd second
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define y0 yORZDXM
#define y1 yORZDXM
#define y2 yORZDXM
typedef double db;
typedef long long ll;
typedef long double ldb;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
int n, h, w;
ll ans;
class Edge {
public:
int u, v, w;
bool operator<(const Edge &e) const {
return MP(w, MP(u, v)) < MP(e.w, MP(e.u, e.v));
}
} ed[maxn];
class Dsu {
private:
int fa[maxn << 1], cyc[maxn << 1];
public:
inline void init() {
FOR(i, 0, maxn << 1) fa[i] = i, cyc[i] = false;
return;
}
inline int find(int u) { return (u == fa[u]) ? u : (fa[u] = find(fa[u])); }
inline int combine(int u, int v, int w) {
u = find(u), v = find(v);
if (u == v) {
if (!cyc[u]) {
cyc[u] = true;
return w;
}
return 0;
}
if (cyc[u] && cyc[v])
return 0;
fa[u] = v;
cyc[v] |= cyc[u];
return w;
}
} dsu;
int main() {
scanf("%d%d%d", &n, &h, &w);
dsu.init();
FOR(i, 0, n) {
scanf("%d%d%d", &ed[i].u, &ed[i].v, &ed[i].w);
--ed[i].u, --ed[i].v;
ed[i].v += h;
}
sort(ed, ed + n);
reverse(ed, ed + n);
FOR(i, 0, n) ans += dsu.combine(ed[i].u, ed[i].v, ed[i].w);
printf("%lld\n", ans);
return 0;
}
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 732,879
| 732,880
|
u904221771
|
cpp
|
p02931
|
#include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(ll x) {
write(x);
puts("");
}
using namespace std;
const int N = 3e5 + 6;
int n;
int h, w;
struct T {
int l, r, v;
} a[N];
bool cmp(T x, T y) { return x.v > y.v; }
int g[N], fa[N];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
int check(int x, int y) {
x = Find(x), y = Find(y);
if (x == y) {
if (g[x]) {
--g[x];
return 1;
}
return 0;
}
fa[x] = y;
g[y] += g[x];
if (g[y] == 0)
return 0;
--g[y];
return 1;
}
int main() {
n = read(), h = read(), w = read();
for (int i = 1; i <= n; ++i) {
a[i].l = read();
a[i].r = read();
a[i].v = read();
}
ll ans = 0;
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= h + w; ++i)
fa[i] = i, g[i] = 1;
for (int i = 1; i <= n; ++i)
if (check(a[i].l, a[i].r + n)) {
ans += a[i].v;
}
writeln(ans);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(ll x) {
write(x);
puts("");
}
using namespace std;
const int N = 3e5 + 6;
int n;
int h, w;
struct T {
int l, r, v;
} a[N];
bool cmp(T x, T y) { return x.v > y.v; }
int g[N], fa[N];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
int check(int x, int y) {
x = Find(x), y = Find(y);
if (x == y) {
if (g[x]) {
--g[x];
return 1;
}
return 0;
}
fa[x] = y;
g[y] += g[x];
if (g[y] == 0)
return 0;
--g[y];
return 1;
}
int main() {
n = read(), h = read(), w = read();
for (int i = 1; i <= n; ++i) {
a[i].l = read();
a[i].r = read();
a[i].v = read();
}
ll ans = 0;
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= h + w; ++i)
fa[i] = i, g[i] = 1;
for (int i = 1; i <= n; ++i)
if (check(a[i].l, a[i].r + h)) {
ans += a[i].v;
}
writeln(ans);
return 0;
}
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 732,883
| 732,884
|
u580537908
|
cpp
|
p02931
|
#include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(ll x) {
write(x);
puts("");
}
using namespace std;
const int N = 3e5 + 6;
int n;
int h, w;
struct T {
int l, r, v;
} a[N];
bool cmp(T x, T y) { return x.v > y.v; }
int g[N], fa[N];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
int check(int x, int y) {
x = Find(x), y = Find(y);
if (x == y) {
if (g[x]) {
--g[x];
return 1;
}
return 0;
}
fa[x] = y;
g[y] += g[x];
if (g[y] == 0)
return 0;
--g[y];
return 1;
}
int main() {
n = read(), h = read(), w = read();
for (int i = 1; i <= n; ++i) {
a[i].l = read();
a[i].r = read();
a[i].v = read();
}
ll ans = 0;
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n * 2; ++i)
fa[i] = i, g[i] = 1;
for (int i = 1; i <= n; ++i)
if (check(a[i].l, a[i].r + n)) {
ans += a[i].v;
}
/* for(int i = 1; i <= n; ++i) {
if(!v1[a[i].l]) {
ans += a[i].v;
v1[a[i].l] = 1;
} else if(!v2[a[i].r]) {
ans += a[i].v;
v2[a[i].r] = 1;
}
}*/
writeln(ans);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
inline ll read() {
ll x = 0;
char ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * w;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(ll x) {
write(x);
puts("");
}
using namespace std;
const int N = 3e5 + 6;
int n;
int h, w;
struct T {
int l, r, v;
} a[N];
bool cmp(T x, T y) { return x.v > y.v; }
int g[N], fa[N];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
int check(int x, int y) {
x = Find(x), y = Find(y);
if (x == y) {
if (g[x]) {
--g[x];
return 1;
}
return 0;
}
fa[x] = y;
g[y] += g[x];
if (g[y] == 0)
return 0;
--g[y];
return 1;
}
int main() {
n = read(), h = read(), w = read();
for (int i = 1; i <= n; ++i) {
a[i].l = read();
a[i].r = read();
a[i].v = read();
}
ll ans = 0;
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= h + w; ++i)
fa[i] = i, g[i] = 1;
for (int i = 1; i <= n; ++i)
if (check(a[i].l, a[i].r + h)) {
ans += a[i].v;
}
writeln(ans);
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 732,885
| 732,884
|
u580537908
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int P[200002];
int eranda[200002];
int Find(int A) {
if (P[A] < 0)
return A;
return P[A] = Find(P[A]);
}
bool Unite(int A, int B) {
int a = Find(A);
int b = Find(B);
if (a == b)
return false;
if (P[a] > P[b])
swap(a, b);
P[a] += P[b];
eranda[a] |= eranda[b];
P[b] = a;
return true;
}
int Size(int A) { return -P[Find(A)]; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, H, W;
cin >> N >> H >> W;
pair<int, pair<int, int>> E[100000];
rep(i, N) {
int r, c, a;
cin >> r >> c >> a;
E[i] = mp(a, mp(r - 1, H + c - 1));
}
sort(E, E + N);
reverse(E, E + N);
rep(i, H + W) P[i] = -1;
ll kotae = 0;
rep(i, N) {
int r = E[i].second.first;
int c = E[i].second.second;
if (Find(r) != Find(c)) {
if (!(eranda[Find(r)] && eranda[Find(r)])) {
Unite(r, c);
kotae += E[i].first;
}
} else {
if (eranda[Find(r)] == 0) {
kotae += E[i].first;
eranda[Find(r)] = 1;
}
}
}
co(kotae);
Would you please return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int P[200002];
int eranda[200002];
int Find(int A) {
if (P[A] < 0)
return A;
return P[A] = Find(P[A]);
}
bool Unite(int A, int B) {
int a = Find(A);
int b = Find(B);
if (a == b)
return false;
if (P[a] > P[b])
swap(a, b);
P[a] += P[b];
eranda[a] |= eranda[b];
P[b] = a;
return true;
}
int Size(int A) { return -P[Find(A)]; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, H, W;
cin >> N >> H >> W;
pair<int, pair<int, int>> E[100000];
rep(i, N) {
int r, c, a;
cin >> r >> c >> a;
E[i] = mp(a, mp(r - 1, H + c - 1));
}
sort(E, E + N);
reverse(E, E + N);
rep(i, H + W) P[i] = -1;
ll kotae = 0;
rep(i, N) {
int r = E[i].second.first;
int c = E[i].second.second;
if (Find(r) != Find(c)) {
if (!(eranda[Find(r)] && eranda[Find(c)])) {
Unite(r, c);
kotae += E[i].first;
}
} else {
if (eranda[Find(r)] == 0) {
kotae += E[i].first;
eranda[Find(r)] = 1;
}
}
}
co(kotae);
Would you please return 0;
}
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 732,886
| 732,887
|
u096883693
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
struct edge {
ll R, C, A;
bool operator<(const edge &right) const { return A < right.A; }
};
// par[i] は，iがrootなら-(連結成分のサイズ)を，iがrootではないならばrootを返す
// root(x) は必ずroot を返す
struct UnionFindSize {
vector<int> par;
UnionFindSize(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H, W;
cin >> N >> H >> W;
vector<edge> edges;
REP(i, N) {
ll R, C, A;
cin >> R >> C >> A;
R--, C--;
edges.push_back(edge{R, C, A});
}
sort(edges.rbegin(), edges.rend());
UnionFindSize uf(H + W);
vector<ll> cnt(N, 0);
ll res = 0;
REP(i, N) {
ll r1 = uf.root(edges[i].R);
ll r2 = uf.root(H + edges[i].C);
ll s1 = uf.size(r1);
ll s2 = uf.size(r2);
ll e1 = cnt[r1];
ll e2 = cnt[r2];
if (r1 == r2) {
if (s1 > e1) {
res += edges[i].A;
cnt[r1]++;
}
} else {
if (s1 + s2 > e1 + e2) {
res += edges[i].A;
uf.merge(r1, r2);
cnt[uf.root(r1)] = e1 + e2 + 1;
}
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
struct edge {
ll R, C, A;
bool operator<(const edge &right) const { return A < right.A; }
};
// par[i] は，iがrootなら-(連結成分のサイズ)を，iがrootではないならばrootを返す
// root(x) は必ずroot を返す
struct UnionFindSize {
vector<int> par;
UnionFindSize(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H, W;
cin >> N >> H >> W;
vector<edge> edges;
REP(i, N) {
ll R, C, A;
cin >> R >> C >> A;
R--, C--;
edges.push_back(edge{R, C, A});
}
sort(edges.rbegin(), edges.rend());
UnionFindSize uf(H + W);
vector<ll> cnt(H + W, 0);
ll res = 0;
REP(i, N) {
ll r1 = uf.root(edges[i].R);
ll r2 = uf.root(H + edges[i].C);
ll s1 = uf.size(r1);
ll s2 = uf.size(r2);
ll e1 = cnt[r1];
ll e2 = cnt[r2];
if (r1 == r2) {
if (s1 > e1) {
res += edges[i].A;
cnt[r1]++;
}
} else {
if (s1 + s2 > e1 + e2) {
res += edges[i].A;
uf.merge(r1, r2);
cnt[uf.root(r1)] = e1 + e2 + 1;
}
}
}
cout << res << endl;
return 0;
}
|
[
"call.arguments.change"
] | 732,892
| 732,893
|
u895971408
|
cpp
|
p02931
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
// Verified: AOJ-DSL1A
class UFSet {
private:
vector<int> ranks;
vector<int> prevs;
public:
UFSet(int n) : ranks(n), prevs(n) {
for (int i = 0; i < n; i++)
prevs[i] = i;
}
// Returns a root of a tree which x belongs to.
int Find(int x) {
if (x != prevs[x])
prevs[x] = Find(prevs[x]);
return prevs[x];
}
// Merges a set which x blongs to and a set which y belongs to.
void Union(int x, int y) {
int x_root = Find(x);
int y_root = Find(y);
if (ranks[x_root] > ranks[y_root]) {
prevs[y_root] = prevs[x_root];
} else if (ranks[x_root] < ranks[y_root]) {
prevs[x_root] = prevs[y_root];
} else if (prevs[x_root] != prevs[y_root]) {
prevs[y_root] = prevs[x_root];
ranks[x_root]++;
}
}
};
struct WeightedEdge {
int v1, v2;
int64 weight;
WeightedEdge(int v1, int v2, int64 weight) : v1(v1), v2(v2), weight(weight) {}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, h, w;
cin >> n >> h >> w;
vector<WeightedEdge> edges;
for (int i = 0; i < n; i++) {
int r, c;
int64 weight;
cin >> r >> c >> weight;
r--;
c--;
edges.emplace_back(r, h + c, weight);
}
sort(edges.begin(), edges.end(),
[](const auto &e1, const auto &e2) { return e1.weight > e2.weight; });
UFSet uf_set(h + w);
vector<int> has_cycle_vector(h + w);
int64 answer;
for (const auto &e : edges) {
int s1 = uf_set.Find(e.v1);
int s2 = uf_set.Find(e.v2);
if (s1 != s2) {
if (has_cycle_vector[s1] && has_cycle_vector[s2])
continue;
int new_has_cycle = has_cycle_vector[s1] || has_cycle_vector[s2];
uf_set.Union(e.v1, e.v2);
int s3 = uf_set.Find(e.v1);
has_cycle_vector[s3] = new_has_cycle;
answer += e.weight;
} else {
if (has_cycle_vector[s1])
continue;
has_cycle_vector[s1] = true;
answer += e.weight;
}
}
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
// Verified: AOJ-DSL1A
class UFSet {
private:
vector<int> ranks;
vector<int> prevs;
public:
UFSet(int n) : ranks(n), prevs(n) {
for (int i = 0; i < n; i++)
prevs[i] = i;
}
// Returns a root of a tree which x belongs to.
int Find(int x) {
if (x != prevs[x])
prevs[x] = Find(prevs[x]);
return prevs[x];
}
// Merges a set which x blongs to and a set which y belongs to.
void Union(int x, int y) {
int x_root = Find(x);
int y_root = Find(y);
if (ranks[x_root] > ranks[y_root]) {
prevs[y_root] = prevs[x_root];
} else if (ranks[x_root] < ranks[y_root]) {
prevs[x_root] = prevs[y_root];
} else if (prevs[x_root] != prevs[y_root]) {
prevs[y_root] = prevs[x_root];
ranks[x_root]++;
}
}
};
struct WeightedEdge {
int v1, v2;
int64 weight;
WeightedEdge(int v1, int v2, int64 weight) : v1(v1), v2(v2), weight(weight) {}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, h, w;
cin >> n >> h >> w;
vector<WeightedEdge> edges;
for (int i = 0; i < n; i++) {
int r, c;
int64 weight;
cin >> r >> c >> weight;
r--;
c--;
edges.emplace_back(r, h + c, weight);
}
sort(edges.begin(), edges.end(),
[](const auto &e1, const auto &e2) { return e1.weight > e2.weight; });
UFSet uf_set(h + w);
vector<int> has_cycle_vector(h + w);
int64 answer = 0;
for (const auto &e : edges) {
int s1 = uf_set.Find(e.v1);
int s2 = uf_set.Find(e.v2);
if (s1 != s2) {
if (has_cycle_vector[s1] && has_cycle_vector[s2])
continue;
int new_has_cycle = has_cycle_vector[s1] || has_cycle_vector[s2];
uf_set.Union(e.v1, e.v2);
int s3 = uf_set.Find(e.v1);
has_cycle_vector[s3] = new_has_cycle;
answer += e.weight;
} else {
if (has_cycle_vector[s1])
continue;
has_cycle_vector[s1] = true;
answer += e.weight;
}
}
cout << answer << endl;
}
|
[
"variable_declaration.value.change"
] | 732,894
| 732,895
|
u771276542
|
cpp
|
p02931
|
#include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
t *= f;
}
typedef long long ll;
const int maxn = (2e5) + 10;
int n, m1, m2, fa[maxn], sz[maxn];
ll ans;
struct node {
int x, y, z;
} d[maxn];
bool cmp(node a, node b) { return a.z > b.z; }
int find(int x) {
if (fa[x] == x)
return x;
return fa[x] = find(fa[x]);
}
int main() {
// freopen("1.txt","r",stdin);
read(n);
read(m1);
read(m2);
int x, y, z;
for (int i = 1; i <= n; i++) {
read(x);
read(y);
read(z);
d[i] = (node){x, y + m1, z};
}
sort(d + 1, d + n + 1, cmp);
for (int i = 1; i <= m1 + m2; i++)
fa[i] = i;
for (int i = 1; i <= n; i++) {
x = d[i].x;
y = d[i].y;
z = d[i].z;
x = find(x);
y = find(y);
if (x == y) {
if (sz[x])
continue;
sz[x] = 1;
} else {
if (sz[x] && sz[y])
continue;
fa[x] = y;
sz[y] |= sz[y];
}
ans += z;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
t *= f;
}
typedef long long ll;
const int maxn = (2e5) + 10;
int n, m1, m2, fa[maxn], sz[maxn];
ll ans;
struct node {
int x, y, z;
} d[maxn];
bool cmp(node a, node b) { return a.z > b.z; }
int find(int x) {
if (fa[x] == x)
return x;
return fa[x] = find(fa[x]);
}
int main() {
// freopen("1.txt","r",stdin);
read(n);
read(m1);
read(m2);
int x, y, z;
for (int i = 1; i <= n; i++) {
read(x);
read(y);
read(z);
d[i] = (node){x, y + m1, z};
}
sort(d + 1, d + n + 1, cmp);
for (int i = 1; i <= m1 + m2; i++)
fa[i] = i;
for (int i = 1; i <= n; i++) {
x = d[i].x;
y = d[i].y;
z = d[i].z;
x = find(x);
y = find(y);
if (x == y) {
if (sz[x])
continue;
sz[x] = 1;
} else {
if (sz[x] && sz[y])
continue;
fa[x] = y;
sz[y] |= sz[x];
}
ans += z;
}
printf("%lld\n", ans);
return 0;
}
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 732,905
| 732,906
|
u880862257
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define rbg rbegin()
#define red rend()
#define all(x) x.bg, x.ed
#define rall(x) x.rbg, x.red
#define pb push_back
#define pf push_front
#define eb emplace_back
using namespace std;
typedef long long ll;
template <class t, class u> bool chmax(t &a, u b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class t, class u> bool chmin(t &a, u b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class t, class u> t MAX(t a, u b) {
if (a >= b)
return a;
return b;
}
template <class t, class u> t MIN(t a, u b) {
if (a <= b)
return a;
return b;
}
template <class t> int SIZE(t s) { return (int)s.size(); }
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using vvi = vc<vc<int>>;
using pi = pair<int, int>;
using vi = vc<int>;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
const long long INF = 1LL << 60;
int main() {
cout << fixed << setprecision(20);
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define rbg rbegin()
#define red rend()
#define all(x) x.bg, x.ed
#define rall(x) x.rbg, x.red
#define pb push_back
#define pf push_front
#define eb emplace_back
using namespace std;
typedef long long ll;
template <class t, class u> bool chmax(t &a, u b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class t, class u> bool chmin(t &a, u b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class t, class u> t MAX(t a, u b) {
if (a >= b)
return a;
return b;
}
template <class t, class u> t MIN(t a, u b) {
if (a <= b)
return a;
return b;
}
template <class t> int SIZE(t s) { return (int)s.size(); }
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using vvi = vc<vc<int>>;
using pi = pair<int, int>;
using vi = vc<int>;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
const long long INF = 1LL << 60;
int main() {
cout << fixed << setprecision(20);
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 732,913
| 732,914
|
u891346638
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, k, x = 0, y = 2, m, ans = 0, h, s;
ll a[MAXX], b[MAXX], c[MAXX];
double f = 0.5;
vector<ll> adj[MAXX];
bool used[MAXX];
ll d[MAXX];
ll p[MAXX];
queue<ll> q;
signed main() {
FAST;
cin >> n;
string str;
cin >> str;
if (n >= 3200) {
cout << "pink";
return 0;
}
cout << "red";
}
|
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, k, x = 0, y = 2, m, ans = 0, h, s;
ll a[MAXX], b[MAXX], c[MAXX];
double f = 0.5;
vector<ll> adj[MAXX];
bool used[MAXX];
ll d[MAXX];
ll p[MAXX];
queue<ll> q;
signed main() {
FAST;
cin >> n;
string str;
cin >> str;
if (n >= 3200) {
cout << str;
return 0;
}
cout << "red";
}
|
[
"io.output.change"
] | 732,915
| 732,916
|
u102842945
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, k, x = 0, y = 2, m, ans = 0, h, s;
ll a[MAXX], b[MAXX], c[MAXX];
double f = 0.5;
vector<ll> adj[MAXX];
bool used[MAXX];
ll d[MAXX];
ll p[MAXX];
queue<ll> q;
signed main() {
FAST;
cin >> n;
string str;
cin >> str;
if (n >= 3200) {
cout << "red";
return 0;
}
cout << "pink";
}
|
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, k, x = 0, y = 2, m, ans = 0, h, s;
ll a[MAXX], b[MAXX], c[MAXX];
double f = 0.5;
vector<ll> adj[MAXX];
bool used[MAXX];
ll d[MAXX];
ll p[MAXX];
queue<ll> q;
signed main() {
FAST;
cin >> n;
string str;
cin >> str;
if (n >= 3200) {
cout << str;
return 0;
}
cout << "red";
}
|
[
"io.output.change",
"literal.string.change"
] | 732,917
| 732,916
|
u102842945
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"literal.string.change",
"io.output.change"
] | 732,922
| 732,923
|
u650236619
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string S;
cin >> S;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string S;
cin >> S;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,951
| 732,952
|
u319965179
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "Red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 732,957
| 732,958
|
u170385544
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"expression.operation.binary.add"
] | 732,959
| 732,960
|
u893584578
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "s" << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[] | 732,963
| 732,964
|
u587669944
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vv vector<int>
#define endl "\n"
#define test(i) cout << i << endl
#define tests(i) cout << "i: " << i << endl;
#define itrt \
int t; \
cin >> t; \
fors(i, t)
#define itr1 \
int t; \
cin >> t;
#define ff first
#define ss second
#define pb push_back
#define vmp make_pair
#define ppb pop_back
#define sorta(a, n) sort(arr, arr + n)
#define sortv(x) sort(x.begin(), x.end())
void file() {
#ifdef LOCAL
freopen("demo.in", "r", stdin);
freopen("demo.out", "w", stdout);
#endif
}
bool sortdes(const pair<int, int> &a, const pair<int, int> &b) {
return a.ss < b.ss;
}
bool sortasc(const pair<int, int> &a, const pair<int, int> &b) {
return a.ss > b.ss;
}
int gcd(int x, int y) { return __gcd(x, y); }
void test_case() {
int n;
string s;
cin >> n;
cin >> s;
if (n >= 3200) {
test(s);
} else {
test("red");
}
}
int main() {
fastio;
file();
// int T=1;
int T;
cin >> T;
for (int nr = 1; nr <= T; ++nr) {
// cout<<"Case #"<<nr<<": ";
test_case();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vv vector<int>
#define endl "\n"
#define test(i) cout << i << endl
#define tests(i) cout << "i: " << i << endl;
#define itrt \
int t; \
cin >> t; \
fors(i, t)
#define itr1 \
int t; \
cin >> t;
#define ff first
#define ss second
#define pb push_back
#define vmp make_pair
#define ppb pop_back
#define sorta(a, n) sort(arr, arr + n)
#define sortv(x) sort(x.begin(), x.end())
void file() {
#ifdef LOCAL
freopen("demo.in", "r", stdin);
freopen("demo.out", "w", stdout);
#endif
}
bool sortdes(const pair<int, int> &a, const pair<int, int> &b) {
return a.ss < b.ss;
}
bool sortasc(const pair<int, int> &a, const pair<int, int> &b) {
return a.ss > b.ss;
}
int gcd(int x, int y) { return __gcd(x, y); }
void test_case() {
int n;
string s;
cin >> n;
cin >> s;
if (n >= 3200) {
test(s);
} else {
test("red");
}
}
int main() {
fastio;
file();
int T = 1;
// int T;
// cin>>T;
for (int nr = 1; nr <= T; ++nr) {
// cout<<"Case #"<<nr<<": ";
test_case();
}
}
|
[
"expression.operation.binary.remove"
] | 732,981
| 732,982
|
u998008108
|
cpp
|
p02933
|
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#include <map> // map
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int main() {
int s;
string k, a;
cin >> s >> k;
a = s;
if (s < 3200) {
a = "red";
}
cout << a << endl;
}
|
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#include <map> // map
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int main() {
int s;
string k, a;
cin >> s >> k;
a = k;
if (s < 3200) {
a = "red";
}
cout << a << endl;
}
|
[
"assignment.value.change",
"identifier.change"
] | 732,987
| 732,988
|
u927801748
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << a << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"identifier.change",
"io.output.change"
] | 732,991
| 732,992
|
u150155436
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a >> str;
if (a > 3200)
cout << str;
else
cout << "red";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string str;
cin >> a >> str;
if (a >= 3200)
cout << str;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,993
| 732,994
|
u367131219
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[] | 732,995
| 732,996
|
u834753207
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red" << endl;
}
else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 733,003
| 733,004
|
u516876944
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define cs \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
cs int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s;
else
cout << "red";
}
|
#include <bits/stdc++.h>
#define cs \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
cs int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,012
| 733,013
|
u668974816
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N >= 3200)
cout << "red" << endl;
else
cout << R << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,040
| 733,041
|
u161593842
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N >> R;
if (N >= 3200)
cout << "red" << endl;
else
cout << R << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,042
| 733,041
|
u161593842
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N >> R;
if (N >= 3200)
cout << "Red" << endl;
else
cout << R << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string R;
cin >> N;
cin >> R;
if (N < 3200)
cout << "red" << endl;
else
cout << R << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,043
| 733,041
|
u161593842
|
cpp
|
p02933
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "reb\n";
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red\n";
}
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 733,044
| 733,045
|
u535565217
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << a << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"identifier.change",
"io.output.change"
] | 733,049
| 733,050
|
u842897677
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "res" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"literal.string.change",
"io.output.change"
] | 733,056
| 733,057
|
u471069244
|
cpp
|
p02933
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,060
| 733,061
|
u485925545
|
cpp
|
p02933
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 320)
cout << "red" << endl;
else
cout << s << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
[] | 733,062
| 733,061
|
u485925545
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a <= 3200)
cout << s;
else
cout << "red";
}
|
#include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,063
| 733,064
|
u272107664
|
cpp
|
p02933
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,079
| 733,080
|
u728095140
|
cpp
|
p02933
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << "Red" << endl;
} else {
cout << s << endl;
}
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,081
| 733,080
|
u728095140
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,084
| 733,085
|
u387371565
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"io.output.change"
] | 733,090
| 733,091
|
u525560003
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
int main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
ini(n);
ins(a);
if (n <= 3200) {
out(a);
} else {
out("red");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
int main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
ini(n);
ins(a);
if (n >= 3200) {
out(a);
} else {
out("red");
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,102
| 733,103
|
u203197031
|
cpp
|
p02933
|
#if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n < 3200)
puts("Red");
else
cout << s << '\n';
return 0;
}
|
#if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n < 3200)
puts("red");
else
cout << s << '\n';
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 733,106
| 733,107
|
u461913494
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
if (a >= 3200) {
string s;
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
if (a >= 3200) {
string s;
cin >> s;
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[] | 733,113
| 733,114
|
u037563046
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N <= 3200)
cout << "red" << endl;
else
cout << S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N < 3200)
cout << "red" << endl;
else
cout << S << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,120
| 733,121
|
u889173297
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N >= 3200)
cout << "red" << endl;
else
cout << S << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N < 3200)
cout << "red" << endl;
else
cout << S << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,122
| 733,121
|
u889173297
|
cpp
|
p02933
|
//
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// const ll INF = 1LL<<60;
// const int INF = 1<<29;
// const ll MOD = 1000000007;
// const double PI=3.1415926535897932;
//#define __DBG__
void solve(void) {
int a;
string S;
cin >> a >> S;
if (a >= 3200) {
cout << S << endl;
} else {
cout << "Red" << endl;
}
return;
}
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
//
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// const ll INF = 1LL<<60;
// const int INF = 1<<29;
// const ll MOD = 1000000007;
// const double PI=3.1415926535897932;
//#define __DBG__
void solve(void) {
int a;
string S;
cin >> a >> S;
if (a >= 3200) {
cout << S << endl;
} else {
cout << "red" << endl;
}
return;
}
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
[
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 733,123
| 733,124
|
u671267423
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? "red" : "pink") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
[
"io.output.change",
"literal.string.change"
] | 733,125
| 733,126
|
u717762991
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a < 3200 ? "red" : "pink") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < c; ++i)
int main() {
int a;
string s;
cin >> a;
cin >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 733,127
| 733,126
|
u717762991
|
cpp
|
p02933
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
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"
] | 733,130
| 733,131
|
u293523151
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << a << endl;
} else {
cout << "red" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"identifier.change",
"io.output.change"
] | 733,132
| 733,133
|
u068713120
|
cpp
|
p02933
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s;
} else {
cout << "red" << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red" << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,140
| 733,141
|
u633728454
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << s << '\n';
else
cout << "red\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << '\n';
else
cout << "red\n";
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,148
| 733,149
|
u338339091
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red";
} else {
cout << s;
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,150
| 733,151
|
u726771425
|
cpp
|
p02933
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red";
} else {
cout << s;
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red";
} else {
cout << s;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,152
| 733,151
|
u726771425
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
|
[
"control_flow.branch.else.add"
] | 733,167
| 733,168
|
u492707675
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s;
else
cout << "red";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,169
| 733,170
|
u607728868
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
|
[] | 733,171
| 733,172
|
u808743599
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll N;
cin >> N;
string s;
cin >> s;
if (N >= 3200)
print(s);
else
print('red');
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll N;
cin >> N;
string s;
cin >> s;
if (N >= 3200)
print(s);
else
print("red");
return 0;
}
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 733,178
| 733,179
|
u281168735
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
|
[
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 733,192
| 733,193
|
u271369517
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
getline(cin, s);
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"call.remove",
"call.arguments.change"
] | 733,199
| 733,200
|
u457196771
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
// const ll MOD=998244353;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const double pi = acos(-1);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, 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 >> s;
if (a <= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
// const ll MOD=998244353;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const double pi = acos(-1);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, 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 >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,215
| 733,216
|
u275786410
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) // 不小于 3200
{
cout << s << endl;
} else { // 小于 3200
cout << "red\n";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) // 不小于 3200
{
cout << s << endl;
} else { // 小于 3200
cout << "red\n";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,221
| 733,222
|
u440588451
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << s;
} else if (a < 3200) {
cout << "red";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s;
} else if (a <= 3200) {
cout << "red";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,223
| 733,224
|
u079905062
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int s;
string a;
cin >> s >> a;
if (s >= 3200)
cout << s << a << endl;
else
cout << "red" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int s;
string a;
cin >> s >> a;
if (s >= 3200) {
cout << a << endl;
} else
cout << "red" << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 733,226
| 733,227
|
u589238650
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,231
| 733,232
|
u047655753
|
cpp
|
p02933
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
else
cout << "red";
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,233
| 733,232
|
u047655753
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,234
| 733,235
|
u559578080
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << "red";
else
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 3200)
cout << "red";
else
cout << s;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,251
| 733,252
|
u491314298
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
else {
cout << "red" << endl;
}
return 0;
}
|
[] | 733,257
| 733,258
|
u550374978
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
}
|
[] | 733,259
| 733,260
|
u702701631
|
cpp
|
p02933
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << "red";
}
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200)
cout << s;
if (a < 3200)
cout << "red";
if (a == 3200)
cout << s;
}
|
[
"io.output.change"
] | 733,262
| 733,260
|
u702701631
|
cpp
|
p02933
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n > 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,273
| 733,274
|
u084466852
|
cpp
|
p02933
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n == 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,275
| 733,274
|
u084466852
|
cpp
|
p02933
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n <= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
signed main() {
tezz
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,276
| 733,274
|
u084466852
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N > 3199)
cout << "red" << endl;
else
cout << S << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N > 3199)
cout << S << endl;
else
cout << "red" << endl;
return 0;
}
|
[
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 733,283
| 733,284
|
u762476457
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
typedef unsigned int uint;
int main() {
int a;
string s;
std::cin >> a;
std::cin >> s;
if (a < 3200)
std::cout << s << std::endl;
else
std::cout << "red" << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() + (n)
#define VEC(type, name, n) \
std::vector<type> name(n); \
rep(i, n) std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define mp make_pair
#define sum accumulate
#define keta fixed << setprecision
#define vvector(name, typ, m, n, a) \
vector<vector<typ>> name(m, vector<typ>(n, a))
#define vvvector(name, t, l, m, n, a) \
vector<vector<vector<t>>> name(l, vector<vector<t>>(m, vector<t>(n, a)));
#define vvvvector(name, t, k, l, m, n, a) \
vector<vector<vector<vector<t>>>> name( \
k, vector<vector<vector<t>>>(l, vector<vector<t>>(m, vector<t>(n, a))));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
typedef unsigned int uint;
int main() {
int a;
string s;
std::cin >> a;
std::cin >> s;
if (a < 3200)
std::cout << "red" << std::endl;
else
std::cout << s << std::endl;
}
|
[
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 733,287
| 733,288
|
u539011156
|
cpp
|
p02933
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const int MOD = 1000000007;
int main() {
int a;
string s;
std::cin >> a >> s;
if (a <= 3200)
std::cout << "red" << std::endl;
else
std::cout << s << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const int MOD = 1000000007;
int main() {
int a;
string s;
std::cin >> a >> s;
if (a < 3200)
std::cout << "red" << std::endl;
else
std::cout << s << std::endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 733,290
| 733,291
|
u539011156
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.