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 |
|---|---|---|---|---|---|---|---|
p03024 | #include <bits/stdc++.h>
#define fi first
#define se second
#define bug cout << "--------------" << endl
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int inf = 1e9;
const ll llf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
char s[55];
int k;
int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define bug cout << "--------------" << endl
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int inf = 1e9;
const ll llf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
char s[55];
int k;
int ... | [
"control_flow.branch.if.condition.change"
] | 836,136 | 836,137 | u384161413 | cpp |
p03024 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
string S;
int s = S.size(), ans = 0;
for (int i = 0; i < s; i++) {
if (S[i] == 'x')
ans++;
}
if (ans < 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
string S;
cin >> S;
int s = S.size(), ans = 0;
for (int i = 0; i < s; i++) {
if (S[i] == 'x')
ans++;
}
if (ans < 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [] | 836,140 | 836,141 | u732571394 | cpp |
p03024 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,144 | 836,145 | u139235669 | cpp |
p03024 | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int tmp = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x') {
cnt++;
} else {
tmp++;
}
}
if (cnt >= 7 && tmp <= 7) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
int tmp = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x') {
cnt++;
} else {
tmp++;
}
}
if (cnt >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
retur... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 836,148 | 836,149 | u692207013 | cpp |
p03024 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int win{0}, lose{0};
for (int i = 0; i < S.size(); ++i) {
if (S[i] == 'o')
++win;
else
++lose;
}
if (15 - S.size() + win >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int win{0}, lose{0};
for (int i = 0; i < S.size(); ++i) {
if (S[i] == 'o')
++win;
else
++lose;
}
if (15 - S.size() + win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,159 | 836,160 | u894555185 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, win = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
win++;
cnt++;
}
int pw = S.size() - cnt;
if (pw + win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, win = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
win++;
cnt++;
}
int pw = 15 - S.size();
if (pw + win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
... | [
"expression.operation.binary.remove"
] | 836,167 | 836,168 | u067128860 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, win = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
win++;
cnt++;
}
int pw = S.size();
if (pw + win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
ret... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0, win = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
win++;
cnt++;
}
int pw = 15 - S.size();
if (pw + win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
... | [
"assignment.change"
] | 836,169 | 836,168 | u067128860 | cpp |
p03024 | /*------------------------Original Copyright belongs
to-------------------------/ !
! ! ## ## ## ##
! ! # #
# # !
! ### #### ### ### ## # ! !
# # # # # # # # # ## !
! # # # ### ###... | /*------------------------Original Copyright belongs
to-------------------------/ !
! ! ## ## ## ##
! ! # #
# # !
! ### #### ### ### ## # ! !
# # # # # # # # # ## !
! # # # ### ###... | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 836,174 | 836,175 | u344266329 | cpp |
p03024 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int win = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
win++;
}
}
if ((15 - s.size() + win) >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int win = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
win++;
}
}
if ((15 - s.size() + win) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,176 | 836,177 | u120564432 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int win = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o')
win++;
}
if (win + (15 - s.length()) >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int win = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o')
win++;
}
if (win + (15 - s.length()) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,180 | 836,181 | u355424600 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int win = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o')
win++;
}
if (win + s.length() >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int win = 0;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o')
win++;
}
if (win + (15 - s.length()) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,182 | 836,181 | u355424600 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o')
c++;
}
cout << (c >= 8 ? "YES" : "NO") << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x') {
c++;
}
}
cout << (15 - c >= 8 ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 836,187 | 836,188 | u959815036 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
string S;
cin >> S... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
string S;
cin >> S... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 836,189 | 836,190 | u600896094 | cpp |
p03024 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string S;
int res = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'o')
res++;
}
res += 15 - S.length();
if (res >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
#include <string.h>
using namespace std;
int main() {
string S;
int res = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'o')
res++;
}
res += 15 - S.length();
if (res >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,198 | 836,199 | u291552830 | cpp |
p03024 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int win_cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
win_cnt++;
}
}
int remain = 15 - S.size();
if (win_cnt + remain >= 8) {
cout << "Yes\n";
} else {... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int win_cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
win_cnt++;
}
}
int remain = 15 - S.size();
if (win_cnt + remain >= 8) {
cout << "YES\n";
} else {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,200 | 836,201 | u190018920 | cpp |
p03024 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 836,202 | 836,203 | u240031669 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define start... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define start... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,204 | 836,205 | u266509174 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
for (char c : s) {
if (c == 'o')
cnt++;
}
cout << (cnt + (15 - s.length()) >= 8 ? "Yes" : "No");
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
for (char c : s) {
if (c == 'o')
cnt++;
}
cout << (cnt + (15 - s.length()) >= 8 ? "YES" : "NO");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,206 | 836,207 | u809153881 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
#include <vector>
using namespace std;
int main() {
string s;
int size = 0;
cin >> s;
size = s.size();
int def = 0;
for (int i = 0; i < size; i++) {
if (s.at(i) == 'x')
def++;
}
if (15 - def > 7) {
cout << "NO" << en... | #include <algorithm>
#include <bits/stdc++.h>
#include <stdint.h>
#include <vector>
using namespace std;
int main() {
string s;
int size = 0;
cin >> s;
size = s.size();
int def = 0;
for (int i = 0; i < size; i++) {
if (s.at(i) == 'x')
def++;
}
if (15 - def > 7) {
cout << "YES" << e... | [
"literal.string.change",
"io.output.change"
] | 836,208 | 836,209 | u641922479 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int compare_char(char *a, char *b) { return strcmp(a, b); }
int intsort(const void *a, const void *b) {
return *(int *)b - *(int *)a;
/*qsort(a,aの配列数,sizeof(int),intsort);*/
}
int longsort(const void *a, const void *b) {
long *A = (long *)a;
long *B = (long *)b;
... | #include <bits/stdc++.h>
using namespace std;
int compare_char(char *a, char *b) { return strcmp(a, b); }
int intsort(const void *a, const void *b) {
return *(int *)b - *(int *)a;
/*qsort(a,aの配列数,sizeof(int),intsort);*/
}
int longsort(const void *a, const void *b) {
long *A = (long *)a;
long *B = (long *)b;
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 836,212 | 836,213 | u251847465 | cpp |
p03024 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,214 | 836,215 | u468700753 | cpp |
p03025 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"call.add",
"call.arguments.change"
] | 836,216 | 836,217 | u224756887 | cpp |
p03025 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b... | [
"assignment.change"
] | 836,233 | 836,234 | u807998890 | cpp |
p03024 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
char S[99];
ll i, j, k;
int main() {
scanf("%lld", &S);
j = 7;
for (i... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
char S[99];
ll i, j, k;
int main() {
scanf("%s", &S);
j = 7;
for (i =... | [
"literal.string.change",
"call.arguments.change"
] | 836,238 | 836,239 | u259396003 | cpp |
p03024 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#def... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#def... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 836,242 | 836,243 | u335104842 | cpp |
p03024 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long lon... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,250 | 836,251 | u511379665 | cpp |
p03024 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 15; ++i) {
if (S[i] == 'o') {
++count;
}
}
if (count >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 15; ++i) {
if (S[i] == 'x') {
++count;
}
}
if (count <= 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 836,254 | 836,255 | u701556979 | cpp |
p03024 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ... | [
"variable_declaration.value.change"
] | 836,256 | 836,257 | u528720841 | cpp |
p03024 | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | [
"control_flow.branch.if.condition.change"
] | 836,262 | 836,263 | u862237347 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, y) for (int i = x; i < y; i++)
const int8_t INFC = 0x3f;
const int16_t INFS = 0x3f3f;
const int32_t INF = 0x3f3f3f3f;
const int64_t INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
ios::sync_with_stdio(0);
string s;
cin >> s;
int cnt = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, y) for (int i = x; i < y; i++)
const int8_t INFC = 0x3f;
const int16_t INFS = 0x3f3f;
const int32_t INF = 0x3f3f3f3f;
const int64_t INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
ios::sync_with_stdio(0);
string s;
cin >> s;
int cnt = 0;
for (int i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,268 | 836,269 | u908432409 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o')
cnt++;
}
if (cnt >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'x')
cnt++;
}
if (cnt >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 836,272 | 836,273 | u665871498 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#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... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#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... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 836,274 | 836,275 | u352200121 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int lose = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose >= 8)
printf("No\n");
else
printf("Yes\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int lose = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose >= 8)
printf("NO\n");
else
printf("YES\n");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 836,276 | 836,277 | u429526425 | cpp |
p03024 | #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... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,278 | 836,279 | u691174149 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o')
count++;
}
if (15 - S.size() + count >= 15)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o')
count++;
}
if (15 - S.size() + count >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,283 | 836,284 | u239087789 | cpp |
p03024 | /*include*/
#include <bits/stdc++.h>
/*alias*/
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using ll = long long;
using namespace std;
/*input*/
string s;
/*funcs*/
/*main*/
int main() {
cin >> s;
int k = s.length();
int rest = 15 - k;
int count = 0;
for (in... | /*include*/
#include <bits/stdc++.h>
/*alias*/
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using ll = long long;
using namespace std;
/*input*/
string s;
/*funcs*/
/*main*/
int main() {
cin >> s;
int k = s.length();
int rest = 15 - k;
int count = 0;
for (in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,287 | 836,288 | u629194491 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
string s;
int main() {
cin >> s;
ll cnt = 0;
for (int i = 0; i < s.size(); ++i) {
cnt += (s[i] == 'o');
}
if (cnt + (15 - s.size()) >= 8) {
cout << "YES";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
string s;
int main() {
cin >> s;
ll cnt = 0;
for (int i = 0; i < s.size(); ++i) {
cnt += (s[i] == 'o');
}
if (cnt + (15 - s.size()) >= 8) {
cout << "YES";
return 0;
... | [
"literal.string.change",
"io.output.change"
] | 836,289 | 836,290 | u522784682 | cpp |
p03024 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == '×') {
count++;
}
}
if (count < 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'x') {
count++;
}
}
if (count < 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 836,291 | 836,292 | u322714721 | cpp |
p03024 | #include <bits/stdc++.h>
#define mod 1000000007
#define f first
#define s second
using namespace std;
/*int gcd(int a,int b){
if(b == 0)
return a;
return gcd(b,a%b);
}*/
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
#define mod 1000000007
#define f first
#define s second
using namespace std;
/*int gcd(int a,int b){
if(b == 0)
return a;
return gcd(b,a%b);
}*/
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false);
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,295 | 836,296 | u175695388 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
string S;
cin >> S;
int c = 0;
for (int i = 0; i < S.size(); i++)
if (S.at(i) == 'x')
c++;
if (c < 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
string S;
cin >> S;
int c = 0;
for (int i = 0; i < S.size(); i++)
if (S.at(i) == 'x')
c++;
if (c < 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,297 | 836,298 | u889812821 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = (... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,299 | 836,300 | u150255544 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
string s;
int w = 0, l = 0;
int main() {
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s.at(i) == 'o') {
++w;
}
}
if ((15 - s.size()) + w >= 8) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
using llint = long long;
#define LOG(x) cout << "# " << #x << " => " << (x) << endl
string s;
int w = 0, l = 0;
int main() {
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s.at(i) == 'o') {
++w;
}
}
if ((15 - s.size()) + w >= 8) {
cout <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,310 | 836,311 | u135954097 | cpp |
p03024 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_o... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 836,314 | 836,315 | u322038235 | cpp |
p03024 | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,320 | 836,321 | u259210975 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int lcount = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
lcount++;
}
cout << (lcount < 8 ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int lcount = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
lcount++;
}
cout << (lcount < 8 ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,322 | 836,323 | u506320030 | cpp |
p03024 | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 836,324 | 836,325 | u438319362 | cpp |
p03025 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | [] | 836,342 | 836,343 | u986399983 | cpp |
p03025 | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << "... | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << "... | [
"literal.number.change",
"expression.operation.binary.change"
] | 836,347 | 836,348 | u467423063 | cpp |
p03025 | #include <bits/stdc++.h>
using namespace std;
#define dist2D(x1, y1, x2, y2) ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))
#define dist3D(x1, y1, z1, x2, y2, z2) \
((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2))
#define EPS 1e-12
#define FastIO ios_ba... | #include <bits/stdc++.h>
using namespace std;
#define dist2D(x1, y1, x2, y2) ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))
#define dist3D(x1, y1, z1, x2, y2, z2) \
((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2))
#define EPS 1e-12
#define FastIO ios_ba... | [
"assignment.change"
] | 836,357 | 836,358 | u971626508 | cpp |
p03025 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 836,363 | 836,364 | u976045235 | cpp |
p03025 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"call.add"
] | 836,369 | 836,370 | u874644572 | cpp |
p03025 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1;
}
return ret;
}
l... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1;
}
return ret;
}
l... | [] | 836,371 | 836,372 | u107077805 | cpp |
p03025 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1;
}
return ret;
}
l... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a, ll b) {
ll ret = 1, kakeru = a;
while (b > 0) {
if (b & 1)
ret *= kakeru, ret %= MOD;
kakeru *= kakeru, kakeru %= MOD;
b >>= 1;
}
return ret;
}
l... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 836,373 | 836,372 | u107077805 | cpp |
p03025 | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (100000L)
#define MAX_FACT (MAX_N)
#define NUM_MOD (1000000007L)
long fs[MAX_FACT + 1], finvs[MAX_FACT + 1], invs[MAX_FACT + 1];
void combination_init() {
fs[0] = fs[1] = 1;
finvs[0] = finvs[1] = 1;
invs[1] = 1;
for (long i = 2; i <= MAX_FACT; i++) {
f... | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (300000L)
#define MAX_FACT (MAX_N)
#define NUM_MOD (1000000007L)
long fs[MAX_FACT + 1], finvs[MAX_FACT + 1], invs[MAX_FACT + 1];
void combination_init() {
fs[0] = fs[1] = 1;
finvs[0] = finvs[1] = 1;
invs[1] = 1;
for (long i = 2; i <= MAX_FACT; i++) {
f... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 836,380 | 836,381 | u359413838 | cpp |
p03017 | // A - Kenken Race
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ans = true;
if (c > d) {
ans = false;
for (int i = a; i < d; i++)
if (s[i] == '.' && s[i + 1] =... | // A - Kenken Race
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ans = true;
if (c > d) {
ans = false;
for (int i = b - 1; i < d; i++)
if (s[i] == '.' && s[i + ... | [
"control_flow.loop.for.initializer.change"
] | 836,431 | 836,432 | u839953699 | cpp |
p03017 | // A - Kenken Race
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ans = true;
if (c > d) {
ans = false;
for (int i = a; i < d - 1; i++)
if (s[i] == '.' && s[i + ... | // A - Kenken Race
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ans = true;
if (c > d) {
ans = false;
for (int i = b - 1; i < d; i++)
if (s[i] == '.' && s[i + ... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,433 | 836,432 | u839953699 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"expression.operation.binary.add"
] | 836,434 | 836,435 | u007637377 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"expression.operation.binary.remove"
] | 836,436 | 836,435 | u007637377 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,459 | 836,460 | u134857688 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,461 | 836,460 | u134857688 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i < end - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 836,462 | 836,460 | u134857688 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i < end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D;
string S;
bool canReach(int begin, int end) {
for (int i = begin + 1; i <= end; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 836,463 | 836,460 | u134857688 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 836,465 | 836,466 | u002419600 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,467 | 836,468 | u543657872 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 836,469 | 836,468 | u543657872 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,470 | 836,468 | u543657872 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | [
"expression.operation.binary.remove"
] | 836,476 | 836,477 | u406423757 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | [
"expression.operation.binary.remove"
] | 836,478 | 836,477 | u406423757 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int INF = 1e9 + 101;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define reps(i, j,... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 836,479 | 836,477 | u406423757 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unistd.h>
#include <vector>
#define ALL(a) (a).begin(), (... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unistd.h>
#include <vector>
#define ALL(a) (a).begin(), (... | [
"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"
] | 836,495 | 836,496 | u334656323 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
int main() {
... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,497 | 836,498 | u334624175 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10000010
char s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, n, i, j, k = 0;
cin >> n >> a >> b >> c >> d;
for (i = 1; i <= n; i++)
cin >> s[i];
for (i = a + 1; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10000010
char s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, n, i, j, k = 0;
cin >> n >> a >> b >> c >> d;
for (i = 1; i <= n; i++)
cin >> s[i];
for (i = a + 1; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,503 | 836,504 | u100434304 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10000010
char s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, n, i, j, k = 0;
cin >> n >> a >> b >> c >> d;
for (i = 1; i <= n; i++)
cin >> s[i];
for (i = a + 1; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10000010
char s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, n, i, j, k = 0;
cin >> n >> a >> b >> c >> d;
for (i = 1; i <= n; i++)
cin >> s[i];
for (i = a + 1; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 836,505 | 836,504 | u100434304 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
auto can_reach = [&](int s, int e) {
for (int i = s; i... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
S = "#" + S + "#";
auto can_reach = [&](int s, int e) {
for (int i = s; i... | [] | 836,514 | 836,515 | u318727472 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | [
"control_flow.loop.for.initializer.change"
] | 836,528 | 836,529 | u878615689 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,530 | 836,529 | u878615689 | 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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | #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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,531 | 836,532 | u652662440 | 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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | #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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | [
"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"
] | 836,533 | 836,532 | u652662440 | 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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | #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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,534 | 836,532 | u652662440 | 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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | #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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,531 | 836,535 | u652662440 | 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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | #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;
string ans = "Yes";
a--;
b--;
c--;
d--;
for (int i = b + 2; i <= d; i++) {
if (s[i] == s[i - 1] && s[i] == '#')
ans = "No";
}
s[d] = '#';
for (int ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,534 | 836,535 | u652662440 | cpp |
p03017 | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 836,536 | 836,537 | u470437951 | cpp |
p03017 | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"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,538 | 836,537 | u470437951 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ass 1e18
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define boost ... | #include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ass 1e18
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define boost ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,543 | 836,544 | u902456829 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ass 1e18
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define boost ... | #include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ass 1e18
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define boost ... | [
"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,545 | 836,544 | u902456829 | cpp |
p03017 | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end(... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end(... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,546 | 836,547 | u202370403 | cpp |
p03017 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,555 | 836,556 | u686099444 | cpp |
p03017 | #include <iostream>
using namespace std;
bool isseries(string S, int n, int l, int u) {
for (int i = l; i < u; ++i) {
if (S[i - 1] == '#') {
for (int j = 1; j < n; ++j) {
if ((i - j > l) && (S[i - 1 - j] == '#'))
return true;
}
}
}
return false;
}
bool issparse(string S, in... | #include <iostream>
using namespace std;
bool isseries(string S, int n, int l, int u) {
for (int i = l; i < u; ++i) {
if (S[i - 1] == '#') {
for (int j = 1; j < n; ++j) {
if ((i - j - 1 > l) && (S[i - 1 - j] == '#'))
return true;
}
}
}
return false;
}
bool issparse(string S... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 836,582 | 836,583 | u969236097 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long l... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long l... | [
"control_flow.loop.for.initializer.change"
] | 836,584 | 836,585 | u507128581 | cpp |
p03017 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,586 | 836,587 | u528744583 | cpp |
p03017 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,588 | 836,587 | u528744583 | cpp |
p03017 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 836,589 | 836,587 | u528744583 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,598 | 836,599 | u147305315 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,600 | 836,599 | u147305315 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = (1000000000 + 7);
int max_count(string &s, int b, int d) {
int cnt = 0;
int ma... | [
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"assignment.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 836,601 | 836,599 | u147305315 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = false;
if (c < d) {
if (c < b) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#') ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = false;
if (c < d) {
if (c < b) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#') ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,602 | 836,603 | u874723578 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = false;
if (c < d) {
if (c < b) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#') ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = false;
if (c < d) {
if (c < b) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#') ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 836,604 | 836,603 | u874723578 | cpp |
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,610 | 836,611 | u883323885 | cpp |
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",
"misc.opposites",
"expression.operator.compare.change"
] | 836,612 | 836,611 | u883323885 | cpp |
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"
] | 836,610 | 836,613 | u883323885 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.