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 |
|---|---|---|---|---|---|---|---|
p03017 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,304 | 830,305 | u136342563 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j, n) for (i = j; i < (n); i++)
#define rrep(i, j, n) for (i = j; i > (n); i--)
typedef long long int ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j, n) for (i = j; i < (n); i++)
#define rrep(i, j, n) for (i = j; i > (n); i--)
typedef long long int ... | [
"assignment.change"
] | 830,308 | 830,309 | u744607340 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector... | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 830,320 | 830,321 | u215268883 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
c... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
c... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,322 | 830,323 | u252348942 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool ok = true;
for (in... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool ok = true;
for (in... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,326 | 830,327 | u031178961 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout <... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,333 | 830,334 | u774202056 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout <... | [
"control_flow.loop.for.initializer.change"
] | 830,335 | 830,334 | u774202056 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,341 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,343 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,344 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
//最大公約数
int gcd(int s, int b) {
if (b == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
//最大公約数
int gcd(int s, int b) {
if (b == 0)
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,355 | 830,356 | u686352452 | cpp |
p03017 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CO... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CO... | [
"control_flow.loop.for.condition.change"
] | 830,361 | 830,362 | u156778176 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,366 | 830,367 | u995725911 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 830,370 | 830,371 | u322177979 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,372 | 830,371 | u322177979 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int N;
int A, B, C, D;
string S;
bool possi(int a, int b) {
bool res = true;
for (int i = a + 1; i < b; i++) {
if (S[i] == S[i + 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int N;
int A, B, C, D;
string S;
bool possi(int a, int b) {
bool res = true;
for (int i = a + 1; i < b; i++) {
if (S[i] == S[i + 1... | [
"variable_declaration.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,379 | 830,378 | u797165415 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <un... | [
"identifier.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,404 | 830,405 | u293523151 | cpp |
p03017 | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
... | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
... | [
"assignment.change"
] | 830,406 | 830,407 | u899220667 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a > b) ? b : a; }
int main() {
int n, a, b, c, d, st, en;
string s;
bool f = true, can_c = false;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
e... | #include <iostream>
#include <string>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a > b) ? b : a; }
int main() {
int n, a, b, c, d, st, en;
string s;
bool f = true, can_c = false;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
e... | [
"control_flow.loop.for.condition.change"
] | 830,449 | 830,450 | u352248517 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [
"control_flow.loop.for.initializer.change"
] | 830,455 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 830,457 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 830,458 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,459 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,460 | 830,456 | u991846372 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,474 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,476 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d) - 1; h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 830,477 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d) + 1; h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 830,478 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 830,480 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 830,481 | 830,475 | u986568278 | cpp |
p03017 | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy... | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,484 | 830,485 | u644568158 | cpp |
p03017 | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy... | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,486 | 830,485 | u644568158 | cpp |
p03017 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,497 | 830,498 | u147049801 | cpp |
p03017 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,499 | 830,498 | u147049801 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '#' + s + '#';
bool gyaku = a < b == c < d;
for (int i = max(a, b); i < min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
gyak... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '#' + s + '#';
bool gyaku = a < b == c < d;
for (int i = max(a, b); i <= min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
gya... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,500 | 830,501 | u412908746 | cpp |
p03017 | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define... | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define... | [
"control_flow.loop.for.initializer.change"
] | 830,502 | 830,503 | u385825353 | cpp |
p03017 | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define... | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.o... | 830,502 | 830,504 | u385825353 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
... | [
"control_flow.loop.for.condition.change"
] | 830,505 | 830,506 | u629133942 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i <= d; i++) {
if (rock) {
... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,507 | 830,506 | u629133942 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i ... | [
"call.arguments.change"
] | 830,512 | 830,513 | u547448704 | cpp |
p03017 | #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)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | #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)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,539 | 830,540 | u824337972 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i < d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,545 | 830,546 | u125051909 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i < d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,547 | 830,546 | u125051909 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool valid(int x, int y, string &s) {
for (int i = x; i + 1 <= y; ++i) {
if (s[i] == '#' and s[i + 1] == '#')
return false;
}
return true;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
bool valid(int x, int y, string &s) {
for (int i = x; i + 1 <= y; ++i) {
if (s[i] == '#' and s[i + 1] == '#')
return false;
}
return true;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,548 | 830,549 | u318334550 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace s... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace s... | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,563 | 830,564 | u493750228 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
const long long INF = MOD * MOD;
typedef pair<int, int> P;
typedef long long ll;
ll n, m, k, ans;
string s;
main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
const long long INF = MOD * MOD;
typedef pair<int, int> P;
typedef long long ll;
ll n, m, k, ans;
string s;
main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,568 | 830,569 | u974214237 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < min(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ba... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ba... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,581 | 830,580 | u409373192 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < min(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ba... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ba... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 830,582 | 830,580 | u409373192 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,585 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [] | 830,587 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [
"expression.operation.binary.add"
] | 830,589 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [
"expression.operation.binary.add"
] | 830,590 | 830,586 | u888094685 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = true;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b - 1; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = true;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b - 1; i ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,595 | 830,596 | u415325136 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
int len = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
int len = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
... | [
"control_flow.loop.for.initializer.change"
] | 830,597 | 830,598 | u243961437 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = 1;
for (int i = A; i < C; i++) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = 1;
for (int i = A; i < C; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,599 | 830,600 | u243961437 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"expression.operation.binary.add"
] | 830,619 | 830,620 | u517411077 | cpp |
p03017 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"control_flow.loop.for.initializer.change"
] | 830,631 | 830,632 | u031448582 | cpp |
p03017 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,633 | 830,634 | u031448582 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.... | [
"expression.operation.binary.remove"
] | 830,645 | 830,646 | u026620445 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,647 | 830,648 | u625741705 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,649 | 830,650 | u612271542 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,651 | 830,650 | u612271542 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 830,661 | 830,662 | u568545273 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D... | [
"misc.opposites",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 830,663 | 830,662 | u568545273 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool Check(string &L, int s, int g) {
s--;
g--;
bool ans = true;
for (int i = s +... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool Check(string &L, int s, int g) {
s--;
g--;
bool ans = true;
for (int i = s +... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,672 | 830,673 | u924785929 | cpp |
p03017 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,681 | 830,682 | u340293807 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,692 | 830,693 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,694 | 830,693 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,695 | 830,696 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 830,697 | 830,696 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 830,698 | 830,696 | u298620933 | cpp |
p03017 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | [
"control_flow.loop.for.initializer.change"
] | 830,702 | 830,703 | u845000384 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return... | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,710 | 830,711 | u879099684 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return... | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,712 | 830,711 | u879099684 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,715 | 830,716 | u988961969 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,717 | 830,716 | u988961969 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void AGC034A() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void AGC034A() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
... | [
"control_flow.loop.for.initializer.change"
] | 830,718 | 830,719 | u227117171 | cpp |
p03017 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, e) for (int i = 0; i < (int)(e); i++)
#define reps(i, s, e) for (int i = s; i < (int)(e); i++)
#define repr(i, s, e) for (int i = s; i > (int)(e); i--)
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n, a, b, c, d;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, e) for (int i = 0; i < (int)(e); i++)
#define reps(i, s, e) for (int i = s; i < (int)(e); i++)
#define repr(i, s, e) for (int i = s; i > (int)(e); i--)
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n, a, b, c, d;
c... | [
"expression.operation.binary.remove"
] | 830,720 | 830,721 | u694859623 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
// 034
int main() {
ll N, A, B, C, D;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
// 034
int main() {
ll N, A, B, C, D;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 830,727 | 830,728 | u572472538 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
bool sort_pair(std::pair<int64_t, std::string> origin,
std::pair<int64_t, std::string> another) {
return origin.first < another.first;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
bool sort_pair(std::pair<int64_t, std::string> origin,
std::pair<int64_t, std::string> another) {
return origin.first < another.first;... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 830,729 | 830,730 | u184115330 | cpp |
p03017 | #include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
char S[200000];
bool can = true;
bool space3 = false;
string ans;
rep(i, N) cin >> S[i];
if (C < D) {
for (int i = A - 1;... | #include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
char S[200000];
bool can = true;
bool space3 = false;
string ans;
rep(i, N) cin >> S[i];
if (C < D) {
for (int i = A - 1;... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,731 | 830,732 | u637834578 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,743 | 830,744 | u981890679 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 830,745 | 830,746 | u007567244 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,747 | 830,746 | u007567244 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,755 | 830,756 | u601444374 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,757 | 830,756 | u601444374 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,776 | 830,777 | u422633119 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll d = 1000000000;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = true;
bool flag5 = false; //初めのBの位置の前からDまでに.が３連続以上あるか
if (C > D) {
//#の連続数をカウント
for (int i = A; i < C - 1; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll d = 1000000000;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = true;
bool flag5 = false; //初めのBの位置の前からDまでに.が３連続以上あるか
if (C > D) {
//#の連続数をカウント
for (int i = A; i < C - 1; i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,793 | 830,794 | u037276799 | cpp |
p03017 | #include <bits/stdc++.h> // ver1.8
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define r... | #include <bits/stdc++.h> // ver1.8
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define r... | [
"expression.operation.binary.add"
] | 830,797 | 830,798 | u095453583 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
retur... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
retur... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,801 | 830,802 | u401900157 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,803 | 830,804 | u050428930 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 830,805 | 830,804 | u050428930 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 830,806 | 830,804 | u050428930 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,809 | 830,810 | u926416331 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,811 | 830,810 | u926416331 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | [
"expression.operation.binary.add"
] | 830,812 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | [
"control_flow.branch.if.condition.change"
] | 830,814 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,815 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= ... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= ... | [
"expression.operation.binary.add"
] | 830,816 | 830,817 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
if (b < a) {
bool ans = false;
for (int i = a + 2; i <= c;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
if (b < a) {
bool ans = false;
for (int i = a + 1; i <= c ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,818 | 830,819 | u166378830 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.