Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = A[P]-1
    if Q[P] == 0:
        L = i - R[P]
        break
    if Q[P] == 1:
        R[P] = i
        Q[P] = 0
S = (K - R[P] - 1) % L
G = 0
for j in range(S + R[P] + 1):
    G = A[G]-1
print(G+1)

Fixed submission:
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = A[P]-1
    if Q[P] == 0:
        L = i - R[P]
        S = (K - R[P] - 1) % L
        G = 0
        for j in range(S + R[P] + 1):
            G = A[G]-1
        print(G+1)
        exit()
    if Q[P] == 1:
        R[P] = i
        Q[P] = 0
print(P+1)

Buggy python submission (verdict: Runtime Error):
import copy
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = copy.deepcopy(A[P]-1)
    if Q[P] == 0:
        L = copy.deepcopy(i - R[P])
        break
    if Q[P] == 1:
        R[P] = copy.deepcopy(i)
        Q[P] = 0
S = copy.deepcopy((K - R[P] - 1) % L)
G = 0
for j in range(S + R[P] + 1):
    G = copy.deepcopy(A[G]-1)
print(G+1)


Fixed submission:
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = A[P]-1
    if Q[P] == 0:
        L = i - R[P]
        S = (K - R[P] - 1) % L
        G = 0
        for j in range(S + R[P] + 1):
            G = A[G]-1
        print(G+1)
        exit()
    if Q[P] == 1:
        R[P] = i
        Q[P] = 0
print(P+1)

Buggy python submission (verdict: Runtime Error):
import copy
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = A[P]-1
    if Q[P] == 0:
        L = copy.deepcopy(i - R[P])
        break
    if Q[P] == 1:
        R[P] = copy.deepcopy(i)
        Q[P] = 0
S = (K - R[P] - 1) % L
G = 0
for j in range(S + R[P] + 1):
    G = A[G]-1
print(G+1)

Fixed submission:
N, K = map(int, input().split())
A = list(map(int,input().split()))
P = 0
Q = [0] + [1 for _ in range(N-1)]
R = [-1] + [0 for _ in range(N-1)]
L = 0
for i in range(K):
    P = A[P]-1
    if Q[P] == 0:
        L = i - R[P]
        S = (K - R[P] - 1) % L
        G = 0
        for j in range(S + R[P] + 1):
            G = A[G]-1
        print(G+1)
        exit()
    if Q[P] == 1:
        R[P] = i
        Q[P] = 0
print(P+1)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
G = []
S = []
r = 0
t = 0
for i in range(N):
    p = input()
    l = len(p)
    if not l in G:
        G.append(l)
        #S[t].append(len(p))
        S.append([p])
        t += 1
    else:
        z = G.index(l)
        if not p in S[z]:
            S[z].append(p)
x = 0
for w in range(len(G)):
    x += len(S[w])
print(x)

Fixed submission:
N = int(input())
S = set()
for i in range(N):
    S.add(input())
print(len(S))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
for i in range(N):
    p = input()
    if not p in S:
        S.append(p)
print(len(S))

Fixed submission:
N = int(input())
S = set()
for i in range(N):
    S.add(input())
print(len(S))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
S.append(input())
r = 1
for i in range(N-1):
    p = input()
    q = 0
    for k in range(r):
        if p == S[k]:
            q = 1
            break
    if q == 0:
        S.append(p)
        r += 1
print(r)

Fixed submission:
N = int(input())
S = set()
for i in range(N):
    S.add(input())
print(len(S))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
S.append(input())
for i in range(N-1):
    p = input()
    q = 0
    for k in range(len(S)):
        #print(len(S))
        #print(S)
        if p == S[k]:
            q = 1
    if q == 0:
        S.append(p)
print(len(S))
#print(S)

Fixed submission:
N = int(input())
S = set()
for i in range(N):
    S.add(input())
print(len(S))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
for i in range(1,N+1):
    print(A[i-1:].count(i))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for _ in range(N)]
for i in A:
    B[i-1] += 1
for j in range(N):
    print(B[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
d = dict()
for i in range(1,N+1):
    print(A[i-1:].count(i))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for _ in range(N)]
for i in A:
    B[i-1] += 1
for j in range(N):
    print(B[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for _ in range(N)]
for i in A:
    B[i-1] += 1
for j in range(N):
    print(B[j])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int. input().split())
for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for _ in range(N)]
for i in A:
    B[i-1] += 1
