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:
S = input()
n = len(S)

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

Submission status: Accepted

Solution code:
s = input()
lose = 0
for c in s:
  if c == 'x':
    lose += 1
    if lose == 8:
      print('NO')
      break
else:
  print('YES')

Submission status: Accepted

Solution code:
import sys
from collections import Counter
INF = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input().strip()
ocnt = s.count('o')

rem = 15 - len(s)
if ocnt + rem >= 8:
    print "YES"
else:
    print "NO"

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    S = input()

    cnt = 0
    for s in S:
        if s == 'x':
            cnt += 1
    if cnt <= 7:
        print('YES')
    else:
        print('NO')

input = lambda: stdin.readline().rstrip()
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
o, x = 0, 0
for c in s:
  if c =='o':
    o += 1
  else:
    x += 1
if x < 8:
  print('YES')
else:
  print('NO')

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:
import sys
rr = lambda: sys.stdin.readline().strip()
rri = lambda: int(rr())
rrs = lambda: [int(_) for _ in rr().split()]

S = rr()

if S.count('x') > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

for i in s:
    if i == "o":
        cnt += 1
        
ans = 15 - len(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

S=input()

if S.count('x')>=8:
    NO()
else:
    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()

num = S.count('x')

if num > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(['YES','NO'][7<len(input().replace('o',''))])

Submission status: Accepted

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

import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

def main():
    S = input()
    days = len(S)
    win = S.count('o')
    possible_win = 15 - len(S)
    print('YES' if win + possible_win >= 8 else 'NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = list(input())
lose = 0
for s_n in S:
	if s_n == "x":
		lose += 1
		
if lose > 7:
	print("NO")
else:
	print("YES")

Submission status: Accepted

Solution code:
def main():
    s = input()

    n = len(s)
    m = 0
    for ss in s:
        if ss == 'o':
            m += 1

    print('YES') if (15 - n + m) >= 8 else print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
d = "o" * 15
s = input()
s = s + ("o" * (15-len(s)))
r = 0
for i in range(len(s)):
    if s[i] == "o":
        r += 1
print("YES" if r > 7 else "NO")

Submission status: Accepted

Solution code:
s = input()
p = len(s)
if 15 - p + s.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] == 'o' :
        count += 1

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

Submission status: Accepted

Solution code:
Ss = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from collections import Counter
from collections import OrderedDict


#a, b, c, d = (int(i) for i in input().split())  
#a = [int(i) for i in input().split()] 

#N =  int(input())

#print(180*(N-2))

S = input()
o_count = 0
x_count = 0
for s in S:
    if s == 'o':
        o_count += 1
    else:
        x_count += 1
if x_count >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
A = list(input())

ans = A.count('o')
k = len(A)
zan = 15 - k

if zan + ans >= 8:
    print ('YES')
else:
    print ('NO')

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()

w = 0

for c in s:
  if c == "o":
    w += 1

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

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()
count=0
for i in range(len(s)):
    if s[i]=='o':
        count=count+1
if count+15-len(s)>=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

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()
s_len = len(S)
s_win = S.count('o')
if (15 - s_len)+s_win >= 8:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
S = input()
cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getlist():
	return map(int, input().split())

S = list(input())

k = len(S)

c = S.count("o")
if 15 - k + c >= 8:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

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:
def li():
    return list(map(int, input().split()))


if __name__ == "__main__":
    s = input()
    games = len(s)
    wins = s.count("o")
    if (15 - games) + wins >= 8:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
s = input()

ok = 0
for c in s:
    if c == "o":
        ok += 1

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

S = input()
counter = Counter(S)

if counter['x'] > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s = input()
x = sum(1 for c in s if c == 'x')
if x >= 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
s = input()

count = 0

for i in s:
    if(i == "o"): count += 1

count += 15 - len(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

batu = 0
for i in range(len(s)):
    if s[i] == 'x':
        batu += 1

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

Submission status: Accepted

Solution code:
S = input()
print('YES' if 8 <= (15 - len(S)) + sum(c == 'o' for c in S) else 'NO')

Submission status: Accepted

Solution code:
a = input()
s = len(a)
def Y(a,t = 0):
    if a>=t : print('YES')
    else : print('NO')
def y(a, t =0):
    if a==t : print('Yes')
    else : print('No')
t = a.count("o")
Y(15-s+t,8)

Submission status: Accepted

Solution code:
S = input()
S.zfill(15)
win = 15 - S.count('x')
if win < 8:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    wl = Counter(S)
    return 'YES' if (wl['o'] + 15-len(S)) >= 8 else 'NO'


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

maru = 0
batsu = 0

for i in range(len(S)):
    if(S[i] == 'x'):
        batsu += 1

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

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
# import statistics
import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))
def unite(x, y):
    # それぞれのノードの根を求める
    x = root(x)
    y = root(y)
    if x == y:
        return
    # node[x]の根をyに変更する
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  # xが根の場合
        return x
    else:
        node[x] = root(node[x])  # 経路圧縮
        return node[x]
