Problem:


Score : 200 points

Problem Statement

Takahashi is competing in a sumo tournament.
The tournament lasts for 15 days, during which he performs in one match per day.
If he wins 8 or more matches, he can also participate in the next tournament.

The matches for the first k days have finished.
You are given the results of Takahashi's matches as a string S consisting of o and x.
If the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.

Print YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.

Constraints

1 \leq k \leq 15

S is a string of length k consisting of o and x.

Input

Input is given from Standard Input in the following format:

S

Output

Print YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.

Sample Input 1

oxoxoxoxoxoxox

Sample Output 1

YES

Takahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.

Sample Input 2

xxxxxxxx

Sample Output 2

NO



Sample input:
oxoxoxoxoxoxox


Sample output:
YES

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "YES"  # type: str
NO = "NO"  # type: str
K = 15

def solve(S: str):
    count =  S.count("o")
    if count >= 8:
        print("YES")
    else:
        rest = K - len(S)
        if count + rest >= 8:
            print("YES")
        else:
            print("NO")
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
if 15 - len(S) + S.count('o') >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
n = input()
ans = 0
for i in range (len(n)):
  if n[i] == 'o':
    ans += 1
if 15 - len(n) + ans >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()

cnt = 0
for c in s:
    if c == 'x':
        cnt += 1
if cnt >= 8:
    print("NO")
else:
    print("YES")

# print(*data, sep='\n')

Submission status: Accepted

Solution code:
#input
S = input()

#slice
Batsu = int(S.count('x'))
Nokori = 15 - Batsu

#output
if Batsu >= 8:
	print("NO")
else:
	print("YES")

Submission status: Accepted

Solution code:
s = input()
rest = 15- len(s)
print('YES') if s.count('o') + rest >=8 else print('NO')

Submission status: Accepted

Solution code:
print("YES"if input().count("x")<8else"NO")

Submission status: Accepted

Solution code:
S = str(input())
win = 0
for s in S:
  if s == "o":
    win += 1
if (win + (15 - len(S))) >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()
x = s.count('x')
if x>7:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
s=input()
print('YES' if s.count('o')>=8-(15-len(s)) else 'NO')

Submission status: Accepted

Solution code:
S = input()
S_list = list(S)
remain_match = 15 - len(S_list)
S_remain_win = 8 - S.count("o")
if remain_match >= S_remain_win:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
q = input()
a=0
for i in q :
	if i == 'x' : a+=1

if a>=8 : print("NO") 
else : print("YES")

Submission status: Accepted

Solution code:
# coding: utf-8
# user: herp_sy

import math
import statistics

win = 0
lose = 0
s = input()
for i in range(len(s)):
  if s[i] == 'o':
    win = win + 1
  else:
    lose = lose + 1
if(win + (15 - len(s)) >= 8):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
num = 0
for i in range(len(s)):
    if s[i] == 'x':
        num+=1
    
if num >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
count=0
s=input()
for i in range(0,len(s)):
  if(s[i]=='x'):
    count=count+1
if(count>=8):
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
s = input()
lose = s.count('x')
if lose > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s = input()
c=0
n = list(map(str, s))

for i in n :
    if i == 'o' :
        c +=1
        
if c >= 8 or (8-c) <= 15 - len(n) :
    print('YES')
else :
    print('NO')

Submission status: Accepted

Solution code:
s = input()

ans = 15 - len(s) + s.count("o")

if ans >= 8:
    print("YES")

else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()

cnt = 0
for i in S:
    if(i=='o'):
        cnt += 1
if(15-len(S)+cnt>=8):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S = input()
k = len(S)
win = S.count('o')
print("YES" if (15-k) >= (8-win) else "NO")

Submission status: Accepted

Solution code:
s = input()

n_win = sum([1 for ss in s if ss == 'o'])
ans = 'YES' if 15-len(s) >= 8-n_win else 'NO'
print(ans)

Submission status: Accepted

Solution code:
s = input()
n = len(s)
s += "o"*(15-n)
if s.count("o") >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()
loss = s.count('x')
print("YES" if loss < 8 else "NO")

Submission status: Accepted

Solution code:
# 参考: https://qiita.com/y-tsutsu/items/aa7e8e809d6ac167d6a1

import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

