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 - res >= 8) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | #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 - res >= 8) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
| [
"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
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) { return a * b / GCD(a, b); }
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// chcp 65001
signed main() {
string s;
cin >> s;
// 14買いで7回以上かつ
int cnt{};
for (auto x : s) {
if (x == 'o') {
cnt++;
}
}
// 15-s.size()が
if (s.size() <= 7) {
cout << "YES" << endl;
} else if (15 - s.size() <= 7 + cnt) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #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
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) { return a * b / GCD(a, b); }
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// chcp 65001
signed main() {
string s;
cin >> s;
// 14買いで7回以上かつ
int cnt{};
for (auto x : s) {
if (x == 'o') {
cnt++;
}
}
// 15-s.size()が
if (s.size() <= 7) {
cout << "YES" << endl;
} else if (s.size() - cnt <= 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"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<ll, LP> LPP;
int main() {
string s;
int num = 0;
cin >> s;
REP(i, (int)s.length()) {
if (s[i] == 'o')
num++;
}
num += 15 - (int)s.length();
if (num >= 8)
cout << "YES" << endl;
else
cout << num << "NO" << endl;
} | #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<ll, LP> LPP;
int main() {
string s;
int num = 0;
cin >> s;
REP(i, (int)s.length()) {
if (s[i] == 'o')
num++;
}
num += 15 - (int)s.length();
if (num >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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";
} else {
ans = "YES";
}
cout << ans << endl;
return 0;
}
| #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";
} else {
ans = "YES";
}
cout << ans << endl;
return 0;
} | [
"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 rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (i).rbegin(), (i).rend()
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
inline constexpr int modf(ll n) {
ll ans = 1;
rep(i, 0, n) { ans = ans * (n - i) % MOD; }
return ans;
}
inline long double median(vector<ll> v) {
ll size = v.size();
sort(v.begin(), v.end());
if (size % 2 == 1)
return v[(size - 1) / 2];
else
return v[(size / 2) - 1];
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct unionfind {
vector<ll> d;
unionfind(ll x) : d(x, -1) {}
ll root(ll x) { return d[x] < 0 ? x : d[x] = root(d[x]); }
ll size(ll x) { return -d[root(x)]; };
bool unite(ll x, ll y) {
x = root(x), y = root(y);
if (x != y) {
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
}
return x != y;
}
bool find(ll x, ll y) { return root(x) == root(y); }
};
int main() {
string s;
cin >> s;
ll k = s.size(), cnt = 0;
rep(i, 0, k - 1) if (s[i] == 'x') cnt++;
if (cnt < 8)
cout << "YES";
else
cout << "NO";
}
| #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 rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (i).rbegin(), (i).rend()
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
inline constexpr int modf(ll n) {
ll ans = 1;
rep(i, 0, n) { ans = ans * (n - i) % MOD; }
return ans;
}
inline long double median(vector<ll> v) {
ll size = v.size();
sort(v.begin(), v.end());
if (size % 2 == 1)
return v[(size - 1) / 2];
else
return v[(size / 2) - 1];
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct unionfind {
vector<ll> d;
unionfind(ll x) : d(x, -1) {}
ll root(ll x) { return d[x] < 0 ? x : d[x] = root(d[x]); }
ll size(ll x) { return -d[root(x)]; };
bool unite(ll x, ll y) {
x = root(x), y = root(y);
if (x != y) {
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
}
return x != y;
}
bool find(ll x, ll y) { return root(x) == root(y); }
};
int main() {
string s;
cin >> s;
ll k = s.size(), cnt = 0;
rep(i, 0, k) if (s[i] == 'x') cnt++;
if (cnt < 8)
cout << "YES";
else
cout << "NO";
}
| [
"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 << "NO";
}
return 0;
} | #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 << "YES";
}
return 0;
} | [
"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 = 0, xcount = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o')
ocount++;
else
xcount++;
}
if (ocount >= 8 || ocount + 15 - s.size() >= 8)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #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 = 0, xcount = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o')
ocount++;
else
xcount++;
}
if (ocount >= 8 || ocount + 15 - s.size() >= 8)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| [
"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 + (15 - S.length()) >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #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 + (15 - S.length()) >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"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 ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int get_ab(string str) {
bool isA = false;
int res = 0;
if (str[0] == 'A')
isA = true;
for (int i = 1; i < str.length(); i++) {
if (isA && str[i] == 'B') {
res++;
isA = false;
} else if (str[i] == 'A')
isA = true;
else
isA = false;
}
return res;
}
vector<bool> isVisited;
vector<int> Accu;
vector<vector<int>> Datas;
int N;
void DEF(int pos, int sum) {
bool all_visited = true;
rep(i, N) if (isVisited[i] == false) {
all_visited = false;
break;
}
Accu[pos] = sum;
rep(i, N) {
if (isVisited[i] == true)
continue; //すでに訪れている
if (Datas[pos][i] == -1)
continue; //繋がっていない
isVisited[i] = true;
DEF(i, sum + Datas[pos][i]);
}
}
ll gcd(ll A, ll B) {
int r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
return B;
}
vector<bool> to_binary(int x) {
vector<bool> res;
while (x != 0) {
res.push_back(x % 2);
x /= 2;
}
return res;
}
vector<bool> pad(vector<bool> inp, int num) {
while (inp.size() != num) {
inp.push_back(false);
}
return inp;
}
vector<bool> proc(int x, int n) {
vector<bool> res = pad(to_binary(x), n);
reverse(res.begin(), res.end());
return res;
}
int main(void) {
// Program Start
string S;
cin >> S;
int win = 0;
rep(i, S.size()) win += (S[i] == 'o' ? 1 : 0);
if (win >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
ProgramEndPointLabel:;
// Program End
system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| #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 ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int get_ab(string str) {
bool isA = false;
int res = 0;
if (str[0] == 'A')
isA = true;
for (int i = 1; i < str.length(); i++) {
if (isA && str[i] == 'B') {
res++;
isA = false;
} else if (str[i] == 'A')
isA = true;
else
isA = false;
}
return res;
}
vector<bool> isVisited;
vector<int> Accu;
vector<vector<int>> Datas;
int N;
void DEF(int pos, int sum) {
bool all_visited = true;
rep(i, N) if (isVisited[i] == false) {
all_visited = false;
break;
}
Accu[pos] = sum;
rep(i, N) {
if (isVisited[i] == true)
continue; //すでに訪れている
if (Datas[pos][i] == -1)
continue; //繋がっていない
isVisited[i] = true;
DEF(i, sum + Datas[pos][i]);
}
}
ll gcd(ll A, ll B) {
int r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
return B;
}
vector<bool> to_binary(int x) {
vector<bool> res;
while (x != 0) {
res.push_back(x % 2);
x /= 2;
}
return res;
}
vector<bool> pad(vector<bool> inp, int num) {
while (inp.size() != num) {
inp.push_back(false);
}
return inp;
}
vector<bool> proc(int x, int n) {
vector<bool> res = pad(to_binary(x), n);
reverse(res.begin(), res.end());
return res;
}
int main(void) {
// Program Start
string S;
cin >> S;
int lose = 0;
rep(i, S.size()) lose += (S[i] == 'x' ? 1 : 0);
if (lose < 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
ProgramEndPointLabel:;
// Program End
system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| [
"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 = b;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string str;
cin >> str;
if (count(str.begin(), str.end(), 'x') >= 8) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #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 = b;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string str;
cin >> str;
if (count(str.begin(), str.end(), 'x') >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| [
"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;
else {
cout << "No" << endl;
}
return 0;
} | #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;
else {
cout << "NO" << endl;
}
return 0;
} | [
"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;
signed main() {
string s;
cin >> s;
ll cnt;
rep(i, s.size()) if (s[i] == 'o') cnt++;
if (cnt + 15 - s.size() >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
// `.`..`(WNNNNNNMNWWWH9rttwgHM8OtttwwVtttrrtrttrw0rtrtwrrrtrZUAOOrrrXWppHMHyZHpWHMHMkWWVHMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.`..`(WMNMHfWH9ZtrtAdNM8ttttOwVtrrtrrtrrrrrdrrttrZkOrrrrrrXWyrtrrZWWWWMmwXWppWHHMmWHkWMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// .`.```_..(HMfWH9OtttwXWHBrttrOw0rttrOvrrrtrZrrRrtrrrtZHwrrrrrwwZHyrrrrZWWpWMmwWppkWHHMkHNkVWMNNNNN#NN#NN#NN#NN#NN#NN#NN#NN#NN#NNNN
// .``..
// ..HNfWW9wtrrOdWHM0trttOdSrtrtwwrtrtrw0twSrtOrrrrZHwtrrrrrXwdWwrrrrXHppWNkXWpkvWH@MkHMHkWMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.
// -jMWWXXwtrttO0d@BrtrttwXVrtrrwVrrrtrtXrrd0rrXrrrrrZWyrrrrrrZXwWyZOrrvWWpWMkZHbkwrdHMMKMMNHkHMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.
// v8Xdk9ttttrOwXM0tttrtwXwwrtrw0rrtrrtwKrrd0rrXrtrrrrZHkwrrrrrrXkVkrrrvrZHWpHHkWkwrwvVHHNWMMMMkWMNNNNNNN#NN#NN#NN#NN#NN#NN#NNNN
// ..
// JHZdbKOrrrtrtwWWOOttrOwSzVrOrw0rrttrrrdRrrdZrrdOrtrtrrZHkXwrrrrrZWXHwwrrrvWWWWNkWkvrrrwWM@RMMMNNmWMNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// .
// .JGXHStttttrtwW9OrtrrrdSX0rtrdStrtrtrrwHVrrdkrrtSrrrrrrrdMyXrrrrrvXWXWmwvrrvdHWWNkWyvvvvvT@MNWM#N#MNWMMNNNNNNNNNNNNNNNNNNNNNNNNN
// (.zqHXZtrttrrOwU0trttrOdWX0OtOdRrrtrrrrrdNrrrdkrrrXOwrrrrrrdNySrrrrrwXXkUmvvwvrZHWfNkUkvwvvvdMMMRM#MMNNNkMMNNNNNN#NN#NN#NN#NN#NNNN
// (wdS0OttrtOOrwSrtttrrtwKukrrrwKrrrrrtrrwW@rrrXKrrrZkr0OrrrrrWNwkrvvrrvzXkXHwvvrvwWVVHkUyrvvvvZHMMNWMMNNNNNkWMNNNNNNNNNNNNNNNNNNNNN
// wWtrrttrrOwrwStrttrtrwWZXOrtwX0rrrttrrrXMSrrrXWrrrrXrwvrrrrvZHHXkrrrrvrzWkXNyvrvvvWWWHHWwvvvvvwHNMHRM#NNNNNMmWMMNNNNNNNNNNNNNNNNNN
// 8OtttrwZwwtwSrrttrrrwdyXwtrrdWrrtrrrrrdWH0rrrXWOrrrwRz0rrvrrrdMHWwvvrrvvXWkWHyrvvvrWWWHkHvvvvvvwWMMMNWMMNNNNNMHWMMNMNNNN#NN#NNNNNN
// wttrrdVrZrwWwtOrrrrwdWX0rrtdH0rrrtrrtwWHHrrrrXWRrrvrXXXrrvrrrvXHkSwvvrvrrXWkVHyvvvvwHVWHWRvvvvvvdHdMMMKMNNNNNNNMNkWMNNNNNNNNNNNNNM
// ttrrd0rwrOX0rrtrrtwXHXSrwrwHKrtrtrrtrdWH#rrrrdpkrrrrvHwkwvrrvrZWHXkzzvvvvwUWkpNwvrvvZHfVNHwvvvvvzXHWMNMNMNNNNNNNN#NkWMNNNNNNNNNM3>
// rrrdSrwwtXSrrtrrrwXWWKwrrrdHXrrrrrrrwWWH#vrrrvWpvrrvrdRXwvrvrvvXHWWwkvvrvvwWWKWHzwvvvXHVWWHvzzzzvzWRHMMMNHMNNNNNNNNMNkMMNNNNNN@<<>
// OOd9rw0rdKOtrtrrruXHW0rrrdH#rrrrrrrrdpWp#rrrrrXWkvrvvrWwkrvrrvwwWHpKdvvrrvvXHHfWmdwvzwWHVHWkzzzzzzwWXHMHHNWMNNNNNNNNNMNkMNNNN#z>>>
// OdSOwSwwW0rrrrtrwXNW8rrtrWWSrtrrrrrrXpHWHvrrrrXpHrrrvwZHdyvvvvvvXHpHwkvvvvvrXHHfNwXvzzwWWWKHzzzzzzzWSWHHHMMKMNNNNNNNNNNMNKMNN#>>;>
// wWwOXrwX8rtrrrrwWWpHrrrrdNNrrrrrrrrwppNWHrvrvrypWwvvrrvXKWvrvrvvZXHHkXzvvvvvwWWWWNdkvvzXHfHWkXzzzzzwWXHHHHNMHMNNNNNNNNNNNNNWMN+>>>
// R0rd0rdKrrtrtrrdWHWSrrrwWWDrrrrrrrrXpWHqWvrrrvdWbRvvrvvwWZkvvvrvvXHbHzRvvvvvvdHHpHkWwvzXWHWHHzuzzzzzXXWHHHMHMNHMNNNNNNNNNNNMNWh<>>
// wOwSrwXSrtrtrrwHWWMwrrrdNWSrrrrrrrvppWpHprrvrvddWHwvvrrvXHXwvvvrvzXWHkXzvvvvvzWWKWNdRvzzXWWHHXzzzzzzzudWHbH@HNNWMNNNNNNNNNNNNNkHe>
// rOXwwwKrrrrrrrXWHHDrrwrdHHXwrrrrrrwpWWbHWvvvrvwHHpHrvvvrXWHWwvvrwwXHkHdkvzvvvvZHHpHKWzzzwWHWHRzzzzuzzzzWHHkHHMMNWMNNNNNNNNNNNNNNKm
// rdX0OXSrrtrrrdHHWMXrrrwHWHrrrrrrrrXppqWHWkrrvvwWMHHXwwvvvZWKRvvvvrWHWHwWvzvzzzzXWKWNXRzzwXWWNHzzzzzzzzzXUHkHWMMHNWMNNNNNNNNNNNNNNN
// wSwww#rrrrrrwWWHM#vrrrd#WKvrrrrrvvXppmWMWkvvvvwXNNpNvSXzzvdHkkvvzvdWWWRXwzzzzzzdNNpMkHzzzWVHHpXzzzzzzzzdkHkHHHNMHNkMNNNNNNNNNNNNNN
// XwSwWwrrrrrrdHWWMKrvrvWHWSrvrvvvvwpppHW#HRwUUUWWMMMMMHHHHmmXHWwvvzwWHbNwRzzzzzzzWWWWHWkzzdXWWWRzzzzzzzuzWWbHHWMNMMNkMNNNNNNNNNNNNN
// 8drd#rrrrrrwWWkHMmXmywMfWXrvrrrvrwppWNWMNWvrvvwvW#MNHmdkrvvXHMMmmwzdWpM0WzzzzzzzdHHWNUHzzzWWmHHzzuzzuzuzWXbbNkHMqMHNkHNNNNNNNNNNNN
// dSwWSrrrrrrdHHHMHrrrwWMfWvvvrvrrrdppWNW#WWRvvrvvdM?WNHkXkzvvdWMHXHNmHHHkfwzzzzzzXHHpMWHkzuXWHNWXzzuzzuzzXXkkHbHMHMMMMkMNNNNNNNNNNN
// Xrd#wrrrrrrXpHWH#rrrvdMWWvrrvrvvrdppWHW#(NWwvvvvwMr~TNHmdkvzvXWMKzzzWMHKXXzzzzzzuWHbHkWKuzdWWHWkzzzuzzuuXXHkHkgHk@H@HHkMNNNNNNNNNN
// RvWDrrrrrrwHWkMW#rvvrMMfWwrvrrvvrdppWHW@~?HHuvvrvdb_~?NWkdkzzzUWMkzuuWWHWXuzwzzuzXHHHKWHuzzWW@WRuzuzzzzzduWbHHgMH@HHHMMHMNNNNNNNNN
// rdHwrrrrrrXHHWNW#vvvdMMHWkvrvrrvrdppWbWD~~?XKkrrrwMc~~~THHZHwzzWHNkvzwMRdHHzuzzzzXHHWHXNkuzdWHkWuzzuzuzzXzWkHHHMHHHkH@MMNWMNNNNNNN
// rdHvrrrrrrWkHHHW#rrrd#dNWKrvrvvrvwbpWWW$...vVkkOrtXb~~~~(WHkWkvwWWMkzzWRXkSWXzzzuwmNWHXHRuuwHMKWzzuzzzuzXzWHWHHMHHHkkMMMHHWNNNNNNN
// wW#rrvrrrwHWHMpWNrvrd@(NWWvrrrrrvvWpWXH$..._?dkkttOWl~~~~~?HHdHXXbWMkzUHXWkzzzzzzuHNk#XHHzzukHHXzuzzzuzuXuXqkMHMHMbbkHHH@HNWMNNNNN
// dH#rrrvrrdNWWNpHHwrrd@_WHWkrvvrrrrZpWXWr...__?WkWyOvN~~~~~__7HkWkbbkNkzXHZkzzzuzzzWHW#ugbXuzWWHXXuzzuzuuuzXkkHHH@MbkHMHMHMMNWMNNNN
// X@KrrvrvrXNHWHpHHHrrdb~(NWHrrrrrrrrXWXWr..`...-7HZkzvn~~~~~~~_TNyHHkHMyzXkXuzzzzuuWHW#uHkkzzWHHXuzzzzuzzuuXHkHHHMNbkHHHHHHMMNWMNNN
// WHKvvrvrvXHNMbpHmHkOwb..?HWRrwOrtrtrWKWr`.`.`..._?6dkJn~~~~~~-_~7NHMHbNkuUkzzuzzzuWHW#uHbRzuXHHXzzuuuuzuuzXHkHHMMbkkHkMkkkMMMNUMMN
// WHKrrvrrvXqHMpfHHHWkrb...vkHyOrtttttdNXr.`.J>~-((J+ggQkHXHHHmaJz7&JWHMMWkuHXzuuuzzWgHHwHkKuzXMKXuzuuzuzzuzdkHHHHHkHWMHHbkWHMMMNXM#
// Wg#rvrvrrXmHNpfHHHMMRd-.._4kfyttttllOHWr``
// <udT"""7"""""TMHHMNHHMNgv4HMRXHXHwuzzzuWHHKXHkHzzXMSWzuzzuzuuzudbkHHHHkkHqHuWkWHHMMMNWM
// WHNrvrvvvXHmNppgg@MMMHr..` UkWOlllllldW$..?! ` `
// ?@MMHHMM#NMMmMkXXWkHuzuzuWNHSXHHHuuXNSWuzuuzuzuzuWkHNgMkkkMHSuWkqmqHHMNNK
// WHMkvvrvrXHHMppHHHMNMTN_``` 4kWOz====vXP` ` `
// ``.HggmgM@MH###NKkkuXWHzzuXHHMzdMHHuzWNXKzuuzuzuzuuHkHHNMkkHHBuzWkHHHHuHMMM
// WHHNzvvrvwHMMppHMMMM>.#L`````?kyy====?0S`` ` `
// ``...dmqqqmmHHHMMM#WRSzuzWHuzXHq#uWHHHzuWHXKzuzzuzuzuXHkHWMNkWM#uzuWHHHHSuuWM#
// WM@MkwvvrzXMMHpgHMMM[.MN.`````(HXy1???zd.`` ` ` `
// dHkkqkkqkHHHHHHMMWWXzzuzwWwXHHKXMkHHuXMRXSuuuzuuzuzXHkHdHHWHHXuuwWHqHHuXzXWM
// XHHMNyrvvwdW@HpHWMHML MM[` ` `.4kGz<<>Or``` `
// `dWpbbbbbHMMbbbHHMXXuzzuzuzXWHHSXMkHHuXMSXuzzuzzuzuzWkkHWMHMSwuzzXHkHHXuzuWd#
// dHHH@NyzwwwWHMHHWMMMR dW]`` ` ```(HZx<<<4.```` `` ``
// OZppfppppWfpWpK9NKXuuzuuzuXWHHudMqNHXWNuHuzzuzuzuzuHkHXMMBuuuzuuWkHHUuuuXSMS
// wWHMMMMkwwvdNpHHHM#MH-jWP``` `` ```7kI<:<h.``````` ``
// ,2OWVVyVVyWWWWIdMKWzuuuzzuXHHSwHHHHKXHHXSuuzuuzuzuXHHHXMXuuuuuuXHHHuzuuXSX#X
// wdWHMMMMmwXwHbpMNHMM@b.hb```````````
// 7x1_(>_```````````(x7UUUV0XwvCI1dMWKXuzzuzuWHHudMkgkWbMSXuzzzuzzuzuWkHSW#zXwXuXXWHHuuXXuWXWSX
// vvXWHMMHWNkvWHbbMWMMMN_JF.```` ``
// `````?1_(_.`.`........(<777=<<<><<+dMXUuzuuuuWWMRwMHWMkWHHXSuuzuzuzzuXqHHXMHUXuXXHHHSuuwuXWud8uH
// mzzXWH#zHbHkXNbbWMMMMD~(_```````````````
// .~_`.``.`.`.....___(<~(<<(<<dHkkuuuuuXkHHuWMkHkkkHSXXzuuzuuuuzXHHSd#uuXXWHHXuuuZuXSuqHudS
// UHzzXWSXXWbbHHHbWHMH#<~...```` ``````````````.```.`
// -_____<~~_<_<~~(jMWSuzuzuXWHMHXMHHHkkH#XSuzzuzuzuzuKkHXMQkWHHWUXuXXUuXUuXHuXBu
// .(Smd8wSvXbbbbHHHWHW3___.``````` ``
// ``````.```.```.`...._.._~~..~_~~(#WuzuuzXXkHMqMMHMkkkMUXuXzuuwuuzuXkHSWMWUUuuuXXUUuXHXXWSuXHXu
// .. JKwSvwzWkkkkHHHH5~~..```````````````````.```.````````.`
// .........dWSuuzzzdkHMW@MHMkkkHHXXuzuuXSuzuuWWHd#uuuXXkWSuXXWUXXHUXWHuuu
// .`(HXSzzzzwWbkWHNHr_...``````````````````.```````.```````.`.`..`.-.(HKuzzuuwHHMNMHHMkkkHHuZuuzuuXuuuuXkHWMHHHUUuXXXWHXXHHUuXW8uuuu
// .-MXWwzzzuzXkHHMHHN-.``````````
// ````````````.`.````.``.```.`.`....-dXUXuzuXHWHMMHHBWHMMMSZuzuuzXXzuuXHHMHMHkHHHHHHHWHHSuXkHWSuuuuX
// (#XKzzzzzuzuWHHkWHHp
// ``.````````````````````````.````````.....-((-(NSXuzzXHW@D:~`(/1-
// .kXuzuuzXSuuzXXkHWMHHHHHHHHMWuuuQXUXWuuuXuXH
// MXWzuzzzzzuXHHbHNMMMt`.```````````````````````````.`.` ..-J7"!``
// XKuzzuXHHM9;/<-.J-u!JXXuuzuXWuuuuXHHH#WMNHmkkkuXXkWUXXWXXuuuXqHH
// XWzzzzuzzwXHHHH#"````<.````````````````````.``.`...-c"7``` ` `
// `(BzuuuXmHH8<!(- ?_!`jWUuzuuuWuuuzXWHNH> ..7WHHqHmQkWWXXuuuuuXWqHH
// SwuzzzXuwXHNHY`` `` <,`.`````````````` `` ..J7=``` ` ` ``
// ````.#zuzXXHHH$~`` ```(_(HSuuuzuXSuzuuXHHWCi(` ._ ?WggHHHHWkkkkWHHHHMH
// zzzuzuzwWHMY!` ` ` `(&.```````````` ..J7^ `` ` ` ` ` `. .HXuuXWHW#!` `
// ```` (WUuzzuXXSzuuudHHXY$. : (..``.THHkqkHHHgHHMHkkk zzzzzzXHWK`` ` `` ` ` `
// TJ.``````..J7=```` ` ` ` ` `` ` `.8zuXXHHW=` ``
// ..(XSuuuuuXWuuuuXHWH5~~` .`_?_,-``.TMMMMMMHkkqqHHH zzuuzdHHkN ` ` ` `` `
// ``(Wm,.(J7!``` ` ``` `` `` ` ` ``` .SzuXWHHY ``
// .._~<~~(dSuuuzzXHuuuuXHWHD::?C._.( -`(!_1 ,WHqHHHmqHHHHN zuzXXHHkHM;` ` ` `
// `` ` .;jY= ` .``_`` ` ` ` ` `` ` `.dXuXWm@^
// .._~_.~~~~~(d0uuzuuXHUuuuXHWH5:::::::_.<&._4r?_.;WMMM@MMY"<!` zzXHHHHMHMb``
// `` ` `` `` .J! ` ..`_~ ` ` ` `` ` ` ``.JXXXHY!
// .__.....~.~~~-d0wuzuXXHSuuuXWWH$::::;:::;:+- ~`(.i +HqHHkkHL..`. XWHHHMMHMHM;
// ` ` ` ` ._`` ...(:.=_` ` ` ` ` ````
// .-dVT7^``````......~~~~~_jWuuuuuXHSuzuXHHH3<;:::::;;j<+z ``` -dHNkkMqkkN..``
// HHHMMHHHHNMN.`` ` ` `!`z(. ~..~ ! . ` `` ` ` `
// ..gHr``````````........~~~~_jWuuuuuXkSuuuXHWHC:;::;;:::+v>:((J<!(WHHMkkHNqkM;`..
// HMMkkHHHHM9?b `` ` ` `` .``. ` ` ` ` ``` 4HkkkH,
// ``````.`......~~~~_+KuuuzuXHSuuuXHHK<(::::::<;<J+g9>::;< .4NkkqMHqH]..`
// MHkHHHMM$<<:?L` `` ` ` ` ``.` ` !`` ` ` ` ` `
// ?HbkkHx``````.`..`...~~~~_jKuuuuuXHSuuuqMHD<:<;:<++ddNMB3:;::;:<`
// `,HkkqH@HH].`` kkHHkHY``` (;?h`` ` ` `` ```` ` ` ` ` ` ` ` `
// ```.4XWbHx```..`......~~~~_gKuuuuXWH0uuuXHH3:;++1z<jgMB3<::::::::~`
// `jMkqkHMHHF.`. kHHHH=` . ` _<?L ` ` ` ` ` ` ` ` ` ` ` ` ` ` ?kwWHp
// .`.......~_~~(dKuuuuXWHUuuXWH9++z1<;+jWB3::::;;;::;:;_`` MNkqkqMNMF..` HHk@!.
// ` ` ` ~?L ` ` `` ` `` `` ` ` ` ` ` ` ` `
// -WuXHh..`.....~~~~(dWuuuXXkHUuuXHH9>:<:++YY<:;::::;:::::;:::+.``?HHkHHHM>`.`
| #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;
signed main() {
string s;
cin >> s;
ll cnt = 0;
rep(i, s.size()) if (s[i] == 'o') cnt++;
if (cnt + (15 - s.size()) >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
// `.`..`(WNNNNNNMNWWWH9rttwgHM8OtttwwVtttrrtrttrw0rtrtwrrrtrZUAOOrrrXWppHMHyZHpWHMHMkWWVHMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.`..`(WMNMHfWH9ZtrtAdNM8ttttOwVtrrtrrtrrrrrdrrttrZkOrrrrrrXWyrtrrZWWWWMmwXWppWHHMmWHkWMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// .`.```_..(HMfWH9OtttwXWHBrttrOw0rttrOvrrrtrZrrRrtrrrtZHwrrrrrwwZHyrrrrZWWpWMmwWppkWHHMkHNkVWMNNNNN#NN#NN#NN#NN#NN#NN#NN#NN#NN#NNNN
// .``..
// ..HNfWW9wtrrOdWHM0trttOdSrtrtwwrtrtrw0twSrtOrrrrZHwtrrrrrXwdWwrrrrXHppWNkXWpkvWH@MkHMHkWMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.
// -jMWWXXwtrttO0d@BrtrttwXVrtrrwVrrrtrtXrrd0rrXrrrrrZWyrrrrrrZXwWyZOrrvWWpWMkZHbkwrdHMMKMMNHkHMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// `.`.
// v8Xdk9ttttrOwXM0tttrtwXwwrtrw0rrtrrtwKrrd0rrXrtrrrrZHkwrrrrrrXkVkrrrvrZHWpHHkWkwrwvVHHNWMMMMkWMNNNNNNN#NN#NN#NN#NN#NN#NN#NNNN
// ..
// JHZdbKOrrrtrtwWWOOttrOwSzVrOrw0rrttrrrdRrrdZrrdOrtrtrrZHkXwrrrrrZWXHwwrrrvWWWWNkWkvrrrwWM@RMMMNNmWMNNNNNNNNNNNNNNNNNNNNNNNNNNNN
// .
// .JGXHStttttrtwW9OrtrrrdSX0rtrdStrtrtrrwHVrrdkrrtSrrrrrrrdMyXrrrrrvXWXWmwvrrvdHWWNkWyvvvvvT@MNWM#N#MNWMMNNNNNNNNNNNNNNNNNNNNNNNNN
// (.zqHXZtrttrrOwU0trttrOdWX0OtOdRrrtrrrrrdNrrrdkrrrXOwrrrrrrdNySrrrrrwXXkUmvvwvrZHWfNkUkvwvvvdMMMRM#MMNNNkMMNNNNNN#NN#NN#NN#NN#NNNN
// (wdS0OttrtOOrwSrtttrrtwKukrrrwKrrrrrtrrwW@rrrXKrrrZkr0OrrrrrWNwkrvvrrvzXkXHwvvrvwWVVHkUyrvvvvZHMMNWMMNNNNNkWMNNNNNNNNNNNNNNNNNNNNN
// wWtrrttrrOwrwStrttrtrwWZXOrtwX0rrrttrrrXMSrrrXWrrrrXrwvrrrrvZHHXkrrrrvrzWkXNyvrvvvWWWHHWwvvvvvwHNMHRM#NNNNNMmWMMNNNNNNNNNNNNNNNNNN
// 8OtttrwZwwtwSrrttrrrwdyXwtrrdWrrtrrrrrdWH0rrrXWOrrrwRz0rrvrrrdMHWwvvrrvvXWkWHyrvvvrWWWHkHvvvvvvwWMMMNWMMNNNNNMHWMMNMNNNN#NN#NNNNNN
// wttrrdVrZrwWwtOrrrrwdWX0rrtdH0rrrtrrtwWHHrrrrXWRrrvrXXXrrvrrrvXHkSwvvrvrrXWkVHyvvvvwHVWHWRvvvvvvdHdMMMKMNNNNNNNMNkWMNNNNNNNNNNNNNM
// ttrrd0rwrOX0rrtrrtwXHXSrwrwHKrtrtrrtrdWH#rrrrdpkrrrrvHwkwvrrvrZWHXkzzvvvvwUWkpNwvrvvZHfVNHwvvvvvzXHWMNMNMNNNNNNNN#NkWMNNNNNNNNNM3>
// rrrdSrwwtXSrrtrrrwXWWKwrrrdHXrrrrrrrwWWH#vrrrvWpvrrvrdRXwvrvrvvXHWWwkvvrvvwWWKWHzwvvvXHVWWHvzzzzvzWRHMMMNHMNNNNNNNNMNkMMNNNNNN@<<>
// OOd9rw0rdKOtrtrrruXHW0rrrdH#rrrrrrrrdpWp#rrrrrXWkvrvvrWwkrvrrvwwWHpKdvvrrvvXHHfWmdwvzwWHVHWkzzzzzzwWXHMHHNWMNNNNNNNNNMNkMNNNN#z>>>
// OdSOwSwwW0rrrrtrwXNW8rrtrWWSrtrrrrrrXpHWHvrrrrXpHrrrvwZHdyvvvvvvXHpHwkvvvvvrXHHfNwXvzzwWWWKHzzzzzzzWSWHHHMMKMNNNNNNNNNNMNKMNN#>>;>
// wWwOXrwX8rtrrrrwWWpHrrrrdNNrrrrrrrrwppNWHrvrvrypWwvvrrvXKWvrvrvvZXHHkXzvvvvvwWWWWNdkvvzXHfHWkXzzzzzwWXHHHHNMHMNNNNNNNNNNNNNWMN+>>>
// R0rd0rdKrrtrtrrdWHWSrrrwWWDrrrrrrrrXpWHqWvrrrvdWbRvvrvvwWZkvvvrvvXHbHzRvvvvvvdHHpHkWwvzXWHWHHzuzzzzzXXWHHHMHMNHMNNNNNNNNNNNMNWh<>>
// wOwSrwXSrtrtrrwHWWMwrrrdNWSrrrrrrrvppWpHprrvrvddWHwvvrrvXHXwvvvrvzXWHkXzvvvvvzWWKWNdRvzzXWWHHXzzzzzzzudWHbH@HNNWMNNNNNNNNNNNNNkHe>
// rOXwwwKrrrrrrrXWHHDrrwrdHHXwrrrrrrwpWWbHWvvvrvwHHpHrvvvrXWHWwvvrwwXHkHdkvzvvvvZHHpHKWzzzwWHWHRzzzzuzzzzWHHkHHMMNWMNNNNNNNNNNNNNNKm
// rdX0OXSrrtrrrdHHWMXrrrwHWHrrrrrrrrXppqWHWkrrvvwWMHHXwwvvvZWKRvvvvrWHWHwWvzvzzzzXWKWNXRzzwXWWNHzzzzzzzzzXUHkHWMMHNWMNNNNNNNNNNNNNNN
// wSwww#rrrrrrwWWHM#vrrrd#WKvrrrrrvvXppmWMWkvvvvwXNNpNvSXzzvdHkkvvzvdWWWRXwzzzzzzdNNpMkHzzzWVHHpXzzzzzzzzdkHkHHHNMHNkMNNNNNNNNNNNNNN
// XwSwWwrrrrrrdHWWMKrvrvWHWSrvrvvvvwpppHW#HRwUUUWWMMMMMHHHHmmXHWwvvzwWHbNwRzzzzzzzWWWWHWkzzdXWWWRzzzzzzzuzWWbHHWMNMMNkMNNNNNNNNNNNNN
// 8drd#rrrrrrwWWkHMmXmywMfWXrvrrrvrwppWNWMNWvrvvwvW#MNHmdkrvvXHMMmmwzdWpM0WzzzzzzzdHHWNUHzzzWWmHHzzuzzuzuzWXbbNkHMqMHNkHNNNNNNNNNNNN
// dSwWSrrrrrrdHHHMHrrrwWMfWvvvrvrrrdppWNW#WWRvvrvvdM?WNHkXkzvvdWMHXHNmHHHkfwzzzzzzXHHpMWHkzuXWHNWXzzuzzuzzXXkkHbHMHMMMMkMNNNNNNNNNNN
// Xrd#wrrrrrrXpHWH#rrrvdMWWvrrvrvvrdppWHW#(NWwvvvvwMr~TNHmdkvzvXWMKzzzWMHKXXzzzzzzuWHbHkWKuzdWWHWkzzzuzzuuXXHkHkgHk@H@HHkMNNNNNNNNNN
// RvWDrrrrrrwHWkMW#rvvrMMfWwrvrrvvrdppWHW@~?HHuvvrvdb_~?NWkdkzzzUWMkzuuWWHWXuzwzzuzXHHHKWHuzzWW@WRuzuzzzzzduWbHHgMH@HHHMMHMNNNNNNNNN
// rdHwrrrrrrXHHWNW#vvvdMMHWkvrvrrvrdppWbWD~~?XKkrrrwMc~~~THHZHwzzWHNkvzwMRdHHzuzzzzXHHWHXNkuzdWHkWuzzuzuzzXzWkHHHMHHHkH@MMNWMNNNNNNN
// rdHvrrrrrrWkHHHW#rrrd#dNWKrvrvvrvwbpWWW$...vVkkOrtXb~~~~(WHkWkvwWWMkzzWRXkSWXzzzuwmNWHXHRuuwHMKWzzuzzzuzXzWHWHHMHHHkkMMMHHWNNNNNNN
// wW#rrvrrrwHWHMpWNrvrd@(NWWvrrrrrvvWpWXH$..._?dkkttOWl~~~~~?HHdHXXbWMkzUHXWkzzzzzzuHNk#XHHzzukHHXzuzzzuzuXuXqkMHMHMbbkHHH@HNWMNNNNN
// dH#rrrvrrdNWWNpHHwrrd@_WHWkrvvrrrrZpWXWr...__?WkWyOvN~~~~~__7HkWkbbkNkzXHZkzzzuzzzWHW#ugbXuzWWHXXuzzuzuuuzXkkHHH@MbkHMHMHMMNWMNNNN
// X@KrrvrvrXNHWHpHHHrrdb~(NWHrrrrrrrrXWXWr..`...-7HZkzvn~~~~~~~_TNyHHkHMyzXkXuzzzzuuWHW#uHkkzzWHHXuzzzzuzzuuXHkHHHMNbkHHHHHHMMNWMNNN
// WHKvvrvrvXHNMbpHmHkOwb..?HWRrwOrtrtrWKWr`.`.`..._?6dkJn~~~~~~-_~7NHMHbNkuUkzzuzzzuWHW#uHbRzuXHHXzzuuuuzuuzXHkHHMMbkkHkMkkkMMMNUMMN
// WHKrrvrrvXqHMpfHHHWkrb...vkHyOrtttttdNXr.`.J>~-((J+ggQkHXHHHmaJz7&JWHMMWkuHXzuuuzzWgHHwHkKuzXMKXuzuuzuzzuzdkHHHHHkHWMHHbkWHMMMNXM#
// Wg#rvrvrrXmHNpfHHHMMRd-.._4kfyttttllOHWr``
// <udT"""7"""""TMHHMNHHMNgv4HMRXHXHwuzzzuWHHKXHkHzzXMSWzuzzuzuuzudbkHHHHkkHqHuWkWHHMMMNWM
// WHNrvrvvvXHmNppgg@MMMHr..` UkWOlllllldW$..?! ` `
// ?@MMHHMM#NMMmMkXXWkHuzuzuWNHSXHHHuuXNSWuzuuzuzuzuWkHNgMkkkMHSuWkqmqHHMNNK
// WHMkvvrvrXHHMppHHHMNMTN_``` 4kWOz====vXP` ` `
// ``.HggmgM@MH###NKkkuXWHzzuXHHMzdMHHuzWNXKzuuzuzuzuuHkHHNMkkHHBuzWkHHHHuHMMM
// WHHNzvvrvwHMMppHMMMM>.#L`````?kyy====?0S`` ` `
// ``...dmqqqmmHHHMMM#WRSzuzWHuzXHq#uWHHHzuWHXKzuzzuzuzuXHkHWMNkWM#uzuWHHHHSuuWM#
// WM@MkwvvrzXMMHpgHMMM[.MN.`````(HXy1???zd.`` ` ` `
// dHkkqkkqkHHHHHHMMWWXzzuzwWwXHHKXMkHHuXMRXSuuuzuuzuzXHkHdHHWHHXuuwWHqHHuXzXWM
// XHHMNyrvvwdW@HpHWMHML MM[` ` `.4kGz<<>Or``` `
// `dWpbbbbbHMMbbbHHMXXuzzuzuzXWHHSXMkHHuXMSXuzzuzzuzuzWkkHWMHMSwuzzXHkHHXuzuWd#
// dHHH@NyzwwwWHMHHWMMMR dW]`` ` ```(HZx<<<4.```` `` ``
// OZppfppppWfpWpK9NKXuuzuuzuXWHHudMqNHXWNuHuzzuzuzuzuHkHXMMBuuuzuuWkHHUuuuXSMS
// wWHMMMMkwwvdNpHHHM#MH-jWP``` `` ```7kI<:<h.``````` ``
// ,2OWVVyVVyWWWWIdMKWzuuuzzuXHHSwHHHHKXHHXSuuzuuzuzuXHHHXMXuuuuuuXHHHuzuuXSX#X
// wdWHMMMMmwXwHbpMNHMM@b.hb```````````
// 7x1_(>_```````````(x7UUUV0XwvCI1dMWKXuzzuzuWHHudMkgkWbMSXuzzzuzzuzuWkHSW#zXwXuXXWHHuuXXuWXWSX
// vvXWHMMHWNkvWHbbMWMMMN_JF.```` ``
// `````?1_(_.`.`........(<777=<<<><<+dMXUuzuuuuWWMRwMHWMkWHHXSuuzuzuzzuXqHHXMHUXuXXHHHSuuwuXWud8uH
// mzzXWH#zHbHkXNbbWMMMMD~(_```````````````
// .~_`.``.`.`.....___(<~(<<(<<dHkkuuuuuXkHHuWMkHkkkHSXXzuuzuuuuzXHHSd#uuXXWHHXuuuZuXSuqHudS
// UHzzXWSXXWbbHHHbWHMH#<~...```` ``````````````.```.`
// -_____<~~_<_<~~(jMWSuzuzuXWHMHXMHHHkkH#XSuzzuzuzuzuKkHXMQkWHHWUXuXXUuXUuXHuXBu
// .(Smd8wSvXbbbbHHHWHW3___.``````` ``
// ``````.```.```.`...._.._~~..~_~~(#WuzuuzXXkHMqMMHMkkkMUXuXzuuwuuzuXkHSWMWUUuuuXXUUuXHXXWSuXHXu
// .. JKwSvwzWkkkkHHHH5~~..```````````````````.```.````````.`
// .........dWSuuzzzdkHMW@MHMkkkHHXXuzuuXSuzuuWWHd#uuuXXkWSuXXWUXXHUXWHuuu
// .`(HXSzzzzwWbkWHNHr_...``````````````````.```````.```````.`.`..`.-.(HKuzzuuwHHMNMHHMkkkHHuZuuzuuXuuuuXkHWMHHHUUuXXXWHXXHHUuXW8uuuu
// .-MXWwzzzuzXkHHMHHN-.``````````
// ````````````.`.````.``.```.`.`....-dXUXuzuXHWHMMHHBWHMMMSZuzuuzXXzuuXHHMHMHkHHHHHHHWHHSuXkHWSuuuuX
// (#XKzzzzzuzuWHHkWHHp
// ``.````````````````````````.````````.....-((-(NSXuzzXHW@D:~`(/1-
// .kXuzuuzXSuuzXXkHWMHHHHHHHHMWuuuQXUXWuuuXuXH
// MXWzuzzzzzuXHHbHNMMMt`.```````````````````````````.`.` ..-J7"!``
// XKuzzuXHHM9;/<-.J-u!JXXuuzuXWuuuuXHHH#WMNHmkkkuXXkWUXXWXXuuuXqHH
// XWzzzzuzzwXHHHH#"````<.````````````````````.``.`...-c"7``` ` `
// `(BzuuuXmHH8<!(- ?_!`jWUuzuuuWuuuzXWHNH> ..7WHHqHmQkWWXXuuuuuXWqHH
// SwuzzzXuwXHNHY`` `` <,`.`````````````` `` ..J7=``` ` ` ``
// ````.#zuzXXHHH$~`` ```(_(HSuuuzuXSuzuuXHHWCi(` ._ ?WggHHHHWkkkkWHHHHMH
// zzzuzuzwWHMY!` ` ` `(&.```````````` ..J7^ `` ` ` ` ` `. .HXuuXWHW#!` `
// ```` (WUuzzuXXSzuuudHHXY$. : (..``.THHkqkHHHgHHMHkkk zzzzzzXHWK`` ` `` ` ` `
// TJ.``````..J7=```` ` ` ` ` `` ` `.8zuXXHHW=` ``
// ..(XSuuuuuXWuuuuXHWH5~~` .`_?_,-``.TMMMMMMHkkqqHHH zzuuzdHHkN ` ` ` `` `
// ``(Wm,.(J7!``` ` ``` `` `` ` ` ``` .SzuXWHHY ``
// .._~<~~(dSuuuzzXHuuuuXHWHD::?C._.( -`(!_1 ,WHqHHHmqHHHHN zuzXXHHkHM;` ` ` `
// `` ` .;jY= ` .``_`` ` ` ` ` `` ` `.dXuXWm@^
// .._~_.~~~~~(d0uuzuuXHUuuuXHWH5:::::::_.<&._4r?_.;WMMM@MMY"<!` zzXHHHHMHMb``
// `` ` `` `` .J! ` ..`_~ ` ` ` `` ` ` ``.JXXXHY!
// .__.....~.~~~-d0wuzuXXHSuuuXWWH$::::;:::;:+- ~`(.i +HqHHkkHL..`. XWHHHMMHMHM;
// ` ` ` ` ._`` ...(:.=_` ` ` ` ` ````
// .-dVT7^``````......~~~~~_jWuuuuuXHSuzuXHHH3<;:::::;;j<+z ``` -dHNkkMqkkN..``
// HHHMMHHHHNMN.`` ` ` `!`z(. ~..~ ! . ` `` ` ` `
// ..gHr``````````........~~~~_jWuuuuuXkSuuuXHWHC:;::;;:::+v>:((J<!(WHHMkkHNqkM;`..
// HMMkkHHHHM9?b `` ` ` `` .``. ` ` ` ` ``` 4HkkkH,
// ``````.`......~~~~_+KuuuzuXHSuuuXHHK<(::::::<;<J+g9>::;< .4NkkqMHqH]..`
// MHkHHHMM$<<:?L` `` ` ` ` ``.` ` !`` ` ` ` ` `
// ?HbkkHx``````.`..`...~~~~_jKuuuuuXHSuuuqMHD<:<;:<++ddNMB3:;::;:<`
// `,HkkqH@HH].`` kkHHkHY``` (;?h`` ` ` `` ```` ` ` ` ` ` ` ` `
// ```.4XWbHx```..`......~~~~_gKuuuuXWH0uuuXHH3:;++1z<jgMB3<::::::::~`
// `jMkqkHMHHF.`. kHHHH=` . ` _<?L ` ` ` ` ` ` ` ` ` ` ` ` ` ` ?kwWHp
// .`.......~_~~(dKuuuuXWHUuuXWH9++z1<;+jWB3::::;;;::;:;_`` MNkqkqMNMF..` HHk@!.
// ` ` ` ~?L ` ` `` ` `` `` ` ` ` ` ` ` ` `
// -WuXHh..`.....~~~~(dWuuuXXkHUuuXHH9>:<:++YY<:;::::;:::::;:::+.``?HHkHHHM>`.`
| [
"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;
return 0;
}
| #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 0;
}
| #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) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll cnt = 0;
REP(i, S.size()) if (S[i] == 'x') cnt++;
cout << (cnt <= 7 ? "Yes" : "No") << endl;
return 0;
} | #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) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll cnt = 0;
REP(i, S.size()) if (S[i] == 'x') cnt++;
cout << (cnt <= 7 ? "YES" : "NO") << endl;
return 0;
} | [
"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
cout << "NO" << endl;
}
| [
"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;
}
}
if (7 - S.length() + numwin >= 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #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;
}
}
if (7 - (int)(S.length()) + numwin >= 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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 < l; i++) {
if (s[i] == 'o')
m++;
}
if ((15 - l) + m >= 8)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
solve();
return 0;
}
| #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 < l; i++) {
if (s[i] == 'o')
m++;
}
if ((15 - l) + m >= 8)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main() {
solve();
return 0;
}
| [
"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())
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007
#define INF LLONG_MAX / 3
typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> Tiii;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<string> Vs;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
void YesNo(int a) { cout << ((a) ? "Yes" : "No") << endl; }
void YESNO(int a) { cout << ((a) ? "YES" : "NO") << endl; }
void AorB(int a, string b, string c) { cout << ((a) ? b : c) << endl; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void start() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
start();
string s;
cin >> s;
int x = 0;
REP(i, 0, s.size()) if (s[i] == 'x') x++;
YESNO(x > 7);
return 0;
}
| #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())
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007
#define INF LLONG_MAX / 3
typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> Tiii;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<string> Vs;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
void YesNo(int a) { cout << ((a) ? "Yes" : "No") << endl; }
void YESNO(int a) { cout << ((a) ? "YES" : "NO") << endl; }
void AorB(int a, string b, string c) { cout << ((a) ? b : c) << endl; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void start() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
}
signed main() {
start();
string s;
cin >> s;
int x = 0;
REP(i, 0, s.size()) if (s[i] == 'x') x++;
YESNO(x <= 7);
return 0;
}
| [
"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) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FI first
#define SE second
#define endl "\n"
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main() {
string s;
int kati = 0;
REP(i, s.size()) {
if (s[i] == 'o') {
kati++;
}
}
if (kati + 15 - s.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #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) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FI first
#define SE second
#define endl "\n"
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int kati = 0;
REP(i, s.size()) {
if (s[i] == 'o') {
kati++;
}
}
if (kati + 15 - s.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [] | 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" << endl;
} | #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" << endl;
} | [
"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 << "yes" << endl;
} else {
cout << "no" << endl;
}
return 0;
} | #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 << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"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 ze(int a, int b) {
if (a > b) {
return a - b;
} else {
return b - a;
}
}
int main() {
int n, len, x, y;
int ans = 0;
int bnuma[2][2] = {};
// long long int a[N];
char b[20];
cin >> b;
rep(i, strlen(b)) {
if (b[i] == 'x')
ans++;
}
if (ans <= 5)
printf("YES\n");
else
printf("NO\n");
// cout<<(n-2)*180<<endl;
// memset(b, '\0', sizeof(b));初期化
// len = strlen(s);文字列長さ
} | #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 ze(int a, int b) {
if (a > b) {
return a - b;
} else {
return b - a;
}
}
int main() {
int n, len, x, y;
int ans = 0;
int bnuma[2][2] = {};
// long long int a[N];
char b[20];
cin >> b;
rep(i, strlen(b)) {
if (b[i] == 'x')
ans++;
}
if (ans <= 7)
printf("YES\n");
else
printf("NO\n");
// cout<<(n-2)*180<<endl;
// memset(b, '\0', sizeof(b));初期化
// len = strlen(s);文字列長さ
}
| [
"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) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | #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) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"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 0;
} | [
"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
cout << "NO" << endl;
} | #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
cout << "NO" << endl;
}
| [
"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 vector<int> vi;
typedef long long ll;
const int N = 1000005;
ll l[N], r[N], b[N], rk[N], val[N], mark[N];
ll sum[N], n, x, aim, ans = 2e18;
inline ll cmp(ll x, ll y) { return val[x] > val[y]; }
inline ll calc(ll x, ll y) {
if (x >= y)
return sum[x];
return sum[x] + val[rk[y]];
}
inline ll doit(ll k, ll rem) {
if (rem <= 0)
return 0;
if (rem <= l[k] * b[k])
return (rem + l[k] - 1) / l[k];
return b[k] + (rem - l[k] * b[k] + r[k] - 1) / r[k];
}
int main() {
scanf("%lld%lld", &n, &x);
rep(i, 1, n) {
scanf("%lld%lld%lld", &b[i], &l[i], &r[i]);
val[i] = b[i] * l[i] + (x - b[i]) * r[i];
aim += b[i] * l[i];
rk[i] = i;
// cerr<<i<<" "<<val[i]<<endl;
}
sort(rk + 1, rk + n + 1, cmp);
rep(i, 1, n) sum[i] = sum[i - 1] + val[rk[i]];
rep(i, 1, n) {
ll low = 0, high = n, mid;
while (low < high) {
mid = (low + high) >> 1;
if (calc(mid, i) >= aim)
high = mid;
else
low = mid + 1;
}
if (low < i) {
ll now = x * low + doit(rk[i], aim - sum[low]);
ans = min(ans, now);
} else {
ll now = x * (low - 1) + doit(rk[i], aim - sum[low] + val[rk[i]]);
ans = min(ans, now);
}
}
cerr << ans << endl;
return 0;
} | #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 vector<int> vi;
typedef long long ll;
const int N = 1000005;
ll l[N], r[N], b[N], rk[N], val[N], mark[N];
ll sum[N], n, x, aim, ans = 2e18;
inline ll cmp(ll x, ll y) { return val[x] > val[y]; }
inline ll calc(ll x, ll y) {
if (x >= y)
return sum[x];
return sum[x] + val[rk[y]];
}
inline ll doit(ll k, ll rem) {
if (rem <= 0)
return 0;
if (rem <= l[k] * b[k])
return (rem + l[k] - 1) / l[k];
return b[k] + (rem - l[k] * b[k] + r[k] - 1) / r[k];
}
int main() {
scanf("%lld%lld", &n, &x);
rep(i, 1, n) {
scanf("%lld%lld%lld", &b[i], &l[i], &r[i]);
val[i] = b[i] * l[i] + (x - b[i]) * r[i];
aim += b[i] * l[i];
rk[i] = i;
// cerr<<i<<" "<<val[i]<<endl;
}
sort(rk + 1, rk + n + 1, cmp);
rep(i, 1, n) sum[i] = sum[i - 1] + val[rk[i]];
rep(i, 1, n) {
ll low = 0, high = n, mid;
while (low < high) {
mid = (low + high) >> 1;
if (calc(mid, i) >= aim)
high = mid;
else
low = mid + 1;
}
if (low < i) {
ll now = x * low + doit(rk[i], aim - sum[low]);
ans = min(ans, now);
} else {
ll now = x * (low - 1) + doit(rk[i], aim - sum[low] + val[rk[i]]);
ans = min(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"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 vector<int> vi;
typedef long long ll;
const int N = 1000005;
ll l[N], r[N], b[N], rk[N], val[N], mark[N];
ll sum[N], n, x, aim, ans = 2e18;
inline ll cmp(ll x, ll y) { return val[x] > val[y]; }
inline ll calc(ll x, ll y) {
if (x >= y)
return sum[x];
return sum[x] + val[rk[y]];
}
inline ll doit(ll k, ll rem) {
if (rem < 0)
return 0;
if (rem <= l[k] * b[k])
return (rem + l[k] - 1) / l[k];
return b[k] + (rem - b[k] * l[k] + r[k] - 1) / r[k];
}
int main() {
scanf("%lld%lld", &n, &x);
rep(i, 1, n) {
scanf("%lld%lld%lld", &b[i], &l[i], &r[i]);
val[i] = b[i] * l[i] + (x - b[i]) * r[i];
aim += b[i] * l[i];
rk[i] = i;
// cerr<<i<<" "<<val[i]<<endl;
}
sort(rk + 1, rk + n + 1, cmp);
rep(i, 1, n) sum[i] = sum[i - 1] + val[rk[i]];
rep(i, 1, n) {
ll low = 0, high = n, mid;
while (low < high) {
mid = (low + high) >> 1;
if (calc(mid, i) >= aim)
high = mid;
else
low = mid + 1;
}
if (low < i) {
ll now = x * low + doit(rk[i], aim - sum[low]);
ans = min(ans, now);
} else {
ll now = x * (low - 1) + doit(rk[i], aim - sum[low] + val[rk[i]]);
ans = min(ans, now);
}
}
cerr << ans << endl;
return 0;
} | #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 vector<int> vi;
typedef long long ll;
const int N = 1000005;
ll l[N], r[N], b[N], rk[N], val[N], mark[N];
ll sum[N], n, x, aim, ans = 2e18;
inline ll cmp(ll x, ll y) { return val[x] > val[y]; }
inline ll calc(ll x, ll y) {
if (x >= y)
return sum[x];
return sum[x] + val[rk[y]];
}
inline ll doit(ll k, ll rem) {
if (rem <= 0)
return 0;
if (rem <= l[k] * b[k])
return (rem + l[k] - 1) / l[k];
return b[k] + (rem - l[k] * b[k] + r[k] - 1) / r[k];
}
int main() {
scanf("%lld%lld", &n, &x);
rep(i, 1, n) {
scanf("%lld%lld%lld", &b[i], &l[i], &r[i]);
val[i] = b[i] * l[i] + (x - b[i]) * r[i];
aim += b[i] * l[i];
rk[i] = i;
// cerr<<i<<" "<<val[i]<<endl;
}
sort(rk + 1, rk + n + 1, cmp);
rep(i, 1, n) sum[i] = sum[i - 1] + val[rk[i]];
rep(i, 1, n) {
ll low = 0, high = n, mid;
while (low < high) {
mid = (low + high) >> 1;
if (calc(mid, i) >= aim)
high = mid;
else
low = mid + 1;
}
if (low < i) {
ll now = x * low + doit(rk[i], aim - sum[low]);
ans = min(ans, now);
} else {
ll now = x * (low - 1) + doit(rk[i], aim - sum[low] + val[rk[i]]);
ans = min(ans, now);
}
}
cout << ans << endl;
return 0;
} | [
"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<long> l(n), r(n), b(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> r[i];
}
long s = 0;
for (int i = 0; i < n; i++) {
s -= l[i] * b[i];
}
long L = -1;
long R = x * n;
while (R > L + 1) {
long M = (L + R) / 2;
vector<pair<long, int>> z(n);
for (int i = 0; i < n; i++) {
z[i] = {x * r[i] - (r[i] - l[i]) * b[i], i};
}
sort(z.begin(), z.end());
int full = M / x;
int rest = M % x;
long ss = s;
vector<bool> tk(n);
for (int i = n - full; i < n; i++) {
ss += z[i].first;
tk[z[i].second] = true;
}
bool ok = false;
for (int i = 0; i < n; i++) {
long sss;
if (!tk[i]) {
sss = ss + max(rest * l[i], rest * r[i] - (r[i] - l[i]) * b[i]);
} else {
int p = n - full - 1;
sss = ss - (x * r[i] - (r[i] - l[i]) * b[i]) +
(x * r[p] - (r[p] - l[p]) * b[p]) +
max(rest * l[i], rest * r[i] - (r[i] - l[i]) * b[i]);
}
if (sss >= 0) {
ok = true;
}
}
if (ok) {
R = M;
} else {
L = M;
}
}
cout << R;
return 0;
} | #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<long> l(n), r(n), b(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> r[i];
}
long s = 0;
for (int i = 0; i < n; i++) {
s -= l[i] * b[i];
}
long L = -1;
long R = x * n;
while (R > L + 1) {
long M = (L + R) / 2;
vector<pair<long, int>> z(n);
for (int i = 0; i < n; i++) {
z[i] = {x * r[i] - (r[i] - l[i]) * b[i], i};
}
sort(z.begin(), z.end());
int full = M / x;
int rest = M % x;
long ss = s;
vector<bool> tk(n);
for (int i = n - full; i < n; i++) {
ss += z[i].first;
tk[z[i].second] = true;
}
bool ok = false;
for (int i = 0; i < n; i++) {
long sss;
if (!tk[i]) {
sss = ss + max(rest * l[i], rest * r[i] - (r[i] - l[i]) * b[i]);
} else {
int p = z[n - full - 1].second;
sss = ss - (x * r[i] - (r[i] - l[i]) * b[i]) +
(x * r[p] - (r[p] - l[p]) * b[p]) +
max(rest * l[i], rest * r[i] - (r[i] - l[i]) * b[i]);
}
if (sss >= 0) {
ok = true;
}
}
if (ok) {
R = M;
} else {
L = M;
}
}
cout << R;
return 0;
} | [] | 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;
cin >> N >> X;
vector<int> B(N);
vector<int> L(N);
vector<int> U(N);
int res = 0;
vector<pair<int, int>> P(N);
int tot = 0;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> U[i];
P[i].first = B[i] * L[i] + (X - B[i]) * U[i];
P[i].second = i;
tot += B[i] * L[i];
}
sort(P.rbegin(), P.rend());
int tmp = 0;
// cerr << tot << endl;
for (int i = 0; i < N; i++) {
// cerr << i << " " << P[i].first << endl;
tmp += P[i].first;
res += X;
if (tmp >= tot) {
int mn = X;
// tmp -= P[i].first;
for (int j = i; j < N; j++) {
int idx = P[j].second;
int ok = X;
int ng = 0;
while (ok - ng > 1) {
int m = (ok + ng) / 2;
int z = 0;
if (m <= B[idx]) {
z = m * L[idx];
} else {
z = L[idx] * B[idx] + (m - B[idx]) * U[idx];
}
if (j <= i) {
z -= P[j].first;
} else {
z -= P[i].first;
}
if (tmp + z >= tot) {
ok = m;
} else {
ng = m;
}
}
mn = min(mn, ok);
}
res += mn;
res -= X;
break;
}
}
cout << res << endl;
} | #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;
cin >> N >> X;
vector<int> B(N);
vector<int> L(N);
vector<int> U(N);
int res = 0;
vector<pair<int, int>> P(N);
int tot = 0;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> U[i];
P[i].first = B[i] * L[i] + (X - B[i]) * U[i];
P[i].second = i;
tot += B[i] * L[i];
}
sort(P.rbegin(), P.rend());
int tmp = 0;
// cerr << tot << endl;
for (int i = 0; i < N; i++) {
// cerr << i << " " << P[i].first << endl;
tmp += P[i].first;
res += X;
if (tmp >= tot) {
int mn = X;
// tmp -= P[i].first;
for (int j = 0; j < N; j++) {
int idx = P[j].second;
int ok = X;
int ng = -1;
while (ok - ng > 1) {
int m = (ok + ng) / 2;
int z = 0;
if (m <= B[idx]) {
z = m * L[idx];
} else {
z = L[idx] * B[idx] + (m - B[idx]) * U[idx];
}
if (j <= i) {
z -= P[j].first;
} else {
z -= P[i].first;
}
if (tmp + z >= tot) {
ok = m;
} else {
ng = m;
}
}
mn = min(mn, ok);
}
res += mn;
res -= X;
break;
}
}
cout << res << endl;
} | [
"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) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), \
printf(" " #z " = "), W(z), printf(" " #w " = "), W(w), putc('\n'); \
}
#define out3(x, y, z) \
{ \
if (debug) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), \
printf(" " #z " = "), W(z), putc('\n'); \
}
#define out2(x, y) \
{ \
if (debug) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), putc('\n'); \
}
#define out1(x) \
{ \
if (debug) \
printf(#x " = "), W(x), putc('\n'); \
}
#define outline(x) \
{ \
if (debug) \
puts("-------------------------------------------" #x \
"----------------------------------------"); \
}
#define outarr(a, L, R) \
{ \
if (debug) { \
printf(#a "[%d..%d] = ", L, R); \
F(i, L, R) W(a[i]), putc(' '); \
putc('\n'); \
} \
}
#define Assert(x) \
{ \
if ((debug) && (!(x))) { \
puts("Wrong Answer"); \
exit(0); \
} \
}
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define mem(a, b) memset(a, b, sizeof a)
#define mec(a, b) memcpy(a, b, sizeof a)
#define mx(a, b) ((a) = max(a, b))
#define mn(a, b) ((a) = min(a, b))
#define lowbit(x) ((x) & (-(x)))
#define abs(x) ((max(x, -(x))))
#define get getchar()
#define pb push_back
#define putc putchar
#define inf 2e18
template <typename Int> void R(Int &x) {
char c = get;
x = 0;
Int t = 1;
for (; !isdigit(c); c = get)
t = (c == '-' ? -1 : t);
for (; isdigit(c); x = (x << 3) + (x << 1) + c - '0', c = get)
;
x *= t;
}
template <typename Int> void W(Int x) {
if (x < 0) {
putc('-');
x = -x;
}
if (x > 9)
W(x / 10);
putc(x % 10 + '0');
}
#define debug (1)
using namespace std;
#define ll long long
const ll N = 3e3 + 10;
const ll M = 3e5 + 10;
ll n, x, y, c, S, T, tot, Ans;
ll tov[M], nex[M], len[M], cost[M], las[N];
ll dis[N], inc[N], bz[N], pre[N];
void link(ll x, ll y, ll c, ll v) {
// out4(x, y, c, v);
tov[++tot] = y, nex[tot] = las[x], las[x] = tot, len[tot] = c, cost[tot] = +v;
tov[++tot] = x, nex[tot] = las[y], las[y] = tot, len[tot] = 0, cost[tot] = -v;
}
bool spfa() {
mem(dis, 128), dis[S] = 0, inc[S] = inf, bz[S] = 1;
queue<ll> Q;
Q.push(S);
while (Q.size()) {
ll k = Q.front();
Q.pop();
for (ll x = las[k], p; x; x = nex[x]) {
p = tov[x];
if (len[x] && dis[p] < dis[k] + cost[x]) {
dis[p] = dis[k] + cost[x];
inc[p] = min(inc[k], len[x]);
pre[p] = x;
if (!bz[p])
Q.push(p), bz[p] = 1;
}
}
bz[k] = 0;
}
outarr(dis, 1, T);
return dis[T] >= 0;
}
int main() {
// freopen("data.in","r",stdin);
R(n), S = 2 * n + 9, T = S + 1, tot = 1;
F(i, 1, n) {
R(x), R(y), R(c);
link(S, i, c, 0);
link(i, n + 1, c, +x + y);
link(i, n + 2, c, +x - y);
link(i, n + 3, c, -x + y);
link(i, n + 4, c, -x - y);
}
F(i, 1, 4) link(n + i, n + 4 + i, inf, 0);
F(i, 1, n) {
R(x), R(y), R(c);
link(n + 8 + i, T, c, 0);
link(n + 5, n + 8 + i, c, -x - y);
link(n + 6, n + 8 + i, c, -x + y);
link(n + 7, n + 8 + i, c, +x - y);
link(n + 8, n + 8 + i, c, +x + y);
}
long long Ans = 0;
while (spfa()) {
Ans += dis[T] * inc[T];
// out2(dis[T], inc[T]);
for (ll k = T; k ^ S; k = tov[pre[k] ^ 1]) {
len[pre[k]] -= inc[T];
len[pre[k] ^ 1] += inc[T];
// out1(k);
}
}
W(Ans);
} | #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) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), \
printf(" " #z " = "), W(z), printf(" " #w " = "), W(w), putc('\n'); \
}
#define out3(x, y, z) \
{ \
if (debug) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), \
printf(" " #z " = "), W(z), putc('\n'); \
}
#define out2(x, y) \
{ \
if (debug) \
printf(#x " = "), W(x), printf(" " #y " = "), W(y), putc('\n'); \
}
#define out1(x) \
{ \
if (debug) \
printf(#x " = "), W(x), putc('\n'); \
}
#define outline(x) \
{ \
if (debug) \
puts("-------------------------------------------" #x \
"----------------------------------------"); \
}
#define outarr(a, L, R) \
{ \
if (debug) { \
printf(#a "[%d..%d] = ", L, R); \
F(i, L, R) W(a[i]), putc(' '); \
putc('\n'); \
} \
}
#define Assert(x) \
{ \
if ((debug) && (!(x))) { \
puts("Wrong Answer"); \
exit(0); \
} \
}
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define mem(a, b) memset(a, b, sizeof a)
#define mec(a, b) memcpy(a, b, sizeof a)
#define mx(a, b) ((a) = max(a, b))
#define mn(a, b) ((a) = min(a, b))
#define lowbit(x) ((x) & (-(x)))
#define abs(x) ((max(x, -(x))))
#define get getchar()
#define pb push_back
#define putc putchar
#define inf 2e18
template <typename Int> void R(Int &x) {
char c = get;
x = 0;
Int t = 1;
for (; !isdigit(c); c = get)
t = (c == '-' ? -1 : t);
for (; isdigit(c); x = (x << 3) + (x << 1) + c - '0', c = get)
;
x *= t;
}
template <typename Int> void W(Int x) {
if (x < 0) {
putc('-');
x = -x;
}
if (x > 9)
W(x / 10);
putc(x % 10 + '0');
}
#define debug (0)
using namespace std;
#define ll long long
const ll N = 3e3 + 10;
const ll M = 3e5 + 10;
ll n, x, y, c, S, T, tot, Ans;
ll tov[M], nex[M], len[M], cost[M], las[N];
ll dis[N], inc[N], bz[N], pre[N];
void link(ll x, ll y, ll c, ll v) {
// out4(x, y, c, v);
tov[++tot] = y, nex[tot] = las[x], las[x] = tot, len[tot] = c, cost[tot] = +v;
tov[++tot] = x, nex[tot] = las[y], las[y] = tot, len[tot] = 0, cost[tot] = -v;
}
bool spfa() {
mem(dis, 128), dis[S] = 0, inc[S] = inf, bz[S] = 1;
queue<ll> Q;
Q.push(S);
while (Q.size()) {
ll k = Q.front();
Q.pop();
for (ll x = las[k], p; x; x = nex[x]) {
p = tov[x];
if (len[x] && dis[p] < dis[k] + cost[x]) {
dis[p] = dis[k] + cost[x];
inc[p] = min(inc[k], len[x]);
pre[p] = x;
if (!bz[p])
Q.push(p), bz[p] = 1;
}
}
bz[k] = 0;
}
outarr(dis, 1, T);
return dis[T] >= 0;
}
int main() {
// freopen("data.in","r",stdin);
R(n), S = 2 * n + 9, T = S + 1, tot = 1;
F(i, 1, n) {
R(x), R(y), R(c);
link(S, i, c, 0);
link(i, n + 1, c, +x + y);
link(i, n + 2, c, +x - y);
link(i, n + 3, c, -x + y);
link(i, n + 4, c, -x - y);
}
F(i, 1, 4) link(n + i, n + 4 + i, inf, 0);
F(i, 1, n) {
R(x), R(y), R(c);
link(n + 8 + i, T, c, 0);
link(n + 5, n + 8 + i, c, -x - y);
link(n + 6, n + 8 + i, c, -x + y);
link(n + 7, n + 8 + i, c, +x - y);
link(n + 8, n + 8 + i, c, +x + y);
}
long long Ans = 0;
while (spfa()) {
Ans += dis[T] * inc[T];
// out2(dis[T], inc[T]);
for (ll k = T; k ^ S; k = tov[pre[k] ^ 1]) {
len[pre[k]] -= inc[T];
len[pre[k] ^ 1] += inc[T];
// out1(k);
}
}
W(Ans);
} | [
"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].push_back(y);
f[x][y] = w, pr[x][y] = c;
ap[y].push_back(x);
f[y][x] = 0, pr[y][x] = -c;
}
typedef vector<int>::iterator IT;
namespace Flow {
LL dis[N];
bool bz[N];
IT cur[N];
int d[N];
bool spfa() {
memset(dis, 107, sizeof(dis));
memset(bz, 0, sizeof(bz));
dis[st] = 0, bz[st] = 1, d[1];
fo(i, 1, n1) cur[i] = ap[i].begin();
int l = 0, r = 1;
while (l < r) {
int k = d[++l];
for (IT i = ap[k].begin(); i != ap[k].end(); i++) {
int p = *i;
if (f[k][p] && dis[k] + pr[k][p] < dis[p]) {
dis[p] = dis[k] + pr[k][p];
if (!bz[p])
bz[p] = 1, d[++r] = p;
}
}
bz[k] = 0;
}
return (dis[ed] <= 1e17);
}
int flow(int k, int s) {
if (k == ed)
return s;
int sl = 0, v;
bz[k] = 1;
for (; cur[k] != ap[k].end(); cur[k]++) {
int p = *cur[k];
if (!bz[p] && f[k][p] && dis[p] == dis[k] + pr[k][p]) {
if (v = flow(p, min(s, f[k][p]))) {
sl += v, s -= v;
f[k][p] -= v, f[p][k] += v;
ans += (LL)v * pr[k][p];
if (!s)
break;
}
}
}
bz[k] = 0;
return sl;
}
} // namespace Flow
using Flow::flow;
using Flow::spfa;
int main() {
cin >> n;
n1 = 2 * n + 6, st = 2 * n + 5, ed = n1;
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(st, i, z, 0);
link(i, 2 * n + 1, z, x + y);
link(i, 2 * n + 2, z, x - y);
link(i, 2 * n + 3, z, -x + y);
link(i, 2 * n + 4, z, -x - y);
}
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(i + n, ed, z, 0);
link(2 * n + 1, i + n, z, -x - y);
link(2 * n + 2, i + n, z, -x + y);
link(2 * n + 3, i + n, z, x - y);
link(2 * n + 4, i + n, z, x + y);
}
ans = 0;
while (spfa())
flow(st, INF);
printf("%lld\n", -ans);
} | #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].push_back(y);
f[x][y] = w, pr[x][y] = c;
ap[y].push_back(x);
f[y][x] = 0, pr[y][x] = -c;
}
typedef vector<int>::iterator IT;
namespace Flow {
LL dis[N];
bool bz[N];
IT cur[N];
int d[200 * N];
bool spfa() {
memset(dis, 107, sizeof(dis));
memset(bz, 0, sizeof(bz));
dis[st] = 0, bz[st] = 1, d[1] = st;
fo(i, 1, n1) cur[i] = ap[i].begin();
int l = 0, r = 1;
while (l < r) {
int k = d[++l];
for (IT i = ap[k].begin(); i != ap[k].end(); i++) {
int p = *i;
if (f[k][p] && dis[k] + pr[k][p] < dis[p]) {
dis[p] = dis[k] + pr[k][p];
if (!bz[p])
bz[p] = 1, d[++r] = p;
}
}
bz[k] = 0;
}
return (dis[ed] <= 1e17);
}
int flow(int k, int s) {
if (k == ed)
return s;
int sl = 0, v;
bz[k] = 1;
for (; cur[k] != ap[k].end(); cur[k]++) {
int p = *cur[k];
if (!bz[p] && f[k][p] && dis[p] == dis[k] + pr[k][p]) {
if (v = flow(p, min(s, f[k][p]))) {
sl += v, s -= v;
f[k][p] -= v, f[p][k] += v;
ans += (LL)v * pr[k][p];
if (!s)
break;
}
}
}
bz[k] = 0;
return sl;
}
} // namespace Flow
using Flow::flow;
using Flow::spfa;
int main() {
cin >> n;
n1 = 2 * n + 6, st = 2 * n + 5, ed = n1;
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(st, i, z, 0);
link(i, 2 * n + 1, z, x + y);
link(i, 2 * n + 2, z, x - y);
link(i, 2 * n + 3, z, -x + y);
link(i, 2 * n + 4, z, -x - y);
}
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(i + n, ed, z, 0);
link(2 * n + 1, i + n, z, -x - y);
link(2 * n + 2, i + n, z, -x + y);
link(2 * n + 3, i + n, z, x - y);
link(2 * n + 4, i + n, z, x + y);
}
ans = 0;
while (spfa())
flow(st, INF);
printf("%lld\n", -ans);
} | [
"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); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -f;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
x *= f;
}
template <typename T> void write(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
write(x);
puts("");
}
struct edge {
int dest, flow, pos, cost;
};
vector<edge> a[MAXP];
int s, t, tot, flow;
ll cost;
ll dist[MAXP];
int path[MAXP], home[MAXP];
void FlowPath() {
int p = t, ans = INF;
while (p != s) {
ans = min(ans, a[path[p]][home[p]].flow);
p = path[p];
}
flow += ans;
cost += ans * dist[t];
p = t;
while (p != s) {
a[path[p]][home[p]].flow -= ans;
a[p][a[path[p]][home[p]].pos].flow += ans;
p = path[p];
}
}
bool spfa() {
static int q[MAXQ];
static bool inq[MAXP];
static int l = 0, r = 0;
for (int i = 0; i <= r; i++)
dist[q[i]] = -INFLL;
dist[t] = INFLL;
q[l = r = 0] = s, dist[s] = 0, inq[s] = true;
while (l <= r) {
int tmp = q[l];
for (unsigned i = 0; i < a[tmp].size(); i++)
if (a[tmp][i].flow != 0 &&
dist[tmp] + a[tmp][i].cost > dist[a[tmp][i].dest]) {
dist[a[tmp][i].dest] = dist[tmp] + a[tmp][i].cost;
path[a[tmp][i].dest] = tmp;
home[a[tmp][i].dest] = i;
if (!inq[a[tmp][i].dest] && a[tmp][i].dest != t) {
q[++r] = a[tmp][i].dest;
inq[q[r]] = true;
}
}
l++, inq[tmp] = false;
}
return dist[t] != -INFLL;
}
void addedge(int x, int y, int z, int c) {
a[x].push_back((edge){y, z, a[y].size(), c});
a[y].push_back((edge){x, 0, a[x].size() - 1, -c});
}
int n, mid[4], cntx[MAXN], cnty[MAXN];
pair<int, int> posx[MAXN], posy[MAXN];
int main() {
read(n), tot = 2 * n;
s = ++tot, t = ++tot;
for (int i = 0; i <= 3; i++)
mid[i] = ++tot;
for (int i = 1; i <= n; i++) {
read(posx[i].first), read(posx[i].second), read(cntx[i]);
addedge(s, i, cntx[i], 0);
addedge(i, mid[0], INF, -posx[i].first - posx[i].second);
addedge(i, mid[1], INF, posx[i].first - posx[i].second);
addedge(i, mid[2], INF, -posx[i].first + posx[i].second);
addedge(i, mid[3], INF, posx[i].first + posx[i].second);
}
for (int i = 1; i <= n; i++) {
read(posy[i].first), read(posy[i].second), read(cnty[i]);
addedge(n + i, t, cnty[i], 0);
addedge(mid[0], n + i, INF, posy[i].first + posy[i].second);
addedge(mid[1], n + i, INF, -posy[i].first + posy[i].second);
addedge(mid[2], n + i, INF, posy[i].first - posy[i].second);
addedge(mid[3], n + i, INF, -posy[i].first - posy[i].second);
}
for (int i = 1; i <= tot; i++)
dist[i] = -INFLL;
while (spfa())
FlowPath();
writeln(cost);
return 0;
}
| #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); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -f;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
x *= f;
}
template <typename T> void write(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
write(x);
puts("");
}
struct edge {
int dest, flow, pos, cost;
};
vector<edge> a[MAXP];
int s, t, tot, flow;
ll cost;
ll dist[MAXP];
int path[MAXP], home[MAXP];
void FlowPath() {
int p = t, ans = INF;
while (p != s) {
ans = min(ans, a[path[p]][home[p]].flow);
p = path[p];
}
flow += ans;
cost += ans * dist[t];
p = t;
while (p != s) {
a[path[p]][home[p]].flow -= ans;
a[p][a[path[p]][home[p]].pos].flow += ans;
p = path[p];
}
}
bool spfa() {
static int q[MAXQ];
static bool inq[MAXP];
static int l = 0, r = 0;
for (int i = 0; i <= r; i++)
dist[q[i]] = -INFLL;
dist[t] = -INFLL;
q[l = r = 0] = s, dist[s] = 0, inq[s] = true;
while (l <= r) {
int tmp = q[l];
for (unsigned i = 0; i < a[tmp].size(); i++)
if (a[tmp][i].flow != 0 &&
dist[tmp] + a[tmp][i].cost > dist[a[tmp][i].dest]) {
dist[a[tmp][i].dest] = dist[tmp] + a[tmp][i].cost;
path[a[tmp][i].dest] = tmp;
home[a[tmp][i].dest] = i;
if (!inq[a[tmp][i].dest] && a[tmp][i].dest != t) {
q[++r] = a[tmp][i].dest;
inq[q[r]] = true;
}
}
l++, inq[tmp] = false;
}
return dist[t] != -INFLL;
}
void addedge(int x, int y, int z, int c) {
a[x].push_back((edge){y, z, a[y].size(), c});
a[y].push_back((edge){x, 0, a[x].size() - 1, -c});
}
int n, mid[4], cntx[MAXN], cnty[MAXN];
pair<int, int> posx[MAXN], posy[MAXN];
int main() {
read(n), tot = 2 * n;
s = ++tot, t = ++tot;
for (int i = 0; i <= 3; i++)
mid[i] = ++tot;
for (int i = 1; i <= n; i++) {
read(posx[i].first), read(posx[i].second), read(cntx[i]);
addedge(s, i, cntx[i], 0);
addedge(i, mid[0], INF, -posx[i].first - posx[i].second);
addedge(i, mid[1], INF, posx[i].first - posx[i].second);
addedge(i, mid[2], INF, -posx[i].first + posx[i].second);
addedge(i, mid[3], INF, posx[i].first + posx[i].second);
}
for (int i = 1; i <= n; i++) {
read(posy[i].first), read(posy[i].second), read(cnty[i]);
addedge(n + i, t, cnty[i], 0);
addedge(mid[0], n + i, INF, posy[i].first + posy[i].second);
addedge(mid[1], n + i, INF, -posy[i].first + posy[i].second);
addedge(mid[2], n + i, INF, posy[i].first - posy[i].second);
addedge(mid[3], n + i, INF, -posy[i].first - posy[i].second);
}
for (int i = 1; i <= tot; i++)
dist[i] = -INFLL;
while (spfa())
FlowPath();
writeln(cost);
return 0;
}
| [
"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 = getchar();
}
return x * f;
}
const int N = 5100, inf = 2e9;
int n, tot, ans;
char s[N];
int head[N], val[N];
int f[N], siz[N], dis[N];
struct node {
int nex, to;
} a[N << 1];
void add(int f, int t) {
a[++tot].nex = head[f];
a[tot].to = t;
head[f] = tot;
}
void dfs(int now, int fa) {
siz[now] = val[now];
int QAQ = 0;
for (int i = head[now], to; i; i = a[i].nex) {
to = a[i].to;
if (to == fa)
continue;
dfs(to, now);
siz[now] += siz[to];
dis[to] += siz[to];
dis[now] += dis[to];
if (dis[QAQ] < dis[to])
QAQ = to;
}
if (!QAQ) {
f[now] = 0;
return;
}
if (dis[QAQ] * 2 >= dis[now])
f[now] = dis[now] / 2;
else
f[now] = dis[now] - dis[QAQ] + min(f[QAQ], (2 * dis[QAQ] - dis[now]) / 2);
}
int main() {
ans = inf;
n = read();
cin >> s;
for (int i = 0; i < n; i++)
val[i + 1] = s[i] - '0';
for (int i = 1, x, y; i < n; i++) {
x = read();
y = read();
add(x, y);
add(y, x);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
f[j] = siz[j] = dis[j] = 0;
dfs(i, 0);
if (dis[i] & 1)
continue;
if (f[i] * 2 >= dis[i])
ans = min(ans, dis[i] / 2);
}
cout << (ans == inf ? -1 : ans) << "\n";
} | #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 = getchar();
}
return x * f;
}
const int N = 5100, inf = 2e9;
int n, tot, ans;
char s[N];
int head[N], val[N];
int f[N], siz[N], dis[N];
struct node {
int nex, to;
} a[N << 1];
void add(int f, int t) {
a[++tot].nex = head[f];
a[tot].to = t;
head[f] = tot;
}
void dfs(int now, int fa) {
siz[now] = val[now];
int QAQ = 0;
for (int i = head[now], to; i; i = a[i].nex) {
to = a[i].to;
if (to == fa)
continue;
dfs(to, now);
siz[now] += siz[to];
dis[to] += siz[to];
dis[now] += dis[to];
if (dis[QAQ] < dis[to])
QAQ = to;
}
if (!QAQ) {
f[now] = 0;
return;
}
if (dis[QAQ] * 2 <= dis[now])
f[now] = dis[now] / 2;
else
f[now] = dis[now] - dis[QAQ] + min(f[QAQ], (2 * dis[QAQ] - dis[now]) / 2);
}
int main() {
ans = inf;
n = read();
cin >> s;
for (int i = 0; i < n; i++)
val[i + 1] = s[i] - '0';
for (int i = 1, x, y; i < n; i++) {
x = read();
y = read();
add(x, y);
add(y, x);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
f[j] = siz[j] = dis[j] = 0;
dfs(i, 0);
if (dis[i] & 1)
continue;
if (f[i] * 2 >= dis[i])
ans = min(ans, dis[i] / 2);
}
cout << (ans == inf ? -1 : ans) << "\n";
} | [
"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 {
cout << 'NO' << endl;
}
}
| #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 {
cout << "NO" << endl;
}
}
| [
"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) {
// for (int i=0;i<N;i++) par[i] = i;
// }
// int root(int x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(int x, int y) {
// int rx = root(x);
// int ry = root(y);
// if (rx == ry) return;
// par[rx] = ry;
// }
// bool same(int x, int y) {
// int rx = root(x);
// int ry = root(y);
// return rx == ry;
// }
// };
// ll gcd(ll a, ll b) {
// if (b == 0) return a;
// return gcd(b,a%b);
// }
int main(void) {
string S;
cin >> S;
int w = 0, l = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
w++;
else
l++;
}
if (l >= 8)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #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) {
// for (int i=0;i<N;i++) par[i] = i;
// }
// int root(int x) {
// if (par[x] == x) return x;
// else return par[x] = root(par[x]);
// }
// void unite(int x, int y) {
// int rx = root(x);
// int ry = root(y);
// if (rx == ry) return;
// par[rx] = ry;
// }
// bool same(int x, int y) {
// int rx = root(x);
// int ry = root(y);
// return rx == ry;
// }
// };
// ll gcd(ll a, ll b) {
// if (b == 0) return a;
// return gcd(b,a%b);
// }
int main(void) {
string S;
cin >> S;
int w = 0, l = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'o')
w++;
else
l++;
}
if (l >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
string A;
cin >> A;
ll c = 0;
FOR(i, 0, A.size() - 1) {
if (A[i] == 'o')
c++;
}
if (c + (15 - A.size()) >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
string A;
cin >> A;
ll c = 0;
FOR(i, 0, A.size() - 1) {
if (A[i] == 'o')
c++;
}
if (c + (15 - A.size()) >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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 (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
string s = stin();
int cnt = 0;
rep(i, s.length()) {
if (s[i] == 'o')
cnt++;
}
if (cnt >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #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 (int i = 0; i < n; i++)
#define rep3(i, a, b) for (int i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define queint queue<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pq priority_queue<int> //大きい順
#define pqg priority_queue<int, vec, greater<int>> //小さい順
#define pb push_back
#define vec vector<int>
#define vecvec vector<vector<int>>
#define vecll vector<ll>
#define vecvecll vector<vector<ll>>
#define bs binary_search
#define All(c) (c).begin(), (c).end()
#define mp make_pair
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
string stin() {
string s;
cin >> s;
return s;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
string s = stin();
int cnt = 0;
rep(i, s.length()) {
if (s[i] == 'x')
cnt++;
}
if (cnt >= 8)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"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
#define mkp make_pair
#define M_PI 3.14159265358979323846
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define LOR(i, l, r) for (ll i = l; i <= r; i++)
#define FORD(i, r, l) for (int i = r; i >= l; i--)
#define LORD(i, r, l) for (ll i = r; i >= l; i--)
#define INF 1000000000
#define CL(x) memset(x, 0, sizeof(x))
#define DEB(x) cout << #x << " : " << x << '\n'
#define ALL(x) x.begin(), x.end()
#define SZ(x) x.size()
#define UI(x) (int)(x - 'A')
#define LI(x) (int)(x - 'a')
typedef long long ll;
string S;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> S;
int N = SZ(S);
int cn = 0;
FOR(i, 0, N - 1) cn += (S[i] == 'o');
cn += (15 - N);
if (cn < 8)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #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
#define mkp make_pair
#define M_PI 3.14159265358979323846
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define LOR(i, l, r) for (ll i = l; i <= r; i++)
#define FORD(i, r, l) for (int i = r; i >= l; i--)
#define LORD(i, r, l) for (ll i = r; i >= l; i--)
#define INF 1000000000
#define CL(x) memset(x, 0, sizeof(x))
#define DEB(x) cout << #x << " : " << x << '\n'
#define ALL(x) x.begin(), x.end()
#define SZ(x) x.size()
#define UI(x) (int)(x - 'A')
#define LI(x) (int)(x - 'a')
typedef long long ll;
string S;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> S;
int N = SZ(S);
int cn = 0;
FOR(i, 0, N - 1) cn += (S[i] == 'o');
cn += (15 - N);
if (cn < 8)
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
| [
"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(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
ll minll(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
ll maxll(ll a, ll b) {
if (a >= b)
return a;
else
return b;
}
string s;
int main() {
cin >> s;
ll co = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
++co;
}
if (co >= 8)
cout << "NO\n";
else {
cout << "Yes\n";
}
} | #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(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
ll minll(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
ll maxll(ll a, ll b) {
if (a >= b)
return a;
else
return b;
}
string s;
int main() {
cin >> s;
ll co = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
++co;
}
if (co >= 8)
cout << "NO\n";
else {
cout << "YES\n";
}
} | [
"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 namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll a = 0, b = 0, c = 0, n = 0, m = 0;
int ar1[100000] = {}, ar2[100000] = {};
string str;
vector<int> vec;
int main() {
cin >> str;
rep(i, str.length()) {
if (str[i] == 'x')
a++;
}
if (a >= 8) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #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 namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll a = 0, b = 0, c = 0, n = 0, m = 0;
int ar1[100000] = {}, ar2[100000] = {};
string str;
vector<int> vec;
int main() {
cin >> str;
rep(i, str.length()) {
if (str[i] == 'x')
a++;
}
if (a >= 8) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| [
"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##_len = int(n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rreps(i, n) for (int i = int(n); i > 0; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int win = 0;
rep(i, s.size()) {
if (s[i] == 'o') {
++win;
}
}
if (win + 15 - (int)s.size() >= 8) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #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##_len = int(n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rreps(i, n) for (int i = int(n); i > 0; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int win = 0;
rep(i, s.size()) {
if (s[i] == 'o') {
++win;
}
}
if (win + 15 - (int)s.size() >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"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> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first) {
return a.first.second > b.first.second;
}
return a.first.first < b.first.first;
}
int main() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if (s[i] == 'x')
cnt++;
}
Yes(cnt < 8);
return 0;
} | #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> vint;
typedef vector<llint> vllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first) {
return a.first.second > b.first.second;
}
return a.first.first < b.first.first;
}
int main() {
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if (s[i] == 'x')
cnt++;
}
YES(cnt < 8);
return 0;
} | [
"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 Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
string s;
int a = 0;
cin >> s;
rep(i, s.size()) {
if (s[i] == 'o') {
a++;
}
}
if (8 - a >= 15 - s.size()) {
YES;
} else {
NO;
}
return 0;
}
| #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 Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
string s;
int a = 0;
cin >> s;
rep(i, s.size()) {
if (s[i] == 'o') {
a++;
}
}
if (8 - a <= 15 - s.size()) {
YES;
} else {
NO;
}
return 0;
}
| [
"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 XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
stin(s);
lint n = s.size(), c = 0;
rep(n) {
if (s[i] == 'o')
++c;
}
c += 15 - n;
Yes(c > 7);
} |
/*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 XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
stin(s);
lint n = s.size(), c = 0;
rep(n) {
if (s[i] == 'o')
++c;
}
c += 15 - n;
YES(c > 7);
}
// sub_EOF
// map<lint,lint> zip;
// lint unzip[MAXN];
//
// void compress(vector<lint> &a,map<lint,lint> &z,lint u[]){
// vector<lint> v=a;
// sort(all(v));
// v.erase(unique(all(v)),v.end());
// rep(i,v.size()){
// z[v[i]]=i;
// u[i]=v[i];
// }return;
//}
//
// int main(){
// lint n,qn;in(n,qn);
// vector<lint> a;
// struct query{ lint t,x,y; };
// vector<query>q(n);
// rep(qn){
// cin>>q[i].t>>q[i].x>>q[i].y;
// a.pb(q[i].x);
// a.pb(q[i].y);
// }compress(a,zip,unzip);
// lint m=a.size();
//}
// sub-EOF
| [
"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 XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
stin(s);
lint n = s.size(), c = 0;
rep(n) {
if (s[i] == 'o')
++c;
}
c += 15 - n;
Yes(c > 7);
}
// sub_EOF
// map<lint,lint> zip;
// lint unzip[MAXN];
//
// void compress(vector<lint> &a,map<lint,lint> &z,lint u[]){
// vector<lint> v=a;
// sort(all(v));
// v.erase(unique(all(v)),v.end());
// rep(i,v.size()){
// z[v[i]]=i;
// u[i]=v[i];
// }return;
//}
//
// int main(){
// lint n,qn;in(n,qn);
// vector<lint> a;
// struct query{ lint t,x,y; };
// vector<query>q(n);
// rep(qn){
// cin>>q[i].t>>q[i].x>>q[i].y;
// a.pb(q[i].x);
// a.pb(q[i].y);
// }compress(a,zip,unzip);
// lint m=a.size();
//}
// sub-EOF
|
/*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 XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " "
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
stin(s);
lint n = s.size(), c = 0;
rep(n) {
if (s[i] == 'o')
++c;
}
c += 15 - n;
YES(c > 7);
}
// sub_EOF
// map<lint,lint> zip;
// lint unzip[MAXN];
//
// void compress(vector<lint> &a,map<lint,lint> &z,lint u[]){
// vector<lint> v=a;
// sort(all(v));
// v.erase(unique(all(v)),v.end());
// rep(i,v.size()){
// z[v[i]]=i;
// u[i]=v[i];
// }return;
//}
//
// int main(){
// lint n,qn;in(n,qn);
// vector<lint> a;
// struct query{ lint t,x,y; };
// vector<query>q(n);
// rep(qn){
// cin>>q[i].t>>q[i].x>>q[i].y;
// a.pb(q[i].x);
// a.pb(q[i].y);
// }compress(a,zip,unzip);
// lint m=a.size();
//}
// sub-EOF
| [
"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 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP << " " <<
#define CYES cout << "Yes" << endl
#define CNO cout << "No" << endl
#define CFS \
cin.tie(0); \
ios::sync_with_stdio(false)
typedef long long LL;
typedef long double LD;
int main() {
string s;
cin >> s;
int c = 0;
rep(i, s.length()) {
if (s[i] == 'x')
c++;
}
if (c > 7)
CNO;
else
CYES;
return 0;
}
| #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 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP << " " <<
#define CYES cout << "YES" << endl
#define CNO cout << "NO" << endl
#define CFS \
cin.tie(0); \
ios::sync_with_stdio(false)
typedef long long LL;
typedef long double LD;
int main() {
string s;
cin >> s;
int c = 0;
rep(i, s.length()) {
if (s[i] == 'x')
c++;
}
if (c > 7)
CNO;
else
CYES;
return 0;
}
| [
"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;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
ans++;
}
if (ans >= 8)
puts("No");
else
puts("Yes");
return 0;
}
| #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;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'x')
ans++;
}
if (ans >= 8)
puts("NO");
else
puts("YES");
return 0;
}
| [
"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
cout << "Yes" << 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) == 'o')
cnt++;
}
if (S.size() < 8)
cout << "YES" << endl;
if (8 <= S.size()) {
if (cnt < S.size() - 7)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
} | [
"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); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I, N) for (auto I = 0; I < (N); ++I)
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define dw(I, A, B) for (auto I = (A); I >= (B); --I)
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define pt pop_front
#define pk pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void in(T &p) { cin >> p; }
template <class T1, class T2> inline void in(T1 &p1, T2 &p2) {
cin >> p1 >> p2;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T1, class T2, class T3, class T4>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4) {
cin >> p1 >> p2 >> p3 >> p4;
}
template <class T1, class T2, class T3, class T4, class T5>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4, T5 &p5) {
cin >> p1 >> p2 >> p3 >> p4 >> p5;
}
template <class T> inline void out(T p) { cout << p << endl; }
template <class T1, class T2> inline void out(T1 p1, T2 p2) {
cout << p1 << " " << p2 << endl;
}
template <class T1, class T2, class T3> inline void out(T1 p1, T2 p2, T3 p3) {
cout << p1 << " " << p2 << " " << p3 << endl;
}
template <class T1, class T2, class T3, class T4>
inline void out(T1 p1, T2 p2, T3 p3, T4 p4) {
cout << p1 << " " << p2 << " " << p3 << " " << p4 << endl;
}
inline void solve(void) {
string s;
in(s);
int n = count(all(s), 'o') >= 8;
int k = s.size();
out(n >= 8 || n + 15 - k >= 8 ? "YES" : "NO");
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| #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); \
cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I, N) for (auto I = 0; I < (N); ++I)
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define dw(I, A, B) for (auto I = (A); I >= (B); --I)
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define pt pop_front
#define pk pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void in(T &p) { cin >> p; }
template <class T1, class T2> inline void in(T1 &p1, T2 &p2) {
cin >> p1 >> p2;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
cin >> p1 >> p2 >> p3;
}
template <class T1, class T2, class T3, class T4>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4) {
cin >> p1 >> p2 >> p3 >> p4;
}
template <class T1, class T2, class T3, class T4, class T5>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4, T5 &p5) {
cin >> p1 >> p2 >> p3 >> p4 >> p5;
}
template <class T> inline void out(T p) { cout << p << endl; }
template <class T1, class T2> inline void out(T1 p1, T2 p2) {
cout << p1 << " " << p2 << endl;
}
template <class T1, class T2, class T3> inline void out(T1 p1, T2 p2, T3 p3) {
cout << p1 << " " << p2 << " " << p3 << endl;
}
template <class T1, class T2, class T3, class T4>
inline void out(T1 p1, T2 p2, T3 p3, T4 p4) {
cout << p1 << " " << p2 << " " << p3 << " " << p4 << endl;
}
inline void solve(void) {
string s;
in(s);
int n = count(all(s), 'o');
int k = s.size();
out(n >= 8 || n + 15 - k >= 8 ? "YES" : "NO");
}
int main(int argc, char **argv) {
BEGIN;
solve();
END;
}
| [
"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 T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
// vector<pair<int,int>> pairs; pairs[i] = make_pair(value, value);
// sort(a.begin(),a+index_number);
// cin>> cout<<'\n'
/*
vector<int> vec(100,-1);全ての値に-1をセット
vector<std::vector<int>> vec{{ 1, 2, 3 },{ 4, 5, 6 }};
vec.size() vec[i].size()
vec.emplace_back(20);追加
*/
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
string ans = "NO";
cin >> s;
int len = s.length();
int count = 0;
for (int i = 0; i < len; i++) {
if (s[0] == 'o') {
count++;
}
}
if ((15 - len + count) >= 8)
ans = "YES";
cout << ans << '\n';
return 0;
} | #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 T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
// vector<pair<int,int>> pairs; pairs[i] = make_pair(value, value);
// sort(a.begin(),a+index_number);
// cin>> cout<<'\n'
/*
vector<int> vec(100,-1);全ての値に-1をセット
vector<std::vector<int>> vec{{ 1, 2, 3 },{ 4, 5, 6 }};
vec.size() vec[i].size()
vec.emplace_back(20);追加
*/
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
string ans = "NO";
cin >> s;
int len = s.length();
int count = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'o') {
count++;
}
}
if ((15 - len + count) >= 8)
ans = "YES";
cout << ans << '\n';
return 0;
} | [
"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.