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 |
|---|---|---|---|---|---|---|---|
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#define rg register
#define llint long long
using namespace std;
struct ios {
template <typename _tp> inline ios operator>>(_tp &x) {
char c = getchar();
int f = 1;
x = 0;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#define rg register
#define llint long long
using namespace std;
struct ios {
template <typename _tp> inline ios operator>>(_tp &x) {
char c = getchar();
int f = 1;
x = 0;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f =... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 757,927 | 757,928 | u849190128 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 2; i >= 0; i--) {
if (H[i] > H[i + 1]) {
if (H[i] - 1 <= H[i + 1])
H[i] -= 1;
else
flag =... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 2; i >= 0; i--) {
if (H[i] > H[i + 1]) {
if (H[i] - 1 <= H[i + 1])
H[i] -= 1;
else
flag =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,935 | 757,936 | u117345342 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
bool down = false;
bool p = true;
int before = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
if (j < before) {
if (before - j >= 2) {
p = false;
}
if (down ... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
bool down = false;
bool p = true;
int before = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
if (j < before) {
if (before - j >= 2) {
p = false;
}
if (down ... | [
"misc.opposites",
"assignment.value.change"
] | 757,939 | 757,940 | u023751250 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
bool down = false;
bool p = true;
int before = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
if (j < before) {
if (before - j >= 2) {
p = false;
}
if (down ... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
bool down = false;
bool p = true;
int before = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
if (j < before) {
if (before - j >= 2) {
p = false;
}
if (down ... | [
"misc.opposites",
"assignment.value.change"
] | 757,941 | 757,940 | u023751250 | cpp |
p02953 | /*
_ _ ___ __ _ _ _ _
_ _ ___| | |/ _ \__ __/ _| | || | ___| |__
| | | |/ _ \ | | | | \ \ /\ / / |_| | || |_/ __| '_ \
| |_| | __/ | | |_| |\ V V /| _| |__ _\__ \ | | |
\__, |\___|_|_|\___/ \_/\_/ |_| |_| |_| |___/_| |_|
|___/
*/
#include <bits/stdc++.h>
using namesp... | /*
_ _ ___ __ _ _ _ _
_ _ ___| | |/ _ \__ __/ _| | || | ___| |__
| | | |/ _ \ | | | | \ \ /\ / / |_| | || |_/ __| '_ \
| |_| | __/ | | |_| |\ V V /| _| |__ _\__ \ | | |
\__, |\___|_|_|\___/ \_/\_/ |_| |_| |_| |___/_| |_|
|___/
*/
#include <bits/stdc++.h>
using namesp... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,942 | 757,943 | u278136654 | cpp |
p02953 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
bool can = false;
cin >> n;
ll h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 1) {
cout << "Yes\n";
return 0;
}
for (int i = 1; i < n; i++) {
if (h[i] < h[i + 1])
h[i]--;
}
for (int... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
bool can = false;
cin >> n;
ll h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 1) {
cout << "Yes\n";
return 0;
}
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i])
h[i]--;
}
for (int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 757,948 | 757,949 | u352248517 | cpp |
p02953 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define oset \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using name... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define oset \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using name... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,950 | 757,951 | u461200315 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> h;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
h.push_back(a);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> h;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
h.push_back(a);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
... | [] | 757,956 | 757,957 | u115819033 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
int c = 1;
int minm = a[0] - 1;
for (int i = 1; i < n; i++) {
if (a[i] >= minm)
minm = max(minm, a[i] - 1);
else {
c = 0;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int count = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
int c = 1;
int minm = a[0] - 1;
for (int i = 1; i < n; i++) {
if (a[i] >= minm)
minm = max(minm, a[i] - 1);
else {
c = 0;
break;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,965 | 757,966 | u802406405 | cpp |
p02953 | #include <algorithm>
#include <cstdio>
const int MAXN = 1e5 + 5;
int dp[MAXN][2], n, val[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
dp[i][0] = dp[i][1] = 2147483647;
scanf("%d", &val[i]);
}
dp[0][0] = dp[0][1] = 0;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= 1; j++)
... | #include <algorithm>
#include <cstdio>
const int MAXN = 1e5 + 5;
int dp[MAXN][2], n, val[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
dp[i][0] = dp[i][1] = 2147483647;
scanf("%d", &val[i]);
}
dp[0][0] = dp[0][1] = 0;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= 1; j++)
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,976 | 757,977 | u767700714 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1000000007ll;
const int N = 100005;
template <class IT> inline void cmin(IT &a, IT b) {
if (b < a)
a = b;
}
template <class IT> inline void cmax(IT &a, IT b) {
if (a < b)
a = b;
}
int dp[N][2], h[N];
int main() {
int n, i, a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1000000007ll;
const int N = 100005;
template <class IT> inline void cmin(IT &a, IT b) {
if (b < a)
a = b;
}
template <class IT> inline void cmax(IT &a, IT b) {
if (a < b)
a = b;
}
int dp[N][2], h[N];
int main() {
int n, i, a, ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,980 | 757,981 | u238671650 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1000000007ll;
const int N = 100005;
template <class IT> inline void cmin(IT &a, IT b) {
if (b < a)
a = b;
}
template <class IT> inline void cmax(IT &a, IT b) {
if (a < b)
a = b;
}
int dp[N][2], h[N];
int main() {
int n, i, a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1000000007ll;
const int N = 100005;
template <class IT> inline void cmin(IT &a, IT b) {
if (b < a)
a = b;
}
template <class IT> inline void cmax(IT &a, IT b) {
if (a < b)
a = b;
}
int dp[N][2], h[N];
int main() {
int n, i, a, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,982 | 757,981 | u238671650 | cpp |
p02953 | #include <cstdio>
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = n; i; i--)
scanf("%d", a + i);
for (int i = 2; i <= n; i++) {
if (a[i] - a[i - 1] > 1)
return puts("NO") & 0;
if (a[i] > a[i - 1])
a[i]--;
}
return puts("YES") & 0;
} | #include <cstdio>
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = n; i; i--)
scanf("%d", a + i);
for (int i = 2; i <= n; i++) {
if (a[i] - a[i - 1] > 1)
return puts("No") & 0;
if (a[i] > a[i - 1])
a[i]--;
}
return puts("Yes") & 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 757,985 | 757,986 | u776525990 | cpp |
p02953 | // Created by liszt on 2019/08/04.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, tmp;
cin >> n;
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long now = h[0];
for (int i = 1; i < n; i++) {
if ... | // Created by liszt on 2019/08/04.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, tmp;
cin >> n;
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long now = h[0];
for (int i = 1; i < n; i++) {
if ... | [
"call.add",
"call.arguments.change"
] | 757,987 | 757,988 | u370447425 | cpp |
p02953 | #include <bits/stdc++.h>
#define range 524289
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
#define range 524289
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define ALL(V) V.begin(), V.end()
#define _ << " " <<
using namespace std;
typedef long long ll;
t... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,001 | 758,002 | u377069206 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,007 | 758,008 | u124992729 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,011 | 758,012 | u419301893 | cpp |
p02953 | #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 100012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int n, a[maxx];
int create(int num) {
int res = 1;
while (num--) {
res... | #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 100012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int n, a[maxx];
int create(int num) {
int res = 1;
while (num--) {
res... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,015 | 758,016 | u309723391 | cpp |
p02953 | // {{{ Template for Competitive Programming
// -std=c++14 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define CFOR(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define RFOR(i, a, b) for (i... | // {{{ Template for Competitive Programming
// -std=c++14 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define CFOR(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define RFOR(i, a, b) for (i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 758,025 | 758,026 | u637515289 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve() {
int n;
cin >> n;
int i, a[n];
for (i = 0; i < n; i++)
cin >> a[i];
bool flag = true;
for (int i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1]) {
a[i]--;
if (a[i] > a[i + 1]) {
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve() {
int n;
cin >> n;
ll i, a[n];
for (i = 0; i < n; i++)
cin >> a[i];
bool flag = true;
for (int i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1]) {
a[i]--;
if (a[i] > a[i + 1]) {
cout... | [
"variable_declaration.type.change"
] | 758,027 | 758,028 | u312943292 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (auto &h : H)
cin >> h;
for (int i = N - 2; i > 0; --i) {
if (H[i] > H[i + 1]) {
--H[i];
}
if (H[i] > H[i + 1]) {
cout << "NO" << endl;
return 0;
}
}
cout <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (auto &h : H)
cin >> h;
for (int i = N - 2; i > 0; --i) {
if (H[i] > H[i + 1]) {
--H[i];
}
if (H[i] > H[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,032 | 758,033 | u107077660 | cpp |
p02953 | #include "bits/stdc++.h"
using namespace std;
int cnt(int x) {
int rv = 0;
while (x) {
rv++;
x /= 10;
}
return rv;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n... | #include "bits/stdc++.h"
using namespace std;
int cnt(int x) {
int rv = 0;
while (x) {
rv++;
x /= 10;
}
return rv;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 758,034 | 758,035 | u753391427 | cpp |
p02953 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 4e6 + 3;
pair<int, int> arr[LIM + 3];
int main() {
int n;
cin >> n;
bool is = true;
int last = -1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!i)
x... | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 4e6 + 3;
pair<int, int> arr[LIM + 3];
int main() {
int n;
cin >> n;
bool is = true;
int last = -1;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!i)
x... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 758,042 | 758,043 | u540045035 | cpp |
p02953 | /// Let us start the game
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define pb push_back
using ll = long long;
using ii = pair<int, int>;
using db = long double;
using ull = unsigned long long;
const int N = 2e3 + 5, M = 1e7 + 5, MOD = 1e9 + 7;
const db EP... | /// Let us start the game
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define pb push_back
using ll = long long;
using ii = pair<int, int>;
using db = long double;
using ull = unsigned long long;
const int N = 2e3 + 5, M = 1e7 + 5, MOD = 1e9 + 7;
const db EP... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,050 | 758,051 | u220114950 | cpp |
p02953 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
int ma = 0;
for (int i = 0; i < N; i++) {
int a;
cin... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
int ma = 0;
for (int i = 0; i < N; i++) {
int a;
cin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,052 | 758,053 | u854904794 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, a[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
--a[1];
for (int i = 2; i <= n; ++i)
if (a[i] > a[i - 1])
--a[i];
for (int i = 2; i <= n; ++i)
if (a[i] < a[i - 1])
retur... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, a[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
--a[1];
for (int i = 2; i <= n; ++i)
if (a[i] > a[i - 1])
--a[i];
for (int i = 2; i <= n; ++i)
if (a[i] < a[i - 1])
retur... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 758,054 | 758,055 | u993519359 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 758,058 | 758,059 | u483277935 | cpp |
p02953 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 758,060 | 758,061 | u136509923 | cpp |
p02953 | #include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// AtCoderC++.cpp
using namespace std;
inline int ceileing(int a, int b) { return a % b... | #include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// AtCoderC++.cpp
using namespace std;
inline int ceileing(int a, int b) { return a % b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,062 | 758,063 | u822155101 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int main() {
string S;
cin >> S;
int l = 1;
int ind_R = 0, ind_L = 0;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int main() {
string S;
cin >> S;
int l = 1;
int ind_R = 0, ind_L = 0;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 758,064 | 758,065 | u603234915 | cpp |
p02953 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#define ll long long
#define il inline
#define rgi register int
using namespace std;
const int N = 100000 + 10;
int n, flag;
int h[N];
il int read() {
rgi x = 0, f = 0, ch;
while (!isdigit(ch = getchar()))
f |= ch == '-';
while (i... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#define ll long long
#define il inline
#define rgi register int
using namespace std;
const int N = 100000 + 10;
int n, flag;
int h[N];
il int read() {
rgi x = 0, f = 0, ch;
while (!isdigit(ch = getchar()))
f |= ch == '-';
while (i... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 758,074 | 758,075 | u469810874 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 1; i >= 1; i--) {
if (h[i] < h[i - 1]) {
cout << "No";
return 0;
} else if (h[i] == h[i - 1])
h[i - 1]--;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 1; i >= 1; i--) {
if (h[i] < h[i - 1] - 1) {
cout << "No";
return 0;
} else if (h[i] == h[i - 1] - 1)
h[i - ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 758,076 | 758,077 | u809153881 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 1; i >= 0; i--) {
if (h[i] < h[i - 1]) {
cout << "No";
return 0;
} else if (h[i] == h[i - 1])
h[i - 1]--;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 1; i >= 1; i--) {
if (h[i] < h[i - 1] - 1) {
cout << "No";
return 0;
} else if (h[i] == h[i - 1] - 1)
h[i - ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 758,078 | 758,077 | u809153881 | cpp |
p02953 | /*
THE BEST IS YET TO COME
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define r(i, s, l) for (int i = s; i < l; i++)
#define mod 1000000007
#define INT_BITS 32
#define ld long double
#define pp pair<long long, long long>
#define ss second
#define ff first
#define N 2000005
#define all(a) a.be... | /*
THE BEST IS YET TO COME
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define r(i, s, l) for (int i = s; i < l; i++)
#define mod 1000000007
#define INT_BITS 32
#define ld long double
#define pp pair<long long, long long>
#define ss second
#define ff first
#define N 2000005
#define all(a) a.be... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,079 | 758,080 | u264877306 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int,... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const auto MOD = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,081 | 758,082 | u587724217 | cpp |
p02953 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 758,087 | 758,088 | u302539304 | cpp |
p02953 | #include <assert.h>
#include <math.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
template <typename T> void in(T &x) { std::cin >> x; }
template <typename T> void out(const T H) { std::cout << (H); }
template <typename T1, typename... T2> void out(const T1 H,... | #include <assert.h>
#include <math.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
template <typename T> void in(T &x) { std::cin >> x; }
template <typename T> void out(const T H) { std::cout << (H); }
template <typename T1, typename... T2> void out(const T1 H,... | [
"preprocessor.define.value.change"
] | 758,089 | 758,090 | u811925505 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int A[100004];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (i + 1 <= n && i - 1 >= 1 && A[i] > A[i + 1] && A[i - 1] == A[i]) {
puts("No");
return 0;
} else if (i - 1 ... | #include <bits/stdc++.h>
using namespace std;
int A[100004];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (i + 1 <= n && i - 1 >= 1 && A[i] > A[i + 1] && A[i - 1] == A[i]) {
puts("No");
return 0;
} else if (i - 1 ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,091 | 758,092 | u765391939 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define mp ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define mp ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,102 | 758,103 | u772514767 | cpp |
p02953 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
bool flag = true;
if (n > 1) {
for (int i = n - 2; i >= 0; i--) {
if (h[i] > h[i - 1] + 1)
flag = false;
else if (h[i] > ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
bool flag = true;
if (n > 1) {
for (int i = n - 2; i >= 0; i--) {
if (h[i] > h[i + 1] + 1)
flag = false;
else if (h[i] > ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 758,104 | 758,105 | u394759653 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define N 140000
#define mod 1000000007
#define pp pair<ll, ll>
typedef long long int ll;
typedef long double ld;
#define MP make_pair
#define endl "\n"
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#define rrep(i, n) for (ll i ... | #include <bits/stdc++.h>
using namespace std;
#define N 140000
#define mod 1000000007
#define pp pair<ll, ll>
typedef long long int ll;
typedef long double ld;
#define MP make_pair
#define endl "\n"
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#define rrep(i, n) for (ll i ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,106 | 758,107 | u377572376 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,112 | 758,113 | u277153875 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl '\n'
#define F first
#define S second
#define mod (ll)998244353
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ios \
io... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl '\n'
#define F first
#define S second
#define mod (ll)998244353
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ios \
io... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 758,114 | 758,115 | u510221731 | cpp |
p02954 | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*** "ALHAMDULILLAH for Everything..." ***/
#include <bits/stdc++.h>
using namespace std;
#define fastt \
ios::sync_with_stdio(0);... | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*** "ALHAMDULILLAH for Everything..." ***/
#include <bits/stdc++.h>
using namespace std;
#define fastt \
ios::sync_with_stdio(0);... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 758,116 | 758,117 | u035712458 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define FOR(i, a, b) for (ll i = (a); i <= (b); ++i)
#defi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define FOR(i, a, b) for (ll i = (a); i <= (b); ++i)
#defi... | [
"expression.operation.binary.remove"
] | 758,118 | 758,119 | u444645674 | 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;
const int mod = 1e9 + 7;
string S;
int main() {
cin >> S;
vector<ll> ans(S.size());
rep(ri, 2) {
int cnt = 0;
rep(i, S.size()) {
if (S[i] == 'R')
... | #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;
const int mod = 1e9 + 7;
string S;
int main() {
cin >> S;
vector<ll> ans(S.size());
rep(ri, 2) {
int cnt = 0;
rep(i, S.size()) {
if (S[i] == 'R')
... | [
"assignment.change"
] | 758,129 | 758,130 | u455366471 | cpp |
p02954 | #include <bits/stdc++.h>
#define endl '\n'
#define fast_in \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mp make_pai... | #include <bits/stdc++.h>
#define endl '\n'
#define fast_in \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mp make_pai... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 758,131 | 758,132 | u922547438 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
vector<int> data(s.size(), 1);
ll right = 0;
ll left... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
vector<int> data(s.size(), 1);
ll right = 0;
ll left... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 758,135 | 758,136 | u169190252 | cpp |
p02954 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"identifier.change",
"call.arguments.change"
] | 758,139 | 758,140 | u809967037 | cpp |
p02954 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
co... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
co... | [
"assignment.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 758,162 | 758,163 | u322110493 | cpp |
p02954 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> ans(n);
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int i = 0; i < n; i++) {
if (S[i] == 'R') {
cnt++;
} else {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> ans(n);
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int i = 0; i < n; i++) {
if (S[i] == 'R') {
cnt++;
} else {
... | [
"control_flow.branch.else.add"
] | 758,170 | 758,171 | u963164554 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX 200010
#define lb lower_bound //[2,4)=lb(4)-lb(2);
/*
任意の場所にどのマス... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX 200010
#define lb lower_bound //[2,4)=lb(4)-lb(2);
/*
任意の場所にどのマス... | [
"assignment.change"
] | 758,184 | 758,185 | u711676593 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//実装面倒→ランレングス圧縮
int main() {
string s;
cin >> s;
vector<int> ans(s.length());
int firstR = 0; //島のはじめのRのインデックス
int firstL; //島のはじめのLのインデックス
rep(i, s.length() - 1) {
if (s[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//実装面倒→ランレングス圧縮
int main() {
string s;
cin >> s;
vector<int> ans(s.length());
int firstR = 0; //島のはじめのRのインデックス
int firstL; //島のはじめのLのインデックス
rep(i, s.length() - 1) {
if (s[i + 1] ... | [
"control_flow.branch.if.condition.change"
] | 758,193 | 758,194 | u650236619 | cpp |
p02954 | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | [] | 758,195 | 758,196 | u332253305 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 758,202 | 758,203 | u279033107 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | [
"control_flow.branch.if.condition.change"
] | 758,206 | 758,207 | u714564133 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> count(N, 0);
int R = 0;
int L = 0;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R') {
R++;
} else {
L++;
}
if (i == N - 2) {
if (S.at(i + 1) == 'R') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> count(N, 0);
int R = 0;
int L = 0;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'R') {
R++;
} else {
L++;
}
if (i == N - 2) {
if (S.at(i + 1) == 'R') {
... | [
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 758,220 | 758,221 | u710877960 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
s += 'R';
int pos = 0;
bool fr = true;
vector<int> cnt(n, 0);
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
if (fr) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
s += 'R';
int pos = 0;
bool fr = true;
vector<int> cnt(n, 0);
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
if (fr) {
... | [
"literal.string.change",
"io.output.change"
] | 758,228 | 758,229 | u415325136 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> num(s.size(), 1);
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'R' && s[i + 1] == 'R') {
num[i + 2] += num[i];
num[i] = 0;
}
}
for (int i = s.size(); i > 2; i--) {
if (s[i] == 'L' && ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> num(s.size(), 1);
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'R' && s[i + 1] == 'R') {
num[i + 2] += num[i];
num[i] = 0;
}
}
for (int i = s.size() - 1; i > 1; i--) {
if (s[i] == 'L'... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 758,232 | 758,233 | u440276250 | cpp |
p02954 | #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;
int main() {
string s;
cin >> s;
int n = s.size();
int l = 0;
int to[n];
rep(i, n) to[i] = -1;
for (int i = 1; i < n; i++) {
if (s[i] != 'R') {
fo... | #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;
int main() {
string s;
cin >> s;
int n = s.size();
int l = 0;
int to[n];
rep(i, n) to[i] = -1;
for (int i = 1; i < n; i++) {
if (s[i] != 'R') {
fo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,234 | 758,235 | u747602774 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
s += 'R';
int b[n] = {};
vector<int> a;
char c = s.at(0);
int d = 1;
for (int i = 0; i < n; i++) {
if (s.at(i + 1) == c)
d++;
else {
c = s.at(i + 1);
a.push_back(d);
d = 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
s += 'R';
int b[n] = {};
vector<int> a;
char c = s.at(0);
int d = 1;
for (int i = 0; i < n; i++) {
if (s.at(i + 1) == c)
d++;
else {
c = s.at(i + 1);
a.push_back(d);
d = 1;... | [
"expression.operation.binary.remove"
] | 758,238 | 758,239 | u298768617 | cpp |
p02954 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans[N];
for (int i = 0; i < N; i++) {
ans[i] = 0;
}
int p = 0, l = 0;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'R' && S[i + 1] == 'L') {
l = i - p;
if (l == 0) {
ans[i] +=... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans[N];
for (int i = 0; i < N; i++) {
ans[i] = 0;
}
int p = 0, l = 0;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'R' && S[i + 1] == 'L') {
l = i - p;
if (l == 0) {
ans[i] +=... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 758,260 | 758,261 | u154904553 | cpp |
p02954 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans[N];
for (int i = 0; i < N; i++) {
ans[i] = 0;
}
int p = 0, l = 0;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'R' && S[i + 1] == 'L') {
l = i - p;
if (l == 0) {
ans[i] +=... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans[N];
for (int i = 0; i < N; i++) {
ans[i] = 0;
}
int p = 0, l = 0;
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'R' && S[i + 1] == 'L') {
l = i - p;
if (l == 0) {
ans[i] +=... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.change"
] | 758,262 | 758,261 | u154904553 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
ll n = s.size();
vector<ll> num(n, 0);
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
for (ll j = i; j >= 0 && s[j] == 'R'; j--) {
num[i + ((i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
ll n = s.size();
vector<ll> num(n, 0);
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'R' && s[i + 1] == 'L') {
for (ll j = i; j >= 0 && s[j] == 'R'; j--) {
num[i + ((i ... | [] | 758,267 | 758,268 | u191114518 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ans[100010];
int main() {
string s;
cin >> s;
ll cnt = 0;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
cnt++;
} else {
ans[i] = cnt / 2;
ans[i - 1] = (cnt + 2 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll ans[100010];
int main() {
string s;
cin >> s;
ll cnt = 0;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
cnt++;
} else {
ans[i] += cnt / 2;
ans[i - 1] += (cnt + ... | [
"assignment.value.change"
] | 758,269 | 758,270 | u166378830 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
ll b[100010];
int main() {
string s;
cin >> s;
ll sum = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
sum++;
continue;
}
a[i - 1] = sum;
sum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
ll b[100010];
int main() {
string s;
cin >> s;
ll sum = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
sum++;
continue;
}
a[i - 1] = sum;
sum = ... | [
"io.output.change"
] | 758,271 | 758,272 | u166378830 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, a, b, c, d, e, f, g, h, p, q, r, fr, sc, tr, sz, tz, i, j, k,
mx = LLONG_MIN, mn = LLONG_MAX;
long long x = 0, y = 0, cnt = 0, res = 0, ttl = 0, ans = 0, sum = 0;
long long flg = 0, flag = 1, na = 0, as = 1;
vector<long long> u, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, a, b, c, d, e, f, g, h, p, q, r, fr, sc, tr, sz, tz, i, j, k,
mx = LLONG_MIN, mn = LLONG_MAX;
long long x = 0, y = 0, cnt = 0, res = 0, ttl = 0, ans = 0, sum = 0;
long long flg = 0, flag = 1, na = 0, as = 1;
vector<long long> u, ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 758,276 | 758,277 | u053980422 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"call.arguments.change",
"expres... | 758,278 | 758,279 | u832995587 | cpp |
p02954 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
using namespace std;
const int mm = 1e9;
int mp[100010], n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int len = s.size(), res = 0;
memset(mp, 0, sizeof mp);
for (int i = 0; i < len; i++) {
if (s[i] == 'R')
res++;
e... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
using namespace std;
const int mm = 1e9;
int mp[100010], n;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> s;
int len = s.size(), res = 0;
memset(mp, 0, sizeof mp);
for (int i = 0; i < len; i++) {
if (s[i] == 'R')
res++;
e... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,282 | 758,283 | u018679195 | cpp |
p02954 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string s;
cin >> s;
// 移動のステップ
vector<int> ans(s.size(), 0);
for (size_t i = 0; i < s.size(); i++) {
// L が出てくるまで進む
int l = 0;
while (s[i + l] != 'L') {
l++... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
string s;
cin >> s;
// 移動のステップ
vector<int> ans(s.size(), 0);
for (int i = 0; i < s.size(); i++) {
// L が出てくるまで進む
int l = 0;
while (s[i + l] != 'L') {
l++;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 758,286 | 758,287 | u789199225 | cpp |
p02954 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int i, idxR, idxL, cnt = 1;
cin >> s;
vector<int> v(s.length());
for (i = 1; i < s.length(); ++i) {
++cnt;
if (s[i - 1] == 'R' && s[i] == 'L') {
idxR = i - 1;
idxL = i;
v.at(i - 1) +=... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int i, idxR, idxL, cnt = 1;
cin >> s;
vector<int> v(s.length());
for (i = 1; i < s.length(); ++i) {
++cnt;
if (s[i - 1] == 'R' && s[i] == 'L') {
idxR = i - 1;
idxL = i;
v.at(i - 1) +=... | [
"expression.unary.arithmetic.remove"
] | 758,294 | 758,295 | u714732628 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#include "string"
int32_t main() {
boost;
string s;
cin >> s;
... | #include <bits/stdc++.h>
using namespace std;
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define int long long
#include "string"
int32_t main() {
boost;
string s;
cin >> s;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 758,300 | 758,301 | u371555975 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans[s.size()]{};
for (int i = 1; i < s.size(); i++)
if (s.substr(i - 1, 2) == "RL") {
int j = i - 1;
while (0 <= j && s[j] == 'R') {
ans[i - 1 + (i - j) % 2]++;
j--;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans[s.size()]{};
for (int i = 1; i < s.size(); i++)
if (s.substr(i - 1, 2) == "RL") {
int j = i - 1;
while (0 <= j && s[j] == 'R') {
ans[i - 1 + (i - 1 - j) % 2]++;
j--;
... | [
"expression.operation.binary.add"
] | 758,306 | 758,307 | u804999113 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll>;
#define all(v) v.begin(), v.end()
int main() {
string S;
cin >> S;
vll ans(S.size(), 0);
ll left = 0, right = 0;
rep(i, S.size()) {
if (S[i] == 'L')
left+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll>;
#define all(v) v.begin(), v.end()
int main() {
string S;
cin >> S;
vll ans(S.size(), 0);
ll left = 0, right = 0;
rep(i, S.size()) {
if (S[i] == 'L')
left+... | [
"expression.operation.binary.add"
] | 758,313 | 758,314 | u883725898 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = s.size();
vector<int> A = {-1};
for (int i = 0; i < N - 1; i++) {
if (s.at(i) == 'L' && s.at(i + 1) == 'R')
A.push_back(i);
}
A.push_back(N - 1);
vector<int> B = {};
for (int i = 0; i < N - 1; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = s.size();
vector<int> A = {-1};
for (int i = 0; i < N - 1; i++) {
if (s.at(i) == 'L' && s.at(i + 1) == 'R')
A.push_back(i);
}
A.push_back(N - 1);
vector<int> B = {};
for (int i = 0; i < N - 1; i++) {
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 758,328 | 758,329 | u101018317 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
int N = S.size();
vi is_lb(N, 0);
vi is_rb(N, 0);
vi is_lm(N, 0);
vi is_rm(N, 0);
for (int i = 0; i < N; i++)
if (i == 0 || (i... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
int N = S.size();
vi is_lb(N, 0);
vi is_rb(N, 0);
vi is_lm(N, 0);
vi is_rm(N, 0);
for (int i = 0; i < N; i++)
if (i == 0 || (i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 758,332 | 758,333 | u063962277 | cpp |
p02954 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
const ll INF = 100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r) {
if (n < r)
return 0;
if (r == 0 || r == n)
retu... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
const ll INF = 100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r) {
if (n < r)
return 0;
if (r == 0 || r == n)
retu... | [
"expression.operation.binary.add"
] | 758,334 | 758,335 | u750466050 | cpp |
p02954 | #include <iostream>
#include <map>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
string S;
cin >> S;
int len = S.size();
map<int, int> mii;
int mode = 1; // right:0 left:1
int cnt[2];
int kiPos = 0, guPos = 0;
cnt[0] = 0;
cnt[1] = 1;
rep(i, len) ... | #include <iostream>
#include <map>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
string S;
cin >> S;
int len = S.size();
map<int, int> mii;
int mode = 1; // right:0 left:1
int cnt[2];
int kiPos = 0, guPos = 0;
cnt[0] = 0;
cnt[1] = 0;
rep(i, len) ... | [
"literal.number.change",
"assignment.value.change"
] | 758,336 | 758,337 | u202260176 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 758,342 | 758,343 | u099619676 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
int size = S.size();
vector<int> ans(size + 1, 0);
int count = 1;
int tmp = 0;
S = S + 'a';
for (int i = 1; i <= size; i++) {
if (S[i - 1] != S[i] || i == size) {
if (S[i] == 'L') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
string S;
cin >> S;
int size = S.size();
vector<int> ans(size + 1, 0);
int count = 1;
int tmp = 0;
S = S + 'a';
for (int i = 1; i <= size; i++) {
if (S[i - 1] != S[i] || i == size) {
if (S[i] == 'L') {
... | [
"io.output.change"
] | 758,349 | 758,350 | u231455327 | cpp |
p02954 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
int ans[n] = {0};
repi(ri, 2, 0) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
int ans[n] = {0};
repi(ri, 2, 0) {
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 758,357 | 758,358 | u187013893 | cpp |
p02954 | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | [
"control_flow.branch.if.condition.change"
] | 758,361 | 758,362 | u334644046 | cpp |
p02954 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,366 | 758,367 | u700484101 | cpp |
p02954 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 758,368 | 758,367 | u700484101 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
char left = 'R';
int num = 1;
int i = 1;
int x;
while (i < n) {
if (left == 'R') {
if (s[i] == left)
num++;
else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[i] = 0;
char left = 'R';
int num = 1;
int i = 1;
int x;
while (i < n) {
if (left == 'R') {
if (s[i] == left)
num++;
else {... | [
"assignment.value.change"
] | 758,371 | 758,372 | u105533331 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 758,381 | 758,382 | u917049698 | cpp |
p02954 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int ... | [
"expression.operation.binary.remove"
] | 758,390 | 758,391 | u104057163 | cpp |
p02954 | // AtCoder template
// sabaより胡蝶しのぶさんの方が可愛いのではないか？
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
vector<int> ans(n, 0);
int odd = 0, even = 0;
... | // AtCoder template
// sabaより胡蝶しのぶさんの方が可愛いのではないか？
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
vector<int> ans(n, 0);
int odd = 0, even = 0;
... | [
"expression.operation.binary.remove"
] | 758,394 | 758,395 | u083190434 | cpp |
p02954 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
retu... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
retu... | [
"assignment.change"
] | 758,406 | 758,407 | u748577909 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size();) {
int x = i;
while (S.at(i + 1) == 'R') {
cout << "0 ";
i++;
}
int y = i;
while (i < S.size() - 1 && S.at(i + 1) == 'L')
i++;
cout << (y - x + 2) / 2 + (i - y) / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size();) {
int x = i;
while (S.at(i + 1) == 'R') {
cout << "0 ";
i++;
}
int y = i;
while (i < S.size() - 1 && S.at(i + 1) == 'L')
i++;
cout << (y - x + 2) / 2 + (i - y) / ... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 758,415 | 758,416 | u820224016 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> v;
int count = 0;
char tmp = 'R';
for (int i = 0; i < n; i++) {
if (tmp == s.at(i))
count++;
else {
tmp = s.at(i);
v.push_back(count);
count = 1;
}
}
v.push... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> v;
int count = 0;
char tmp = 'R';
for (int i = 0; i < n; i++) {
if (tmp == s.at(i))
count++;
else {
tmp = s.at(i);
v.push_back(count);
count = 1;
}
}
v.push... | [
"io.output.change"
] | 758,422 | 758,423 | u013069672 | cpp |
p02954 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> last(n);
int R_count = 1;
int L_count;
int r;
int l;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'R' && s[i + 1] =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> last(n);
int R_count = 1;
int L_count;
int r;
int l;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'R' && s[i + 1] =... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 758,428 | 758,429 | u614128939 | cpp |
p02954 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,430 | 758,431 | u858670323 | cpp |
p02954 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int... | [] | 758,438 | 758,439 | u942393279 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,451 | 758,452 | u132364782 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | [
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,453 | 758,452 | u132364782 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
string S;
cin >> S;
int n;
n = S.size();
vector<int> ans(n);
int cnt = 0;
rep(i, n) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 758,454 | 758,452 | u132364782 | cpp |
p02954 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 758,466 | 758,467 | u347057617 | cpp |
p02954 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | [] | 758,470 | 758,471 | u811004127 | cpp |
p02954 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | [
"assignment.change"
] | 758,472 | 758,471 | u811004127 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.