# 多次元配列
# dp = [[0] * 3 for _ in range(5)]

# 入力を受け取る
s = input()

l = len(s)

w = len(list(filter(lambda c: c == 'o', s)))

print('YES' if 15 - l + w >= 8 else 'NO')

Submission status: Accepted

Solution code:
S = input()

ans = 'YES' if 15-len(S) + S.count('o') >= 8 else 'NO'
print(ans)

Submission status: Accepted

Solution code:
S = input()
cnt = 0

for s in S:
    if s == "x":
        continue

    else:
        cnt += 1

if 15 - len(S) + cnt >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    S = [1 for c in input().strip() if c == 'x']
    if sum(S) >= 8:
        return 'NO'
    else:
        return 'YES'

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
a = input()
if 15-len(a) + a.count('o') >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
win = s.count('o')

if win + (15-len(s)) >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

S = raw_input()
if S.count("x") <= 7:
    print "YES"
else:
    print "NO"

Submission status: Accepted

Solution code:
s = raw_input()
c = 0
for ch in s:
  if ch == 'x':
    c += 1
if c <= 7:
  print 'YES'
else:
  print 'NO'

Submission status: Accepted

Solution code:
s = input()
s = list(s)


if len(s) < 15:
    for _ in range(15-len(s)):
        s.append('o')

cnt = 0
for r in s:
    if r == 'o':
        cnt += 1

if cnt >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = list(input())
counter = 0
k = len(s)
for i in range(k):
    if s[i] == "o":
        counter += 1
if counter+(15-k) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_b

S = input().strip()
if S.count("x") >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
c=list(input())
if c.count('x')>=8:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
s = input()
s = s + "o" * (15 - len(s))

if s.count("o") >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s=input()
ct=0
for i in s:
  if i=='o':
    ct+=1
if 15-len(s)+ct>=8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s=list(input())
o=0
z=len(s)
for i in range(len(s)):
    if s[i]=='o':
        o+=1
if o+(15-z)>=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S=str(input())
L=len(S)
if (15-L)+S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a=input()
n=a.count("x")
if n>7:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
s = input()
k = len(s)

if 15-k+s.count('o') >= 8:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
s = input()
nokori = 15 -len(s)
should = 8 -nokori 
num = s.count("o")
if num >= should:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a = input()

b = a.count('o')

if 8 - b <= 15 - len(a):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
if 15-s.count("x")<8: print("NO")
else: print("YES")

Submission status: Accepted

Solution code:
S = input()
k = len(S)
l = 15 - k
m =S.count("o")
if m + l>= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()
print('YES' if s.count('o') - len(s) >= -7 else 'NO')

Submission status: Accepted

Solution code:

s = input()
a = 0

for i in s:
    a += 1 if i == 'o' else 0

if a + 15 - len(s) >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
ans = s.rjust(15, 'o').count('o')  >=  8
print(ans and 'YES' or 'NO')

Submission status: Accepted

Solution code:
from collections import Counter

S = input()
counter = Counter(S)
if counter['x'] <= 7:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
print("YES" if s.count("o") + 15-len(s) >= 8 else "NO")

Submission status: Accepted

Solution code:
print("YNEOS"[input().count('x')>=8::2])

Submission status: Accepted

Solution code:
S = input()

if 15 - len(S) + S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S = list(input())

#勝利数
win = S.count("o")
#これから勝つ必要のある試合
korekara = 8 - win
#戦った試合
match = len(S)
#残り試合
nokori = 15 - match

if korekara <= 0:
    print("YES")
elif nokori >= korekara:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
print("NO" if input().count("x") > 7 else "YES")

Submission status: Accepted

Solution code:
print("NO") if input().count("x") > 7 else print("YES")

Submission status: Accepted

Solution code:
S = input()
print("YES" if S.count("x")<8 else "NO")

Submission status: Accepted

Solution code:
print("NO" if input().count("x")>7 else "YES")

Submission status: Accepted

Solution code:
S=input()
if S.count('x')<=7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    k = list(input())
    win_count = k.count('o')

    if (win_count + (15 - len(k))) >= 8:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
num = S.count("x")
if 1 <= len(S) <= 15:
    if 1 <= len(S) <= 7 :
        print("YES")
    else :
        if num >= 8 :
            print("NO")
        else :
            print("YES")