def dfs(v):
    # ノードに訪れた
    visited[v] = True
    for v2 in range(n):
        if graph[v][v2] == False:  # そもそもvとv2が辺でつながっていない
            continue
        if visited[v2] == True:  # もう見た
            continue
        dfs(v2)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=15-len(a)

if a.count("o") + b >= 8:
  print("YES")
else:
  print("NO")

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()
a = 0
for i in range(len(S)):
    if S[i] == "o":
        a += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

count = 15 - len(s)
for c in s:
  if c is 'o': count += 1
    
if count >= 8:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:

import sys
#sys.stdin=open("data.txt")
input=sys.stdin.readline
mii=lambda:map(int,input().split())

s=input().strip()

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

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()
    cnt_lose = 0

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

solve()

Submission status: Accepted

Solution code:
S=list(input())

L=0
for i in range(len(S)):
    if S[i]=="x":
        L+=1
if L>=8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
# N=int(input())
# x,y = map(int,input().split())
S = input()
# 負けの数が8以上ならアウト
cnt = 0
for ss in S:
    if ss=="x":
        cnt += 1
print("YES" if cnt <8 else "NO")

Submission status: Accepted

Solution code:
# 2019/06/01
# M-SOLUTIONS プロコンオープン - B

# Input
s = input()

cnt = 0
for i in range(len(s)):
    if s[i] == "o":
        cnt += 1

cnt += 15 - len(s)

if cnt >= 8:
    ans = "YES"
