ZhenlongDai/ACPR huggingface dataset:
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main(n,lst):
    if len(set(lst)) != n:
        return "No"
    last = lst[1][-1]
    for e in lst[1:]:
        if e[0]==last:
            last = e[-1]
        else:
            return "No"
    return "Yes"
n = int(input())
lst = [input() for i in range(n)]
print(main(n,lst))


Failing test case input:
4
hoge
english
hnge
enigma

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
def main(n,lst):
    if len(set(lst)) != n:
        return "No"
    last = lst[0][-1]
    for e in lst[1:]:
        if e[0]==last:
            last = e[-1]
        else:
            return "No"
    return "Yes"
n = int(input())
lst = [input() for i in range(n)]
print(main(n,lst))

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def shiritori(n, string_list):

    if len(string_list)!=len(set(string_list)):
        return False

    for i in range(1,n):
        if string_list[i-1][-1]!=string_list[i][0]:
            print(string_list[i-1][-1],string_list[i][0])
            return False

    return True


def main():
    n = int(input())
    string_list = [input() for i  in range(n)]

    if shiritori(n, string_list):
        print('Yes')
    else :
        print('No')

if __name__=='__main__':
    main()

Failing test case input:
4
ghof
english
hnge
ingame

Expected output:
No


Actual output:
f e
No


Fixed submission (verdict: Accepted):
def shiritori(n, string_list):

    if len(string_list)!=len(set(string_list)):
        return False

    for i in range(1,n):
        if string_list[i-1][-1]!=string_list[i][0]:
            return False

    return True


def main():
    n = int(input())
    string_list = [input() for i  in range(n)]

    if shiritori(n, string_list):
        print('Yes')
    else :
        print('No')

if __name__=='__main__':
    main()

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import collections

N = int(input())
W = []
for i in range(N):
    W.append(input())


def is_unique2(seq):
    seen = []
    unique_list = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) == len(unique_list)
c=0

if is_unique2(W)==True:
    for i in range(N-1):
        a = W[i]
        b = W[i+1]


        if a[len(a)-1] == b[0]:
            c+=1
    if c == N-1:
        print('Yes')
else:
    print('No')

Failing test case input:
4
fohg
fntligh
ehoh
img`ne

Expected output:
No


Actual output:

Fixed submission (verdict: Accepted):
import collections

N = int(input())
W = []
for i in range(N):
    W.append(input())


def is_unique2(seq):
    seen = []
    unique_list = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) == len(unique_list)
c=0

if is_unique2(W)==True:
    for i in range(N-1):
        a = W[i]
        b = W[i+1]


        if a[len(a)-1] == b[0]:
            c+=1
    if c == N-1:
        print('Yes')
    else:
        print('No')
else:
    print('No')
Problem: p03261
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n=int(input())
a=input()
st=set(a)
ans='Yes'
for i in range(n-1):
    s=input()
    if a[-1]!=s[0]:
        ans='No'
    st.add(s)
    a=s
if len(st)<n:
    ans='No'
print(ans)


Failing test case input:
4
hoge
english
hoge
enigma

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
a=input()
st=set()
st.add(a)
ans='Yes'
for i in range(n-1):
    s=input()
    st.add(s)
    if a[-1]!=s[0]:
        ans='No'
    a=s
if len(st)<n:
    ans='No'
print(ans)

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
lstw=[input() for _ in range(n)]
string=[]
flag=False

if len(lstw)==len(set(lstw)):
    for i in range(n):
        string.append(lstw[i][:1])
        string.append(lstw[i][-1:])
    for i in range(1,n):
        if string[2*i-1]==string[2*i]:
            flag=True
    if flag:
        print("Yes")
    else:
        print("No")

else:
    print("No")

Failing test case input:
8
a
``
`aa
aaaa
``aaa
aaa_aa
ba`
aaaaaaa

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
lstw=[input() for _ in range(n)]
string=[]
flag=False
cnt=0

if len(lstw)==1:
    flag=True
elif len(lstw)==len(set(lstw)):
    for i in range(n):
        string.append(lstw[i][:1])
        string.append(lstw[i][-1:])
    for i in range(1,n):
        if string[2*i-1]==string[2*i]:
            cnt+=1
    if cnt==(n-1):
        flag=True

if flag:
    print("Yes")
else:
    print("No")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
W = [input() for _ in range(N)]

Ws = set([W[0]])
for i in range(1, N):
    if not W[i - 1][-1] == W[i][0] or W[i] in Ws:
        print("No", W[i])
        exit()
    else:
        Ws.add(W[i])

print("Yes")


Failing test case input:
3
aac
arc
`gc

Expected output:
No


Actual output:
No arc


Fixed submission (verdict: Accepted):
N = int(input())
W = [input() for _ in range(N)]