Submission status: Accepted

Solution code:
if input().count("x") > 7:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
ans = s.rjust(15, 'o').count('o') >= 8
print(ans and 'YES' or 'NO')

Submission status: Accepted

Solution code:
print(("NO","YES")[input().count('x')<=7])

Submission status: Accepted

Solution code:
S = input()
if S.count('o')+15-len(S) >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input()
o_count = s.count('o')
win_need = 8 - o_count
nokori = 15 - len(s)

if nokori>= win_need:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
#B問題
S = list(str(input()))
Slen=len(S)
O = S.count("o")
if (15-Slen)+O >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()

k = 0
for c in S:
    if c == "o":
        k += 1

if k + 15 - len(S) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
count = 0
for i in S:
  if i == "x" :
    count += 1
if count <= 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()
cnt = 0
for i in range(len(s)):
  if s[i] == 'o':
    cnt += 1

if cnt + 15 - len(s) >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
S=input()
print('YES' if S.count('o') + 15-len(S) >= 8 else 'NO')

Submission status: Accepted

Solution code:
s = str(input())
if s.count('x')>7:
    ans = 'NO'
else:
    ans = 'YES'
print(ans)

Submission status: Accepted

Solution code:
S = input()
win = S.count('o')
print('YES' if (15-len(S))+win >= 8 else 'NO')

Submission status: Accepted

Solution code:
s=input();print('YNEOS'[s.count('o')+7-len(s)<0::2])

Submission status: Accepted

Solution code:
if input().count("x") > 7:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
input_num = input()

plus_count =15 - len(input_num)
win = input_num.count('o')

if win + plus_count >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s=input()
t=len(s)
o=s.count("o")
n=s.count("x")
if n<8 and t<=15:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
xcounter=0
a=list(input())
for i in range(len(a)):
  if a[i]=="x":
    xcounter+=1
if xcounter>=8:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
s=list(input())

maru = 0
batu = 0
for i in range(len(s)):
  if s[i] == "o":
    maru = maru + 1
  else:
    batu = batu + 1
if 15 - maru - batu >= 8 - maru:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
line = input()
count = 0
for i in line:
  if i == "x" :
    count += 1
if count <= 7: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
S=input()
rest = 15-len(S)
N = 0
for i in range(len(S)):
    if S[i]=="o": 
        N+=1
if N+rest>=8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
k = len(S)
n = 8 - (15-k)
if (n <= 0) or (S.count("o")>=n):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys


def judge(s):
    win = s.count('o')
    if win >= 8:
        return 'YES'

    if (8 - win) <= (15 - len(s)):
        return 'YES'

    return 'NO'


S = input()

print(judge(S))

Submission status: Accepted

Solution code:
S = input()
day =  15 - len(S)

if((S.count('o') + day) > S.count('x')):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S = input()
w = 0
for curr in range(len(S)):
    if S[curr] == 'o':
        w += 1

if (15 - len(S)) >= (8 - w):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
n = list(input())
cont1 = 0
for i in range(len(n)):
  if n[i] is 'o':
    cont1 = cont1 + 1
if cont1 >= len(n)-7:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a = input()
x = [a[i:i+1] for i in range(len(a))]
r = len([s for s in x if s.endswith('x')])
if r >= 8:
	print('NO')
else:
	print('YES')

Submission status: Accepted

Solution code:

S = input()
w = 15-len(S)
w += sum([s=="o" for s in S])
if w >= 8:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
s = input()
if s.count('o')>= 8:
  print('YES')
elif 15 - len(s)+ s.count('o')>= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s = input()
x = 0
for i in range(len(s)):
    if s[i] == "x":
        x += 1
if x < 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
win = 0
for i in range(len(S)):
    if S[i] == 'o':
        win += 1

if 15 - len(S) + win >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s=input()
win=0
ls=0
for i in s:
    if i=='x':
        ls+=1
    else:
        win+=1
if len(s)==15:
    if win>=8:
        print('YES')
    else:
        print('NO')

if len(s) < 15:
    if (win+(15-len(s)))>=8:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
S = [1 if s == 'o' else 0 for s in input()]
k = len(S)
if sum(S) >= 8-(15-k):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
stars = input()
loses = 0
for i in stars:
    if i == 'x':
        loses += 1