for j in range(N):
    print(B[j])
Buggy python submission (verdict: Time Limit Exceeded):
import math
g = 0
K = int(input())
for a in range(1,K+1):
    for b in range(1,K+1):
        for c in range(1,K+1):
            g += math.gcd(math.gcd(a,b),c)
print(g)

Fixed submission:
import math
g = 0
K = int(input())
for a in range(1,K-1):
    for b in range(a+1,K):
        for c in range(b+1,K+1):
            g += math.gcd(math.gcd(a,b),c)*6
for d in range(1,K):
    for e in range(d+1,K+1):
        g+= math.gcd(d,e)*6
g+= K*(K+1)//2
print(g)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
color = [[], [], []]
for i in range(N):
    if S[i] == 'R':
        color[0].append(i)
    elif S[i] == 'G':
        color[1].append(i)
    elif S[i] == 'B':
        color[2].append(i)
rn = len(color[0])
gn = len(color[1])
bn = len(color[2])
mi = 0
for i in color[0]:
    for j in color[1]:
        for k in color[2]:
            if k == 2*j-i:
                mi += 1
            if k == (j-i)/2+i:
                mi += 1
            if k == 2*i-j:
                mi += 1
print(rn*gn*bn-mi)

Fixed submission:
N = int(input())
S = input()
color = [[], [], []]
for i in range(N):
    if S[i] == 'R':
        color[0].append(i)
    elif S[i] == 'G':
        color[1].append(i)
    elif S[i] == 'B':
        color[2].append(i)
rn = len(color[0])
gn = len(color[1])
bn = len(color[2])
mi = 0
for i in range(N):
    p = 0
    while i + 2*p <= N-1:
        if S[i] != S[i+p] and S[i+p] != S[i+2*p] and S[i] != S[i+2*p]:
           mi += 1
        p += 1
print(rn*gn*bn-mi)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
color = [[], [], []]
for i in range(N):
    if S[i] == 'R':
        color[0].append(i)
    elif S[i] == 'G':
        color[1].append(i)
    elif S[i] == 'B':
        color[2].append(i)
rn = len(color[0])
gn = len(color[1])
bn = len(color[2])
mi = 0
for i in color[0]:
    for j in color[1]:
        if 2*j-i in color[2]:
            mi += 1
        if (j-i)/2+i in color[2]:
            mi += 1
        if 2*i-j in color[2]:
            mi += 1
print(rn*gn*bn-mi)

Fixed submission:
N = int(input())
S = input()
color = [[], [], []]
for i in range(N):
    if S[i] == 'R':
        color[0].append(i)
    elif S[i] == 'G':
        color[1].append(i)
    elif S[i] == 'B':
        color[2].append(i)
rn = len(color[0])
gn = len(color[1])
bn = len(color[2])
mi = 0
for i in range(N):
    p = 0
    while i + 2*p <= N-1:
        if S[i] != S[i+p] and S[i+p] != S[i+2*p] and S[i] != S[i+2*p]:
           mi += 1
        p += 1
print(rn*gn*bn-mi)
Buggy python submission (verdict: Runtime Error):
if S=='AAA' or S=='BBB':
  print('No')
else
  print('Yes')
  


Fixed submission:
S = input()
if 'A' in S and 'B' in S:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
if S=='AAA' or S='BBB':
  print('No')
else
  print('Yes')
  

Fixed submission:
S = input()
if 'A' in S and 'B' in S:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
Q = int(input())
x = 0
for i in range(Q):
    A = list(input().split())
    if A[0] == '1':
        x += 1
    elif x%2 ==0:
        if A[1] == '1':
            S = A[2] + S
        else:
            S = S + A[2]
    else:
        if A[1] == '1':
            S = S + A[2] 
        else:
            S = A[2] + S
if x%2 == 1:
    S = ''.join(reversed(list(S)))
print(S)

Fixed submission:
S = input()
Q = int(input())
x = 0
p = ''
q = ''
for i in range(Q):
    A = list(input().split())
    if A[0] == '1':
        x += 1
    elif x%2 ==0:
        if A[1] == '1':
            p = A[2] + p
        else:
            q = q + A[2]
    else:
        if A[1] == '1':
            q = q + A[2] 
        else:
            p = A[2] + p