Ws = set([W[0]])
for i in range(1, N):
    if not W[i - 1][-1] == W[i][0] or W[i] in Ws:
        print("No")
        exit()
    else:
        Ws.add(W[i])

print("Yes")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

w = []

for i in range(n):
    w.append(list(input()))



for i in range(n - 1):
    if i != 0:
        if w[i] in w[0 : i - 1]:
            print("No")
            exit(0)
        
        if w[i][0] != w[i - 1][-1]:
            print("No")
            exit(0)

print("Yes")


Failing test case input:
8
a
aa
aaa
aaaa
aaaaa
aaa`aa
aa`
aaaaaaa

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())

w = []

for i in range(n):
    w.append(list(input()))



for i in range(n):
    if i != 0:
        if w[i] in w[0 : i - 1]:
            print("No")
            exit(0)
        
        if w[i][0] != w[i - 1][-1]:
            print("No")
            exit(0)

print("Yes")
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from sys import stdin

N = int(stdin.readline().rstrip())
W = []
for k in range(N):
    w = stdin.readline().rstrip()
    if k > 1:
        if w[0] != W[k - 1][len(W[k - 1]) - 1] or len([x for x in W if x == w]) > 0:
            print('No')
            break
    W.append(w)
if len(W) == N:
    print('Yes')

Failing test case input:
4
hgof
english
hnge
emigma

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
from sys import stdin

N = int(stdin.readline().rstrip())
W = []
for k in range(N):
    w = stdin.readline().rstrip()
    if k >= 1:
        if w[0] != W[k - 1][len(W[k - 1]) - 1] or len([x for x in W if x == w]) > 0:
            print('No')
            break
    W.append(w)
if len(W) == N:
    print('Yes')

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
W = []
for i in range(N):
    X = input()
    W.append(X)
    if i >= 1:
        if W[i-1][len(W[i-1])-1] != W[i][0]:
            print("No1")
            exit()
    for j in range(i):
        if W[i] == W[j]:
            print("No2")
            exit()
else:
    print("Yes")


Failing test case input:
9
b`sic
c
ncp
qfp
ptyhpn
nadftico
ob`ml
aum
aasemsly

Expected output:
No


Actual output:
No1


Fixed submission (verdict: Accepted):
N = int(input())
W = []
for i in range(N):
    X = input()
    W.append(X)
    if i >= 1:
        if W[i-1][len(W[i-1])-1] != W[i][0]:
            print("No")
            exit()
    for j in range(i):
        if W[i] == W[j]:
            print("No")
            exit()
else:
    print("Yes")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())



ls = [input() for i in range(n)]

for i in range(1,len(ls)-1):
  if ls[i][0] != ls[i-1][-1]:
    print("No")
    quit()
  if ls.count(ls[i]) >= 2:
    print("No")
    quit()
    
print("Yes")

Failing test case input:
4
ghof
fntligh
hohe
img`ne

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())



ls = [input() for i in range(n)]

for i in range(1,len(ls)):
  if ls[i][0] != ls[i-1][-1]:
    print("No")
    quit()
  if ls.count(ls[i]) >= 2:
    print("No")
    quit()
    
print("Yes")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = []
judge = "Yes"

w1 = input()
L.append(w1)
for i in range(N - 1):
	w2 = input()
	if L.count(w2) == 1:
		judge = "No"
		break
	elif w1[-1] != w2[0]:
		judge = "No"
		break
	else:
		w1 = w2

print(judge)

Failing test case input:
8
a
aa
aaa
aaaa
aaaaa
aaa`aa
aaa
aaaaaaa

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L = []
judge = "Yes"

w1 = input()
L.append(w1)
for i in range(N - 1):
	w2 = input()
	if L.count(w2) == 1:
		judge = "No"
		break
	elif w1[-1] != w2[0]:
		judge = "No"
		break
	else:
		L.append(w2)
		w1 = w2

print(judge)
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
w = [input() for i in range(n)]
ok = True
if len(w) == len(set(w)):
  for i in range(n-1):
    if w[i][-1] != [i+1][0]:
      ok = False
  if ok:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Failing test case input:
4
hoge
english
hnge
enigma

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = int(input())
w = [input() for i in range(n)]
if len(w) == len(set(w)):
  ok = True
  for i in range(n-1):
    if w[i][-1] != w[i+1][0]:
      ok = False
      break
  if ok:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
W={}
A={}
count=0
for i in range(N):
	A=W[i]=str(input())
for i in range(N-1):
	s=0
	for j in W[i+1]:
		s=s+1
		if s==1:
			t=j
		for k in W[i]:
			r=k
			if j==k and count==0:
				print("No")
				count=1
	if t!=r and count==0:
		print("No")
		count=1
