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 <iostream>
using namespace std;
int main() {
int n, a, b, c, d, e = 0, f = 0, g = 0;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
e++;
}
}
if (e == 0) {
cout << "Yes" << end... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d, e = 0, f = 0, g = 0;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
e++;
}
}
if (e == 0) {
cout << "Yes" << end... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change"
] | 836,612 | 836,613 | u883323885 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#defi... | [
"expression.operation.binary.remove"
] | 836,628 | 836,627 | u319234342 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
ll mod = 1e9 + 7;
ll mod2 = 998244353;
const int INF = 1e9;
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 836,645 | 836,646 | u890465662 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change"
] | 836,650 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 836,652 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 836,653 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,654 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 836,655 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change"
] | 836,658 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 836,659 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,660 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,661 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,662 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,663 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,664 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,665 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,666 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,667 | 836,651 | u201455094 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | #include <bits/stdc++.h>
using namespace std;
char a[200005];
int main() {
int n, bx, by, fx, fy;
cin >> n >> bx >> by >> fx >> fy;
for (int i = 1; i <= n; i++) {
cin >> a[i];
/*if(a[i]=='#' && a[i-1]=='#')
check1=1;*/
}
for (int i = bx + 1; i <= fx; i++) {
if (a[i] == '#' && a[i - 1] == '... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,670 | 836,651 | u201455094 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
bool judge(int a, int b, string s) {
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool check(int a, int b, string s) {
for (int i... | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
bool judge(int a, int b, string s) {
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
return false;
}
}
return true;
}
bool check(int a, int b, string s) {
for (int i... | [
"expression.operation.binary.add"
] | 836,676 | 836,677 | u467826805 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 836,680 | 836,681 | u609688888 | cpp |
p03017 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(int N): par(N) {
... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
// struct UnionFind {
// vector<int> par;
// UnionFind(int N): par(N) {
... | [
"control_flow.branch.if.condition.change"
] | 836,694 | 836,695 | u677149117 | cpp |
p03017 | #include <iostream>
int main() {
int N, A, B, C, D;
std::cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
std::string S;
std::cin >> S;
int oikosi;
int owari;
if (C > D) {
// 岩チェック
for (int i = A; i < C; ++i) {
if ((S[i] == '#') && (S[i + 1] == '#')) {
std::cout << "No" ... | #include <iostream>
int main() {
int N, A, B, C, D;
std::cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
std::string S;
std::cin >> S;
int oikosi;
int owari;
if (C > D) {
// 岩チェック
for (int i = A; i < C; ++i) {
if ((S[i] == '#') && (S[i + 1] == '#')) {
std::cout << "No" ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,706 | 836,707 | u477096296 | cpp |
p03017 | #include <iostream>
int main() {
int N, A, B, C, D;
std::cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
std::string S;
std::cin >> S;
int oikosi;
int owari;
if (C > D) {
// 岩チェック
for (int i = A; i < C; ++i) {
if ((S[i] == '#') && (S[i + 1] == '#')) {
std::cout << "No" ... | #include <iostream>
int main() {
int N, A, B, C, D;
std::cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
std::string S;
std::cin >> S;
int oikosi;
int owari;
if (C > D) {
// 岩チェック
for (int i = A; i < C; ++i) {
if ((S[i] == '#') && (S[i + 1] == '#')) {
std::cout << "No" ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,708 | 836,707 | u477096296 | cpp |
p03017 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 836,711 | 836,712 | u483156389 | cpp |
p03017 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 836,713 | 836,712 | u483156389 | cpp |
p03017 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,714 | 836,712 | u483156389 | cpp |
p03017 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string y;
cin >> y;
y = '#' + y + '#';
bool rev = false;
bool ans = false;
bool revpos = true;
for (int i =... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,715 | 836,712 | u483156389 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 836,722 | 836,723 | u445922306 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 836,724 | 836,723 | u445922306 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define ll long long
#define re register
inline int gi() {
int sum = 0, f = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
f ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define ll long long
#define re register
inline int gi() {
int sum = 0, f = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
f ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 836,737 | 836,738 | u131303230 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, E, G;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
G = 0;
if (C > D) {
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
G = 1;
break;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, E, G;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
G = 0;
if (C > D) {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
G = 1;
break;
}
}
}
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,780 | 836,781 | u902787159 | cpp |
p03017 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,793 | 836,794 | u628047647 | cpp |
p03017 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,795 | 836,794 | u628047647 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 836,805 | 836,806 | u784120136 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 836,809 | 836,810 | u381585104 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 836,811 | 836,810 | u381585104 | cpp |
p03017 | #include <cstdio>
int n, a, b, c, d, t = -1;
char s[200000];
int main() {
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
for (int i = a; i < c; i++)
if (s[i] == s[i + 1] && s[i] == '#') {
puts("No");
return 0;
}
for (int i = b; i < d; i++)
if (s[i] == s[i + 1] && s[i] == '#') {
pu... | #include <cstdio>
int n, a, b, c, d, t = -1;
char s[200000];
int main() {
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
for (int i = a; i < c; i++)
if (s[i] == s[i + 1] && s[i] == '#') {
puts("No");
return 0;
}
for (int i = b; i < d; i++)
if (s[i] == s[i + 1] && s[i] == '#') {
pu... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,812 | 836,813 | u823558173 | cpp |
p03017 | #include <cstdio>
int n, a, b, c, d, t = -1;
char s[200100];
int main() {
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
s[0] = s[n + 1] = '#';
for (int i = a; i < c; i++)
if (s[i + 1] == '#' && s[i] == '#') {
puts("No");
return 0;
}
for (int i = b; i < d; i++)
if (s[i + 1] == '#' && ... | #include <cstdio>
int n, a, b, c, d, t = -1;
char s[200100];
int main() {
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
s[0] = s[n + 1] = '#';
for (int i = a; i < c; i++)
if (s[i + 1] == '#' && s[i] == '#') {
puts("No");
return 0;
}
for (int i = b; i < d; i++)
if (s[i + 1] == '#' && ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,814 | 836,815 | u823558173 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int N, A, B, C, D;
string s;
int main() {
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
bool flag = false;
if (D < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int N, A, B, C, D;
string s;
int main() {
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
bool flag = false;
if (D < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,836 | 836,837 | u730271001 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int N, A, B, C, D;
string s;
int main() {
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
bool flag = false;
if (D < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int N, A, B, C, D;
string s;
int main() {
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
bool flag = false;
if (D < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,838 | 836,837 | u730271001 | cpp |
p03017 | #include <inttypes.h>
#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char const *argv[]) {
intmax_t N, A, B, C, D;
char S[200000 + 1];
intmax_t ans = 0;
scanf("%jd%jd%jd%jd%jd", &N, &A, &B, &C, &D);
scanf("%s", S);
A--;
B--;
C--;
... | #include <inttypes.h>
#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char const *argv[]) {
intmax_t N, A, B, C, D;
char S[200000 + 1];
intmax_t ans = 0;
scanf("%jd%jd%jd%jd%jd", &N, &A, &B, &C, &D);
scanf("%s", S);
A--;
B--;
C--;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 836,841 | 836,842 | u327687161 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,843 | 836,844 | u136378781 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,851 | 836,852 | u057617112 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,853 | 836,852 | u057617112 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - a - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c, d;
cin >> a >> b >> c >> d;
string s;
cin >> s;
int ans = 1;
if (c < d) {
for (int i = a; i < d - 3; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = 0;
}
}
if (c > d) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 836,856 | 836,852 | u057617112 | cpp |
p03017 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | [
"assignment.change"
] | 836,859 | 836,860 | u772304668 | cpp |
p03017 | #include <iostream>
using namespace std;
bool Check(string S, int A, int B, int C, int D) {
int fm = min(A, B);
int fM = max(A, B);
int lm = min(C, D);
int lM = max(C, D);
while (lM < S.size())
S.pop_back();
if (S.find("##", fm) != std::string::npos) {
return false;
}
if (((A < B) && (C < D)... | #include <iostream>
using namespace std;
bool Check(string S, int A, int B, int C, int D) {
int fm = min(A, B);
int fM = max(A, B);
int lm = min(C, D);
int lM = max(C, D);
while (lM < S.size())
S.pop_back();
if (S.find("##", fm) != std::string::npos) {
return false;
}
if (((A < B) && (C < D)... | [
"variable_declaration.name.change",
"identifier.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 836,861 | 836,862 | u878967567 | cpp |
p03017 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
n -= 1, a -= 1;
b -= 1;
c -= 1;
d -= 1;
char s[200000] = {};
for (int i = a; i < n; i++)
cin >> s[i];
if (c < d) {
if (c > a + 1) {
for (int i = a; i <= c - 1; i++) {
if (... | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
n -= 1, a -= 1;
b -= 1;
c -= 1;
d -= 1;
char s[200001];
for (int i = 0; i < n; i++)
cin >> s[i];
if (c < d) {
if (c > a + 1) {
for (int i = a; i <= c - 1; i++) {
if (s[i] =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 836,890 | 836,891 | u957416438 | cpp |
p03017 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
n -= 1, a -= 1;
b -= 1;
c -= 1;
d -= 1;
char s[200000] = {};
for (int i = a; i < n; i++)
cin >> s[i];
if (c < d) {
if (c > a + 1) {
for (int i = a; i <= c - 1; i++) {
if (... | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
n -= 1, a -= 1;
b -= 1;
c -= 1;
d -= 1;
char s[200100];
for (int i = 0; i < n; i++)
cin >> s[i];
if (c < d) {
if (c > a + 1) {
for (int i = a; i <= c - 1; i++) {
if (s[i] =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 836,890 | 836,892 | u957416438 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int H = 1000 + 7;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef vector<ll> vl;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--... | #include <bits/stdc++.h>
using namespace std;
const int H = 1000 + 7;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef vector<ll> vl;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--... | [
"assignment.change"
] | 836,896 | 836,897 | u411195488 | cpp |
p03017 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,908 | 836,909 | u050698451 | cpp |
p03017 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,910 | 836,909 | u050698451 | cpp |
p03017 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 836,911 | 836,909 | u050698451 | cpp |
p03017 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"control_flow.loop.for.initializer.change"
] | 836,912 | 836,909 | u050698451 | cpp |
p03017 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 836,914 | 836,909 | u050698451 | 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 MODE 1
... | #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 MODE 1
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,945 | 836,946 | u848736574 | 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 MODE 1
... | #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 MODE 1
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,947 | 836,946 | u848736574 | 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 MODE 1
... | #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 MODE 1
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 836,948 | 836,946 | u848736574 | cpp |
p03017 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typed... | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typed... | [
"control_flow.loop.for.initializer.change"
] | 836,955 | 836,956 | u652420316 | cpp |
p03017 | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,971 | 836,972 | u809889010 | cpp |
p03017 | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 836,973 | 836,972 | u809889010 | cpp |
p03017 | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
char s[200001];
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
if (d < c) {
bool flg = false;
for (int i = a - 1; i < b - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,974 | 836,972 | u809889010 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [
"expression.operation.binary.remove"
] | 836,981 | 836,982 | u030685402 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [
"call.arguments.change",
"call.arguments.add"
] | 836,983 | 836,982 | u030685402 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 836,984 | 836,985 | u516708338 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 836,986 | 836,985 | u516708338 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,987 | 836,985 | u516708338 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
#define MEM(arr, i) memset(arr, i, sizeof(arr))
#define Push push_back
#define Pair make_pair
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<i... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,988 | 836,985 | u516708338 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | [
"expression.operation.binary.remove"
] | 836,992 | 836,993 | u966921248 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | [
"call.arguments.change",
"call.arguments.add"
] | 836,994 | 836,993 | u966921248 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define... | [
"expression.operation.binary.add"
] | 836,995 | 836,993 | u966921248 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
int n, a, b, c, d;
char s[N];
bool check(int a, int b)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
int n, a, b, c, d;
char s[N];
bool check(int a, int b)... | [
"expression.operation.binary.add"
] | 836,996 | 836,997 | u209921913 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,998 | 836,999 | u962104148 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 837,000 | 836,999 | u962104148 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 837,001 | 836,999 | u962104148 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 837,002 | 836,999 | u962104148 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, nn) for (int i = 0; i < nn; i++)
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 837,003 | 836,999 | u962104148 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int const N = 200000;
char s[N + 2];
void no() {
printf("No\n");
exit(0);
}
int main() {
int n, a, b, c, d;
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
f(i, a, c) if (s[i] == '#' &... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int const N = 200000;
char s[N + 2];
void no() {
printf("No\n");
exit(0);
}
int main() {
int n, a, b, c, d;
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, s + 1);
f(i, a, c) if (s[i] == '#' &... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 837,010 | 837,011 | u647100698 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | [
"io.output.newline.add"
] | 837,248 | 837,249 | u022832318 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | [
"io.output.newline.add"
] | 837,248 | 837,250 | u022832318 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define pi pair<int, int>
#define ff first
#define ss second
#include "... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define boost \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define pi pair<int, int>
#define ff first
#define ss second
#include "... | [
"literal.number.change",
"variable_declaration.value.change"
] | 837,251 | 837,252 | u371555975 | cpp |
p03027 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include... | [
"io.output.newline.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 837,255 | 837,256 | u577774192 | cpp |
p03027 | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 1000003;
#define dump(x) \
if (dbg) { ... | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 1000003;
#define dump(x) \
if (dbg) { ... | [] | 837,265 | 837,266 | u070600790 | cpp |
p03027 | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
//#define i_7 998244353
//#define i_5 i_7-2
ll i_7 = 1E6 + 3;
ll i_5 = i_7 - 2;
l... | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
//#define i_7 998244353
//#define i_5 i_7-2
ll i_7 = 1E6 + 3;
ll i_5 = i_7 - 2;
l... | [
"call.add",
"io.output.change",
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 837,267 | 837,268 | u763881112 | cpp |
p03027 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [] | 837,279 | 837,280 | u030685402 | cpp |
p03027 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | [
"io.output.newline.add"
] | 837,283 | 837,284 | u373008269 | cpp |
p03027 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 837,285 | 837,286 | u017271745 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e6 + 3;
void add(int64_t &a, int64_t b) { a = (a + b) % MOD; }
void mul(int64_t &a, int64_t b) { a = a * b % MOD; }
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num) {
fact[0] = fact[1] = 1;
for (int i = 2; i <= num; i++)
... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e6 + 3;
void add(int64_t &a, int64_t b) { a = (a + b) % MOD; }
void mul(int64_t &a, int64_t b) { a = a * b % MOD; }
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num) {
fact[0] = fact[1] = 1;
for (int i = 2; i <= num; i++)
... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 837,291 | 837,292 | u314396879 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
template <unsigned long long mod> class modint {
public:
unsigned long long v;
modint(const long long x = 0) : v(x % mod) {... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
template <unsigned long long mod> class modint {
public:
unsigned long long v;
modint(const long long x = 0) : v(x % mod) {... | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 837,295 | 837,296 | u614497125 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// a^n (mod m)
const long long mod = 1000003;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod mでの a の逆元を求める
lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// a^n (mod m)
const long long mod = 1000003;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod mでの a の逆元を求める
lon... | [] | 837,299 | 837,300 | u676029460 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | [
"control_flow.branch.if.condition.change"
] | 837,310 | 837,311 | u633020228 | cpp |
p03027 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | [
"expression.operation.binary.add"
] | 837,318 | 837,319 | u162364634 | cpp |
p03027 | #include <bits/stdc++.h>
#define int long long
#define M 1000003
using namespace std;
typedef long long ll;
const int mod = M;
ll mod_pow(ll a, ll x) {
ll res = 1;
while (x) {
if (x % 2)
res = res * a % mod;
a = a * a % mod;
x /= 2;
}
return res;
}
ll inv(ll x) { return mod_pow(x, mod - 2)... | #include <bits/stdc++.h>
#define int long long
#define M 1000003
using namespace std;
typedef long long ll;
const int mod = M;
ll mod_pow(ll a, ll x) {
ll res = 1;
while (x) {
if (x % 2)
res = res * a % mod;
a = a * a % mod;
x /= 2;
}
return res;
}
ll inv(ll x) { return mod_pow(x, mod - 2)... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 837,323 | 837,324 | u192912097 | cpp |
p03027 | #include <bits/stdc++.h>
#define int long long
#define M 1000003
using namespace std;
typedef long long ll;
const int mod = M;
ll mod_pow(ll a, ll x) {
ll res = 1;
while (x) {
if (x % 2)
res = res * a % mod;
a = a * a % mod;
x /= 2;
}
return res;
}
ll inv(ll x) { return mod_pow(x, mod - 2)... | #include <bits/stdc++.h>
#define int long long
#define M 1000003
using namespace std;
typedef long long ll;
const int mod = M;
ll mod_pow(ll a, ll x) {
ll res = 1;
while (x) {
if (x % 2)
res = res * a % mod;
a = a * a % mod;
x /= 2;
}
return res;
}
ll inv(ll x) { return mod_pow(x, mod - 2)... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 837,323 | 837,325 | u192912097 | cpp |
p03027 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> fct, invfct;
ll mod_pow(ll n, ll p, ll mod) {
// 繰り返し二乗法で (n^p) % mod を求める
if (p == 0)
return 1;
ll res = mod_pow(n * n % mod, p / 2, mod);
if (p % 2 == 1)
res = res * n % mod;
return res;
}
ll calc(ll x, ll n, ll mod) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> fct, invfct;
ll mod_pow(ll n, ll p, ll mod) {
// 繰り返し二乗法で (n^p) % mod を求める
if (p == 0)
return 1;
ll res = mod_pow(n * n % mod, p / 2, mod);
if (p % 2 == 1)
res = res * n % mod;
return res;
}
ll calc(ll x, ll n, ll mod) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 837,326 | 837,327 | u119098168 | cpp |
p03027 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 837,328 | 837,329 | u010004797 | cpp |
p03027 | #include <iostream>
#define MOD 1000003
using namespace std;
long long fac_dic[1000010], fac_inv_dic[1000010], inv_d[1000010];
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return re... | #include <iostream>
#define MOD 1000003
using namespace std;
long long fac_dic[1000010], fac_inv_dic[1000010], inv_d[1000010];
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return re... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 837,330 | 837,331 | u112318601 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 837,332 | 837,333 | u055303078 | cpp |
p03027 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
struct modCalc {
int mod;
int n;
vector<int> fact, invfact;
modCalc(){};
modCalc(int _... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
struct modCalc {
int mod;
int n;
vector<int> fact, invfact;
modCalc(){};
modCalc(int _... | [] | 837,339 | 837,340 | u731175398 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.