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 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d;
string s;
int dem;
int main() {
cin >> n >> a >> b >> c >> d;
cin >> s;
s = " " + s;
if (c < d) {
for (int i = a; i <= d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No";
return 0;
}
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d;
string s;
int dem;
int main() {
cin >> n >> a >> b >> c >> d;
cin >> s;
s = " " + s;
if (c < d) {
for (int i = a; i <= d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No";
return 0;
}
}
cout <<... | [
"control_flow.loop.for.initializer.change"
] | 831,326 | 831,325 | u185917548 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,330 | 831,331 | u108124198 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,332 | 831,331 | u108124198 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,333 | 831,331 | u108124198 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,334 | 831,331 | u108124198 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"identifier.change",
"call.function.change"
] | 831,335 | 831,331 | u108124198 | cpp |
p03017 | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | //#include<stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f_(i, a, b) for (int i = a; i >= b; i--)
#define f(i, a, b) for (int i = a; i <= b; i++)
int n, a, b, c, d;
string s;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
// scanf("%d %d %d %d %d", &n, &a,... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 831,336 | 831,331 | u108124198 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change"
] | 831,346 | 831,347 | u153390822 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 831,348 | 831,347 | u153390822 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 831,349 | 831,347 | u153390822 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No";
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i] == S[i + 1... | #include <iostream>
using namespace std;
int main() {
long long int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No";
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i] == S[i + 1... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 831,357 | 831,358 | u773499055 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c; i++) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == s[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c; i++) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == s[i... | [
"control_flow.loop.for.initializer.change"
] | 831,359 | 831,360 | u799165954 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,361 | 831,362 | u722777218 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
int const MAXN = 2e5 + 10;
char arr[MAXN];
bool move_check(int init, int ending) {
if (init == ending)
return true;
while (true) {
init++;
if (init == ending)
break;
if (a... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
int const MAXN = 2e5 + 10;
char arr[MAXN];
bool move_check(int init, int ending) {
if (init == ending)
return true;
while (true) {
init++;
if (init == ending)
break;
if (a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 831,374 | 831,375 | u562777854 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, startA, startB, endA, endB;
string str;
cin >> n >> startA >> startB >> endA >> endB;
cin >> str;
string result = "YES";
if (endB < endA) {
int point = str.find("...", startB - 2);
if (point == -1 || point > endB - 2)... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, startA, startB, endA, endB;
string str;
cin >> n >> startA >> startB >> endA >> endB;
cin >> str;
string result = "Yes";
if (endB < endA) {
int point = str.find("...", startB - 2);
if (point == -1 || point > endB - 2)... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 831,376 | 831,377 | u914384129 | cpp |
p03017 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | [
"expression.operation.binary.add"
] | 831,380 | 831,381 | u495267515 | cpp |
p03017 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | [
"expression.operation.binary.add"
] | 831,383 | 831,381 | u495267515 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a, b) accumulate(all(a), b)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a, b) accumulate(all(a), b)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i... | [
"expression.operation.binary.add"
] | 831,397 | 831,398 | u994831328 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, e;
string s;
bool ok = true;
int main() {
cin >> n >> a >> b >> c >> d >> s;
e = max(c, d) - 1;
for (int i = a; i < e; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
ok = false;
for (int i = b - 1; i < d ... | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, e;
string s;
bool ok = true;
int main() {
cin >> n >> a >> b >> c >> d >> s;
e = max(c, d) - 1;
for (int i = a; i < e; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
ok = false;
for (int i = b - 2; i < d ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,408 | 831,409 | u309985845 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define REPB(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define REPB1(i, n) for (long long i = (n); i > 0; i--)
#define ITE(arr) for (auto ite = (arr).begin(); ite ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define REPB(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define REPB1(i, n) for (long long i = (n); i > 0; i--)
#define ITE(arr) for (auto ite = (arr).begin(); ite ... | [
"control_flow.loop.for.initializer.change"
] | 831,417 | 831,418 | u786318703 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,435 | 831,436 | u728702354 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 831,437 | 831,436 | u728702354 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 831,438 | 831,436 | u728702354 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | #include <bits/stdc++.h>
using namespace std;
bool judge(bool AC, bool BD) {
if (AC && BD)
return true;
else
return false;
}
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool flagAC = true;
bool flagBD = true;
if (C < B) {
for (int i = A - 1; i < C - 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 831,439 | 831,436 | u728702354 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string S;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
// snuke able
int cnt = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
cnt++;
} else
cnt = 0;
... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string S;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
// snuke able
int cnt = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
cnt++;
} else
cnt = 0;
... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,452 | 831,453 | u107077805 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(string s, char delim) {
int len = s.length();
string currStr = "";
vector<string> retVec;
for (int i = 0; i < len; i++) {
char ch = s[i];
if (ch... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(string s, char delim) {
int len = s.length();
string currStr = "";
vector<string> retVec;
for (int i = 0; i < len; i++) {
char ch = s[i];
if (ch... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,459 | 831,460 | u989996503 | cpp |
p03017 | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | // Notes -- Should have done these:
// 1. Pad "#" to beginning and end of the given string -> No need to think hard
// about off-by-1 indices
// 2. Also no need to handle boundary condition (e.g., when B stays at its
// beginning position, and A jumps over B, no need max(0, b - 2))
#include <iostream>
#include <string>... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,467 | 831,469 | u477824229 | cpp |
p03017 | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | // Notes -- Should have done these:
// 1. Pad "#" to beginning and end of the given string -> No need to think hard
// about off-by-1 indices
// 2. Also no need to handle boundary condition (e.g., when B stays at its
// beginning position, and A jumps over B, no need max(0, b - 2))
#include <iostream>
#include <string>... | [
"control_flow.loop.for.initializer.change",
"call.add",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 831,470 | 831,469 | u477824229 | cpp |
p03017 | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,467 | 831,471 | u477824229 | cpp |
p03017 | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | // Example program
#include <iostream>
#include <string>
using namespace std;
int n, a, b, c, d;
string s;
bool solve_simple(string &s, int x, int y) {
for (int i = x; i < y - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool can_skip(string &s, int a, int b, i... | [
"control_flow.loop.for.initializer.change",
"call.add",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 831,470 | 831,471 | u477824229 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
long long read() {
char ch = getchar();
long long x = 0, ff = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return x * ff;
}
void write(long lon... | #include <bits/stdc++.h>
using namespace std;
long long read() {
char ch = getchar();
long long x = 0, ff = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
ff = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return x * ff;
}
void write(long lon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,475 | 831,477 | u098142718 | cpp |
p03017 | #include <bits/stdc++.h>
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 < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((A < i && i < C) || (B < i && i < D)) {
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
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 < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((A < i && i < C) || (B < i && i < D)) {
cout << "No" << endl;
return 0;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,478 | 831,479 | u840810569 | cpp |
p03017 | #include <bits/stdc++.h>
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 < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((A < i && i < C) || (B < i && i < D)) {
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
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 < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((A < i && i < C) || (B < i && i < D)) {
cout << "No" << endl;
return 0;
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,480 | 831,479 | u840810569 | cpp |
p03017 | /*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll ve... | /*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll ve... | [
"misc.typo",
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,493 | 831,494 | u216557283 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define Mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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] && s[i] == '#') {
cout... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define Mod 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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] && s[i] == '#') {
cout... | [
"control_flow.loop.for.initializer.change"
] | 831,513 | 831,514 | u158165654 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = 0; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,518 | 831,516 | u265249432 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = 0; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,519 | 831,516 | u265249432 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = 0; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,520 | 831,516 | u265249432 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = 0; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,521 | 831,516 | u265249432 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = 0; i < min(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 2連続の岩がゴールより手前にあったらアウト
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
re... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.... | 831,522 | 831,516 | u265249432 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
string str;
bool check2 = 0, check3 = 0;
cin >> N >> A >> B >> C >> D;
cin >> str;
int i;
for (i = A - 1; i < C - 1; i++) {
if ((str[i] == '#') && (str[i + 1] == '#')) {
check2 = 1... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
string str;
bool check2 = 0, check3 = 0;
cin >> N >> A >> B >> C >> D;
cin >> str;
int i;
for (i = A - 1; i < C - 1; i++) {
if ((str[i] == '#') && (str[i + 1] == '#')) {
check2 = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,536 | 831,538 | u453235374 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
string str;
bool check2 = 0, check3 = 0;
cin >> N >> A >> B >> C >> D;
cin >> str;
int i;
for (i = A - 1; i < C - 1; i++) {
if ((str[i] == '#') && (str[i + 1] == '#')) {
check2 = 1... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
string str;
bool check2 = 0, check3 = 0;
cin >> N >> A >> B >> C >> D;
cin >> str;
int i;
for (i = A - 1; i < C - 1; i++) {
if ((str[i] == '#') && (str[i + 1] == '#')) {
check2 = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,540 | 831,538 | u453235374 | cpp |
p03017 | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,542 | 831,543 | u346193734 | cpp |
p03017 | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,546 | 831,543 | u346193734 | cpp |
p03017 | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
int main() {
int n, a, b, c, d;
cin >... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 831,547 | 831,543 | u346193734 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 10000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 10000... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,548 | 831,549 | u901561754 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mn = min(c, d) - 1;
int mx = max(c, d) - 1;
//? ~~ A ~ C,D ~ C,D ~~ ?
// 0 ~~ a-1 ~ mn ~ mx ~~ length()-1
//連続した##のとき除外
for (int i = a; i <= mx - 1; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mn = min(c, d) - 1;
int mx = max(c, d) - 1;
//? ~~ A ? ~ B ? ~ C,D ~ C,D ~~ ?
// 0 ~~ a-1 a ~ b-1 b ~ mn ~ mx ~~ length()-1
//連続した##のとき除外
for (int i = a; i < mx; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 831,551 | 831,553 | u948459352 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mn = min(c, d) - 1;
int mx = max(c, d) - 1;
//? ~~ A ~ C,D ~ C,D ~~ ?
// 0 ~~ a-1 ~ mn ~ mx ~~ length()-1
//連続した##のとき除外
for (int i = a; i <= mx - 1; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mn = min(c, d) - 1;
int mx = max(c, d) - 1;
//? ~~ A ? ~ B ? ~ C,D ~ C,D ~~ ?
// 0 ~~ a-1 a ~ b-1 b ~ mn ~ mx ~~ length()-1
//連続した##のとき除外
for (int i = a; i < mx; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 831,551 | 831,554 | u948459352 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A, --B, --C, --D;
string S;
cin >> S;
auto checkRoute = [&S](int from, int to) {
for (int i = from; i < to; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A, --B, --C, --D;
string S;
cin >> S;
auto checkRoute = [&S](int from, int to) {
for (int i = from; i < to; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,558 | 831,559 | u762603420 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
// #define ll long long int
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string path;
cin >> path;
int f = 1;
int k = max(c, d);
for (int i = a - 1; i < n - 1 && i... | #include <bits/stdc++.h>
using namespace std;
// #define ll long long int
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string path;
cin >> path;
int f = 1;
int k = max(c, d);
for (int i = a - 1; i < n - 1 && i... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 831,560 | 831,561 | u060049558 | cpp |
p03017 | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | [
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 831,582 | 831,583 | u285660186 | cpp |
p03017 | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,584 | 831,583 | u285660186 | cpp |
p03017 | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | // finish date: 2019/06/03
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vecto... | [
"expression.operation.binary.remove"
] | 831,585 | 831,583 | u285660186 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline boo... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline boo... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,598 | 831,599 | u901397311 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,603 | 831,604 | u666394517 | cpp |
p03017 | #include "bits/stdc++.h"
typedef long long int lli;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" ... | #include "bits/stdc++.h"
typedef long long int lli;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,608 | 831,609 | u294738119 | cpp |
p03017 | #include "bits/stdc++.h"
typedef long long int lli;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" ... | #include "bits/stdc++.h"
typedef long long int lli;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,611 | 831,609 | u294738119 | cpp |
p03017 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,618 | 831,619 | u834777932 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool has_target(string s, int from, int to, string target) {
auto x = s.find(target, from);
// printf("has_target %d, %d\n", x, string::npos);
if (x == string::npos) {
retu... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool has_target(string s, int from, int to, string target) {
auto x = s.find(target, from);
// printf("has_target %d, %d, %s\n", x, to, target.c_str());
if (x == string::npos) ... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,625 | 831,626 | u590241855 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool has_target(string s, int from, int to, string target) {
auto x = s.find(target, from);
// printf("has_target %d, %d\n", x, string::npos);
if (x == string::npos) {
retu... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool has_target(string s, int from, int to, string target) {
auto x = s.find(target, from);
// printf("has_target %d, %d, %s\n", x, to, target.c_str());
if (x == string::npos) ... | [
"call.arguments.change",
"call.arguments.add"
] | 831,627 | 831,626 | u590241855 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "#" + s + "#";
auto can_jump = [&](int start, int goal) {
for (int i = start; i + 1 <= goal; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
re... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "#" + s + "#";
auto can_jump = [&](int start, int goal) {
for (int i = start; i + 1 <= goal; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
... | [] | 831,628 | 831,629 | u993967581 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utili... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utili... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,639 | 831,640 | u406158207 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utili... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utili... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,641 | 831,640 | u406158207 | cpp |
p03017 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,645 | 831,646 | u190907730 | cpp |
p03017 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"identifier.change",
"call.arguments.change"
] | 831,647 | 831,646 | u190907730 | cpp |
p03017 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int N, A, B, C, D;
string S;
bool pos(int a, int b) {
if (b - 2 <= a) {
return true;
} else if (S[a + 1] == '.') {
return pos(a + 2... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int N, A, B, C, D;
string S;
bool pos(int a, int b) {
if (b - 2 <= a) {
return true;
} else if (S[a + 1] == '.') {
return pos(a + 2... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,652 | 831,653 | u086366728 | cpp |
p03017 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 831,656 | 831,657 | u706730549 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, A, B, C, D;
char S[200010] = {};
bool flag = true;
bool flag2 = false;
int main()... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, A, B, C, D;
char S[200010] = {};
bool flag = true;
bool flag2 = false;
int main()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"literal.string.change"
] | 831,658 | 831,659 | u364497081 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, A, B, C, D;
char S[200010] = {};
bool flag = true;
bool flag2 = false;
int main()... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, A, B, C, D;
char S[200010] = {};
bool flag = true;
bool flag2 = false;
int main()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 831,660 | 831,659 | u364497081 | cpp |
p03017 | #include "bits/stdc++.h"
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
#define ll long long
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define rc(s) return cout << s, 0
#define rcg(s) ... | #include "bits/stdc++.h"
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
#define ll long long
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define rc(s) return cout << s, 0
#define rcg(s) ... | [
"expression.operator.compare.change"
] | 831,667 | 831,668 | u288444854 | cpp |
p03017 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,692 | 831,693 | u457283867 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a = a - 1;
b = b ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a = a - 1;
b = b ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,696 | 831,697 | u127768253 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, a, b, c, d;
string s;
int ch(int i, int j) {
for (int x = i; x < j; x++)
if (s[x] == '#' && s[x + 1] == '#')
return 0;
return 1;
}
int main() {
cin >> n >> a >> b >> c >> d >> s;
// cout<<s;
a--;
b--;
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, a, b, c, d;
string s;
int ch(int i, int j) {
for (int x = i; x < j; x++)
if (s[x] == '#' && s[x + 1] == '#')
return 0;
return 1;
}
int main() {
cin >> n >> a >> b >> c >> d >> s;
// cout<<s;
a--;
b--;
... | [
"control_flow.loop.for.initializer.change"
] | 831,705 | 831,706 | u095884941 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, a, b, c, d;
string s;
int ch(int i, int j) {
for (int x = i; x < j; x++)
if (s[x] == '#' && s[x + 1] == '#')
return 0;
return 1;
}
int main() {
cin >> n >> a >> b >> c >> d >> s;
// cout<<s;
a--;
b--;
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, a, b, c, d;
string s;
int ch(int i, int j) {
for (int x = i; x < j; x++)
if (s[x] == '#' && s[x + 1] == '#')
return 0;
return 1;
}
int main() {
cin >> n >> a >> b >> c >> d >> s;
// cout<<s;
a--;
b--;
... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,707 | 831,706 | u095884941 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
#define... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
#define... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,714 | 831,715 | u386769326 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B, C, D;
string S;
int main() {
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
bool sn_ok = true;
bool fn_ok = true;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, A, B, C, D;
string S;
int main() {
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
bool sn_ok = true;
bool fn_ok = true;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] ... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,725 | 831,724 | u489053642 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 200000 + 5;
char aa[maxn];
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
getchar();
cin >> aa[1];
char ss = aa[1];
int te = 0;
int la = max(c, d);
for (int i = 2; i <= n; i++) {
cin >> aa[i];
if... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 200000 + 5;
char aa[maxn];
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
getchar();
cin >> aa[1];
char ss = aa[1];
int te = 0;
int la = max(c, d);
for (int i = 2; i <= n; i++) {
cin >> aa[i];
if... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,728 | 831,729 | u249468506 | cpp |
p03017 | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | [
"expression.operation.binary.remove"
] | 831,733 | 831,734 | u453412459 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"expression.operation.binary.add"
] | 831,735 | 831,736 | u366676780 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"expression.operation.binary.remove"
] | 831,737 | 831,736 | u366676780 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | [
"expression.operation.binary.remove"
] | 831,738 | 831,739 | u152129372 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | [
"expression.operation.binary.add"
] | 831,740 | 831,739 | u152129372 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
char s[N];
int main() {
int n, a, b, c, d;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
for (int i = a + 1; i <= max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
printf("NO\n");
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
char s[N];
int main() {
int n, a, b, c, d;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
for (int i = a + 1; i <= max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
printf("No\n");
return 0;
}
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 831,750 | 831,751 | u593031180 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; 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"
] | 831,754 | 831,755 | u134519179 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 831,756 | 831,755 | u134519179 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = 0; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"identifier.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 831,757 | 831,755 | u134519179 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = 0; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 831,758 | 831,755 | u134519179 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = B; i < ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = B; i < ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 831,767 | 831,768 | u003080851 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// a
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (int i = a; i + 1 <... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// a
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (int i = a; i + 1 <... | [
"control_flow.loop.for.initializer.change"
] | 831,769 | 831,770 | u817760251 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(i, 1, (n))
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(i, 1, (n))
#define pb pu... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,775 | 831,776 | u157886944 | cpp |
p03017 | //#include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#in... | //#include "bits/stdc++.h"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <tuple>
#in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,780 | 831,781 | u810724221 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d;
bool solve() {
int i, j;
string str;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> str;
if (c > d) {
int f = 0;
for (i = b - 1, j = 0; i <= d; i++) {
if (str[i] == '.')
j++;
else
j = 0;
... | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d;
bool solve() {
int i, j;
string str;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> str;
if (c > d) {
int f = 0;
for (i = b - 1, j = 0; i <= d + 1; i++) {
if (str[i] == '.')
j++;
else
j = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,797 | 831,798 | u309112964 | cpp |
p03017 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#inclu... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 831,799 | 831,800 | u922299738 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
#define ll long long int
#define io \
ios_base::sync_with_stdio(false); ... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,809 | 831,810 | u445107674 | cpp |
p03017 | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,811 | 831,812 | u379822620 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 99991;
const int maxn = 200007;
char vis[maxn];
int main() {
int n, a, b, c, d, flag = 0;
cin >> n >> a >> b ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 99991;
const int maxn = 200007;
char vis[maxn];
int main() {
int n, a, b, c, d, flag = 0;
cin >> n >> a >> b ... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,815 | 831,816 | u130934466 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"expression.operation.binary.remove"
] | 831,817 | 831,818 | u472675932 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 831,823 | 831,824 | u532573979 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
int i, j;
int goal = max(c, d);
for (i = a + 1; i <= goal; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
int i, j;
int goal = max(c, d);
for (i = a + 1; i <= goal; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,825 | 831,826 | u216374186 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, vec) \
VL(vec)(n); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, vec) \
VL(vec)(n); ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 831,827 | 831,828 | u423624748 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.