if count==0:
	print("Yes")

Failing test case input:
4
hoge
english
hnge
enigma

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N=int(input())
W=[]
count=0
for i in range(N):
	w=str(input())
	W.append(w)
for i in range(N):
	c=0
	for j in range(N):
		if W[i]==W[j]:
			c=c+1
		if c>=2 and count==0:
			print("No")
			count=1
for i in range(N-1):
	s=0
	for j in W[i+1]:
		s=s+1
		if s==1:
			t=j
		for k in W[i]:
			r=k
	if t!=r and count==0:
		print("No")
		count=2
if count==0:
	print("Yes")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
W=[]
S=set()
for i in range(N):
    w=input()
    W.append(w)
last=W[0][-1]
S.add(w[0])
for i in range(1,N):
    if W[i][0]==last and not W[i] in S:
        pass
    else:
        print("No")
        exit()
    S.add(W[i])
    last=W[i][-1] 
print("Yes")

Failing test case input:
4
hoge
english
hoge
enigma

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
N=int(input())
W=[]
for i in range(N):
    w=input()
    W.append(w)
last=W[0][-1]
S=set()
S.add(W[0])
for i in range(1,N):
    if W[i][0]==last and not W[i] in S:
        pass
    else:
        print("No")
        exit()
    S.add(W[i])
    last=W[i][-1]
print("Yes")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
w=[input() for i in range(n)]
ans="Yes"
for j in range(1,len(w)):
  if w[j-1][len(w[j-1])-1]!=w[j][0]:
    ans="No"
print(ans)

Failing test case input:
8
a
aa
aaa
aaaa
aaaaa
aaaaaa
aaa
aaaaaaa

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
w=[input() for i in range(n)]
ans="Yes"
if len(set(w))!=n:
  ans="No"
for j in range(1,len(w)):
  if w[j-1][-1]!=w[j][0]:
    ans="No"
print(ans)
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
s = [input() for i in range(N)]

atama=[]
oshiri=[]

for i in s:
    atama.append(i[0])
    oshiri.append(i[-1])



oshiri=oshiri[-1:]+oshiri[:-1]

atama.pop(0)
oshiri.pop(0)

if oshiri==atama:
    print("Yes")
else:
    print("No")

Failing test case input:
4
hoge
english
hoge
enigma

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
N=int(input())
s = [input() for i in range(N)]

atama=[]
oshiri=[]

def is_unique(seq):
    return len(seq) == len(set(seq))



for i in s:
    atama.append(i[0])
    oshiri.append(i[-1])



oshiri=oshiri[-1:]+oshiri[:-1]

atama.pop(0)
oshiri.pop(0)

if oshiri==atama and is_unique(s)==True:
    print("Yes")
else:
    print("No")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
if __name__ == '__main__':
  
  flag = 1
  
  wordNum = int(input())
  wordAll = []

  for i in range(wordNum) :

    word = input()
    wordAll.append(word)
    wordLen = len(word)
    
    if i > 0 and wordLast != word[0]:
      flag = 0
      break
    
    for j in range(len(wordAll)):
      if wordAll[j] == word:
        flag = 0
        break
    
    wordLast = word[wordLen - 1]

  if flag == 1 :
    print("Yes")
    
  else :
    print("No")


Failing test case input:
4
hoge
english
hnge
emigma

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
if __name__ == '__main__':
  
  flag = 1
  
  wordNum = int(input())
  wordAll = []

  for i in range(wordNum) :

    word = input()
    wordAll.append(word)
    wordLen = len(word)
    
    if i > 0 and wordLast != word[0]:
      flag = 0
      break
    
    
    for j in range(len(wordAll)-1):
      if wordAll[j] == word:
        flag = 0
        break
    
    
    wordLast = word[wordLen - 1]

    
  if flag == 1 :
    print("Yes")
    
  else :
    print("No")

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

word = input()
known_words = [word]
for i in range(n-2):
    word = input()
    if word in known_words:
        print('No')
        exit()
    if word[0] != known_words[-1][-1]:
        print('No')
        exit()
    known_words.append(word)
print('Yes')


Failing test case input:
3
caa
arc
`gc

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())

word = input()
known_words = [word]
for i in range(n-1):
    word = input()
    if word in known_words:
        print('No')
        exit()
    if word[0] != known_words[-1][-1]:
        print('No')
        exit()
    known_words.append(word)
print('Yes')
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def is_unique(seq):
    return len(seq) == len(set(seq))

n=int(input())
w=[input() for i in range(n)]
print(n)
print(w)

flag=0

if is_unique(w)=='false':
  flag=1

for j in range(n-1):
  if w[j][-1] != w[j+1][0]:
    flag=1

if flag==1:
  print('No')
else:
  print('Yes')


Failing test case input:
3
caa
cra
`gc