S = p + S + q
if x%2 == 1:
    S = ''.join(reversed(list(S)))
print(S)

Buggy python submission (verdict: Time Limit Exceeded):
S = input()
Q = int(input())
for i in range(Q):
    A = list(input().split())
    if A[0] == '1':
        S = ''.join(reversed(list(S)))
    else:
        if A[1] == '1':
            S = A[2] + S
        else:
            S = S + A[2]
print(S)

Fixed submission:
S = input()
Q = int(input())
x = 0
p = ''
q = ''
for i in range(Q):
    A = list(input().split())
    if A[0] == '1':
        x += 1
    elif x%2 ==0:
        if A[1] == '1':
            p = A[2] + p
        else:
            q = q + A[2]
    else:
        if A[1] == '1':
            q = q + A[2] 
        else:
            p = A[2] + p
S = p + S + q
if x%2 == 1:
    S = ''.join(reversed(list(S)))
print(S)
Buggy python submission (verdict: Runtime Error):
print((lambda x:(int(x[1])+(100*(10 - (10 if x[0]>=10 else x[0])))))(input().split()))

Fixed submission:
print((lambda x:(int(x[1])+(100*(10 - (10 if int(x[0])>=10 else int(x[0]))))))(input().split()))

Buggy python submission (verdict: Runtime Error):
print((lambda x:(int(x[1])+(100*(10 - 10 if x[0]>=10 else x[0]))))(input().split()))

Fixed submission:
print((lambda x:(int(x[1])+(100*(10 - (10 if int(x[0])>=10 else int(x[0]))))))(input().split()))

Buggy python submission (verdict: Runtime Error):
print((lambda x:int(x[1])+(100*(10 - 10 if x[0]>=10 else x[0])))(input().split()))

Fixed submission:
print((lambda x:(int(x[1])+(100*(10 - (10 if int(x[0])>=10 else int(x[0]))))))(input().split()))
Buggy python submission (verdict: Runtime Error):
print((lambda x:((x[2]-1) if x[4] == x[0] else x[2]),((x[3]-1) if x[4] == x[1] else x[3]) )(input().split()+list(map(int,input().split()))+input()))

Fixed submission:
print(' '.join((lambda x:[str((x[2]-1)) if x[4] == x[0] else str(x[2]),str((x[3]-1)) if x[4] == x[1] else str(x[3])])(input().split()+list(map(int,input().split()))+[input()])))
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int,input().split())
P = list(map(int,input().split()))
prob = [0 for _ in range(N)]
for i in range(N):
    prob[i] = (P[i]+1)/2
m = 0
for j in range(N-K+1):
    a = sum(prob[j:(j+K)])
    if a > m:
        m = a
print(m)

Fixed submission:
N, K = map(int,input().split())
P = list(map(int,input().split()))
prob = [0 for _ in range(N)]
for i in range(N):
    prob[i] = (P[i]+1)/2
m = sum(prob[:K])
a = sum(prob[:K])
for j in range(1,N-K+1):
    a = a - prob[j-1] + prob[j+K-1]
    if a > m:
        m = a
