problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02933 | #include <bits/stdc++.h>
using namespace std;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
... | #include <bits/stdc++.h>
using namespace std;
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define DFOR(a, b, c) for (register int a = b, _n = c; a > _n; --a)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,959 | 734,960 | u608862204 | cpp |
p02933 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll a;
cin >> a;
string s;
cin >> s;
if (a <= 320... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll a;
cin >> a;
string s;
cin >> s;
if (a < 3200... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,963 | 734,964 | u508700891 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,965 | 734,966 | u745250049 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,967 | 734,968 | u346214077 | cpp |
p02933 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd lower_bound
#define u... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<long long, long long>
#define vll vector<long long>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (long long)x.size()
#define hell 1000000007
#define lbnd lower_bound
#define u... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,969 | 734,970 | u006069211 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a < 3200)
cout << s << "\n";
else
cout << "red"
<< "\n";
} | #include <bits/stdc++.h>
using namespace std;
int a;
string s;
int main() {
cin >> a >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red"
<< "\n";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,971 | 734,972 | u257015873 | cpp |
p02933 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | [] | 735,027 | 735,033 | u375405838 | cpp |
p02933 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi ... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi ... | [
"io.output.change"
] | 735,037 | 735,039 | u853418842 | cpp |
p02933 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi ... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 735,041 | 735,039 | u853418842 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define mp make_pair
#define int ll
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int mod = ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define mp make_pair
#define int ll
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int mod = ... | [
"literal.string.change",
"io.output.change"
] | 735,043 | 735,046 | u840813237 | cpp |
p02933 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define inf 1e16
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a,... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define inf 1e16
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,052 | 735,054 | u742553775 | cpp |
p02933 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a <= 3200) {
cout << s << endl;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,055 | 735,057 | u416521732 | cpp |
p02933 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << s << endl;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
#define ll long long
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,058 | 735,057 | u416521732 | cpp |
p02933 | #define C
#ifdef C
#include <stdio.h>
#define abs(a) ((a) < 0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
#endif
#ifdef Cpp
#include <bits/stdc++.h>
using namespace std;
#endif
#define freopen(x) ... | #define C
#ifdef C
#include <stdio.h>
#define abs(a) ((a) < 0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
#endif
#ifdef Cpp
#include <bits/stdc++.h>
using namespace std;
#endif
#define freopen(x) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,059 | 735,061 | u013079371 | cpp |
p02933 | #define rep(i, m, n) for (int i = m; i < n; i++)
#define repM(i, m, n) for (int i = n - 1; i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
// typedef pair<int,int> pii; using namespace std;
// d = distance(lower_bound(all(x)), upper_bound(all(x)));
#include <algorithm>
#i... | #define rep(i, m, n) for (int i = m; i < n; i++)
#define repM(i, m, n) for (int i = n - 1; i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
// typedef pair<int,int> pii; using namespace std;
// d = distance(lower_bound(all(x)), upper_bound(all(x)));
#include <algorithm>
#i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,071 | 735,073 | u548163222 | cpp |
p02933 | #include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fr first
#define sc second
#define MP make_pair
... | #include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fr first
#define sc second
#define MP make_pair
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,082 | 735,084 | u379679295 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | [
"literal.string.change",
"io.output.change"
] | 735,089 | 735,092 | u415956569 | cpp |
p02933 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
int a;
string ch;
int main() {
scanf("%d", &a);
cin >> ch;
if (a == 3200)
cout << ch;
else
puts("red");
// system("pause");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
int a;
string ch;
int main() {
scanf("%d", &a);
cin >> ch;
if (a >= 3200)
cout << ch;
else
puts("red");
// system("pause");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,975 | 734,976 | u520815352 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | [] | 734,980 | 734,981 | u004424779 | cpp |
p02933 | #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a > 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| #include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,984 | 734,985 | u886790158 | cpp |
p02933 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 734,988 | 734,989 | u175295878 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,992 | 734,993 | u247347001 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ff first
#define ss second
#define MAXN 300005
#define INF 1000000001000000001LL
#define int long... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 734,994 | 734,993 | u247347001 | cpp |
p02933 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
#if _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
#if _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n ... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 734,998 | 734,999 | u196951291 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? ss : "red") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "red" : ss) << endl;
}
| [] | 735,001 | 735,002 | u168525123 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "pink" : "red") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
string ss;
cin >> ss;
cout << (h < 3200 ? "red" : ss) << endl;
}
| [] | 735,003 | 735,002 | u168525123 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << a << "\n";
} else {
cout << s << "\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << "\n";
} else {
cout << "red"
<< "\n";
}
} | [
"identifier.change",
"io.output.change"
] | 735,006 | 735,007 | u915622184 | cpp |
p02933 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
... | [] | 735,014 | 735,015 | u131340563 | cpp |
p02933 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
st... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
st... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,016 | 735,017 | u498834139 | cpp |
p02933 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
st... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
using namespace std;
int gcd(int a, int b) {
while (b > 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
int n;
cin >> n;
st... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,018 | 735,017 | u498834139 | cpp |
p02933 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,035 | 735,036 | u129763512 | cpp |
p02933 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
typedef long long LL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
string inputString(... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
typedef long long LL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, n)
using namespace std;
string inputString(... | [
"io.output.change"
] | 735,053 | 735,056 | u548094461 | cpp |
p02933 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now... | [
"identifier.change",
"io.output.change"
] | 735,060 | 735,062 | u862720966 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
char str[5006];
int main() {
int n;
scanf("%d", &n);
scanf("%s", str + 1);
if (n > 3200)
puts("red");
else
cout << str + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char str[5006];
int main() {
int n;
scanf("%d", &n);
scanf("%s", str + 1);
if (n < 3200)
puts("red");
else
cout << str + 1;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,064 | 735,066 | u765391939 | cpp |
p02933 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,080 | 735,083 | u526630579 | cpp |
p02933 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
... | [] | 735,093 | 735,094 | u050445028 | cpp |
p02933 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
}... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD=998244353;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,097 | 735,098 | u942774736 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 735,099 | 735,100 | u034810328 | cpp |
p02933 | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 735,101 | 735,102 | u993640894 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 32000) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,105 | 735,106 | u182800367 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 32000) {
cout << s << endl;
} else {
cout << "red";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 735,107 | 735,106 | u182800367 | cpp |
p02933 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a;
char s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int a;
char s[10];
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
}
if (a < 3200) {
cout << "red" << endl;
}
return 0;
} | [] | 735,108 | 735,109 | u817014213 | cpp |
p02933 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << 'red' << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 735,124 | 735,125 | u085481334 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a;
string res;
cin >> a >> res;
if (a >= 3200)
cout << a << endl;
else
cout << "red\n";
} | #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a;
string res;
cin >> a >> res;
if (a >= 3200)
cout << res << endl;
else
cout << "red\n";
} | [
"identifier.change",
"io.output.change"
] | 735,130 | 735,131 | u440249591 | cpp |
p02933 | #include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s);
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s + 1);
return 0;
}
| [
"expression.operation.binary.add"
] | 735,135 | 735,136 | u595557971 | cpp |
p02933 | #include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a >= 3200)
puts("red");
else
puts(s);
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
char s[100];
int a;
int main() {
scanf(" %d %s ", &a, s + 1);
if (a < 3200)
puts("red");
else
puts(s + 1);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,137 | 735,136 | u595557971 | cpp |
p02933 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,138 | 735,139 | u654240084 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n >= 3200)
cout << s << endl;
else
cout << "red" << endl;
return 0;
}
| [] | 735,142 | 735,143 | u018434698 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a > 3200) {
cout << "red"
<< "\n";
} else
cout << s << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red"
<< "\n";
} else
cout << s << "\n";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,144 | 735,145 | u527398664 | cpp |
p02933 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [] | 735,150 | 735,151 | u918357423 | cpp |
p02933 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
s = 'red';
}
cout << s << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
s = "red";
}
cout << s << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 735,152 | 735,153 | u539914590 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a, s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
char s[10];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 735,154 | 735,155 | u195094157 | cpp |
p02933 | #include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o... | #include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 735,160 | 735,161 | u893330446 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
if (n < 3200)
cout << "red";
else
cout << s;
} | #include <iostream>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
if (n < 3200)
cout << "red";
else
cout << s;
}
| [
"expression.operation.binary.remove"
] | 735,164 | 735,165 | u910994303 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lld long long int
#define ull unsigned long long int
ull power(ull x, ull y) {
ull temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ull gcdFactor(ull n) {
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lld long long int
#define ull unsigned long long int
ull power(ull x, ull y) {
ull temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ull gcdFactor(ull n) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,168 | 735,169 | u951746552 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 735,172 | 735,173 | u986399983 | cpp |
p02933 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(INF)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,178 | 735,179 | u055148700 | cpp |
p02933 | // Littleboy123 Template 1.1
#include <bits/stdc++.h>
using namespace std;
// pragmas
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
*/... | // Littleboy123 Template 1.1
#include <bits/stdc++.h>
using namespace std;
// pragmas
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
*/... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,180 | 735,181 | u398659810 | cpp |
p02933 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,192 | 735,193 | u302539304 | cpp |
p02933 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef long long ll;
i... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef long long ll;
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,197 | 735,198 | u744305661 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (en... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (en... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,201 | 735,202 | u278557567 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int N;
cin >> N;
string S;
cin >> S;
if (S.size() < 3200) {
cout << "red";
} else {
cout << S;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef EVAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int N;
cin >> N;
string S;
cin >> S;
if (N < 3200) {
cout << "red";
} else {
cout << S;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.remove"
] | 735,205 | 735,206 | u444804755 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n;
string st;
cin >> n >> st;
if (n < 3200)
cout << "Red";
else
cout << st;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n;
string st;
cin >> n >> st;
if (n < 3200)
cout << "red";
else
cout << st;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 735,207 | 735,208 | u791542693 | cpp |
p02933 | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | [
"expression.operation.binary.add"
] | 735,213 | 735,214 | u091650402 | cpp |
p02929 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
long divd = 1000000007;
int d[N];
d[0] = 1;
int ln = 1;
for (int i = 1; i < 2 * N; i++) { // at d, pos means L , -1 means R
if (S[i] != S[i - 1]) {
if (d[i - 1] > 0) {
ln++;... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
long divd = 1000000007;
int d[2 * N];
d[0] = 1;
int ln = 1;
for (int i = 1; i < 2 * N; i++) {
if (S[i] != S[i - 1]) {
if (d[i - 1] > 0) {
ln++;
d[i] = ln;
} el... | [
"control_flow.branch.if.condition.change"
] | 735,234 | 735,235 | u552137999 | cpp |
p02929 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int,... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 735,264 | 735,265 | u652150585 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,267 | 735,268 | u106297876 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
long long int mod = 1e9 + 7;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
} else {
long long int l = 1, r = 0; //
long long int sum = 1;
char a = 'L';
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
long long int mod = 1e9 + 7;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
} else {
long long int l = 1, r = 0; //
long long int sum = 1;
char a = 'L';
for (int i =... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 735,269 | 735,270 | u422506696 | cpp |
p02929 | #include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1, tmp;
string lr;
string s;
cin >> n >> s;
ll lsum[n * 2], rsum[2 * n];
fill(lsum, lsum + 2 * n, 0);
fill(rsum, rsum + 2 * n, 0);
if (s[0] == 'W' || s[2 * n - 1] == 'W') {
cout << "0\n";
... | #include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1, tmp;
string lr;
string s;
cin >> n >> s;
ll lsum[n * 2], rsum[2 * n];
fill(lsum, lsum + 2 * n, 0);
fill(rsum, rsum + 2 * n, 0);
if (s[0] == 'W' || s[2 * n - 1] == 'W') {
cout << "0\n";
... | [
"expression.operation.binary.remove"
] | 735,304 | 735,305 | u352248517 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll modpow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll modpow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"control_flow.branch.if.condition.change"
] | 735,314 | 735,315 | u553623615 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
string ss;
rep(i, 2 * n) {
if ((t + (s[i] == 'B' ? 1 : 0)) % 2 == 1) {
ss.push_back('r');
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
string ss;
rep(i, 2 * n) {
if ((t + (s[i] == 'B' ? 1 : 0)) % 2 == 1) {
ss.push_back('r');
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 735,320 | 735,319 | u321761416 | cpp |
p02929 | #include <iostream>
#include <string.h>
using namespace std;
#define MOD 1000000007
main() {
int n;
int a[200010];
bool b;
long long ans, k, l;
string s;
cin >> n >> s;
k = 0;
b = false;
for (int i = 0; i < n * 2; i++) {
if (s[i] == 'B') {
b = true;
if (k % 2 == 0) {
a[i] = ... | #include <iostream>
#include <string.h>
using namespace std;
#define MOD 1000000007
main() {
int n;
int a[200010];
bool b;
long long ans, k, l;
string s;
cin >> n >> s;
k = 0;
b = false;
for (int i = 0; i < n * 2; i++) {
if (s[i] == 'B') {
b = true;
if (k % 2 == 0) {
a[i] = ... | [
"assignment.change",
"assignment.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 735,321 | 735,322 | u771099984 | cpp |
p02929 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
u... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
u... | [
"literal.number.change",
"variable_declaration.value.change"
] | 735,336 | 735,337 | u055148700 | cpp |
p02929 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 5100
#define rep(i, n) for (ll i = 0; i <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 5100
#define rep(i, n) for (ll i = 0; i <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.return.add"
] | 735,346 | 735,347 | u242679311 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
}
if (a >= 3200) {
cout << "red" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
}
if (a >= 3200) {
cout << s << endl;
}
} | [
"io.output.change"
] | 735,359 | 735,360 | u173178820 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "s" << endl;
}
if (a >= 3200) {
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << "red" << endl;
}
if (a >= 3200) {
cout << s << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 735,361 | 735,360 | u173178820 | cpp |
p02933 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
char s[100];
cin >> n;
cin >> s;
if (n >= 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
char s[100];
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,364 | 735,365 | u409617391 | cpp |
p02933 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
string s;
cin >> a >> s;
// cout<<"a="<<a<<",s="<<s<<endl;
if (a >= 3200) {
cout << s << endl;
} else {
cout << a << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
string s;
cin >> a >> s;
// cout<<"a="<<a<<",s="<<s<<endl;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| [
"io.output.change"
] | 735,373 | 735,374 | u074351677 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a < 3200) {
cout << 'red';
return 0;
}
string s;
cin >> s;
cout << s;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a < 3200) {
cout << "red";
return 0;
}
string s;
cin >> s;
cout << s;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 735,379 | 735,380 | u780842141 | cpp |
p02933 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a;
string str;
cin >> a;
cin >> str;
if (a == 3200) {
cout << str << endl;
} else
cout << "red" << endl;
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a;
string str;
cin >> a;
cin >> str;
if (a >= 3200) {
cout << str << endl;
} else
cout << "red" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,381 | 735,382 | u848361297 | cpp |
p02933 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 735,402 | 735,403 | u757738907 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
cin >> s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
} | [] | 735,404 | 735,405 | u533620702 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
if (T <= 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
string s;
cin >> s;
if (T < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,406 | 735,405 | u533620702 | cpp |
p02933 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n > 3200)
cout << "red" << endl;
else
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
if (n < 3200)
cout << "red" << endl;
else
cout << s << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,409 | 735,410 | u744950774 | cpp |
p02933 | #include <bits/stdc++.h>
constexpr long long INFL = 1LL << 60;
constexpr int INF = 1 << 30;
using namespace std;
using ll = long long;
using P = tuple<int, int>;
using iarr = valarray<int>;
int main() {
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << s << endl;
else
cout << "red" << endl;
... | #include <bits/stdc++.h>
constexpr long long INFL = 1LL << 60;
constexpr int INF = 1 << 30;
using namespace std;
using ll = long long;
using P = tuple<int, int>;
using iarr = valarray<int>;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,421 | 735,422 | u784751818 | cpp |
p02933 | #include <stdio.h>
int main() {
int a;
char s[10];
scanf("%d", &a);
scanf("%s", s);
if (a < 3200) {
printf("%s", s);
} else {
printf("%d", a);
}
return 0;
} | #include <stdio.h>
int main() {
int a;
char s[10];
scanf("%d", &a);
scanf("%s", s);
if (a < 3200) {
printf("red");
} else {
printf("%s", s);
}
return 0;
} | [
"call.add",
"control_flow.branch.else.add",
"call.remove"
] | 735,423 | 735,424 | u592268075 | cpp |
p02933 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb p... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,431 | 735,432 | u816958587 | cpp |
p02933 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define pb p... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,433 | 735,432 | u816958587 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a <= 3200)
cout << "red" << endl;
else
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,434 | 735,435 | u805131136 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << "red" << endl;
else
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,436 | 735,435 | u805131136 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,442 | 735,443 | u048128931 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
main() {
int a;
int s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
}
| [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,444 | 735,443 | u048128931 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a < 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else {
cout << "red" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,445 | 735,446 | u904123392 | cpp |
p02933 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
long long int a;
cin >> a;
cin >> S;
if (a >= 3200) {
cout << "red" << endl;
} else {
cout << S << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
long long int a;
cin >> a;
cin >> S;
if (a >= 3200) {
cout << S << endl;
} else {
cout << "red" << endl;
}
}
| [
"control_flow.branch.else.add"
] | 735,449 | 735,450 | u443479321 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n <= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n >= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,457 | 735,458 | u208664517 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n <= 3200)
cout << "pink" << endl;
else
cout << "red" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss;
cin >> ss;
if (n >= 3200)
cout << ss << endl;
else
cout << "red" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 735,459 | 735,458 | u208664517 | cpp |
p02933 | #include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n <= 3200)
cout << s;
else
cout << "red";
return 0;
} | #include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n >= 3200)
cout << s;
else
cout << "red";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,460 | 735,461 | u819553900 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << "s" << endl;
} else if (a < 3200) {
cout << "red" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200) {
cout << s << endl;
} else if (a < 3200) {
cout << "red" << endl;
}
} | [] | 735,468 | 735,469 | u572559885 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
typedef pair<int, int> p;
int jyo(int x, int y) { // xのｙ乗
int ans = 1;
for (int i = 0; i < y; i++) {
ans *= x;
}
return ans;
}
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
typedef pair<int, int> p;
int jyo(int x, int y) { // xのｙ乗
int ans = 1;
for (int i = 0; i < y; i++) {
ans *= x;
}
return ans;
}
int main() {
int a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s;
... | [
"literal.string.change",
"io.output.change"
] | 735,475 | 735,476 | u029166898 | cpp |
p02933 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a > 3200) {
cout << s;
} else
cout << "red";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else
cout << "red";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 735,477 | 735,478 | u674491576 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.