Expected output:
No


Actual output:
3
['caa', 'cra', '`gc']
No


Fixed submission (verdict: Accepted):
n=int(input())
w=[input() for i in range(n)]


flag=0
if len(w)==len(set(w)):
    flag=0
else:
  flag=1

for j in range(n-1):
  if w[j][-1] != w[j+1][0]:
    flag=1

if flag==1:
  print('No')
else:
  print('Yes')

Problem: p03261
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = set()

ok = True
t = input()
p = t[-1]
for i in range(n-1):
  t = input()
  if t in s:
    ok = False
  s.add(t)
  if t[0] != p:
    ok = False
  p = t[-1]
  
print('Yes' if ok else 'No')

Failing test case input:
4
hoge
english
hoge
enigma

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
s = set()

ok = True
t = input()
p = t[-1]
s.add(t)
for i in range(n-1):
    t = input()
    if t in s:
        ok = False
    s.add(t)
    if t[0] != p:
        ok = False
    p = t[-1]

print('Yes' if ok else 'No')

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l= [input() for elt in range(n)]
x =0
for elt in range(len(l)):
    if l.count(l[elt]) > 1 :

        x=1
        break
for elt in range (len(l )-1):
    if l[elt][-1] != l[elt+1][0]:

        x = 1
        break
if x == 0:
    print("YES")
else:
    print("NO")



Failing test case input:
3
aac
arc
agc

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
l= []
x = 0
for elt in range(n):
    inp = input()
    l.append(inp)
for elt in range(len(l)):
    if l.count(l[elt]) > 1 :
        print("No")
        x+=1
        break

    else:
        if elt < len(l)-1:
            if l[elt][-1] != l[elt+1][0]:
                print("No")
                x += 1
                break
if x == 0:
    print("Yes")
Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


from collections import Counter


def solve(words):
    commons = Counter(words).most_common()
    if commons[0][1] > 1:
        return "No"
    else:
        
        first_letters = list(map(lambda x: x[0], words[1:]))
        
        last_letters = list(map(lambda x: x[-1], words[:-1]))
        if first_letters == last_letters:
            return "Yes"
        else:
            return "No"


if __name__ == "__main__":
    N = input("")
    words = input("").split(" ")
    print(solve(words))


Failing test case input:
3
caa
arc
`gc

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):


from collections import Counter


def solve(words):
    commons = Counter(words).most_common()
    if commons[0][1] > 1:
        return "No"
    else:
        
        first_letters = list(map(lambda x: x[0], words[1:]))
        
        last_letters = list(map(lambda x: x[-1], words[:-1]))
        if first_letters == last_letters:
            return "Yes"
        else:
            return "No"


if __name__ == "__main__":
    N = int(input(""))
    words = [input("") for i in range(N)]
    print(solve(words))

Problem: p03261
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
s=[input() for i in range(n)]
p=list(s[0])[0]
from collections import Counter
c=Counter(s)
if sum(c.values())!=n:
    print("No")
    exit()
else:
    for i in s:
        a=list(i)[0]
        b=list(i)[-1]
        if p==a:
            p=b
        else:
            print("No")
            exit()
print("Yes")
        

Failing test case input:
8
a
aa
aaa
aaaa
aaaaa
aaa`aa
aaa
aaaaaaa

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
s=[input() for i in range(n)]
p=list(s[0])[0]
from collections import Counter
c=Counter(s)
if [1 for i in range(n)]!=list(c.values()):
    print("No")
    exit()
else:
    for i in s:
        a=list(i)[0]
        b=list(i)[-1]
        if p==a:
            p=b
        else:
            print("No")
            exit()
print("Yes")

Problem: p03261
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
words = []
before= input()
words.append(before)
flag = True
for _ in range(n-1):
  s = input()
  if before[-1] != s[0]:
    flag == False
  before = s
l = len(set(words))
if l != n:
  flag = False
if flag:
  print("Yes")
else:
  print("No")

Failing test case input:
4
hoge
english
hnge
enigma

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = int(input())
words = []
before= input()
words.append(before)
flag = True
for _ in range(n-1):
  
  s = input()
  if before[-1] != s[0]:
    flag = False
  before = s
  words.append(s)

l = len(set(words))
if l != n:
  flag = False
if flag:
  print("Yes")
else:
  print("No")
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print((input().count('x')) * 100 + 700)

Failing test case input:
opq

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
print((input().count('o')) * 100 + 700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
price=0
if s[0] == 'o':
    price += 700
if s[1] == 'o':
    price += 100
if s[2] == 'o':
    price += 100
print(price)



Failing test case input:
mzp

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
s=input()
price=700
if s[0] == 'o':
    price += 100
if s[1] == 'o':
    price += 100
if s[2] == 'o':
    price += 100
print(price)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+100*input().count('○'))