print(m)
Buggy python submission (verdict: Runtime Error):
print((lambda x: x[0]//x[1])(map(int,input().split())))

Fixed submission:
print((lambda x: (x[0]-1)//x[1]+1)(list(map(int,input().split()))))
Buggy python submission (verdict: Time Limit Exceeded):
H = int(input())
m = 1
at = 0
while True:
    at += m
    H //= 2
    m *= 2
    if H == 1:
        at += m
        print(at)
        exit()


Fixed submission:
H = int(input())
m = 1
at = 0
for i in range(H):
    if H == 1:
        at += m
        print(at)
        exit()
    at += m
    H //= 2
    m *= 2
Buggy python submission (verdict: Runtime Error):
N = int(input())
S,T = map(,input().split())
M = len(S)
ans = ''
for i in range(M):
  ans += S[i] + T[i]
print(ans)

Fixed submission:
N = int(input())
S,T = map(str,input().split())
ans = ''
for i in range(N):
  ans += S[i] + T[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
nu = 1
bl = 0
if not 1 in A:
    print(-1)
else:
    for i in range(1,N+1):
        if A[i] == nu:
            nu += 1
            bl += 1
    print(N-bl)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
nu = 1
bl = 0
if not 1 in A:
    print(-1)
else:
    for i in range(1,N+1):
        if A[i-1] == nu:
            nu += 1
            bl += 1
    print(N-bl)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
if not 1 in A:
    print(-1)
else:
    for i in range(1,N+1):
        a = A.index(i)
        A = A[a:]
        if not i+1 in A:
            print(N-i)
            exit()

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
nu = 1
bl = 0
if not 1 in A:
    print(-1)
else:
    for i in range(1,N+1):
        if A[i-1] == nu:
            nu += 1
            bl += 1
    print(N-bl)
Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
if a*a*b/2 < x:
    x = a*a*b - x
    b = x*2/(a*a)
p = x*2/(a*b)
print(math.degrees(math.atan(b/p)))

Fixed submission:
import math
a,b,x = map(int,input().split())
if x == a*a*b:
    print(0)
    exit()
if a*a*b/2 < x:
    x = a*a*b - x
    b = x*2/(a*a)
p = x*2/(a*b)
print(math.degrees(math.atan(b/p)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lis = []
for i in range(1,N):
    lis.append(i)
print(sum(lis))

Fixed submission:
N = int(input())
print(N*(N-1)//2)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
S = sorted(S)
for j in range(1,N):
    for k in range(1,j+1):
        if S[j] != S[j-k]:
            break
        count += 1
print(count)

Fixed submission:
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
S = sorted(S)
a = 'sing'
for j in range(N):
    if a != S[j]:
        f = 0
        a = S[j]
    else:
        f += 1
        count += f
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
for j in range(N-1):
    for k in range(j+1,N):
        f = True
        for l in range(10):
            if S[j][l] != S[k][l]:
                f = False
                break
        if f:
            count += 1
print(count)

Fixed submission:
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
S = sorted(S)
a = 'sing'
for j in range(N):
    if a != S[j]:
        f = 0
        a = S[j]
    else:
        f += 1
        count += f
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
for j in range(N-1):
    for k in range(j+1,N):
        if S[j] == S[k]:
            count += 1
print(count)

Fixed submission:
N = int(input())
S = []
count = 0
for i in range(N):
    S.append(sorted(input()))
S = sorted(S)
a = 'sing'
for j in range(N):
    if a != S[j]:
        f = 0
        a = S[j]
    else:
        f += 1
        count += f
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
lis = []
for i in range(N):
    lis.append(map(int,input().split()))
lis.sort(key = lambda x:x[1])
a = 0
for j in range(N):
    a += lis[j][0]
    if a > lis[j][1]:
        print('No')
        exit()
print('Yes')

Fixed submission:
N = int(input())
lis = []
for i in range(N):
    lis.append(list(map(int,input().split())))
lis = sorted(lis, key = lambda x:x[1])
a = 0
for j in range(N):
    a += lis[j][0]
    if a > lis[j][1]:
        print('No')
        exit()
print('Yes')
Buggy python submission (verdict: Runtime Error):
if len(S) == 2:
  print(S)
if len(S) == 3:
  print(S[2]+S[1]+S[0])

Fixed submission:
S = input()
if len(S) == 2:
  print(S)
if len(S) == 3:
  print(S[2]+S[1]+S[0])
Buggy python submission (verdict: Time Limit Exceeded):
X,Y = map(int,input().split())
if X == Y:
    print(-1)
    exit()
for i in range(1,10**18+1):
    a = X*i
    if a%Y != 0:
        print(a)
        exit()

Fixed submission:
import math
X,Y = map(int,input().split())
a = X*Y//math.gcd(X, Y)-X
if a == 0:
    print(-1)
    exit()
print(a)
Buggy python submission (verdict: Runtime Error):
S = input()
if "AC" in S:
	print('Yes')
else
	print('No')

Fixed submission:
S = input()
if "AC" in S:
	print('Yes')
else:
	print('No')
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
G = 1
for i in range(N):
    D = int(input())
    lcm = math.gcd(G, D)
    G = G * D // lcm
print(G)

Fixed submission:
import fractions
N = int(input())
G = 1
for i in range(N):
    D = int(input())
    G = G * D // fractions.gcd(G, D)
print(G)

Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
G = 1
for i in range(N):
    D = int(input())
    lcm = math.floor(math.gcd(G, D))
    G = G * D // lcm
print(G)

Fixed submission:
import fractions
N = int(input())
G = 1
for i in range(N):
    D = int(input())
    G = G * D // fractions.gcd(G, D)
print(G)
Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    if x > S:
        break
    for y in range(K+1):
        if x + y > S:
            break
        for z in range(K+1):
            if x + y + z == S:
                p += 1
            if x + y + z > S:
                break
print(p)

Fixed submission:
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    if S-x <= 2*K:
        for y in range(min(S-x+1,K+1)):
            if S-x-y <= K:
                p += 1
print(p)

Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x + y + z == S:
                p += 1
            if x + y + z > S:
                break
print(p)

Fixed submission:
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    if S-x <= 2*K:
        for y in range(min(S-x+1,K+1)):
            if S-x-y <= K:
                p += 1
print(p)

Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x + y + z == S:
                p += 1
print(p)

Fixed submission:
K, S = map(int,input().split())
p = 0
for x in range(K+1):
    if S-x <= 2*K:
        for y in range(min(S-x+1,K+1)):
            if S-x-y <= K:
                p += 1
print(p)
Buggy python submission (verdict: Runtime Error):
W, H, N = map(int,input().split())
p = 0
q = W
r = 0
s = H
for i in range(N):
    x, y, a = map(int,input().split())
    if a == 1:
        if x > p:
            p = x
    if a == 2:
        if x < q:
            q = x
    if a == 3:
        if y > r:
            r = y
    if a == 4:
        if y < s:
            s = y
ans = (q-p)*(s-r)
if ans < 0
    ans = 0
print(ans)

Fixed submission:
W, H, N = map(int,input().split())
p = 0
q = W
r = 0
s = H
for i in range(N):
    x, y, a = map(int,input().split())
    if a == 1:
        if x > p:
            p = x
    if a == 2:
        if x < q:
            q = x
    if a == 3:
        if y > r:
            r = y
    if a == 4:
        if y < s:
            s = y
ans = (q-p)*(s-r)
if q < p or s < r:
    ans = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
#define pq_pair_tB priority_queue <pair<ll,ll>, vector<pair<ll,ll> > , greater<pair<ll,ll> > > 
#define pq_pair_ts priority_queue <pair<ll,ll> > //第二成分の大きさが関係ない
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);


    
    string s;
    cin >> s ;
    cout << 700 + 100 * count(all(s), 'o') << endl;

    
  
    //cout << fixed << setprecision(16) << ans << endl;
    return 0;
}


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

Buggy python submission (verdict: Runtime Error):
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
#define pq_pair_tB priority_queue <pair<ll,ll>, vector<pair<ll,ll> > , greater<pair<ll,ll> > > 
#define pq_pair_ts priority_queue <pair<ll,ll> > //第二成分の大きさが関係ない
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);


    
    string s;
    cin >> s ;
    cout << 700 + 100 * count(all(s), 'o');

    
  
    //cout << fixed << setprecision(16) << ans << endl;
    return 0;
}


Fixed submission:
s = raw_input()
print 700+s.count('o')*100
Buggy python submission (verdict: Time Limit Exceeded):
debug_mode=True
debug_mode=False
def dprint(x):
    if debug_mode: print(x)

n,k=map(int,input().split())
a=list(map(int,input().split()))

score_k=1 # k学期までの評点
for i in range(k):
    score_k *= a[i]

prev_score = score_k
for i in range(k,n):
    dprint(score_k)
    score_k /= a[i-k]
    score_k *= a[i]
    if score_k > prev_score: print('Yes')
    else: print('No')
    prev_score = score_k



Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))

for i in range(n-k):
    if a[i]<a[i+k]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
def intMap(): return map(int,input().split())
def intList(): return list(map(int, input().split()))

n,x = intMap()
l = intList()

d = 0
i = 0

while d <= x:
    d = d + l[i]
    i += 1
    if i > n: break
    
ans = min(i,n)
print(ans)


Fixed submission:
def intMap(): return map(int,input().split())
def intList(): return list(map(int, input().split()))

n,x = intMap()
l = intList()

ans = 1
d = 0

for i in range(n):
    d += l[i]
    if d > x: break
    ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = map(int,input().split())

ans = 0
for i in range(a, b + 1):
    if (i % x) == 0:
        ans += 1
print(str(ans))


Fixed submission:
a, b, x = map(int,input().split())

left = a // x
right = b // x
ans = right - left
if (a % x) == 0:
    ans += 1

print(str(ans))