print("YES") if loses < 8 else print("NO")

Submission status: Accepted

Solution code:
s=input()
s = s + "o"*(15-len(s))
print("YES" if 7 < s.count("o") else "NO")

Submission status: Accepted

Solution code:
S = str(input())
countup = 0
for i in range(len(S)):
  if S[i] == "o":
    countup += 1
if countup + (15 - len(S)) >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()

n = s.count("o")+(15-len(s))

if n>=8: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
S = input()
win_no = 0
for match in S:
    if match == "o":
        win_no += 1
    
if win_no + 15 - len(S)>= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()
n = s.count('x')
if n > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
S = input()
if S.count('o') + 15 - len(S) >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
S = input()


print('YES' if 15 - sum(s=='x' for s in S) >= 8 else 'NO')

Submission status: Accepted

Solution code:
if input().count("x") < 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S=input()
shori=S.count("o")
if 15-len(S)+shori>=8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()

win = 0
lose = 0

for c in s:
    if c == "o":
        win += 1
    else:
        lose += 1

days = 15 - (win + lose)

if win + days >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s= input()
day= len(s)
win = s.count('o')
possibility=15-day+win

if possibility >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
string = input()
sum_of_o = 0
for i in string:
    if i == 'o':
        sum_of_o += 1
 
if 15-len(string) >= 8 - sum_of_o:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
C = 0
N = len(S)

for i in range(N):
    if S[i] == "o":
        C = C + 1

if ((15 - N) + C) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a = input()
count_all = len(a)
count_win = a.count('o')

if (15 - count_all) + count_win >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
S=input()
a=S.count('x')
if a>7:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
s = input()
day_current = len(s)
win_count = s.count("o")

if win_count + (15 - day_current) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np

# [Pythonで文字列を置換（replace, translate, re\.sub, re\.subn） \| note\.nkmk\.me](https://note.nkmk.me/python-str-replace-translate-re-sub/)
S = input().strip().translate(str.maketrans({'o': '1', 'x': '0'}))
ss = [int(c) for c in S ]

wins = np.sum(ss)

if 15 - len(ss) + wins >= 8 :
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def readInt():
    return int(input())

def readList():
    return list(input().split())

def readListI():
    return list(map(int, input().split()))

def main():
    s = input()
    win = sum(1 for c in s if c == 'o')
    if win+15-len(s) >= 8:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
if s.count('o') + 15 - len(s) > 7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
#coding:utf-8

S = list(input())
cnt = 0

for i in S:
    if i == 'x':
        cnt += 1

if cnt >= 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s = str(input())

if s.count('x') >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
S = input()
ans = 'NO' if S.count('x')>=8 else 'YES'
print(ans)

Submission status: Accepted

Solution code:
s=input()
print("NO" if s.count("x")>7 else "YES")

Submission status: Accepted

Solution code:
S=str(input())
k=len(S)
dic = {"o":0,"x":0}
for character in S:
    dic[character] +=1
    
if dic["o"]>=8:
    print("YES")
else:
    if (15-k)>=(8-dic["o"]):
         print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
S=input()
s=len(S)
ans=S.count("o")
if ans+(15-s)>=8:
    print("YES")
if ans+(15-s)<8:
    print("NO")

Submission status: Accepted

Solution code:
match=input()
match=list(match)
lmatch=len(match)
cmaru=match.count("o")
#print(cmaru)
cnt=15-lmatch+cmaru
#print(cnt)

if cnt>=8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
aryS = list(input())
if aryS.count("x") > 7:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
from collections import Counter
S = input()
c = Counter(S)
res = c['o']+15-len(S)
print('YES' if res >= 8 else 'NO')

Submission status: Accepted

Solution code:
s = input()
sum = 0
for i in range(len(s)):
    if s[i]=='x':
        sum = sum
    else:
        sum = sum +1
if len(s) < 15:
    sum = sum + 15 - len(s)
if sum >=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
x = input()
x_len = len(x)
count_w, count_l = 0,0
for i in range(len(x)):
  if x[i] == 'o':
    count_w += 1
  if x[i] == 'x':
    count_l += 1
    
if 15 - x_len + count_w >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
s=input()
if(s.count('x')>=8):
    print("NO")