else:
    ans = "NO"

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print("YNEOS"[s.count("o")+15-len(s)<8::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

count = 0
for si in s:
    if si == "o":
        count += 1

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

Submission status: Accepted

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

sum=0
for i in range(n):
    if s[i]=='o':
        sum+=1

if (sum+15-n)>=8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
c = S.count('x')

print('YES' if 15 - c >= 8 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# M=int(input())
# N,K=list(map(int,input().split()))
# inl = [int(input()) for i in range(N)]

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
k = len(S)
win = 0
for r in S:
    if r == 'o':
        win += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


S = input()

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

Submission status: Accepted

Solution code:
S = input()
lose = 0

for s in S:
    if s == 'x':
        lose += 1


if lose < 8:
    print('YES')

else:
    print('NO')

Submission status: Accepted

Solution code:
# from sys import exit
# A, B, C = [int(n) for n in input().split()]
# a = [int(input()) for _ in range(N)]
S = str(input())
# L = len(S)
# T = str(input())
# exit()
win = S.count("o")
win += 15 - len(S)
print("YES" if win >= 8 else "NO")

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())
 
def ss_raw():
    return input().split()
 
def ints_raw():
    return tuple(map(int, ss_raw()))


def main():
    S = input()
    return "NO" if S.count("x")>7 else "YES"

print(main())

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = str(input())

a = s.count('o')

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

Submission status: Accepted

Solution code:
S = input()

win = S.count('o')

c = 15-len(S)

if c + win >= 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()

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

Submission status: Accepted

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

S = input()
k = len(S)
wn = len([s for s in S if s == "o"])

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

Submission status: Accepted

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


def main():
  if input().count('x') > 7:
    print('NO')
  else:
    print('YES')


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:

s = input()

won = s.count('o')
ss = len(s)

ans = 'YES' if 15 - ss + won >= 8 else "NO"

print(ans)

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

s = input()

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

nokori = 15 - win - lose

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

Submission status: Accepted

Solution code:
S = input()

k = len(S)
num_win = 0

for s in S:
    if s == 'o': num_win += 1

if num_win+(15-k) >= 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 = input()
if S.count("o") + 15 - len(S) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = str(input())

count = 0
for c in list(s):
    if c == "o":
        count += 1
if 15 - len(s) + count >= 8:
    print("YES")
else:
    print("NO")

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:
# coding: utf-8
s = input()
bad = s.count("x")
if 15 - bad >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if cnt <= 7:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = input()

ans = "NO"
win = 0
for i in range(len(s)):
    if s[i] == "o":
        win += 1

if win + (15 - len(s)) >= 8:
    ans = "YES"

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from functools import reduce

s = input()
# n = int(input())
# A = list(map(int, input().split()))
# a, b = map(int, input().split())

# print((n-2)*180)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

win = 0
nokori = 15 - len(s)
for i in range(len(s)):
    if(s[i]=="o"):
        win += 1

if(win + nokori >= 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()
if S.count("x") >= 8:
	print("NO")
else:
	print("YES")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

cnt = S.count("o")

r = 15-len(S)

if cnt + r >= 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 cnt + 15 - len(S) >= 8:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# B問題
S =input()
if S.count('x') >= 8:
    print("NO")
else:
    print("YES")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

count = 0
for i in range(len(S)):
    if S[i] == 'o':
        count += 1

nokori = 15 - len(S)

if (count + nokori) >= 8:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    print((n-2)*180)
    return

#B
def B():
    b = S()
    kati = b.count("o")
    kati += 15 - len(b)
    if kati >= 8:
        print("YES")
    else:
        print("NO")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
o = ['o']*15
S = list(input())
for i in range(len(S)):
    o[i] = S[i]

print(['NO','YES'][o.count('o')>=8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

def main():
    S = SI()
    rem = 15 - len(S)
    cnt = 8
    for s in S:
        if s == 'o':
            cnt -= 1
    ans = 'YES' if rem >= cnt else 'NO'
    return ans

print(main())

Submission status: Accepted

Solution code:

nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()

left = 8
for c in S:
    if c == 'o':
        left -= 1

if 15 - len(S) < left:
    print('NO')
else:
    print('YES')

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:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()

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

Submission status: Accepted

Solution code:
s=input()
n=15-len(s)
m=0
for i in s:
  if i=="o":m+=1
if m+n<8:print("NO")
else:print("YES")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!


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

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


S = input()

from collections import Counter

count = Counter(S)

if count['x'] > 7:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
totalcount = 15
counter = 0
for c in s:
    totalcount -= 1
    if(c == "o"):
        counter += 1
if((counter + totalcount) >= 8):
    print("YES")
else:

    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = input()

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

Submission status: Accepted

Solution code:
from collections import Counter
ct=Counter(raw_input())
o=ct['o']
x=ct['x']
total=o+x
o += 15-total
if o >= 8:
    print 'YES'
else:
    print 'NO'

Submission status: Accepted

Solution code:
S = input()
S_len = len(S)
S_arr = list(S)
x_num = S_arr.count("x")

if x_num < 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=input()
tmp = [i for i in s if i =='x']
print("YES" if len(tmp) < 8 else "NO")

Submission status: Accepted

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