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;
#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); ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 831,829 | 831,828 | u423624748 | cpp |
p03017 | #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v... | #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,832 | 831,833 | u535555850 | cpp |
p03017 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,841 | 831,842 | u534998883 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B;... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,843 | 831,844 | u036411476 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B;... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,845 | 831,844 | u036411476 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
t... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 831,863 | 831,864 | u997325490 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,874 | 831,875 | u014617387 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 831,876 | 831,875 | u014617387 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 831,877 | 831,875 | u014617387 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000000000
#define mod 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int g... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000000000
#define mod 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int g... | [
"control_flow.loop.for.initializer.change"
] | 831,878 | 831,879 | u452009494 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (C < D) {
for (int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (C < D) {
for (int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,880 | 831,881 | u055685044 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (C < D) {
for (int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (C < D) {
for (int ... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,882 | 831,881 | u055685044 | cpp |
p03017 | /*
بسم الله الرحمن الرحیم
(; طلا یک جهانی
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
for (int i = a; i < c; i++)
if (s[i] == '#'... | /*
بسم الله الرحمن الرحیم
(; طلا یک جهانی
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
for (int i = a; i < c; i++)
if (s[i] == '#'... | [
"control_flow.loop.for.initializer.change"
] | 831,885 | 831,886 | u763582125 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
static const ll mod = 1000003;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
static const ll mod = 1000003;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
b... | [
"control_flow.loop.for.initializer.change"
] | 831,889 | 831,890 | u603234915 | 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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout <<... | #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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout <<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,891 | 831,892 | u013408661 | 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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout <<... | #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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout <<... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,893 | 831,892 | u013408661 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,908 | 831,909 | u539339654 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, i, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "." + s + ".";
for (i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
exit(0);
}
}
if (c < d) {
cout << "Yes" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, i, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "." + s + ".";
for (i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
exit(0);
}
}
if (c < d) {
cout << "Yes" << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,910 | 831,911 | u713421499 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scan... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scan... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 831,912 | 831,913 | u619248223 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scan... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scan... | [
"assignment.add",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 831,914 | 831,913 | u619248223 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 831,921 | 831,922 | u035969230 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 831,927 | 831,928 | u521389909 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,929 | 831,930 | u279196402 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,931 | 831,932 | u634743753 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precisi... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precisi... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,937 | 831,938 | u995792346 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 831,939 | 831,940 | u054652697 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
typedef long long ll;
using namespace std;
const int N = 400010;
int n, A, B, C, D;
char s[N];
int main() {
scanf("%d%d%d%d%d%s", &n, &A, &B, &C, &D, s + 1);
bool flag = 0;
rep(i, ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
typedef long long ll;
using namespace std;
const int N = 400010;
int n, A, B, C, D;
char s[N];
int main() {
scanf("%d%d%d%d%d%s", &n, &A, &B, &C, &D, s + 1);
bool flag = 0;
rep(i, ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 831,941 | 831,942 | u706008189 | cpp |
p03017 | #include <bits/stdc++.h>
#define reps(i, a, b) for (long long int i = a; i < b; i++)
#define rep(i, a) for (long long int i = 0; i < a; i++)
typedef long long int ll;
using namespace std;
ll MOD = 1000000007;
const int MAX = 510000;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed... | #include <bits/stdc++.h>
#define reps(i, a, b) for (long long int i = a; i < b; i++)
#define rep(i, a) for (long long int i = 0; i < a; i++)
typedef long long int ll;
using namespace std;
ll MOD = 1000000007;
const int MAX = 510000;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,943 | 831,944 | u691174149 | cpp |
p03017 | #define MM_USE_COMP_MACRO
#ifdef MM_USE_COMP_MACRO
// DO NOT READ THIS SECTION:YOU'RE WASTING YOUR TIME
#ifndef MM_USE_COMP_MACRO_DEF
#define MM_USE_COMP_MACRO_DEF
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
typedef long long signed int ll;
t... | #define MM_USE_COMP_MACRO
#ifdef MM_USE_COMP_MACRO
// DO NOT READ THIS SECTION:YOU'RE WASTING YOUR TIME
#ifndef MM_USE_COMP_MACRO_DEF
#define MM_USE_COMP_MACRO_DEF
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
typedef long long signed int ll;
t... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,954 | 831,955 | u751537640 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
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;
bool flag = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else... | #include <bits/stdc++.h>
typedef long long ll;
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;
bool flag = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else... | [
"control_flow.loop.for.initializer.change"
] | 831,960 | 831,961 | u620735210 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long l... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 831,962 | 831,963 | u369508054 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,966 | 831,967 | u820560680 | 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;
bool flg = true;
if (D > C) {
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for... | #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;
bool flg = true;
if (D > C) {
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for... | [
"control_flow.loop.for.condition.change"
] | 831,968 | 831,969 | u501643136 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 831,973 | 831,974 | u242534780 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | [
"assignment.change"
] | 831,975 | 831,974 | u242534780 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '... | [
"assignment.change"
] | 831,976 | 831,974 | u242534780 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D + 1; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count =... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,977 | 831,978 | u074306398 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
for (int i = B; i < D; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3) {
fl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D + 1; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count =... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,979 | 831,978 | u074306398 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,982 | 831,983 | u672343646 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 831,984 | 831,983 | u672343646 | cpp |
p03017 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,991 | 831,992 | u102602414 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - ... | [
"expression.operation.binary.remove"
] | 832,000 | 832,001 | u534417782 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 832,002 | 832,001 | u534417782 | cpp |
p03017 | #include <iomanip>
#include <ios>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool reach_b = true;
for (int i = B; i < D - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_b = false;
}
b... | #include <iomanip>
#include <ios>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool reach_b = true;
for (int i = B; i < D - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_b = false;
}
b... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 832,003 | 832,004 | u407416173 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int judge = 1;
int cnt = 0;
//マスaからmax(c,d)までで岩が二つ並んだらダメ
for (int i = a; i < m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int judge = 1; //岩が二つ並んだでいないか？
int cnt = 0; // AがBを追い抜くことは可能か？
//マスaからmax(c,d)... | [
"control_flow.loop.for.initializer.change"
] | 832,013 | 832,014 | u083190434 | cpp |
p03017 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#include <ext/pb_ds/assoc_containe... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#include <ext/pb_ds/assoc_containe... | [
"control_flow.loop.for.initializer.change"
] | 832,020 | 832,021 | u508862376 | cpp |
p03017 | #include <bits/stdc++.h>
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;
bool ans_check = true;
int double_count = 0;
bool double_check = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
double_count++... | #include <bits/stdc++.h>
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;
bool ans_check = true;
int double_count = 0;
bool double_check = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
double_count++... | [
"control_flow.loop.for.initializer.change"
] | 832,022 | 832,023 | u689245321 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,032 | 832,033 | u306142032 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,034 | 832,033 | u306142032 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int A, B, C, D;
int ans = 0;
cin >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
if (C > D) {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int A, B, C, D;
int ans = 0;
cin >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
if (C > D) {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
... | [
"assignment.change"
] | 832,039 | 832,040 | u428520665 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool sunuke = true, funuke = true;
if (c < d) {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool sunuke = true, funuke = true;
if (c < d) {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,045 | 832,046 | u392423112 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef ... | [
"misc.opposites",
"assignment.value.change"
] | 832,047 | 832,048 | u019780057 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | [
"control_flow.branch.if.condition.change"
] | 832,051 | 832,052 | u591075912 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | [
"control_flow.branch.if.condition.change"
] | 832,053 | 832,052 | u591075912 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | [
"assignment.add"
] | 832,056 | 832,057 | u477561431 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), ... | [
"control_flow.loop.for.initializer.change"
] | 832,071 | 832,072 | u569690172 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), ... | [
"control_flow.loop.for.initializer.change"
] | 832,073 | 832,072 | u569690172 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 832,076 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,078 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,079 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,080 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 832,083 | 832,084 | u297203024 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '?' + s;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
for (int i = b; i < d; i++) {
... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '?' + s;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
for (int i = b; i < d; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 832,089 | 832,090 | u707303246 | cpp |
p03017 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#de... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#de... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 832,097 | 832,098 | u862316882 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,104 | 832,105 | u121266738 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change",
"assignment.change",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 832,107 | 832,105 | u121266738 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool f = true;
for (int i = a - 1; i < c - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
for (int i = b - 1; i < d - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool f = true;
for (int i = a - 1; i < c - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
for (int i = b - 1; i < d - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,120 | 832,121 | u612175324 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,124 | 832,125 | u537234062 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 832,126 | 832,125 | u537234062 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 832,127 | 832,125 | u537234062 | cpp |
p03017 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#defin... | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#defin... | [
"expression.operation.binary.add"
] | 832,135 | 832,136 | u210484769 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
// Shortcut
#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#... | #include <bits/stdc++.h>
using namespace std;
// Shortcut
#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#... | [
"expression.operation.binary.add"
] | 832,140 | 832,141 | u430870052 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if (c > d) {
// 抜かす。O*3
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if (c > d) {
// 抜かす。O*3
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 832,152 | 832,153 | u432551953 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
// ##があるかチェック
int breaker = 0;
for (int x = a; x <= c; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breake... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
// ##があるかチェック
int breaker = 0;
for (int x = a; x <= c; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breake... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,176 | 832,177 | u798086274 | cpp |
p03017 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ans = 1;
if (B < C && C < D) {
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = 0;
}
// Aマス目からDマス目... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ans = 1;
if (B < C && C < D) {
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = 0;
}
// Aマス目からDマス目... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,182 | 832,183 | u732571394 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 832,192 | 832,193 | u430494842 | cpp |
p03017 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | [
"expression.operation.binary.remove"
] | 832,197 | 832,198 | u934954661 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, ... | [
"expression.operation.binary.remove"
] | 832,201 | 832,202 | u629341543 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 832,203 | 832,202 | u629341543 | cpp |
p03017 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"expression.operation.binary.add"
] | 832,223 | 832,224 | u900727536 | cpp |
p03017 | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < c; i++... | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < d + 1;... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,233 | 832,234 | u718277423 | cpp |
p03017 | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 1; i < c; i++... | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < d + 1;... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,235 | 832,234 | u718277423 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a, b, c, d;
char s[N];
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
bool flag = true;
for (int i = a; i < max(c, d); i++)
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
if (c > d) {
int to... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a, b, c, d;
char s[N];
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
bool flag = true;
for (int i = a; i < max(c, d); i++)
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
if (c > d) {
int to... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,242 | 832,243 | u676323984 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
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 < max(C, D)... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
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 < max(C, D)... | [
"control_flow.loop.for.initializer.change"
] | 832,244 | 832,245 | u354638986 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
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 < max(C, D)... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
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 < max(C, D)... | [
"control_flow.loop.for.initializer.change"
] | 832,246 | 832,245 | u354638986 | cpp |
p03017 | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.06.02 20:56:01
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typed... | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.06.02 20:56:01
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typed... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,247 | 832,248 | u245366924 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool yes = true;
for (auto i = a - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool yes = true;
for (auto i = a - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 832,249 | 832,250 | u488731967 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <... | [
"expression.operation.binary.remove"
] | 832,256 | 832,257 | u558671021 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int flag = 0;
for (int i = A; i < max(C, D) - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
flag = 1;
}
if (C > D) {
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int flag = 0;
for (int i = A; i < max(C, D) - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
flag = 1;
}
if (C > D) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 832,282 | 832,283 | u590088474 | 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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i... | #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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,289 | 832,290 | u503549962 | 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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i... | #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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 832,291 | 832,290 | u503549962 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D, judg = 0;
string S;
int main() {
cin >> N >> A >> B >> C >> D >> S;
int i, K;
if (D < C)
K = C;
if (D > C)
K = D;
for (i = A; i < K - 1; i++) {
if (S[i] == '#' ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D, judg = 0;
string S;
int main() {
cin >> N >> A >> B >> C >> D >> S;
int i, K;
if (D < C)
K = C;
if (D > C)
K = D;
for (i = A; i < K - 1; i++) {
if (S[i] == '#' ... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 832,292 | 832,293 | u839537391 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
int n;
int a, b, c, d;
scanf("%d", &n);
scanf("%d%d%d%d", &a, &b, &c, &d);
scanf("%s", s + 1);
int flag = 0;
for (int i = a + 2; i <= c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
for (int i = b + 2; ... | #include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
int n;
int a, b, c, d;
scanf("%d", &n);
scanf("%d%d%d%d", &a, &b, &c, &d);
scanf("%s", s + 1);
int flag = 0;
for (int i = a + 1; i <= c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
for (int i = b + 1; ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 832,303 | 832,304 | u818518063 | cpp |
p03017 | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int dis = 1;
if (c > d) {
for (int i = b - 1; i < c; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
dis = 1;
... | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int dis = 1;
if (c > d) {
for (int i = b - 1; i < d; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
dis = 1;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 832,305 | 832,306 | u093744128 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,314 | 832,315 | u266643907 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,316 | 832,315 | u266643907 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,326 | 832,327 | u241615199 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,328 | 832,327 | u241615199 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
co... | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
co... | [
"control_flow.branch.if.condition.change"
] | 832,329 | 832,330 | u679245300 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
co... | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
co... | [
"control_flow.branch.if.condition.change"
] | 832,331 | 832,330 | u679245300 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.