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 |
|---|---|---|---|---|---|---|---|
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
if (b == c) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,698 | 895,699 | u288905450 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,710 | 895,711 | u396284099 | cpp |
p03079 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,712 | 895,713 | u342129174 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c && b == c && c == a) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && a == c && b == c && c == a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,718 | 895,719 | u466983830 | cpp |
p03079 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("Yes\n");
printf("No\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
if (a == b && b == c)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 895,720 | 895,721 | u574811687 | cpp |
p03080 | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ve... | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ve... | [
"assignment.add"
] | 895,734 | 895,735 | u521389909 | cpp |
p03080 | #include <iostream>
using namespace std;
int main(void) {
int n, r, b;
r = 0;
b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
r += (s[i] == 'R');
b += (s[i] == 'B');
}
if (r > b) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, r, b;
r = 0;
b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
r += (s[i] == 'R');
b += (s[i] == 'B');
}
if (r > b) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,738 | 895,739 | u520276780 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = a; i <= (b); ++i)
#define rep3(i, a, b) for (int i = a; i >= (b); --i)
#define all(cont) cont.begin(), cont.end()
#... | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = a; i <= (b); ++i)
#define rep3(i, a, b) for (int i = a; i >= (b); --i)
#define all(cont) cont.begin(), cont.end()
#... | [
"variable_declaration.value.change"
] | 895,740 | 895,741 | u502312544 | cpp |
p03080 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | [] | 895,742 | 895,743 | u683769494 | cpp |
p03080 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"control_flow.branch.if.condition.change"
] | 895,744 | 895,745 | u882039496 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] = 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] == 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,750 | 895,751 | u830745382 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s.at(k) = 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int i = 0;
for (int k = 0; k < N; ++k) {
if (s[k] == 'R')
++i;
else
--i;
}
if (i > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 895,752 | 895,751 | u830745382 | cpp |
p03080 | #include <cstdio>
char s[101];
int main() {
int n;
scanf("%d", &n);
int cntR = 0;
for (int i = 1; i <= n; i++)
cntR += (s[i] == 'R');
if (cntR > n - cntR)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include <cstdio>
char s[101];
int main() {
int n;
scanf("%d%s", &n, s + 1);
int cntR = 0;
for (int i = 1; i <= n; i++)
cntR += (s[i] == 'R');
if (cntR > n - cntR)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"call.arguments.add"
] | 895,757 | 895,758 | u602509796 | cpp |
p03080 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll r = 0;
ll b = 0;
rep(i, n) {
if (s.at(i) = 'R')
r++;
else
... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll r = 0;
ll b = 0;
rep(i, n) {
if (s.at(i) == 'R')
r++;
else
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,780 | 895,781 | u449123607 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 895,784 | 895,785 | u743889070 | cpp |
p03080 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [] | 895,786 | 895,787 | u614128939 | cpp |
p03080 | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 895,788 | 895,789 | u550014122 | cpp |
p03080 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,790 | 895,791 | u294700660 | cpp |
p03080 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi 3.1415926535
#define INF 0x3f3f3f3f
using namespace std;
typedef long lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi 3.1415926535
#define INF 0x3f3f3f3f
using namespace std;
typedef long lo... | [] | 895,805 | 895,806 | u167906550 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
string S;
cin >> S;
int R = 0, B = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
R++;
if (S.at(i) == 'B')
B++;
}
cout << (R > B ? "YES" :... | #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
string S;
cin >> S;
int R = 0, B = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
R++;
if (S.at(i) == 'B')
B++;
}
cout << (R > B ? "Yes" :... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,811 | 895,812 | u845937249 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 895,813 | 895,814 | u393754572 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
int size, num = 0;
cin >> size >> s;
for (int i = 0; i < size; i++) {
if (s[i] = 'R')
++num;
}
if (num > (size - num))
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
int size, num = 0;
cin >> size >> s;
for (int i = 0; i < size; i++) {
if (s[i] == 'R')
++num;
}
if (num > (size - num))
cout << "Yes";
else
cout << "No";
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 895,827 | 895,828 | u512624048 | cpp |
p03080 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,831 | 895,832 | u969116807 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"call.add"
] | 895,835 | 895,836 | u322177979 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i+... | [] | 895,840 | 895,841 | u062908837 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (b > r) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
if (b >= r) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,846 | 895,847 | u079553980 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int red = std::count(s.begin(), s.end(), 'R');
int blue = red - s.length();
if (red > blue) {
std... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int red = std::count(s.begin(), s.end(), 'R');
int blue = s.length() - red;
if (red > blue) {
std... | [
"expression.operation.binary.remove"
] | 895,852 | 895,853 | u914739916 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
count++;
else
count--;
}
cout << (count > 0 ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R')
count++;
else
count--;
}
cout << (count > 0 ? "Yes" : "No") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 895,868 | 895,869 | u849739818 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(), v.end(), greater<>())
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) (v).beg... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPL(i, a, n) for (ll i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(), v.end(), greater<>())
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) (v).beg... | [
"expression.operation.binary.add"
] | 895,879 | 895,880 | u635484372 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
int r, b;
int n;
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
int r = 0, b = 0;
int n;
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
retur... | [
"variable_declaration.value.change"
] | 895,885 | 895,886 | u187711881 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int r_total = 0, b_total = 0;
for (int i = 1; i <= a; i++) {
char s;
cin >> s;
if (s == 'B')
b_total++;
else if (s == 'R')
r_total++;
}
if (b_total > r_total)
cout << "Yes" << endl;
else
cout << "No"... | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int r_total = 0, b_total = 0;
for (int i = 1; i <= a; i++) {
char s;
cin >> s;
if (s == 'B')
b_total++;
else if (s == 'R')
r_total++;
}
if (b_total < r_total)
cout << "Yes" << endl;
else
cout << "No"... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,892 | 895,893 | u952557476 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r, b;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int r = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
cout << (r > b ? "Yes" : "No") << endl;
} | [
"variable_declaration.value.change"
] | 895,906 | 895,907 | u798086274 | cpp |
p03080 | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ ... | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ ... | [
"variable_declaration.add"
] | 895,914 | 895,915 | u682090147 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string Answer = "No";
int N, Red = 0;
char input;
scanf("%d", &N);
for (int i = 0; i <= N; i++) {
if ((input = getchar()) == 'R')
Red++;
}
if (2 * Red - N)
Answer = "Yes";
cout << Answer;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string Answer = "No";
int N, Red = 0;
char input;
scanf("%d", &N);
for (int i = 0; i <= N; i++) {
if ((input = getchar()) == 'R')
Red++;
}
if (2 * Red - N > 0)
Answer = "Yes";
cout << Answer;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 895,916 | 895,917 | u038569501 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
int main() {
string s;
cin >> s;
int r = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (b < r)
cout << "Yes" << endl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
int main() {
string s;
int n;
cin >> n >> s;
int r = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (b < r)
cout <... | [
"variable_declaration.add"
] | 895,918 | 895,919 | u452544900 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
/* int N = 4;
string s = "BRBR";
*/
int N;
string s;
cin >> N >> s;
int cnt_R = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'L') {
cnt_R++;
}
}
int cnt_B = s.size() - cnt_R;
if (cnt_R > cnt_B) {
cout << "Yes... | #include <iostream>
using namespace std;
int main() {
/* int N = 4;
string s = "RRBR";
*/
int N;
string s;
cin >> N >> s;
int cnt_R = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
cnt_R++;
}
}
int cnt_B = s.size() - cnt_R;
if (cnt_R > cnt_B) {
cout << "Yes... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 895,924 | 895,925 | u915355756 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int cR = 0;
int cB = 0;
string s;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> s;
if (s == "R") {
++cR;
} else if (s == "B") {
++cB;
}
}
if (cR > cB) {
cout << "Yes" << endl;
} else {
cout << "No" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int cR = 0;
int cB = 0;
char s;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> s;
if (s == 'R') {
++cR;
} else if (s == 'B') {
++cB;
}
}
if (cR > cB) {
cout << "Yes" << endl;
} else {
cout << "No" <<... | [
"variable_declaration.type.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 895,926 | 895,927 | u348914050 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
int R = 0;
for (int i = 0; i < a; i++) {
if (b[0] == 'R') {
R++;
}
}
if (2 * R > a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string b;
cin >> a >> b;
int R = 0;
for (int i = 0; i < a; i++) {
if (b[i] == 'R') {
R++;
}
}
if (2 * R > a) {
cout << "Yes" << endl;
} else {
cout << "No" << endl... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 895,928 | 895,929 | u208430248 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | [
"variable_declaration.specifier.add"
] | 895,952 | 895,953 | u943004959 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i < n; ++i)
#define fore(i, a) for (auto &i : a)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define stl_rep(itr, x) for (auto it... | [
"variable_declaration.value.change"
] | 895,952 | 895,954 | u943004959 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int N;
int red = 0, blue = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red += 1;
} else {
blue += 1;
};
};
if (red > blue) {
cout << "Yes";
} else {
cout << "No";
};
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int red = 0, blue = 0;
string S;
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
red += 1;
} else {
blue += 1;
};
};
if (red > blue) {
cout << "Yes";
} else {
cout << "No";
};
return ... | [] | 895,955 | 895,956 | u404459933 | cpp |
p03080 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [] | 895,957 | 895,958 | u013803727 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt, N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt = 0;
int N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"variable_declaration.add"
] | 895,961 | 895,962 | u929996201 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt, N;
string s;
cin >> N >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int Rcnt = 0;
int N;
string s;
cin >> N;
cin >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'R')
++Rcnt;
}
if (Rcnt > N - Rcnt)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
return 0;
} | [
"variable_declaration.add"
] | 895,963 | 895,962 | u929996201 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 895,965 | 895,966 | u108304786 | cpp |
p03080 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 895,967 | 895,968 | u318334550 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, R = 0, B = 0;
string S, answer;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(1) == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
answer = "Yes";
} else {
answer = "No";
}
cout << an... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, R = 0, B = 0;
string S, answer;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'R') {
R++;
} else {
B++;
}
}
if (R > B) {
answer = "Yes";
} else {
answer = "No";
}
cout << an... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 895,969 | 895,970 | u514653860 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
string s;
int a, b;
int main() {
cin >> s;
for (char c : s) {
if (c == 'R')
a++;
else
b++;
}
printf("%s\n", a > b ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int a, b, n;
int main() {
cin >> n >> s;
for (char c : s) {
if (c == 'R')
a++;
else
b++;
}
printf("%s\n", a > b ? "Yes" : "No");
return 0;
} | [
"variable_declaration.add"
] | 895,976 | 895,977 | u184802358 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r, b;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r = 0, b = 0;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,985 | 895,986 | u528256243 | cpp |
p03080 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r, b;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, r = 0, b = 0;
cin >> N;
char s[N];
cin >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 895,989 | 895,986 | u528256243 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int num1 = 0, num2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
num1++;
if (s[i] == 'B')
num2++;
}
if (num1 >= num2)
cout << "Yes" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int num1 = 0, num2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
num1++;
if (s[i] == 'B')
num2++;
}
if (num1 > num2)
cout << "Yes" << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 895,994 | 895,995 | u815448579 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, coun = 0, c = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
coun++;
} else if (s[i] == 'B') {
c++;
}
if (coun > c) {
cout << "Yes" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, coun = 0, c = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
coun++;
} else if (s[i] == 'B') {
c++;
}
}
if (coun > c) {
cout << "Yes" << endl;
} else {
... | [
"variable_declaration.type.change"
] | 896,005 | 896,006 | u333683836 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'R') {
++red;
} else {
++blue;
}
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "NO" <<... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'R') {
++red;
} else {
++blue;
}
}
if (red > blue)
cout << "Yes" << endl;
else
cout << "No" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,007 | 896,008 | u068896454 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int b = 0, r = 0;
for (auto c : s)
r += (c == 'R'), b = (c == 'B');
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int b = 0, r = 0;
for (auto c : s)
r += (c == 'R'), b += (c == 'B');
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| [
"assignment.value.change"
] | 896,009 | 896,010 | u386842336 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | [
"expression.operation.binary.add"
] | 896,011 | 896,012 | u742529680 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r, b;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
cout << (r > b ? "Yes" : "No") << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r = 0, b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
r++;
} else {
b++;
}
}
cout << (r > b ? "Yes" : "No") << '\n';
return 0;
} | [
"variable_declaration.value.change"
] | 896,018 | 896,019 | u580075993 | cpp |
p03080 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
for (char c : s)
if (c == 'R')
r++;
else
b++;
cout << (r > b ? "Yes" : "no") << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = 0, b = 0;
for (char c : s)
if (c == 'R')
r++;
else
b++;
cout << (r > b ? "Yes" : "No") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,029 | 896,030 | u374416262 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int len = str.length();
int r = 0, b = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes\n";
else
cout << "no\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int len = str.length();
int r = 0, b = 0;
for (int i = 0; i < len; i++) {
if (str[i] == 'R')
r++;
else
b++;
}
if (r > b)
cout << "Yes\n";
else
cout << "No\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,031 | 896,032 | u047442155 | cpp |
p03080 | #include <stdio.h>
int main() {
int n, a = 0, b = 0;
char m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%c", &m);
if (m == 'R') {
a++;
} else {
b++;
}
}
if (a > b) {
printf("Yes");
} else {
printf("No");
}
} | #include <stdio.h>
int main() {
int n, a = 0, b = 0;
char m;
scanf("%d", &n);
getchar();
for (int i = 0; i < n; i++) {
scanf("%c", &m);
if (m == 'R') {
a++;
} else {
b++;
}
}
if (a > b) {
printf("Yes");
} else {
printf("No");
}
} | [
"call.add"
] | 896,033 | 896,034 | u439952269 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int redsum = 0;
for (int i = 0; i < n; i++) {
if ('R' == s[i])
++redsum;
}
if (redsum > (n - 1) / 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int redsum = 0;
for (int i = 0; i < n; i++) {
if ('R' == s[i])
++redsum;
}
if (redsum > n - redsum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 896,043 | 896,044 | u465516065 | cpp |
p03080 | #include <iostream>
int main() {
int n;
std::cin >> n;
int x = 0;
for (int i = 0; i < n; ++i) {
char c;
std::cin >> c;
if (c == 'R')
++c;
else
--c;
}
if (x > 0)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
int x = 0;
for (int i = 0; i < n; ++i) {
char c;
std::cin >> c;
if (c == 'R')
++x;
else
--x;
}
if (x > 0)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
}
| [
"identifier.change"
] | 896,067 | 896,068 | u492926158 | cpp |
p03080 | #include <algorithm>
#include <chrono>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
int main() {
int N;
char s;
int red = 0;
rep(i, N) {
cin... | #include <algorithm>
#include <chrono>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define INF 100000000
#define uint unsigned int
#define MOD 1e9 + 7
using namespace std;
int main() {
int N;
cin >> N;
char s;
int red = 0;
rep(i, ... | [] | 896,071 | 896,072 | u668785999 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
string S;
cin >> N;
cin >> S;
ll r = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == 'R')
r++;
}
if (r < N - r)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
string S;
cin >> N;
cin >> S;
ll r = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == 'R')
r++;
}
if (r <= N - r)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,073 | 896,074 | u084968244 | cpp |
p03080 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef v... | [
"variable_declaration.value.change"
] | 896,097 | 896,098 | u369883202 | cpp |
p03080 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, n, m) for (int i = n; i < int(m); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef v... | [
"variable_declaration.value.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 896,099 | 896,098 | u369883202 | cpp |
p03080 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
int b = 0;
int c = 0;
int N = s.size();
for (int i = 0; i < N; i++) {
if (s.at(i) == 'R') {
b++;
} else {
c++;
}
}
if (b > c) {
cout << "Yes" << endl;
} else {
cou... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a;
cin >> a;
string s;
cin >> s;
int b = 0;
int c = 0;
int N = s.size();
for (int i = 0; i < N; i++) {
if (s.at(i) == 'R') {
b++;
} else {
c++;
}
}
if (b > c) {
cout << "Yes" << endl;
} el... | [] | 896,103 | 896,104 | u870797515 | cpp |
p03080 |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#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)... |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#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)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,105 | 896,106 | u114047445 | cpp |
p03080 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
string S;
int main() {
cin >> S;
int r = 0, b = 0;
for (auto s ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
string S;
int main() {
int n;
cin >> n >> S;
int r = 0, b = 0;
... | [
"variable_declaration.add"
] | 896,107 | 896,108 | u114234520 | cpp |
p03080 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,109 | 896,110 | u559645647 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
int main() {
string a;
int n;
cin >> n;
cin >> a;
int r, g;
for (auto i : a) {
if (i == 'R')
++r;
else
++g;
}
if (r > g)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
int main() {
string a;
int n;
cin >> n;
cin >> a;
int r = 0, g = 0;
for (auto i : a) {
if (i == 'R')
++r;
else
++g;
}
if (r > g)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 896,111 | 896,112 | u758675363 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef vector<int> VI;
typedef pair<int, int> PII;
//--------
int N;
signed main() {
cin >> N;
string s;
cin >> s;
int r, b;
REP(i, N) {
if (s[i] == 'R') {
r++;
} els... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef vector<int> VI;
typedef pair<int, int> PII;
//--------
int N;
signed main() {
cin >> N;
string s;
cin >> s;
int r = 0, b = 0;
REP(i, N) {
if (s[i] == 'R') {
r++;
... | [
"variable_declaration.value.change"
] | 896,136 | 896,137 | u465379376 | cpp |
p03080 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 896,138 | 896,139 | u063043074 | cpp |
p03080 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,142 | 896,143 | u746560455 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF =... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,144 | 896,145 | u913836622 | cpp |
p03080 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
string S;
int main() {
int N, r, ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
string S;
int main() {
int N, r =... | [
"variable_declaration.value.change"
] | 896,150 | 896,151 | u146532488 | cpp |
p03080 | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#defin... | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#defin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 896,160 | 896,161 | u070528238 | cpp |
p03080 | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | [
"variable_declaration.value.change"
] | 896,162 | 896,163 | u030685402 | cpp |
p03080 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"literal.string.change",
"io.output.change"
] | 896,166 | 896,167 | u076865901 | cpp |
p03080 | using ll = long long;
using ull = unsigned long long;
#include <limits>
namespace pcl {
template <typename T> constexpr T TNF = std::numeric_limits<T>::max() / 2;
constexpr int INF = TNF<int>;
constexpr ll LNF = TNF<ll>;
constexpr double DNF = TNF<double>;
constexpr double EPS = 1e-8;
constexpr int P7 = 1'000'000'007;
... | using ll = long long;
using ull = unsigned long long;
#include <limits>
namespace pcl {
template <typename T> constexpr T TNF = std::numeric_limits<T>::max() / 2;
constexpr int INF = TNF<int>;
constexpr ll LNF = TNF<ll>;
constexpr double DNF = TNF<double>;
constexpr double EPS = 1e-8;
constexpr int P7 = 1'000'000'007;
... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 896,170 | 896,171 | u747446319 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
class Solution {
string s;
public:
void run() {
cin >> s;
cin >> s;
cout << (count(s.begin(), s.end(), 'R') > count(s.begin(), s.end(), 'B')
? "YES"
: "NO")
<< '\n';
}
};
int main() {
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
using namespace std;
class Solution {
string s;
public:
void run() {
cin >> s;
cin >> s;
cout << (count(s.begin(), s.end(), 'R') > count(s.begin(), s.end(), 'B')
? "Yes"
: "No")
<< '\n';
}
};
int main() {
ios_base::sync_with_stdio... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,172 | 896,173 | u459737327 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0, d = 0;
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'R')
c++;
else
d++;
}
if (c > d) {
cout << "Yes\n";
} else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0, d = 0;
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'R')
c++;
else
d++;
}
if (c > d) {
cout << "Yes\n";
} else
cout << "No\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,176 | 896,177 | u859075846 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,179 | 896,180 | u396284099 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struc... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struc... | [] | 896,181 | 896,182 | u539402331 | cpp |
p03080 | #include <bits/stdc++.h>
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define PB push_back
const int MAX = 505;
using namespace std;
int main() {
int N;
cin >> N;
int r = 0, b = 0;
while (N--) {
char c;
cin >> c;
r += c == 'R';
b += c != 'R';
}
cout << ((r > b) ? "YES" : ... | #include <bits/stdc++.h>
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define PB push_back
const int MAX = 505;
using namespace std;
int main() {
int N;
cin >> N;
int r = 0, b = 0;
while (N--) {
char c;
cin >> c;
r += c == 'R';
b += c != 'R';
}
cout << ((r > b) ? "Yes" : ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,183 | 896,184 | u804093140 | cpp |
p03081 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, ll>> a(q);
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pair<char, ll>> a(q);
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 896,185 | 896,186 | u567906952 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 896,199 | 896,200 | u424374375 | cpp |
p03081 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
int t1 = -1;
int f1 = N;
while (f1 - t1 > 1) {
int mid = (t1 + f1) / 2;
int... | [
"identifier.change",
"control_flow.loop.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 896,201 | 896,200 | u424374375 | cpp |
p03081 | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include... | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include... | [
"control_flow.return.add",
"control_flow.return.0.add",
"io.output.change"
] | 896,216 | 896,215 | u811004127 | cpp |
p03081 | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | [
"assignment.add"
] | 896,217 | 896,218 | u347057617 | cpp |
p03081 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<int, PP> PPP;
struct edge {
int to;
int to2;
int cost;
};
string qt, ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<int, PP> PPP;
struct edge {
int to;
int to2;
int cost;
};
string qt, ... | [
"identifier.change",
"io.output.change"
] | 896,219 | 896,220 | u722628899 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<char, char>;
void leave(string message) {
cout << message << endl;
exit(0);
}
int main() {
lint n, q;
string s;
cin >> n >> q >> s;
vector<P> td(q);
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].secon... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<char, char>;
void leave(string message) {
cout << message << endl;
exit(0);
}
int main() {
lint n, q;
string s;
cin >> n >> q >> s;
vector<P> td(q);
for (int i = 0; i < q; i++)
cin >> td[i].first >> td[i].secon... | [
"call.arguments.change"
] | 896,223 | 896,224 | u194268736 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = 0, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = -1, right = N;
while (right - left > 1) {
int mid = (right + left) / 2, mid1 = mid;
for (int i = 0; i ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,225 | 896,226 | u265359795 | cpp |
p03081 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = 0, right = N, ans = N;
while (right - left > 1) {
int mid = (right + left) / 2,... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
for (int i = 0; i < Q; i++)
cin >> t[i] >> d[i];
int left = -1, right = N, ans = N;
while (right - left > 1) {
int mid = (right + left) / 2... | [
"literal.number.change",
"variable_declaration.value.change"
] | 896,227 | 896,228 | u265359795 | cpp |
p03081 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#in... | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#in... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 896,231 | 896,232 | u167931717 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cnt++;
}
if (cnt < n - cnt) {
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
cnt++;
}
if (cnt <= n - cnt) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 896,239 | 896,240 | u414947284 | cpp |
p03080 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> cap(N);
for (int i = 0; i < N; i++) {
cin >> cap.at(i);
}
int red = 0, blue = 0;
for (int i = 0; i < N; i++) {
if (cap.at(i) == 'R') {
red += 1;
} else {
blue += 1;
}
}
if (red > ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> cap(N);
for (int i = 0; i < N; i++) {
cin >> cap.at(i);
}
int red = 0, blue = 0;
for (int i = 0; i < N; i++) {
if (cap.at(i) == 'R') {
red += 1;
} else {
blue += 1;
}
}
if (red > ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 896,241 | 896,242 | u552847961 | cpp |
p03080 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int R = 0;
int B = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
int B = 0;
for (int i = 0; i < S.size(); i++) {
... | [
"variable_declaration.add"
] | 896,245 | 896,246 | u545206239 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define int ll
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 896,247 | 896,248 | u949798495 | cpp |
p03080 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 896,252 | 896,253 | u244583418 | cpp |
p03080 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int r = 0;
for (int i = 0; i < n; i++) {
if (getchar() == 'R') {
r++;
}
}
getchar();
if (r > (n - r)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return (0);
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int r = 0;
for (int i = 0; i <= n; i++) {
if (getchar() == 'R') {
r++;
}
}
if (r > (n - r)) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return (0);
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove"
] | 896,258 | 896,259 | u149751724 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.