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 |
|---|---|---|---|---|---|---|---|
p02954 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int ans[100010] = {0};
bool lcount = false;
bool rcount = true;
int r = 0;
int l = 0;
int nowR = 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int ans[100010] = {0};
bool lcount = false;
bool rcount = true;
int r = 0;
int l = 0;
int nowR = 0;... | [
"io.output.change"
] | 758,475 | 758,476 | u582357587 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define maxn 200010
#define INF 1e15
#define ff first
#define ss second
#define endl '\n'
typedef long long ll;
int ans[maxn], arr[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string str;
cin >> str;
int n = str.length();
int curr = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 200010
#define INF 1e15
#define ff first
#define ss second
#define endl '\n'
typedef long long ll;
int ans[maxn], arr[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string str;
cin >> str;
int n = str.length();
int curr = 0;
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 758,480 | 758,481 | u225649725 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pr_qu priority_queue
#define vec(name, size, common) vector<ll>(name)((size), (common))
int main() {
string s;
cin >> s;
vector<ll> a(s.size(), 0);
char m;
ll mc, co = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pr_qu priority_queue
#define vec(name, size, common) vector<ll>(name)((size), (common))
int main() {
string s;
cin >> s;
vector<ll> a(s.size(), 0);
char m;
ll mc, co = 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 758,495 | 758,496 | u830237447 | cpp |
p02954 | #include <iostream>
using namespace std;
int main() {
// 整数の入力
string s;
cin >> s;
int l = s.length();
int *c = new int[l];
int count = 0;
int pointer = 0;
char before = 'R';
bool flush = false;
for (int i = 0; i < l; i++) {
if (before == s[i]) {
count += 1;
} else if (s[i] == 'L') // ... | #include <iostream>
using namespace std;
int main() {
// 整数の入力
string s;
cin >> s;
int l = s.length();
int *c = new int[l];
int count = 0;
int pointer = 0;
char before = 'R';
bool flush = false;
for (int i = 0; i < l; i++) {
if (before == s[i]) {
count += 1;
} else if (s[i] == 'L') // ... | [
"io.output.change"
] | 758,518 | 758,519 | u222682687 | cpp |
p02954 | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
auto N = s.size();
int k[100000 + 1];
memset(k, 0, sizeof(k));
int i, r, l, j;
int r_w, l_w, esp;
int c = 0;
r = l = i = 0;
while (i != N) {
r = l = 0;
while (s[i ... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
auto N = s.size();
int k[100000 + 1];
memset(k, 0, sizeof(k));
int i, r, l, j;
int r_w, l_w, esp;
int c = 0;
r = l = i = 0;
while (i != N) {
r = l = 0;
while (s[i ... | [
"call.arguments.change"
] | 758,520 | 758,521 | u787311704 | cpp |
p02954 | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
auto N = s.size();
int k[100000 + 1];
memset(k, 0, sizeof(k));
int i, r, l, j;
int r_w, l_w, esp;
int c = 0;
r = l = i = 0;
while (i != N) {
r = l = 0;
while (s[i ... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
auto N = s.size();
int k[100000 + 1];
memset(k, 0, sizeof(k));
int i, r, l, j;
int r_w, l_w, esp;
int c = 0;
r = l = i = 0;
while (i != N) {
r = l = 0;
while (s[i ... | [
"expression.operation.binary.add"
] | 758,522 | 758,521 | u787311704 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
string s;
cin >> s;
int si = s.size();
vector<int> a(si);
int r = 0;
int l = 0;
for (int i = 0; i < si; i++) {
if (s[i] == 'R') {
while (s[i] != 'L') {
r++;
i++;
... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
string s;
cin >> s;
int si = s.size();
vector<int> a(si);
int r = 0;
int l = 0;
for (int i = 0; i < si; i++) {
if (s[i] == 'R') {
while (s[i] != 'L') {
r++;
i++;
... | [
"identifier.change",
"io.output.change"
] | 758,525 | 758,526 | u103850114 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
else {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,537 | 758,538 | u006721330 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll N = s.size();
vector<ll> R(N, 0);
vector<ll> L(N, 0);
vector<ll> ans(N, 0);
for (int i = 0; i < N; i++) {
if (s[i] == 'R' && (i == 0 || R[i - 1] < 2)) {
int ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll N = s.size();
vector<ll> R(N, 0);
vector<ll> L(N, 0);
vector<ll> ans(N, 0);
for (int i = 0; i < N; i++) {
if (s[i] == 'R' && (i == 0 || R[i - 1] < 2)) {
int ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 758,542 | 758,543 | u432088501 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> s;
n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{ // solve R
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
el... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> s;
n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{ // solve R
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
el... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 758,548 | 758,549 | u506858457 | cpp |
p02954 | #include <cstring>
#include <iostream>
using namespace std;
char a[100005];
int b[100005], n, i, sol[100005], nr;
int main() {
cin >> a + 1;
n = strlen(a + 1);
b[1] = 1;
for (i = 2; i <= n; i++) {
if (a[i] == a[i - 1] && a[i] == 'R')
b[i] = b[i - 1] + 1;
if (a[i] != a[i - 1] && a[i] == 'R')
... | #include <cstring>
#include <iostream>
using namespace std;
char a[100005];
int b[100005], n, i, sol[100005], nr;
int main() {
cin >> a + 1;
n = strlen(a + 1);
b[1] = 1;
for (i = 2; i <= n; i++) {
if (a[i] == a[i - 1] && a[i] == 'R')
b[i] = b[i - 1] + 1;
if (a[i] != a[i - 1] && a[i] == 'R')
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 758,552 | 758,553 | u868438411 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{ // solve
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
else {
ans[i] += cnt... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
rep(ri, 2) {
{ // solve
int cnt = 0;
rep(i, n) {
if (s[i] == 'R')
cnt++;
else {
ans[i] += cnt... | [
"call.function.change",
"call.arguments.change"
] | 758,556 | 758,557 | u106635407 | cpp |
p02954 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,558 | 758,559 | u539402331 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int ans[10000000];
int main() {
string s;
cin >> s;
rep(i, s.size()) {
int j = i;
int num = 0;
while (1) {
if (s[i] == 'R') {
if (s[i] != s[j + 1]) {
break;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int ans[10000000];
int main() {
string s;
cin >> s;
rep(i, s.size()) {
int j = i;
int num = 0;
while (1) {
if (s[i] == 'R') {
if (s[i] != s[j + 1]) {
break;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"expression.operation.binary.change"
] | 758,562 | 758,563 | u905170328 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll pre[100001], suff[100001], ans[100001];
int main() {
string s;
cin >> s;
ll n = s.length();
pre[0] = 1;
for (ll i = 1; i < s.length(); i++) {
if (s[i] == 'R')
pre[i] += (pre[i - 1] + 1);
}
suff[n - 1] = 1;
for (ll i = n - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll pre[100001], suff[100001], ans[100001];
int main() {
string s;
cin >> s;
ll n = s.length();
pre[0] = 1;
for (ll i = 1; i < s.length(); i++) {
if (s[i] == 'R')
pre[i] += (pre[i - 1] + 1);
}
suff[n - 1] = 1;
for (ll i = n - ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 758,578 | 758,579 | u193330108 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = (n); i < (x); ++i)
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
int cntR = 0, cntL = 0;
rep(i, 0, n) {
if (s[i] == 'L') {
while (i <= n - 1 && s[i] == 'L') {
cn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = (n); i < (x); ++i)
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
int cntR = 0, cntL = 0;
rep(i, 0, n) {
if (s[i] == 'L') {
while (i <= n - 1 && s[i] == 'L') {
cn... | [
"call.remove",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 758,582 | 758,583 | u526854325 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int rcnt = 0;
int lcnt = 0;
int pos = 0;
int ans[n];
for (int i = 0; i < n; i++) {
ans[i] = 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
if (lcnt != 0) {
if (lcnt % 2 == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int rcnt = 0;
int lcnt = 0;
int pos = 0;
int ans[n];
for (int i = 0; i < n; i++) {
ans[i] = 0;
}
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
if (lcnt != 0) {
if (lcnt % 2 == ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 758,592 | 758,593 | u262602763 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> ans(n);
rep(re, 2) {
{
int count ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
rep(re, 2) {
{
int c... | [
"variable_declaration.add",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 758,594 | 758,595 | u689844566 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int t0 = 1, renzoku = 0, PRL = 0, RorL = 0, N;
cin >> S;
N = S.size();
vector<int> S2(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
renzoku++;
if (RorL == 1) {
RorL = 0;
renzoku = 1;
t0 = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int t0 = 1, renzoku = 0, PRL = 0, RorL = 0, N;
cin >> S;
N = S.size();
vector<int> S2(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
renzoku++;
if (RorL == 1) {
RorL = 0;
renzoku = 1;
t0 = ... | [
"io.output.change"
] | 758,596 | 758,597 | u901446572 | cpp |
p02954 | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 758,615 | 758,616 | u472742542 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = sz(s);
vector<int> ans(n, 0);
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
count++;
} els... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = sz(s);
vector<int> ans(n, 0);
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
count++;
} els... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,617 | 758,618 | u044459372 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sl = sz(s);
vector<pair<char, int>> a;
vector<int> ans(sl);
char tmp = 'R';
int cnt = 1;
for (int i = 0; i <= sl; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sl = sz(s);
vector<pair<char, int>> a;
vector<int> ans(sl);
char tmp = 'R';
int cnt = 1;
for (int i = 1; i <= sl; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 758,631 | 758,632 | u059207724 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S;
cin >> S;
vector<LL> members(S.length());
LL i = 0;
while (i < S.length()) {
LL c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string S;
cin >> S;
vector<LL> members(S.length());
LL i = 0;
while (i < S.length()) {
LL c... | [
"assignment.change"
] | 758,648 | 758,649 | u758765597 | cpp |
p02954 | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
const int N = 1e5 + 1;
char buf[N];
int main() {
scanf("%s", buf);
char *p = buf;
while (*p) {
int a = 0, b = 0;
while (*p == 'R')
++a, ++p;
while (*p && *p == 'L')
++b, ++p;
for (int i = 1; i < a; ++i)
... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
const int N = 1e5 + 1;
char buf[N];
int main() {
scanf("%s", buf);
char *p = buf;
while (*p) {
int a = 0, b = 0;
while (*p == 'R')
++a, ++p;
while (*p && *p == 'L')
++b, ++p;
for (int i = 1; i < a; ++i)
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 758,681 | 758,682 | u919923389 | cpp |
p02954 | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
const int N = 1e5 + 1;
char buf[N];
int main() {
scanf("%s", buf);
char *p = buf;
while (*p) {
int a = 0, b = 0;
while (*p == 'R')
++a, ++p;
while (*p && *p == 'L')
++b, ++p;
for (int i = 1; i < a; ++i)
... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
const int N = 1e5 + 1;
char buf[N];
int main() {
scanf("%s", buf);
char *p = buf;
while (*p) {
int a = 0, b = 0;
while (*p == 'R')
++a, ++p;
while (*p && *p == 'L')
++b, ++p;
for (int i = 1; i < a; ++i)
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 758,683 | 758,682 | u919923389 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
char switcher(char status) {
if (status == 'R')
return 'L';
else
return 'R';
}
int main() {
string s;
cin >> s;
char status = 'R';
vector<int> ans(s.length(), 0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
... | #include <bits/stdc++.h>
using namespace std;
char switcher(char status) {
if (status == 'R')
return 'L';
else
return 'R';
}
int main() {
string s;
cin >> s;
char status = 'R';
vector<int> ans(s.length(), 0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
... | [
"io.output.change"
] | 758,684 | 758,685 | u772690052 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
char switcher(char status) {
if (status == 'R')
return 'L';
else
return 'R';
}
int main() {
string s;
cin >> s;
char status = 'R';
vector<int> ans(s.length(), 0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
... | #include <bits/stdc++.h>
using namespace std;
char switcher(char status) {
if (status == 'R')
return 'L';
else
return 'R';
}
int main() {
string s;
cin >> s;
char status = 'R';
vector<int> ans(s.length(), 0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
... | [
"io.output.change"
] | 758,686 | 758,685 | u772690052 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn];
char s[maxn];
int main() {
scanf("%s", s);
int R = 0, L = 0, Ln, Rn;
while (s[R]) {
while (s[R] == 'R')
R++;
Ln = R - L;
L = R + 1;
while (s[L] == 'L')
L++;
Rn = L - R;
a[R] = a[R - 1] = (... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn];
char s[maxn];
int main() {
scanf("%s", s);
int R = 0, L = 0, Ln, Rn;
while (s[R]) {
while (s[R] == 'R')
R++;
Ln = R - L;
L = R + 1;
while (s[L] == 'L')
L++;
Rn = L - R;
a[R] = a[R - 1] = (... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 758,687 | 758,688 | u098251832 | cpp |
p02954 | #include <iostream>
#include <string>
using namespace std;
int len[100005];
int ans[100005];
int main() {
for (int i = 0; i < 100005; ++i) {
ans[i] = 0;
}
string S;
cin >> S;
int cnt = 0;
int index = 0;
bool flag = true; // true -> R false -> L
for (int i = 0; i < S.size(); ++i) {
if ((flag) ... | #include <iostream>
#include <string>
using namespace std;
int len[100005];
int ans[100005];
int main() {
for (int i = 0; i < 100005; ++i) {
ans[i] = 0;
}
string S;
cin >> S;
int cnt = 0;
int index = 0;
bool flag = true; // true -> R false -> L
for (int i = 0; i < S.size(); ++i) {
if ((flag) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 758,694 | 758,695 | u352969025 | cpp |
p02954 | //萌新看过（膜拜）大佬后写出（逃）
#pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
string s;
int ans[100000], turn[2];
int main() {
ios_base::sync_with_stdio(false);
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
memset(turn, 0, sizeof(t... | //萌新看过（膜拜）大佬后写出（逃）
#pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
string s;
int ans[100000], turn[2];
int main() {
ios_base::sync_with_stdio(false);
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
memset(turn, 0, sizeof(t... | [] | 758,718 | 758,719 | u083499110 | cpp |
p02954 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
int i, j;
string s;
int n;
ll dp[100001][13] = {0};
const ll mod = 1e9 + 7;
void solve() {
string s;
cin >> s;
int l = s.size();
int st = 0;
int circle_pos = -1;
bool has_r = false;
for (i = 0; i < l; ++i) {
... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
int i, j;
string s;
int n;
ll dp[100001][13] = {0};
const ll mod = 1e9 + 7;
void solve() {
string s;
cin >> s;
int l = s.size();
int st = 0;
int circle_pos = -1;
bool has_r = false;
for (i = 0; i < l; ++i) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 758,724 | 758,725 | u778594851 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | [
"expression.operation.binary.remove"
] | 758,738 | 758,739 | u308590217 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | [
"expression.operation.binary.remove"
] | 758,740 | 758,741 | u090325904 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
vector<int> ans(S.size());
int from = 0;
int to = 0;
int point = 0;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L') {
point = i;
}
if (S.at(i) == '... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
vector<int> ans(S.size());
int from = 0;
int to = 0;
int point = 0;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L') {
point = i;
}
if (S.at(i) == '... | [
"io.output.change"
] | 758,762 | 758,763 | u598710706 | cpp |
p02954 | #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popc... | #include <bits/stdc++.h>
//#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popc... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,764 | 758,765 | u381626581 | cpp |
p02954 | // LRが連続している分だけ繰り返せば十分
//その後は、偶奇で繰り返すだけ
//
//実際は偶奇に分ければ、繰り返さなくても答えは出る
// RRRRL -> Rの端に集まるのは、Rの端から左に見て、2個目と4個目のR
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int s_siz... | // LRが連続している分だけ繰り返せば十分
//その後は、偶奇で繰り返すだけ
//
//実際は偶奇に分ければ、繰り返さなくても答えは出る
// RRRRL -> Rの端に集まるのは、Rの端から左に見て、2個目と4個目のR
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int s_siz... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,766 | 758,767 | u538188080 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const int... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const int... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 758,772 | 758,773 | u765690804 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const int... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const int... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 758,774 | 758,773 | u765690804 | cpp |
p02954 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,787 | 758,788 | u139300044 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), k = 0;
vector<int> n = {0};
char prev = 'R';
for (int i = 0; i < N; i++) {
if (prev == S[i]) {
n[k] += 1;
} else {
n.push_back(1);
prev = S[i];
k... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), k = 0;
vector<int> n = {0};
char prev = 'R';
for (int i = 0; i < N; i++) {
if (prev == S[i]) {
n[k] += 1;
} else {
n.push_back(1);
prev = S[i];
k... | [
"io.output.change"
] | 758,793 | 758,794 | u775643066 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define de... | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define de... | [
"assignment.change",
"expression.operation.binary.remove"
] | 758,831 | 758,832 | u111937495 | cpp |
p02954 | #include <iostream>
using namespace std;
int main() {
string s;
char bloc1, bloc2, dir;
int num_f, num_s, rnum, lnum, lcount, i, count, len;
cin >> s;
len = (int)(s.length());
if (len == 2)
cout << 1 << " " << 1;
else {
bloc1 = s[0];
bloc2 = s[1];
num_f = 0;
num_s = 0;
rnum = 0;
... | #include <iostream>
using namespace std;
int main() {
string s;
char bloc1, bloc2, dir;
int num_f, num_s, rnum, lnum, lcount, i, count, len;
cin >> s;
len = (int)(s.length());
if (len == 2)
cout << 1 << " " << 1;
else {
bloc1 = s[0];
bloc2 = s[1];
num_f = 0;
num_s = 0;
rnum = 0;
... | [] | 758,837 | 758,838 | u736278528 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define sachin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
sachin long long n, count1 = 1;
string s;
cin >> s;
n = s.size();
vector... | #include <bits/stdc++.h>
using namespace std;
#define sachin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
sachin long long n, count1 = 1;
string s;
cin >> s;
n = s.size();
vector... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,839 | 758,840 | u760783140 | cpp |
p02954 | #include <iostream>
#include <string>
int main() {
int s, i, rlPlace;
std::string d;
std::cin >> d;
s = d.length();
bool k;
int ans[100000];
for (i = 0; i < s; i++) {
ans[i] = 0;
}
for (i = 1; i < s; i++) {
k = 0;
while (d[i] == 'R')
++i;
rlPlace = i;
while (d[i] == 'L' && i... | #include <iostream>
#include <string>
int main() {
int s, i, rlPlace;
std::string d;
std::cin >> d;
s = d.length();
bool k;
int ans[100000];
for (i = 0; i < s; i++) {
ans[i] = 0;
}
for (i = 1; i < s; i++) {
k = 0;
while (d[i] == 'R')
++i;
rlPlace = i;
while (d[i] == 'L' && i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,843 | 758,844 | u623601489 | cpp |
p02954 | #include <iostream>
#include <string>
int main() {
int s, i, rlPlace;
std::string d;
std::cin >> d;
s = d.length();
bool k;
int ans[100000];
for (i = 0; i < s; i++) {
ans[i] = 0;
}
for (i = 1; i < s; i++) {
k = 1;
while (d[i] == 'R')
++i;
rlPlace = i;
while (d[i] == 'L' && i... | #include <iostream>
#include <string>
int main() {
int s, i, rlPlace;
std::string d;
std::cin >> d;
s = d.length();
bool k;
int ans[100000];
for (i = 0; i < s; i++) {
ans[i] = 0;
}
for (i = 1; i < s; i++) {
k = 0;
while (d[i] == 'R')
++i;
rlPlace = i;
while (d[i] == 'L' && i... | [
"literal.number.change",
"assignment.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 758,845 | 758,844 | u623601489 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> ans((int)s.size()), childR((int)s.size()), childL((int)s.size());
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'L')
continue;
char moto = s[i];
int j = i, cnt = 0;
while (moto == s[j]) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> ans((int)s.size()), childR((int)s.size()), childL((int)s.size());
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'L')
continue;
char moto = s[i];
int j = i, cnt = 0;
while (moto == s[j]) {... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,862 | 758,863 | u018586085 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> ans((int)s.size()), childR((int)s.size()), childL((int)s.size());
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'L')
continue;
char moto = s[i];
int j = i, cnt = 0;
while (moto == s[j]) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> ans((int)s.size()), childR((int)s.size()), childL((int)s.size());
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'L')
continue;
char moto = s[i];
int j = i, cnt = 0;
while (moto == s[j]) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,864 | 758,863 | u018586085 | cpp |
p02954 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int si = s.length();
vector<int> hint;
vector<int> hint2;
vector<int> ans;
int l = 0, r = 0;
for (int i = 0; i < si; i++) {
if (i > 0) {
if (s[i] == 'L' && s[i - 1] == 'R') {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int si = s.length();
vector<int> hint;
vector<int> hint2;
vector<int> ans;
int l = 0, r = 0;
for (int i = 0; i < si; i++) {
if (i > 0) {
if (s[i] == 'L' && s[i - 1] == 'R') {
... | [
"io.output.change"
] | 758,875 | 758,876 | u135203576 | cpp |
p02954 | //
// Created by kuroneko on 2019-08-04.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000000000009LL
#define MOD 1000000007LL
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight... | //
// Created by kuroneko on 2019-08-04.
//
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000000000009LL
#define MOD 1000000007LL
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,882 | 758,883 | u492352831 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int main(void) {
std::string S;
std::cin >> S;
std::vector<int64_t> R(S.size(), 0);
std::vector<int64_t> L(S.siz... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int main(void) {
std::string S;
std::cin >> S;
std::vector<int64_t> R(S.size(), 0);
std::vector<int64_t> L(S.siz... | [
"expression.operation.binary.add"
] | 758,892 | 758,893 | u100280611 | cpp |
p02954 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | [
"assignment.change"
] | 758,904 | 758,905 | u824337972 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
string s;
int e[100100];
int n;
int tot;
int stopR[100100];
int stopL[100100];
int go(int pos) {
if (s[pos] == 'R') {
if ((stopR[pos] - pos) % 2 == 0)
return stopR[pos];
return stopR[pos] + 1;
}
if (s[pos] == 'L') {
if ((pos - stopL[pos] + 1) % 2 == ... | #include <bits/stdc++.h>
using namespace std;
string s;
int e[100100];
int n;
int tot;
int stopR[100100];
int stopL[100100];
int go(int pos) {
if (s[pos] == 'R') {
if ((stopR[pos] - pos) % 2 == 0)
return stopR[pos];
return stopR[pos] + 1;
}
if (s[pos] == 'L') {
if ((pos - stopL[pos] + 1) % 2 == ... | [
"function.return_value.change"
] | 758,907 | 758,908 | u798941584 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::cin >> S;
int length = S.length();
std::vector<int> children(length, 0);
int comparison = 0;
std::vector<int> components;
for (int i = 0; i < length; i += 1) {
if (S[i] == S[comparison]) {
continue;
}... | #include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::cin >> S;
int length = S.length();
std::vector<int> children(length, 0);
int comparison = 0;
std::vector<int> components;
for (int i = 0; i < length; i += 1) {
if (S[i] == S[comparison]) {
continue;
}... | [
"assignment.change"
] | 758,909 | 758,910 | u785465309 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> ans(N, 0), point(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L') {
point.push_back(i);
}
}
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> ans(N, 0), point(0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L') {
point.push_back(i);
}
}
for (int i = 0; i < N; i++) {
... | [
"call.arguments.change"
] | 758,919 | 758,920 | u372299304 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.size();
vector<int> ans(len, 0);
// R->L
for (int i = 0; i < len - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
for (int j = 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int len = s.size();
vector<int> ans(len, 0);
// R->L
for (int i = 0; i < len - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
for (int j = 1;... | [
"assignment.change"
] | 758,921 | 758,922 | u905270643 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G1[500005];
vector<ll> G2[500005];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<ll> G1[500005];
vector<ll> G2[500005];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 758,923 | 758,924 | u399527088 | cpp |
p02954 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (ll a = b; a <= c; a++)
#define per(a, b, c) for (ll a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, s... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (ll a = b; a <= c; a++)
#define per(a, b, c) for (ll a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, s... | [
"literal.number.change",
"call.arguments.change"
] | 758,925 | 758,926 | u493249745 | cpp |
p02954 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
... | [] | 758,939 | 758,940 | u980932400 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define F first
#define ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define F first
#define ... | [
"literal.string.change",
"control_flow.loop.condition.change"
] | 758,945 | 758,946 | u130804410 | cpp |
p02954 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int ans[n];
int status = 0;
int r = 0;
for (int i = 0; i < n; i++) {
if (status == 0) {
if (s[i] == 'R') {
ans[i] = 0;
r++;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int ans[n];
int status = 0;
int r = 0;
for (int i = 0; i < n; i++) {
if (status == 0) {
if (s[i] == 'R') {
ans[i] = 0;
r++;
... | [] | 758,949 | 758,950 | u464190313 | cpp |
p02954 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll N = s.size();
ll i;
char cb, cn;
ll Rpos, Lpos;
ll even, odd;
ll ans[N];
cb = '... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
ll N = s.size();
ll i;
char cb, cn;
ll Rpos, Lpos;
ll even, odd;
ll ans[N];
cb = '... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 758,953 | 758,954 | u770161743 | cpp |
p02954 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 758,955 | 758,956 | u379822620 | cpp |
p02954 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | [
"expression.operation.binary.add"
] | 758,957 | 758,958 | u041282550 | cpp |
p02954 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
//#inc... | [
"io.output.change"
] | 758,960 | 758,961 | u301409936 | cpp |
p02954 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
// RRLLLLRLRRLL 0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0
int h[100005][2] = {0};
int main() {
int n = 1;
char c;
while (cin >> c) {
if (c == 'R')
h[n][0] = 1;
if (c == 'L')
h[n][0] = ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
// RRLLLLRLRRLL 0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0
int h[100005][2] = {0};
int main() {
int n = 1;
char c;
while (cin >> c) {
if (c == 'R')
h[n][0] = 1;
if (c == 'L')
h[n][0] = ... | [
"expression.unary.arithmetic.add"
] | 758,966 | 758,967 | u791146764 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 758,972 | 758,973 | u961528573 | cpp |
p02954 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int size = s.size();
int arr[size];
for (int i = 0; i < size; i++) {
arr[i] = 0;
}
int cnt = 0;
int ans;
for (int i = 0; i < size; i++) {
if (s[i] == 'R')
cnt++;
else {
arr[i - ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int size = s.size();
int arr[size];
for (int i = 0; i < size; i++) {
arr[i] = 0;
}
int cnt = 0;
for (int i = 0; i < size; i++) {
if (s[i] == 'R')
cnt++;
else {
arr[i - 1] += cnt /... | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,974 | 758,975 | u778347695 | cpp |
p02954 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.size(), count = 0, left = 0, hajime = 0;
vector<int> c(l, 0);
fo... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int l = S.size(), count = 0, left = 0, hajime = 0;
vector<int> c(l, 0);
fo... | [
"control_flow.branch.if.condition.change"
] | 758,982 | 758,983 | u444349080 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 758,984 | 758,985 | u898749314 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size();
vector<int> v(n);
vector<int> w(n, 0), w2(n, 0);
for (int i = 0; i < n; i++) {
v[i] = (s[i] == 'R' ? 1 : -1);
}
int cnt = 1;
for (int i = 0; i < n - 1; i++) {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
cin >> s;
int n = s.size();
vector<int> v(n);
vector<int> w(n, 0), w2(n, 0);
for (int i = 0; i < n; i++) {
v[i] = (s[i] == 'R' ? 1 : -1);
}
int cnt = 1;
for (int i = 0; i < n - 1; i++) {
... | [
"expression.unary.arithmetic.add"
] | 758,986 | 758,987 | u550444782 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
char s[maxn];
int sum[maxn];
int L[maxn], R[maxn];
int l[maxn], r[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (register int i = 1; i <= n; i++) {
if (s[i] == 'L') {
int x = i;
L[i] = i;
whi... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
char s[maxn];
int sum[maxn];
int L[maxn], R[maxn];
int l[maxn], r[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (register int i = 1; i <= n; i++) {
if (s[i] == 'L') {
int x = i;
L[i] = i;
whi... | [] | 758,988 | 758,989 | u088044957 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
char s[maxn];
int sum[maxn];
int L[maxn], R[maxn];
int l[maxn], r[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (register int i = 1; i <= n; i++) {
if (s[i] == 'L') {
int x = i;
L[i] = i;
whi... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
char s[maxn];
int sum[maxn];
int L[maxn], R[maxn];
int l[maxn], r[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (register int i = 1; i <= n; i++) {
if (s[i] == 'L') {
int x = i;
L[i] = i;
whi... | [
"assignment.variable.change",
"identifier.change"
] | 758,990 | 758,989 | u088044957 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n, m;
cin >> n >> m;
vector<P> ab;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
ab.push_back(P(a, b));
}
sort(ab.begin(), ab... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n, m;
cin >> n >> m;
vector<P> ab;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
ab.push_back(P(a, b));
}
sort(ab.begin(), ab... | [
"control_flow.loop.for.condition.change"
] | 759,008 | 759,009 | u129667379 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
priority_queue<int> A;
set<int> B[100001];
rep(i, n) cin >> a >> b, B[a].insert(b);
rep(i, m) {
for (auto j : B[i + 1])
A.push(j);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
priority_queue<int> A;
vector<int> B[100001];
rep(i, n) cin >> a >> b, B[a].push_back(b);
rep(i, m) {
for (auto j : B[i + 1])
A.pus... | [
"variable_declaration.type.change",
"call.function.change"
] | 759,012 | 759,013 | u441296840 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | [
"variable_declaration.type.change"
] | 759,014 | 759,015 | u711540245 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N, M;
cin >> N >> M;
vector<pair<int, int>> v;
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
v.push_back(make_pair(A, B));
}
sort(v.begin(), v.end());
long long int ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N, M;
cin >> N >> M;
vector<pair<int, int>> v;
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
v.push_back(make_pair(A, B));
}
sort(v.begin(), v.end());
long long int ans ... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 759,022 | 759,023 | u596101798 | cpp |
p02948 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"assignment.value.change"
] | 759,026 | 759,027 | u222293734 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
set<pair<int, int>> W;
priority_queue<int> B;
int N, M, a, b;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
W.insert({a, b});
}
int ans = 0;
auto it = W.begin();
for (int i = 0; i < M; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
multiset<pair<int, int>> W;
priority_queue<int> B;
int N, M, a, b;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
W.insert({a, b});
}
int ans = 0;
auto it = W.begin();
for (int i = 0; i < M; i++) {
while (it != W.end(... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.change"
] | 759,030 | 759,031 | u045811375 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int main() {
set<pair<int, int>> W;
priority_queue<int> B;
int N, M, a, b;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
W.insert({a, b});
}
int ans = 0;
auto it = W.begin();
for (int i = 0; i < M; i++) {
while (it != W.end()) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
multiset<pair<int, int>> W;
priority_queue<int> B;
int N, M, a, b;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
W.insert({a, b});
}
int ans = 0;
auto it = W.begin();
for (int i = 0; i < M; i++) {
while (it != W.end(... | [
"variable_declaration.type.change"
] | 759,032 | 759,031 | u045811375 | cpp |
p02948 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
priority_queue<pair<int, int>> v;
priority_queue<int> pq;
for (int i = 0; i < n; i++) {
int first, second;
cin >> first >> second;
v.push(pair<int, int>(-first, second));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
priority_queue<pair<int, int>> v;
priority_queue<int> pq;
for (int i = 0; i < n; i++) {
int first, second;
cin >> first >> second;
v.push(pair<int, int>(-first, second));
}
... | [] | 759,036 | 759,037 | u723574055 | cpp |
p02948 | #include <iostream>
#include <queue>
using namespace std;
priority_queue<int> q;
vector<vector<int>> jobs;
int main(void) {
int n, m;
cin >> n >> m;
jobs = vector<vector<int>>(m + 1);
for (int a = 0; a < n; a = a + 1) {
int ai, bi;
cin >> ai >> bi;
jobs[ai].push_back(bi);
}
int ans = 0;
... | #include <iostream>
#include <queue>
using namespace std;
priority_queue<int> q;
vector<vector<int>> jobs;
int main(void) {
int n, m;
cin >> n >> m;
jobs = vector<vector<int>>(100001);
for (int a = 0; a < n; a = a + 1) {
int ai, bi;
cin >> ai >> bi;
jobs[ai].push_back(bi);
}
int ans = 0;
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 759,080 | 759,081 | u888251784 | cpp |
p02954 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int ans[100000];
int main() {
for (int i = 0; i < 100000; i++) {
ans[i] = 0;
}
string S;
cin >> S;
int rb, re, lb, le;
int count = 0;
bool rr = true;
rb = 0;
for (int i = 0; i < S.size(); i++) {
i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int ans[100000];
int main() {
for (int i = 0; i < 100000; i++) {
ans[i] = 0;
}
string S;
cin >> S;
int rb, re, lb, le;
int count = 0;
bool rr = true;
rb = 0;
for (int i = 0; i < S.size(); i++) {
i... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 759,086 | 759,087 | u023751250 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void d() {
string s;
cin >> s;
int n = s.length();
vector<int> count(n, 1);
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
if (s[i + 1] == 'R') {
count[i + 2] += count[i];
count[i] = 0;
}
}
}... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void d() {
string s;
cin >> s;
int n = s.length();
vector<int> count(n, 1);
for (int i = 0; i < n; i++) {
if (s[i] == 'R') {
if (s[i + 1] == 'R') {
count[i + 2] += count[i];
count[i] = 0;
}
}
}... | [] | 759,088 | 759,089 | u261225456 | cpp |
p02954 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans[100000] = {0};
int st = 0;
int la = 0;
char now = 'R';
int mid = 1;
for (int i = 1; i < s.length(); i++) {
if (i == s.length() - 1 || now != s[i + 1]) {
if (i != s.length() - 1 && s[i + 1] == 'L') {
mid... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans[100000] = {0};
int st = 0;
int la = 0;
char now = 'R';
int mid = 1;
for (int i = 0; i < s.length(); i++) {
if (i == s.length() - 1 || now != s[i + 1]) {
if (i != s.length() - 1 && s[i + 1] == 'L') {
mid... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 759,108 | 759,109 | u702906718 | cpp |
p02954 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> B, C, E;
B.push_back(0);
for (int i = 1; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L')
C.push_back(i);
if (S.at(i) == 'L' && S.at(i + 1) == 'R') {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> B, C, E;
B.push_back(0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R' && S.at(i + 1) == 'L')
C.push_back(i);
if (S.at(i) == 'L' && S.at(i + 1) == 'R') {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 759,112 | 759,113 | u465638326 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[100010];
int ans[100010];
int ans1[100010];
int n;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
int now = i;
int flag = 0;
while (s[now] == '... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[100010];
int ans[100010];
int ans1[100010];
int n;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
int now = i;
int flag = 0;
while (s[now] == '... | [] | 759,114 | 759,115 | u549192489 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, r, w, q, qq, p;
multiset<ll> z, zz;
bool b;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
ll x[n];
for (ll i = 0; i < n; i++)
cin >> x[i], r += x[i];
for (ll i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, r, w, q, qq, p;
multiset<ll> z, zz;
bool b;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
ll x[n];
for (ll i = 0; i < n; i++)
cin >> x[i], r += x[i];
for (ll i ... | [
"identifier.change",
"call.arguments.change"
] | 759,118 | 759,119 | u197508298 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, r, w, q, qq, p;
multiset<ll> z, zz;
bool b;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
ll x[n];
for (ll i = 0; i < n; i++)
cin >> x[i], r += x[i];
for (ll i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, r, w, q, qq, p;
multiset<ll> z, zz;
bool b;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
ll x[n];
for (ll i = 0; i < n; i++)
cin >> x[i], r += x[i];
for (ll i ... | [
"identifier.change",
"call.arguments.change"
] | 759,120 | 759,119 | u197508298 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 759,127 | 759,128 | u232429509 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, K;
cin >> N >> K;
int sum = 0;
vector<int> A(N);
for (auto &&e : A) {
cin >> e;
sum += e;
}
vector<int> divisor;
for (int i = 1; i * i < sum + 1; i++) {
if (sum % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, K;
cin >> N >> K;
int sum = 0;
vector<int> A(N);
for (auto &&e : A) {
cin >> e;
sum += e;
}
vector<int> divisor;
for (int i = 1; i * i < sum + 1; i++) {
if (sum % i == 0) {
... | [
"call.arguments.change",
"call.arguments.add"
] | 759,129 | 759,130 | u782098901 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> divisor(int N) {
vector<int> RES;
for (int I = 1; I * I <= N; I++) {
if (N % I == 0) {
RES.push_back(I);
if (I != N / I)
RES.push_back(N / I);
}
}
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<int> divisor(int N) {
vector<int> RES;
for (int I = 1; I * I <= N; I++) {
if (N % I == 0) {
RES.push_back(I);
if (I != N / I)
RES.push_back(N / I);
}
}
ret... | [
"call.add",
"call.arguments.add"
] | 759,131 | 759,132 | u747602774 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
vector<int> divisor(int N) {
vector<int> RES;
for (int I = 1; I * I <= N; I++) {
if (N % I == 0) {
RES.push_back(I);
if (I != N / I)
RES.push_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
vector<int> divisor(int N) {
vector<int> RES;
for (int I = 1; I * I <= N; I++) {
if (N % I == 0) {
RES.push_back(I);
if (I != N / I)
RES.push_b... | [
"control_flow.branch.else.remove"
] | 759,133 | 759,134 | u747602774 | cpp |
p02955 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | [
"assignment.change"
] | 759,149 | 759,150 | u275797573 | cpp |
p02955 | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) \
for (int_... | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) \
for (int_... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 759,153 | 759,154 | u457985479 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | [
"literal.number.change",
"variable_declaration.value.change"
] | 759,160 | 759,161 | u860546679 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << en... | [
"assignment.change"
] | 759,162 | 759,163 | u298620933 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | [] | 759,164 | 759,165 | u987913144 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"assignment.change"
] | 759,166 | 759,167 | u987913144 | cpp |
p02955 | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"identifier.change"
] | 759,179 | 759,180 | u554988565 | cpp |
p02955 | #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 = (i... | #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 = (i... | [
"assignment.change"
] | 759,201 | 759,202 | u704625420 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.