elif((len(s)<15)&(len(s)-s.count('x')+s.count('o')>=8)):
    print("YES")
else:
    print("YES")

Submission status: Accepted

Solution code:
S=input()
win=0
for i in range(int(len(S))):
  if(S[i]=='o'):
  	win += 1

if(win+15-int(len(S))>=8):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a = input()
if (15 - len(a))+ a.count("o") >= 8:
  print("YES")
else :
  print("NO")

Submission status: Accepted

Solution code:
s = input()
count = 0
for i in range(len(s)):
    if s[i] == "x":
        count += 1
n = 15 - count
if n >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
inp = input()
maru = inp.count('o')
batu = inp.count('x')
inp_length = inp.__len__()
if maru > 7 or 15 - inp_length >= 8 - maru:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
nokori = 15 - len(S)
maru = S.count('o')
nokori + maru
if nokori + maru>=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
n = input()
if n.count("o") + (15 - len(n)) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
num = len(S)
if num <= 7:
    print("YES")
else:
    cnt = 0
    for c in S:
        if c == 'o':
            cnt += 1
    rem = num - cnt
    if rem >= 8:
        print("NO")
    else:
        print("YES")

Submission status: Accepted

Solution code:
print("YES" if input().count("x") <= 7  else "NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
	c = 0
	s = input()
	for t in s:
		if t == 'o':
			c += 1
	
	c += 15 - len(s)
	
	if c >= 8:
		print('YES')
	else:
		print('NO')


if __name__ == '__main__':
	import sys
	sys.exit(main())

Submission status: Accepted

Solution code:
import collections

result = list(input())

result_count = collections.Counter(result)
win_count = result_count['o']

remain_days = 15 - len(result) 

if 8 - win_count <= remain_days:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()
no = s.count('o')
r = 15 - len(s)

print('YES' if r + no >= 8 else 'NO')

Submission status: Accepted

Solution code:
S=input()
S_list=list(S)
j=0
k=0


for i in S_list:
    j+=1
    if i=='o':
        k+=1

J=15-j
K=J+k


if K<8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s=raw_input()
si=15-len(s)
n=s.count('o')
if n+si>7: print "YES"
else: print "NO"

Submission status: Accepted

Solution code:
import numpy as np
s=np.asarray(list(str(input())))
r=15-s.size
if(8 <= r + np.sum(s=="o")):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
S = list(input())

count_x = 0
for s in S:
    if s == 'x':
        count_x += 1

if count_x >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
a = input()
if a.count("o") + (15-len(a)) >= 8:
  print("YES")
else:print("NO")

Submission status: Accepted

Solution code:
A = input()

B = list(A)

C = sorted(B)


D=C.count("o")
if 15-len(C) + D > 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
X= input('')
Y=0
Z=0
for i in range(len(X)):
    c = X[i]
    if c == "o" :
        Y += 1
    elif c == 'x' :
        Z += 1
if Z >= 8 :
    print("NO")
else :
    print("YES")

Submission status: Accepted

Solution code:
print("YES" if input().count('x') <= 7 else "NO")

Submission status: Accepted

Solution code:
S = input()

ans = "YES"
win = S.count("o")
if(15 - len(S) + win < 8):
    ans = "NO"
print(ans)

Submission status: Accepted

Solution code:
S=input()
K=len(S)
if (15 - K) +  S.count('o') >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
def main():
    s = input()
    end = len(s)
    win = s.count("o")
    print("YES" if (end - win) <= 7 else "NO")
main()

Submission status: Accepted

Solution code:
c = input()
if c.count('x') <= 7:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
def main():
    S = input()
    x_count = S.count('x')
    if x_count >= 8:
        print("NO")
    else:
        print("YES")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys;
import string;
sys.setrecursionlimit(20000) # 再起呼び出しの最大数をセット

import copy
import itertools

from functools import lru_cache
#@lru_cache(maxsize = None)

# 整数の入力
#n = int(input())

# スペース区切りの整数の入力
#a = [x for x in map(int, input().split())]
#n, m = map(int, input().split())
#print("sp", n, q, file=sys.stderr)

# 改行区切りの整数の入力
#a = []
#for x in range(m):
#  a.append([int(x) for x in input().split()])
#p = [int(x) for x in input().split()]

# 文字列の入力
s = input()

# 出力
#print("{} {}".format(a+b+c, s))
#a.sort()
#print(set(a), file=sys.stderr)
#print(len(set(a)))

#cache = dict()


def doit(s):
  ok = True
  for x in range(m):
    res = 0
    for y in range(a[x][0]):
      if s[a[x][y+1]-1] == 1:
        res = res + 1
    #print("res", res, file=sys.stderr)
    if res % 2 != p[x]:
      ok = False
      break
  #print("ok", ok, file=sys.stderr)
  return ok

def createSw(n):
  if n <= 1:
    return [[0,], [1,]]

  ret = []
  for x in createSw(n-1):
    #print("sw0", x, file=sys.stderr)
    ret.append(x + [0])
    ret.append(x + [1])
    #print("ret", ret, file=sys.stderr)
  #print("ret", ret, file=sys.stderr)
  return ret

#print(doit([0] * 4))
try:
  res = 0
#  for x in createSw(n):
#  for x in itertools.product(range(2), repeat=n):
#    print("x", x, file=sys.stderr)
#    if doit(x):
#      res = res + 1
#  print((n-3)*180)
  l = len(s)
  for x in s:
    if x == 'x':
      res += 1
  print(15 - l, 8 - res, file=sys.stderr)
  if l - res >= 8: 
    print("YES")
  elif res >= 8 or 15 - l < 8 - res:
    print("NO")
  else:
    print("YES")
except Exception as e:
  print("e", e, file=sys.stderr)

Submission status: Accepted

Solution code:
S = input()
lost = 0
win = 0
for i in S:
    if i == "x":
        lost +=1
    else:
        win += 1

if lost >= 8:
    print("NO")
else:
    if 15 - len(S) + win >= 8:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
S = input()

len_s = len(S)

win_count = 0
for s in S:
    if s == "o":
        win_count += 1

if win_count + 15 - len_s >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# 整数入力
a = list(input())

sum = 0
maru = 0

for i in a:
  if i == "o":
    maru += 1
  sum += 1

if 15-sum+maru >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()
k = len(s)
o = s.count('o')
if 15 - k + o >= 8:
  print('YES')
else:
  print ('NO')

Submission status: Accepted

Solution code:
n = input()

x = 0
o = 0

for i in range(len(n)):
  if n[i] == 'o':
    o += 1
  else:
    x += 1
    
if (15 - len(n)) + o >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
games = input()
count = 0
for game in games:
    if(game == "o"):
        count = count +1
count = count + (15 - len(games))
if(count < 8):
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
S = input()
length = len(S)
numOfO = S.count('o')
if (15 - length + numOfO >= 8):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input()
k = len(s)

a = 0

for i in s:
  if i == 'x':
  	a+=1
    
if a>=8:
	print('NO')
else:
	print('YES')

Submission status: Accepted

Solution code:
result = list(input())

if result.count('x') <= 7:
  print('YES')
else: 
  print('NO')

Submission status: Accepted

Solution code:
s = raw_input() + 'o' * 15

s = s[:15]

if s.count('o') >= 8:
    print 'YES'
else:
    print 'NO'

Submission status: Accepted

Solution code:
result = input()
hope = result + (15 - len(result))*'o'
if hope.count('o') >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s=input()
makeban=0
for i in s:
    if i=="x":
        makeban+=1
if makeban<=7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
lll = str(input())
l = list(lll)
if(l.count("o")>7):
    print("YES")
elif(l.count("x") <= 7 and l.count("o") <= 8 ):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
S = input()
S_count = S.count("o")
remain = 15 - len(S)
if remain + S_count >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s=input()
if s.count("x")>7:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
S = list(input())
N = len(S)
C = S.count('o')
if C >= 8 or (15 - N) >= (8 - C) :
    print('YES')
else :
    print('NO')

Submission status: Accepted

Solution code:
S = raw_input()
print "YES" if S.count("o")+(15-len(S))>=8 else "NO"

Submission status: Accepted

Solution code:
S = input()
if S.count('o') - len(S) >= -7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = map(str,input())
S = list(s)
k = len(S)
count = 15-k
for i in range(k):
  if S[i] == 'o':
    count+= 1
if count >= 8:
  print("YES")
else:
  print("NO")