Failing test case input:
ppo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
print(700+100*input().count('o'))

Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
print(input().count("o")*100+600)


Failing test case input:
mqo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
print(input().count("o")*100+700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(input().count("o"))

Failing test case input:
|kp

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
print((input().count("o"))*100+700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+input().count('o'))

Failing test case input:
ppo

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
print(700+100*input().count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
price = 500

if s[0] == "o":
	price += 100
if s[1] == "o":
	price += 100
if s[2] == "o":
	price += 100
print(price)

Failing test case input:
{kp

Expected output:
700


Actual output:
500


Fixed submission (verdict: Accepted):
s = input()
price = 700

if s[0] == "o":
	price += 100
if s[1] == "o":
	price += 100
if s[2] == "o":
	price += 100
print(price)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
print(700+s.count('o'))

Failing test case input:
mzo

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
s=input()
print(700+100*s.count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()

ct=0
if "o" in s:
  ct=ct+1
if(ct>0):
  f=700+100*ct
else:
  f=700
print(f)  
  

 

Failing test case input:
ooo

Expected output:
1000

Actual output:
800


Fixed submission (verdict: Accepted):
s=input()
ct=0
for i in range(0,len(s)):
    
    if(s[i]=="o"): 
        ct=ct+1
if(ct>0):
  f=700+100*ct
else:
  f=700
print(f)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
topping = S.count("o")
print(700+topping)

Failing test case input:
opp

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
S = input()
topping = S.count("o")
ans = 700 + topping*100
print(ans)
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=str(input())
s=list(s)
temp=s.count("○")
print(700+temp*100)

Failing test case input:
opn

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s=str(input())
s=list(s)
temp=s.count("o")
print(700+temp*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
print(s.count("o") * 100)

Failing test case input:
npx

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
print(700 + s.count("o") * 100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
toppings = list(input())
print(toppings)
ans = 700
for i in toppings:
  if i == "o":
    ans += 100
print(ans)

Failing test case input:
pop

Expected output:
800


Actual output:
['p', 'o', 'p']
800


Fixed submission (verdict: Accepted):
toppings = list(input())
ans = 700
for i in toppings:
  if i == "o":
    ans += 100
print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


a = input()

b = a.count('o')
print(b)

if b == 3:
    print(1000)
elif b == 2:
    print(900)
elif b == 1:
    print(800)
else:
    print(700)

Failing test case input:
wzy

Expected output:
700


Actual output:
0
700


Fixed submission (verdict: Accepted):


a = input()

b = a.count('o')

if b == 3:
    print(1000)
elif b == 2:
    print(900)
elif b == 1:
    print(800)
else:
    print(700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(100*len([i for i in list(input()) if i == "x"]))

Failing test case input:
opp

Expected output:
800


Actual output:
0


Fixed submission (verdict: Accepted):
print(700+100*len([i for i in list(input()) if i == "o"]))

Problem: p03369
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input().split()
s = s.count('o')
print(700 + 100*s)

Failing test case input:
{lo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()
s = s.count('o')
print(700 + 100*s)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input())
cou = 700
for i in range(3):
  if s[i] == "〇":
    cou += 100
print(cou)

Failing test case input:
oox

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
s = str(input())
cou = 700
for i in range(3):
    if s[i] == "o":
        cou += 100
print(cou)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



s = input()

print(700 * s.count("o"))

Failing test case input:
xpo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):



s = input()

print(700 + s.count("o") * 100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+(input().count("○"))*100)

Failing test case input:
npo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
print(700+(input().count("o"))*100)
Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
S = input()

print(700 + 100*S.count('x'))

Failing test case input:
oos

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
S = input()

print(700 + 100*S.count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
print(700+3*s.count('o'))

Failing test case input:
pop

Expected output:
800


Actual output:
703


Fixed submission (verdict: Accepted):
s=input()
print(700+100*s.count('o'))

Problem: p03369
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
print(S.count("x")*100 + 700)

Failing test case input:
ok{

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
S = input()
print(S.count("o")*100 + 700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
print(700 + 700 * s.count("o"))

Failing test case input:
xpo

Expected output:
800


Actual output:
1400


Fixed submission (verdict: Accepted):
s = input()
print(700 + 100 * s.count("o"))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input)

v = 700

if s[0] == 'o':
    v+= 100

if s[1] == 'o':
    v+= 100

if s[2] == 'o':
    v += 100

print(v)

Failing test case input:
{mo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = str(input())
v = 700
if s[0] == 'o':
    v+= 100
if s[1] == 'o':
    v+= 100
if s[2] == 'o':
    v += 100
print(v)

Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):



S = input()

y = 700
S = list(S)
for i in S:
    if i == '○':
        y += 100


print(y)

Failing test case input:
{mo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):



S = input()

y = 700
S = list(S)
for i in S:
    if i == 'o':
        y += 100


print(y)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
a = list(s)
print(a.count("o")*100+a.count("x")*700)

Failing test case input:
wzy

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
a = list(s)
print(a.count("o")*100+700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def resolve():
    s = list(str(input()))
    cnt = 0
    if s[0] == 'o':
        cnt += 1
    if s[1] == 'o':
        cnt += 1
    if s[2] == 'o':
        cnt += 1
    print(700+cnt*100)

Failing test case input:
opp

Expected output:
800


Actual output:

Fixed submission (verdict: Accepted):
s = list(str(input()))
cnt = 0
if s[0] == 'o':
    cnt += 1
if s[1] == 'o':
    cnt += 1
if s[2] == 'o':
    cnt += 1
print(700+cnt*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print((input().count("o"))*3+700)

Failing test case input:
xoo

Expected output:
900


Actual output:
706


Fixed submission (verdict: Accepted):
print((input().count("o"))*100+700)
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
print(700+s.count('o'))

Failing test case input:
ok{

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
s = input()
print(700+s.count('o')*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+input().count('o'))

Failing test case input:
xpo

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
print(700+100*input().count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=input()
print(700+S.count('o'))

Failing test case input:
ppo

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
S=input()
print(700+100*S.count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = str(input())
S = 0

for i in range(1, 3):
    if a[i] == 'o':
        S ++ S
print(700+S*100)

Failing test case input:
oxn

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
a = str(input())
S = 0

for i in range(0, 3):
    if a[i] == 'o':
        S += 1
print(700+S*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
x = s.count('o')
print(x*100)

Failing test case input:
zwy

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
x = s.count('o')
print(700+x*100)

Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = input()
ans = 700
for i in range(3):
    if s[i]=="o":
        ans += 100
    print(ans)

Failing test case input:
qop

Expected output:
800


Actual output:
700
800
800


Fixed submission (verdict: Accepted):
s = str(input())
ans = 700
for i in range(3):
    if s[i]=="o":
        ans += 100
print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
100
t = 0
for i in range(len(S)): 
    if S[i] == 'o':
        t =+ 1
print(700 + t*100)


Failing test case input:
qoo

Expected output:
900


Actual output:
800


Fixed submission (verdict: Accepted):
S = input()
t = 0
for i in range(len(S)): 
    if S[i] == 'o':
        t += 1 
print(700 + t*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
cnt = 0
for t in s:
    if(s=="o"):
        cnt += 1
print(700 + cnt * 100)

Failing test case input:
{lo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()
cnt = 0
for t in s:
    if(t=="o"):
        cnt += 1
print(700 + cnt * 100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
ans = 700
for i in a:
  if i == "o":
    ans += 100


Failing test case input:
yxx

Expected output:
700


Actual output:

Fixed submission (verdict: Accepted):
a = input()
ans = 700
for i in a:
  if i == "o":
    ans += 100
print(ans)
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
print(S)
checker = 0
for i in list(S):
    if i == 'o':
        checker += 1
sum = 700 + 100 * checker
print(sum)


Failing test case input:
xzx

Expected output:
700


Actual output:
xzx
700


Fixed submission (verdict: Accepted):

S = input()
checker = 0

for i in list(S):
    if i == 'o':
        checker += 1
sum = 700 + 100 * checker
print(sum)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
X = 700
if S[0] == '○':
  X += 100
if S[1] == '○':
  X += 100
if S[2] == '○':
  X += 100
print(X)

Failing test case input:
opo

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
S = input()
X = 700
if S[0] == 'o':
  X += 100
if S[1] == 'o':
  X += 100
if S[2] == 'o':
  X += 100
print(X)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = "oxo"
price = 700
for i in range(3):
    if s[i] == "o":
        price += 100
    else:
        price += 0
print(price)


Failing test case input:
ywz

Expected output:
700


Actual output:
900


Fixed submission (verdict: Accepted):
s = input()
price = 700
for i in range(3):
    if s[i] == "o":
        price += 100
    else:
        price += 0
print(price)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
price=700+100*s.count('s')
print(price)

Failing test case input:
oos

Expected output:
900


Actual output:
800


Fixed submission (verdict: Accepted):
s=input()
price=700+100*s.count('o')
print(price)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=list(input())

print(700+s.count('o'))

Failing test case input:
oro

Expected output:
900


Actual output:
702


Fixed submission (verdict: Accepted):
s=list(input())
 
print(700+100*(s.count('o')))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+100*len([i for i in list(input()) if i == "x"]))

Failing test case input:
xw{

Expected output:
700


Actual output:
800


Fixed submission (verdict: Accepted):
print(700+100*len([i for i in list(input()) if i == "o"]))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input().split(",")
topping = S.count("o")
ans = 700 + topping*100
print(ans)

Failing test case input:
oox

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
S = input()
topping = S.count("o")
ans = 700 + topping*100
print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700+100*list(input()).count("x"))

Failing test case input:
oor

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
print(700+100*list(input()).count("o"))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
print(700+s.count("o")*2)

Failing test case input:
opo

Expected output:
900


Actual output:
704


Fixed submission (verdict: Accepted):
s = input()
print(700+s.count("o")*100)
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=list(input())
count=0
for s_ in s:
    if s_ =="◯":
        count=count+1
    else:
        count=count
print(700+100*count)


Failing test case input:
sqo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):


s=list(input())
count=0
for s_ in s:
    if s_ =="o":
        count=count+1

print(700+100*count)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
print(700 + int(S.count('o')))

Failing test case input:
oor

Expected output:
900


Actual output:
702


Fixed submission (verdict: Accepted):
S = input()
print(700 + int(S.count('o'))*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input().split()
sum = 700
for a in n:
  if a == 'o':
  	sum += 100

print(sum)


Failing test case input:
sqo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
n = list(input())
sum = 700
for a in n:
  if a == 'o':
  	sum += 100
print(sum)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
price = 500

if s[0] == "o":
  price += 100
if s[1] == "o":
  price += 100
if s[2] == "o":
  price += 100
print(price)

Failing test case input:
nwo

Expected output:
800


Actual output:
600


Fixed submission (verdict: Accepted):
s = input()
price = 700

if s[0] == "o":
	price += 100
if s[1] == "o":
	price += 100
if s[2] == "o":
	price += 100
print(price)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
n = s.count('○')
print(700 + 100*n)

Failing test case input:
npo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()
n = s.count('o')
print(700 + 100*n)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
t = 0
for i in range(len(S)): 
    if S[i] == 'o':
        t += 1 
    print(t)
print(700 + t*100)


Failing test case input:
nxo

Expected output:
800


Actual output:
0
0
1
800


Fixed submission (verdict: Accepted):
S = input()
t = 0
for i in range(len(S)): 
    if S[i] == 'o':
        t += 1 
print(700 + t*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

S = input()

ans = 0

for i in range(3):
    if S[i] == 'o':
        ans += 1

print(ans)

Failing test case input:
mpm

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):

S = input()

ans = 0

for i in range(3):
    if S[i] == 'o':
        ans += 1

ans = ans * 100 + 700

print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
print(s.count("o") * 100)


Failing test case input:
xvy

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
print(s.count("o") * 100 + 700)

Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
x = list(input())
print(700+x.count(x)*100)

Failing test case input:
nxo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
x = list(input())
print(700+x.count("o")*100)
Problem: p03369
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
print(700+100*s.count('○'))

Failing test case input:
oro

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
print(700 + 100 * input().count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
print(500 + s.count("o")*100)

Failing test case input:
pnp

Expected output:
700


Actual output:
500


Fixed submission (verdict: Accepted):
s=input()
print(700 + s.count("o")*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input())
y = 700
if s[0] == "○":
  y += 100
if s[1] == "○":
  y += 100
if s[2] == "○":
  y += 100
print(y)

Failing test case input:
ooq

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
s = str(input())
y = 700
if s[0] == "o":
  y += 100
if s[1] == "o":
  y += 100
if s[2] == "o":
  y += 100
print(y)

Problem: p03369
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
S =input()
print(700+S.count('o'))

Failing test case input:
npo

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
S =input()
print(700+100*S.count('o'))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
ra = 700

s = S.count('○')
fra = ra + 100 * s
print(fra)

Failing test case input:
nor

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
S = input()
ra = 700

s = S.count('o')
fra = ra + 100 * s
print(fra)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(100*input().count("o"))

Failing test case input:
wzy

Expected output:
700


Actual output:
0


Fixed submission (verdict: Accepted):
print(700+100*input().count("o"))

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())
t = 0
for row in s:
    if row ==  'o':
        t += 1
print(800 + 100 * t)

Failing test case input:
omz

Expected output:
800


Actual output:
900


Fixed submission (verdict: Accepted):
s = list(input())
t = 0
for row in s:
    if row ==  'o':
        t += 1
print(700 + 100 * t)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input())
print(s.count("o") * 100)


Failing test case input:
opq

Expected output:
800


Actual output:
100


Fixed submission (verdict: Accepted):
s = str(input())
print(s.count("o") * 100 + 700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
count = 0

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

print(700 + 100 * count)


Failing test case input:
sqo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()
count = 0

for i in range(3):
    if s[i] == "o":
        count += 1

print(700 + 100 * count)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(700 + int(input().count("o")))

Failing test case input:
owo

Expected output:
900


Actual output:
702


Fixed submission (verdict: Accepted):
print(700 + 100 * int(input().count("o")))
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print(input().split().count('o') * 100 + 700)

Failing test case input:
{lo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
print(input().count('o') * 100 + 700)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=input()
ans=700
for i in S:
  if i==0:
    ans+=100
print(ans)

Failing test case input:
opq

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
S=input()
ans=700
for i in S:
  if i=="o":
    ans+=100
print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
line = input()
ans = 700
for i in range(3):
    if line[i] == "○":
        ans += 100
print(ans)

Failing test case input:
nwo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
line = list(input())
ans = 700
for i in range(3):
    if line[i] == "o" or line[i] == "○":
        ans += 100
print(ans)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
co=0
for i in s:
    if s=='o':
        co+=1
print(700+co*100)

Failing test case input:
{lo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s=input()
co=0
for i in s:
    if i=='o':
        co+=1
print(700+co*100)

Problem: p03369
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = str(input())

count = 0

for i in range(3):
  if i == "○":
    count += 1
    
print(700 + count * 100)


Failing test case input:
nor

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()

count = 700

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

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = list(input())

price = 700
l = len(S)

for i in range(l):
  if(S[i] == '○'):
    price += 100
    
  else:
    continue
    
print(price)


Failing test case input:
oos

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
S = list(input())

price = 700
l = len(S)

for i in range(l):
  if(S[i] == 'o'):
    price += 100
    
  else:
    continue
    
print(price)

Problem: p03369
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

s = input()
count = s.count("〇")
print(700 + 100 * count)

Failing test case input:
onp

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):

s = input()
count = s.count("o")
print(700 + 100 * count)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input())
counter = 0
if s[0] == "○":
  counter += 1
if s[1] == "○":
  counter += 1
if s[2] == "○":
  counter += 1
print(700+100*counter)

Failing test case input:
oqo

Expected output:
900


Actual output:
700


Fixed submission (verdict: Accepted):
s = input()
counter = 0
if s[0] == 'o':
  counter += 1
if s[1] == 'o':
  counter += 1
if s[2] == 'o':
  counter += 1
print(int(700+counter*100))
Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = list(input())
p = S.count('○')
print(700+p*100)

Failing test case input:
qmo

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
S = list(input())
p = S.count('o')
print(700 + p*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

s = str(input())
ans = 700
count = s.count('o')
print(count)
print(ans + 100 * count)

Failing test case input:
soo

Expected output:
900


Actual output:
2
900


Fixed submission (verdict: Accepted):

s = str(input())
ans = 700
count = s.count('o')
print(ans + 100 * count)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
print(700 + S.count("o")*300)

Failing test case input:
ppo

Expected output:
800


Actual output:
1000


Fixed submission (verdict: Accepted):
S = input()
print(700 + S.count("o")*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=str(input())
k = 0
for i in range(3):
  if S[i] == "○":
    k = k + 100
print(k)

Failing test case input:
onq

Expected output:
800


Actual output:
0


Fixed submission (verdict: Accepted):
S=str(input())
k = 700
for i in range(3):
  if S[i] == 'o':
    k = k + 100
print(k)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
700+input().count("o")*100

Failing test case input:
npx

Expected output:
700


Actual output:

Fixed submission (verdict: Accepted):
print(700+input().count("o")*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())
count = 0
for i in range(len(s)):
    if i == "o":
        count += 1
print(700 + count*100)

Failing test case input:
nor

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
s = list(input())
count = 0
for i in s:
    if i == "o":
        count += 1
print(700 + count*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
sum = 700
if a[0] == 'o': sum += 100
if a[1] == '0': sum += 100
if a[2] == 'o': sum += 100
print(sum)
    


Failing test case input:
nor

Expected output:
800


Actual output:
700


Fixed submission (verdict: Accepted):
a = input()
sum = 700
if a[0] == 'o': sum += 100
if a[1] == 'o': sum += 100
if a[2] == 'o': sum += 100
print(sum)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
b = a.count('o')
print(700+b)

Failing test case input:
opq

Expected output:
800


Actual output:
701


Fixed submission (verdict: Accepted):
a = input()
b = a.count('o')
print(700+b*100)

Problem: p03369
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

s = 'S'
a = s.count('o')
y = 1000 + 100 * a
print(y)

Failing test case input:
myp

Expected output:
700


Actual output:
1000


Fixed submission (verdict: Accepted):

s = input()
a = s.count('o')
y = 700 + 100 * a
print(y)