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>
using namespace std;
int main() {
string c = "YES";
int cnt = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o')
cnt++;
}
if (8 <= s.size() && s.size() - 8 < cnt)
c = "NO";
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string c = "YES";
int cnt = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'o')
cnt++;
}
if (8 <= s.size() && cnt <= s.size() - 8)
c = "NO";
cout << c << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 835,615 | 835,617 | u298768617 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size, count;
size = S.size();
count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x') {
count++;
}
if (count >= 7) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size, count;
size = S.size();
count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x') {
count++;
}
if (count >= 8) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,623 | 835,624 | u609576113 | cpp |
p03024 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;
for (int j = 0; j < 16; j++) {
if (str[j] == 'o') {
ans++;
} else if (str[j] == '\0') {
break;
}
}
int res;
res = (int)str.length();
if (ans + 15 ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;
for (int j = 0; j < 16; j++) {
if (str[j] == 'o') {
ans++;
} else if (str[j] == '\0') {
break;
}
}
int res;
res = (int)str.length();
if (ans + 15 ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,627 | 835,628 | u875347753 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) if (s[i] == 'x') cnt++;
if (cnt >= 8) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) if (s[i] == 'x') cnt++;
if (cnt >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,639 | 835,640 | u083190434 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w = 0, l = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'o')
w++;
else
l++;
}
if (w + 15 - s.length() >= 8)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w = 0, l = 0;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == 'o')
w++;
else
l++;
}
if (w + 15 - s.length() >= 8)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,644 | 835,645 | u221811114 | cpp |
p03024 | #include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
count++;
}
}
count = count + 15 - S.length();
if (count >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o') {
count++;
}
}
count = count + 15 - S.length();
if (count >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,665 | 835,666 | u918659922 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() >= 8) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,667 | 835,668 | u577134002 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() > 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,669 | 835,668 | u577134002 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() > 8) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int n = 0;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == 'o') {
n++;
}
}
if (n + 15 - a.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,670 | 835,668 | u577134002 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int n, ans = 0;
string s;
int main() {
cin >> s;
n = s.length();
for (int i = 1; i < s.length(); i++) {
if (s[i - 1] == 'o')
ans++;
}
if (n - ans <= 7)
cout << "YES";
else
cout << "NO";
}
| #include <bits/stdc++.h>
using namespace std;
int n, ans = 0;
string s;
int main() {
cin >> s;
n = s.length();
for (int i = 1; i <= s.length(); i++) {
if (s[i - 1] == 'o')
ans++;
}
if (n - ans <= 7)
cout << "YES";
else
cout << "NO";
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 835,675 | 835,676 | u872406755 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '×') {
count++;
}
}
if (count >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x') {
count++;
}
}
if (count >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,681 | 835,682 | u801530021 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 835,683 | 835,684 | u509680664 | 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 INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair... | [
"expression.operation.binary.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 835,685 | 835,686 | u477561431 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string S;
cin >> S;
int lose;
lose = 0;
rep(i, S.size()) {
if (S[i] = '×') {
lose = lose + 1;
}
}
string ans;
if (lose > 7) {
ans = "NO";
}... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string S;
cin >> S;
int lose;
lose = 0;
rep(i, S.size()) {
if (S[i] == 'x') {
lose = lose + 1;
}
}
string ans;
if (lose > 7) {
ans = "NO";
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,691 | 835,692 | u311671153 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if ('x' == S.at(i)) {
cnt++;
}
}
if (cnt > 7)
cout << 'NO';
else
cout << 'YES';
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if ('x' == S.at(i)) {
cnt++;
}
}
if (cnt > 7)
cout << "NO";
else
cout << "YES";
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 835,702 | 835,703 | u868344991 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if ('x' == S.at(i)) {
cnt++;
}
}
if (cnt > 7)
cout << "No";
else
cout << "Yes";
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size(); i++) {
if ('x' == S.at(i)) {
cnt++;
}
}
if (cnt > 7)
cout << "NO";
else
cout << "YES";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,704 | 835,703 | u868344991 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
char a[16];
int sum;
int main() {
cin >> a;
for (int i = 1; i <= 15; i++)
if (a[i] != 'o' && a[i] != 'x')
a[i] = 'o';
for (int i = 1; i <= 15; i++)
if (a[i] == 'o')
sum++;
if (sum >= 8)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char a[15];
int sum;
int main() {
cin >> a;
for (int i = 0; i < 15; i++)
if (a[i] != 'o' && a[i] != 'x')
a[i] = 'o';
for (int i = 0; i < 15; i++)
if (a[i] == 'o')
sum++;
if (sum >= 8)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 835,705 | 835,706 | u730153732 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 100000007;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
#define ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 100000007;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
#define ... | [
"expression.operation.binary.remove"
] | 835,710 | 835,711 | u356489231 | cpp |
p03024 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
count++;
}
}
if (count >= 8) {
cout << "YES";
} else {
cout << ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x') {
count++;
}
}
if (count >= 8) {
cout << "NO";
} else {
cout << "... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 835,712 | 835,713 | u376078818 | 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[i] == 'o') {
count++;
}
}
if (15 - s.size() + count >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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[i] == 'o') {
count++;
}
}
if (15 - s.size() + count >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,730 | 835,731 | u370447425 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
//#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define sd(x) scanf("%d", &x)
#define sld(x) scanf("%lld", &x)
#define pld(x) printf("%lld\n", x)
#define pd(x) printf("%d\n", x)
int main() {
string s;
cin >> s;
int ocount... | #include <bits/stdc++.h>
using namespace std;
//#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define sd(x) scanf("%d", &x)
#define sld(x) scanf("%lld", &x)
#define pld(x) printf("%lld\n", x)
#define pd(x) printf("%d\n", x)
int main() {
string s;
cin >> s;
int ocount... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 835,732 | 835,733 | u141684774 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int k = s.length();
int remMatches = 15 - k;
int count = 0;
for (int i = 0; i < k - 1; i++) {
if (s[i] == 'o')
count++;
}
if (count + remMatches >= 8)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int k = s.length();
int remMatches = 15 - k;
int count = 0;
for (int i = 0; i <= k - 1; i++) {
if (s[i] == 'o')
count++;
}
if (count + remMatches >= 8)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 835,736 | 835,737 | u267232849 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, D, m;
string S;
cin >> S;
N = 0;
M = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
N++;
}
M++;
}
if (15 - M + N > 7) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, D, m;
string S;
cin >> S;
N = 0;
M = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
N++;
}
M++;
}
if (15 - M + N > 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,738 | 835,739 | u041855176 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, D, m;
string S;
cin >> S;
N = 0;
M = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
N++;
}
M++;
}
if (15 - M + N >= 8) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, D, m;
string S;
cin >> S;
N = 0;
M = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'o') {
N++;
}
M++;
}
if (15 - M + N > 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,740 | 835,739 | u041855176 | cpp |
p03024 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] == x)
x++;
}
if (x >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] == 'x')
x++;
}
if (x >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 835,741 | 835,742 | u973991908 | cpp |
p03024 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] = x)
x++;
}
if (x >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] == 'x')
x++;
}
if (x >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 835,743 | 835,742 | u973991908 | cpp |
p03024 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] = x)
x++;
}
if (x >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
string s;
int x = 0;
cin >> s;
REP(i, s.size()) {
if (s[i] == 'x')
x++;
}
if (x >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 835,744 | 835,742 | u973991908 | 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) == '×') {
count++;
}
}
if (count <= 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #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) == 'x') {
count++;
}
}
if (count <= 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 835,745 | 835,746 | u190066528 | 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) == 'x') {
count++;
}
}
if (count > 7) {
cout << 'NO' << endl;
}
if (count < 8) {
cout << 'YES' << endl;
}
}
| #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) == 'x') {
count++;
}
}
if (count > 7) {
cout << "NO" << endl;
}
if (count < 8) {
cout << "YES" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 835,763 | 835,764 | u003761219 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int lose = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x')
lose++;
}
if (lose >= 7) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int lose = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'x')
lose++;
}
if (lose > 7) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
};
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,772 | 835,773 | u987594251 | cpp |
p03024 | #include <stdio.h>
int main() {
char s[20];
int x = 0;
int i = 0;
scanf("%s", s);
for (; i < 16; i++)
x += s[i] == 'x';
if (x > 8)
printf("NO\n");
else
printf("YES\n");
return 0;
} | #include <stdio.h>
int main() {
char s[20];
int x = 0;
int i = 0;
scanf("%s", s);
for (; i < 20; i++)
x += s[i] == 'x';
if (x > 7)
printf("NO\n");
else
printf("YES\n");
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 835,774 | 835,775 | u785396874 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k = 15, win = 0;
string s, msg = "No";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o') {
win++;
}
}
if (k - s.length() + win >= 8) {
msg = "Win";
}
cout << msg << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k = 15, win = 0;
string s, msg = "NO";
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'o') {
win++;
}
}
if (k - s.length() + win >= 8) {
msg = "YES";
}
cout << msg << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 835,780 | 835,781 | u794832384 | cpp |
p03024 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.length() - 1; i++) {
if (S[i] == 'o')
count++;
}
if (count ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'o')
count++;
}
if (count + (1... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 835,782 | 835,783 | u329706129 | cpp |
p03024 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^=... | [
"variable_declaration.name.change",
"identifier.change",
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 835,784 | 835,785 | u040251933 | cpp |
p03024 | #include <bits/stdc++.h>
int main() {
std::string score;
std::cin >> score; // 文字列はcin, 数値はscanfでやったほうがいいかも
// 文字列の中から'x'の数を数える
int num_of_x;
num_of_x = std::count(score.cbegin(), score.cend(), 'x');
// 負けた回数が8以下ならば
if (num_of_x < 8) {
printf("Yes\n");
} else {
// 8回以上ならば
printf("No\n");
... | #include <bits/stdc++.h>
int main() {
std::string score;
std::cin >> score; // 文字列はcin, 数値はscanfでやったほうがいいかも
// 文字列の中から'x'の数を数える
int num_of_x;
num_of_x = std::count(score.cbegin(), score.cend(), 'x');
// 負けた回数が8以下ならば
if (num_of_x < 8) {
printf("YES\n");
} else {
// 8回以上ならば
printf("NO\n");
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 835,786 | 835,787 | u772588522 | cpp |
p03024 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MODk = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MODk = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge {
public:
int from, to, value;
Edge(LL a, LL b, LL c) {
from = a;
to = b;
value = c;
}
Edge(LL a, LL b) {
from = a;
to... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,790 | 835,791 | u580402951 | cpp |
p03024 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int count = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
count++;
}
}
int a = 15 - s.size();
if (a + count >= 8)
cout << "Yes" << endl;
els... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int count = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
count++;
}
}
int a = 15 - s.size();
if (a + count >= 8)
cout << "YES" << endl;
els... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,800 | 835,801 | u710135612 | cpp |
p03024 | #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;
... | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 835,802 | 835,803 | u890465662 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
string s;
int main(void) {
cin >> s;
int n = s.size();
int cnt = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == 'o')
cnt++;
if (cnt + 15 - n >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
string s;
int main(void) {
cin >> s;
int n = s.size();
int cnt = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == 'o')
cnt++;
if (cnt + 15 - n >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,804 | 835,805 | u319282133 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int count = 0;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == 'o')
count++;
}
cout << (15 - count >= 8 ? "YES" : "NO") << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int count = 0;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == 'x')
count++;
}
cout << (count < 8 ? "YES" : "NO") << endl;
return 0... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 835,806 | 835,807 | u809458301 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int count = 0;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == 'o')
count++;
}
cout << (count >= 8 ? "YES" : "NO") << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int count = 0;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] == 'x')
count++;
}
cout << (count < 8 ? "YES" : "NO") << endl;
return 0... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 835,808 | 835,807 | u809458301 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,815 | 835,816 | u895971408 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int rem = 15 - s.size();
int won = 0;
for (auto x : s) {
if (x == 'o')
++won;
}
if (won + rem >= 15)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int rem = 15 - s.size();
int won = 0;
for (auto x : s) {
if (x == 'o')
++won;
}
if (won + rem >= 8)
cout << "YES";
else
cout << "NO";
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,820 | 835,821 | u436364432 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
char S[20];
scanf("%s", S);
int l = strlen(S);
for (int i = 1; i <= l; i++) {
if (S[i] == 'x')
count++;
}
if (count >= 8)
printf("NO");
else
printf("YES");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
char S[20];
scanf("%s", S);
int l = strlen(S);
for (int i = 0; i <= l - 1; i++) {
if (S[i] == 'x')
count++;
}
if (count >= 8)
printf("NO");
else
printf("YES");
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 835,829 | 835,830 | u527058497 | cpp |
p03024 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = (int)S.size();
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'o')
cnt++;
}
if (cnt + (15 - N) >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = (int)S.size();
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'o')
cnt++;
}
if (cnt + (15 - N) >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,833 | 835,834 | u188117876 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll 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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,835 | 835,836 | u084968244 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
ll 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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,837 | 835,836 | u084968244 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll k;
string s;
cin >> s;
k = s.length();
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
count++;
}
if (count >= 8)
cout << "YES";
else
cout << "NO";
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll k;
string s;
cin >> s;
k = s.length();
for (int i = 0; i < k; i++) {
if (s[i] == 'o')
count++;
}
if (count + (15 - k) >= 8)
cout << "YES";
else
cout << "NO";
}
| [
"control_flow.branch.if.condition.change"
] | 835,842 | 835,843 | u012310435 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int length = S.length();
int cnt = 0;
for (int i = 0; i < length; i++) {
if (S.substr(i, 1) == "o")
cnt++;
}
if (length + cnt >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int length = S.length();
int cnt = 0;
// cout << length << endl;
for (int i = 0; i < length; i++) {
if (S.substr(i, 1) == "o")
cnt++;
}
if (15 - length + cnt >= 8)
cout << "YES" << endl;
else
... | [
"control_flow.branch.if.condition.change"
] | 835,846 | 835,847 | u837654535 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
main() {
string S;
int numwin = 0;
cin >> S;
FOR(i, 0, S.length()) {
if (S[i] == 'o') {
numwin += 1;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
main() {
string S;
int numwin = 0;
cin >> S;
FOR(i, 0, S.length()) {
if (S[i] == 'o') {
numwin += 1;
... | [
"control_flow.branch.if.condition.change"
] | 835,855 | 835,856 | u287367500 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
string s;
cin >> s;
int l = (int)(s.length());
int m = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
string s;
cin >> s;
int l = (int)(s.length());
int m = 0;
for (int i = 0; i < ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,857 | 835,858 | u305824645 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 835,859 | 835,860 | u635484372 | cpp |
p03024 | #include <iostream>
using namespace std;
int c;
string s;
main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
c++;
}
cout << (c >= 8 ? "No" : "Yes") << endl;
} | #include <iostream>
using namespace std;
int c;
string s;
main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'x')
c++;
}
cout << (c >= 8 ? "NO" : "YES") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,861 | 835,862 | u843139357 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
bool isWin(const string &s) {
int lose = 0;
for (char c : s)
lose += (c == 'X');
return lose < 8;
}
int main() {
string s;
cin >> s;
cout << (isWin(s) ? "YES\n" : "NO\n");
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
bool isWin(const string &s) {
int lose = 0;
for (char c : s)
lose += (c == 'x');
return lose < 8;
}
int main() {
string s;
cin >> s;
cout << (isWin(s) ? "YES\n" : "NO\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 835,871 | 835,872 | u661686644 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | [] | 835,873 | 835,874 | u337054478 | cpp |
p03024 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
while (s.size() < 15) {
s += 'o';
}
int win = 0;
for (int i = 0; i < 15; i++) {
if (s[i] == 0)
win++;
}
if (win >= 8)
cout << "YES" << endl;
else
cout << "NO" << end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
while (s.size() < 15) {
s += 'o';
}
int win = 0;
for (int i = 0; i < 15; i++) {
if (s[i] == 'o')
win++;
}
if (win >= 8)
cout << "YES" << endl;
else
cout << "NO" << e... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 835,875 | 835,876 | u539675863 | cpp |
p03024 | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int k = 0;
int j = S.size();
for (int i = 0; i <= j; i++) {
if (S[i] == 'o') {
k++;
}
}
if (k >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int k = 0;
int j = S.size();
for (int i = 0; i < j; i++) {
if (S[i] == 'o') {
k++;
}
}
if (k + 15 - j >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 835,879 | 835,880 | u300866293 | cpp |
p03024 | #include <iostream>
int main() {
std::string S;
std::cin >> S;
int n = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == 'o')
++n;
}
if (n >= 8 || (15 - S.size() + n >= 8))
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
| #include <iostream>
int main() {
std::string S;
std::cin >> S;
int n = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == 'o')
++n;
}
if (n >= 8 || (15 - S.size() + n >= 8))
std::cout << "YES" << std::endl;
else
std::cout << "NO" << std::endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 835,884 | 835,885 | u047150897 | cpp |
p03024 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
size_t k = S.length();
for (int i = 1; i <= k; i++) {
if (S[i] == 'o') {
++count;
}
}
if (S[0] == 'o') {
++count;
}
int b = 15 - k;
if (b + count >= 8) {
cout ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
size_t k = S.length();
for (int i = 1; i <= k; i++) {
if (S[i] == 'o') {
++count;
}
}
if (S[0] == 'o') {
++count;
}
int b = 15 - k;
if (b + count >= 8) {
cout ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 835,886 | 835,887 | u122496126 | cpp |
p03024 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
size_t strlen(const char *s);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int N = 10010;
int compare_int(const void *a, const void *b) {
return *(long long int *)b - *(long long int *)a;
}
int... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
size_t strlen(const char *s);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int N = 10010;
int compare_int(const void *a, const void *b) {
return *(long long int *)b - *(long long int *)a;
}
int... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,890 | 835,891 | u660489157 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, n = s.size(), m = 0;
for (i = 0; i < n - 1; i++) {
if (s[i] == 'x')
m++;
}
if (m <= 7)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i, n = s.size(), m = 0;
for (i = 0; i < n; i++) {
if (s[i] == 'x')
m++;
}
if (m <= 7)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 835,897 | 835,898 | u264532180 | cpp |
p03024 | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
// 文字列の入力
string str;
cin >> str;
int k = 15;
int l = 0;
char ch[1] = "";
for (int i = 0; i < (int)str.size(); ++i) {
ch[1] = str[i];
if (strcmp(ch, "x") == 0) {
l++;
}
}
if (l > 7) {
co... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
// 文字列の入力
string str;
cin >> str;
int k = 15;
int l = 0;
char ch[1] = "";
for (int i = 0; i < (int)str.size(); ++i) {
ch[0] = str[i];
if (strcmp(ch, "x") == 0) {
l++;
}
}
if (l > 7) {
co... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 835,921 | 835,922 | u491990150 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int cnt1 = 0, cnt2 = 0;
for (int i = 0, len = s.length(); i < len; ++i) {
if (s[i] == 'o') {
cnt1++;
} else {
cnt2++;
}
}
if (cnt2 >= 8) {
puts("No");
} else {
puts("Yes");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int cnt1 = 0, cnt2 = 0;
for (int i = 0, len = s.length(); i < len; ++i) {
if (s[i] == 'o') {
cnt1++;
} else {
cnt2++;
}
}
if (cnt2 >= 8) {
puts("NO");
} else {
puts("YES");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 835,933 | 835,934 | u394188694 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
while ((c = getchar()) != EOF) {
if (a + b + 1 > 15)
break;
if (c == 'o')
a++;
else if (c == 'x')
b++;
}
if (a >= 8 || 15 - (a + b) >= 8)
printf("YES");
else
printf("NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
while ((c = getchar()) != EOF) {
if (a + b + 1 > 15)
break;
if (c == 'o')
a++;
else if (c == 'x')
b++;
}
if (a >= 8 || 15 - (a + b) + a >= 8)
printf("YES");
else
printf("NO");
return ... | [
"control_flow.branch.if.condition.change"
] | 835,937 | 835,938 | u379393519 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int sum = 0;
int a = l / 2;
for (int i = 0; i < l; i++) {
if (s[i] == 'o')
++sum;
}
if (a >= sum)
cout << "NO";
else
cout << "YES";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int sum = 1;
int a = l / 2;
for (int i = 0; i < l; i++) {
if (s[i] == 'o')
++sum;
}
if (a > sum)
cout << "NO";
else
cout << "YES";
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 835,943 | 835,944 | u782759564 | cpp |
p03024 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; S[i] != '\0'; i++) {
if (S[i] == 'x')
cnt++;
}
cnt = 2;
if (cnt > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; S[i] != '\0'; i++) {
if (S[i] == 'x')
cnt++;
}
if (cnt > 7) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,947 | 835,948 | u964959608 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
int cnt = 0;
for (int i = 0; i < 15; i++) {
if (i < ss) {
if (S[i] == 'o')
cnt++;
continue;
}
cnt++;
}
if (cnt >= 15)
cout << "YES" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
int cnt = 0;
for (int i = 0; i < 15; i++) {
if (i < ss) {
if (S[i] == 'o')
cnt++;
continue;
}
cnt++;
}
if (cnt >= 8)
cout << "YES" << endl;
else
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 835,958 | 835,959 | u045811375 | cpp |
p03019 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | [
"identifier.change",
"io.output.change"
] | 835,960 | 835,961 | u603486542 | cpp |
p03019 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 835,962 | 835,961 | u603486542 | cpp |
p03019 | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
long x;
cin >> n >> x;
vector<l... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
long x;
cin >> n >> x;
vector<l... | [] | 835,963 | 835,964 | u136509923 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, X;
c... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, X;
c... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"literal.number.change"
] | 835,969 | 835,968 | u864888234 | cpp |
p03020 | #include <bits/stdc++.h>
#define F(i, a, b) for (ll i = a; i <= b; i++)
#define G(i, a, b) for (ll i = a; i >= b; i--)
#define out4(x, y, z, w) \
{ \
if (debug) ... | #include <bits/stdc++.h>
#define F(i, a, b) for (ll i = a; i <= b; i++)
#define G(i, a, b) for (ll i = a; i >= b; i--)
#define out4(x, y, z, w) \
{ \
if (debug) ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 835,980 | 835,981 | u110841400 | cpp |
p03020 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
const int N = 2115;
const int INF = 1e7;
typedef long long LL;
using namespace std;
vector<int> ap[N];
int n, n1, st, ed, f[N][N];
LL ans, pr[N][N];
void link(int x, int y, int w, LL c) {
ap[x].... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
const int N = 2115;
const int INF = 1e7;
typedef long long LL;
using namespace std;
vector<int> ap[N];
int n, n1, st, ed, f[N][N];
LL ans, pr[N][N];
void link(int x, int y, int w, LL c) {
ap[x].... | [
"assignment.change"
] | 836,027 | 836,026 | u347712490 | cpp |
p03020 | #include <bits/stdc++.h>
using namespace std;
const int MAXQ = 1e7 + 5;
const int MAXN = 1e3 + 5;
const int MAXP = 5e3 + 5;
const int INF = 1e9;
const long long INFLL = 1e18;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
tem... | #include <bits/stdc++.h>
using namespace std;
const int MAXQ = 1e7 + 5;
const int MAXN = 1e3 + 5;
const int MAXP = 5e3 + 5;
const int INF = 1e9;
const long long INFLL = 1e18;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
tem... | [
"expression.operation.unary.add"
] | 836,028 | 836,029 | u630936832 | cpp |
p03021 | #include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = ge... | #include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = ge... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,042 | 836,043 | u018679195 | cpp |
p03024 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
if (s[i] == 'o') {
ans++;
}
}
if (15 - s.size() + ans > 7) {
cout << 'YES' << endl;
} else ... | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
if (s[i] == 'o') {
ans++;
}
}
if (15 - s.size() + ans > 7) {
cout << "YES" << endl;
} else ... | [
"literal.string.change",
"io.output.change"
] | 836,054 | 836,055 | u118875091 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (char c : s) {
if (c == 'o')
cnt++;
}
if ((15 - s.size() + cnt) >= 8)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (char c : s) {
if (c == 'o')
cnt++;
}
if ((15 - s.size() + cnt) >= 8)
cout << "YES";
else
cout << "NO";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,058 | 836,059 | u546943614 | cpp |
p03024 | #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) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,060 | 836,061 | u677149117 | cpp |
p03024 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,062 | 836,063 | u043443359 | cpp |
p03024 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (in... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (in... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 836,064 | 836,065 | u434662823 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 836,066 | 836,067 | u146724119 | cpp |
p03024 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
const char *s = S.c_str();
size_t lose = 0;
for (size_t i = 0; i < S.size(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose >= 8) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
const char *s = S.c_str();
size_t lose = 0;
for (size_t i = 0; i < S.size(); i++) {
if (s[i] == 'x')
lose++;
}
if (lose >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,068 | 836,069 | u840713046 | cpp |
p03024 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
char str[233];
int main() {
scanf("%d", str + 1);
int len = strlen(str + 1), tot = 0;
for (int i = 1; i <= len; i++)
tot += str[i] == 'x';
if (tot >= 8)
puts("NO");
else
puts("YES");
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
char str[233];
int main() {
scanf("%s", str + 1);
int len = strlen(str + 1), tot = 0;
for (int i = 1; i <= len; i++)
tot += str[i] == 'x';
if (tot >= 8)
puts("NO");
else
puts("YES");
}
| [
"literal.string.change",
"call.arguments.change"
] | 836,070 | 836,071 | u677509328 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,072 | 836,073 | u085486962 | cpp |
p03024 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n = 0;
int k = s.size();
for (int i = 0; i < k; i++) {
if (s[i] == 'x')
n++;
}
cout << (n > 7 ? "No" : "Yes") << endl;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n = 0;
int k = s.size();
for (int i = 0; i < k; i++) {
if (s[i] == 'x')
n++;
}
cout << (n > 7 ? "NO" : "YES") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,074 | 836,075 | u179970156 | cpp |
p03024 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define MOD 1000000000 + 7
#define INF 1000000000
typedef long long ll;
using namesp... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define MOD 1000000000 + 7
#define INF 1000000000
typedef long long ll;
using namesp... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,076 | 836,077 | u345965293 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for (int i = (x), i##_len = int(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_le... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for (int i = (x), i##_len = int(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_le... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,078 | 836,079 | u895641117 | cpp |
p03024 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"identifier.change",
"call.function.change"
] | 836,080 | 836,081 | u376082984 | cpp |
p03024 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 836,082 | 836,083 | u297203024 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n = 0;
string s;
cin >> s;
rep(i, s.size()) if (s[i] == 'x') n++;
if (15 - s.size() - n >= 8)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n = 0;
string s;
cin >> s;
rep(i, s.size()) if (s[i] == 'x') n++;
if (15 - n >= 8)
cout << "YES";
else
cout << "NO";
} | [
"expression.operation.binary.remove"
] | 836,084 | 836,085 | u441296840 | cpp |
p03024 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... | [
"identifier.change",
"call.function.change"
] | 836,086 | 836,087 | u675296835 | cpp |
p03024 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... | [
"identifier.change",
"call.function.change"
] | 836,088 | 836,087 | u675296835 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | [
"preprocessor.define.value.change"
] | 836,089 | 836,090 | u405923605 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 836,093 | 836,094 | u640323045 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int x = n.size();
int ans = 0;
for (int i = 0; i < x; i++) {
if (n[i] == '×') {
ans++;
}
}
if (ans >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int x = n.size();
int ans = 0;
for (int i = 0; i < x; i++) {
if (n.at(i) == 'x') {
ans++;
}
}
if (ans >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"literal.string.change"
] | 836,101 | 836,102 | u521723672 | 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 (S.size() < 8)
cout << "YES" << endl;
if (8 <= S.size()) {
if (cnt < S.size() - 7)
cout << "No" << endl;
else
... | #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 (S.size() < 8)
cout << "YES" << endl;
if (8 <= S.size()) {
if (cnt < S.size() - 7)
cout << "NO" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 836,103 | 836,104 | u495461806 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define BEGIN \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"expression.operation.binary.remove"
] | 836,121 | 836,122 | u743561048 | cpp |
p03024 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int r, x, D;
r = a.size();
x = 0;
for (int i = 0; i < r; i++) {
if (a[i] == '○') {
x++;
}
}
x = 15 - r + x;
if (x > 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int r, x, D;
r = a.size();
x = 0;
for (int i = 0; i < r; i++) {
if (a[i] == 'o') {
x++;
}
}
x += 15 - r;
if (x > 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 836,125 | 836,126 | u902787159 | cpp |
p03024 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
string s;
cin >> s;
int ans = 0, k = s.size();
for (char c : s) {
if (c == 'o')
ans++;
}
cout << (ans + k >= 8 ? "YES" : "NO") << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve(void) {
string s;
cin >> s;
int ans = 0, k = s.size();
for (char c : s) {
if (c == 'o')
ans++;
}
cout << (15 - k + ans >= 8 ? "YES" : "NO") << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 836,129 | 836,130 | u344412812 | cpp |
p03024 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class ... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 836,134 | 836,135 | u706343625 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.