problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02792 | s660346264 | Wrong Answer | N=int(input())
A=[[0]*9,[0]*9,[0]*9,[0]*9,[0]*9,[0]*9,[0]*9,[0]*9,[0]*9,[0]*9]
for n in range(N):
temp=str(n)
r=int(temp[-1])
l=int(temp[0])
if r!=0 and l!=0:
A[r-1][l-1]+=1
ans=0
for i in range(9):
for j in range(9):
ans+=A[i][j]*A[j][i]
if N==1:
print(1)
else:
print(ans)
|
p03284 | s827045524 | Wrong Answer | N, K = map(int, input().split())
print(N - (N // K) * K) |
p03281 | s314651708 | Wrong Answer | n = int(input())
if n < 105:
print(0)
elif n < 165:
print(1)
elif n < 195:
print(2)
else:
print(3)
|
p02988 | s332230322 | Accepted | n=int(input())
p=list(map(int,input().split()))
cnt=0
for i in range(1,n-1):
l = p[i-1:i+2]
if l[1] == sorted(l)[1]:
cnt+=1
print(cnt) |
p02972 | s859219587 | Accepted | def main():
N = int(input())
A = [0] + [int(i) for i in input().split()]
C = [0]*(N+1)
for i in range(1, N+1)[::-1]:
cur = 0
for j in range(i, N+1, i):
cur += C[j]
if cur % 2 != A[i] % 2:
C[i] += 1
M = sum(C)
print(M)
if M:
C = [i for i in range(1, N+1) if C[i]]
print(*C)
if __name__ == '__main__':
main()
|
p02767 | s747005063 | Wrong Answer | import numpy as np
def Rally(n, array):
min_ = max(np.array(array)*100)
for i in range(0,max(np.array(array))):
if min_ > sum((np.array(array)-i)**2):
min_ = sum((np.array(array)-i)**2)
return min_
n = int(input())
array = list(map(int,input().split()))
print(Rally(n, array)) |
p02771 | s950145923 | Accepted | a,b,c=map(int, input().split())
if (a==b or b==c or c==a)and not (a==b and b==c):
print('Yes')
else:
print('No')
|
p02633 | s034323775 | Accepted |
import math
X = int(input())
print ((X*360//math.gcd(X,360)) // X)
|
p03944 | s764684495 | Accepted | H,W,N=map(int,input().split())
sita,hidari=0,0
ue,migi=W,H
for i in range(N):
x,y,a=map(int,input().split())
if a==1:
hidari=max(x,hidari)
elif a==2:
migi=min(migi,x)
elif a==3:
sita=max(sita,y)
else:
ue=min(ue,y)
print(max(0,(migi-hidari))*max(0,(ue-sita))) |
p03073 | s034799027 | Accepted | s = input()
n = len(s)
white_start = ["0" if i%2==0 else "1" for i in range(n)]
#black_start = ["1" if i%2==0 else "0" for i in range(n)]
Wcnt = 0
#Bcnt = 0
for i in range(n):
if s[i]!=white_start[i]:
Wcnt +=1
#else:
#Bcnt +=1
print(min(Wcnt,n-Wcnt)) |
p02987 | s415032489 | Accepted | import collections
S = input()
c = collections.Counter(S)
if (len(c.keys()) == 2 )and(list(c.values()) == [2,2]):
print("Yes")
else:
print("No") |
p03556 | s454020435 | Wrong Answer | n = int(input())
square_roots = [i**2 for i in range(n) if i**2<=n]
print(max(square_roots))
|
p03241 | s722831985 | Accepted | import bisect
N,M = map(int,input().split())
maxa = M//N
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
mdiv = sorted(make_divisors(M))
ans = mdiv[bisect.bisect_right(mdiv,maxa)-1]
print(ans) |
p03338 | s278723034 | Wrong Answer | n = int(input())
s = list(input())
ans = 0
for i in range(n):
x = s[:i+1]
y = s[i:]
ans = max(ans,len(set(x)&set(y))) |
p02760 | s877984595 | Wrong Answer | a = [input().split() for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
total = []
for i in range(n):
for k in range(3):
for j in range(3):
if b[i] == int(a[k][j]):
total.append(k + j)
break
if ((0 and 1 and 2) in total) or ((3 and 4 and 5) in total) or ((6 and 7 and 8) in total) or ((0 and 3 and 6) in total) or ((1 and 4 and 7) in total) or ((2 and 5 and 8) in total) or ((0 and 4 and 8) in total) or ((2 and 4 and 6) in total):
print("Yes")
else:
print("No")
|
p02756 | s598904399 | Wrong Answer | # -*- coding: utf-8 -*-
# TLE
s = input()
q = int(input())
reverse_flag = False
prefix = ''
suffix = ''
for _ in range(q):
query = input()
if query == '1':
if reverse_flag:
reverse_flag = False
else:
reverse_flag = True
else:
if reverse_flag and query[2] == '1':
suffix += query[4]
elif not reverse_flag and query[2] == '2':
suffix += query[4]
else:
prefix += query[4]
if reverse_flag:
print(suffix[::-1] + s + prefix)
else:
print(prefix[::-1] + s + suffix) |
p03817 | s359748883 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')
def solve():
# n, m = [int(x) for x in input().split()]
n = int(input()) * 10
print((n + 54) // 55)
t = 1
# t = int(input())
for case in range(1,t+1):
ans = solve()
"""
R s
S p
P r
"""
|
p03221 | s089206703 | Accepted | from collections import defaultdict
dic = defaultdict(int)
N,M = map(int,input().split())
A = []
for i in range(M):
a,b = map(int,input().split())
A.append((a,b,i))
A.sort()
#print(A)
ans = [-1 for _ in range(M)]
for i in range(M):
dic[A[i][0]] += 1
#print(dic[A[i][0]])
temp = "0"*(6-len(str(A[i][0])))+str(A[i][0])+"0"*(6-len(str(dic[A[i][0]])))+str(dic[A[i][0]])
ans[A[i][2]] = temp
#print(i,temp)
for t in ans:
print(t)
|
p02814 | s631804959 | Wrong Answer | def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd (a, b)
N,M = map(int, input().split())
xs = map(int, input().split())
r = 1
for x in xs:
r = lcm(x,r)
if r//2 > M:
print(0)
else:
print((M-r//2)//r+1)
|
p02660 | s894345085 | Wrong Answer | import sys
n=int(input())
if n == 1:
print(0)
sys.exit()
tmp=n
ans=0
for i in range(2,n):
if tmp % i == 0:
tmp = tmp // i
ans += 1
continue
if i > tmp:
break
if i > tmp // i:
ans+=1
break
print(ans) |
p02923 | s662062203 | Accepted | N=int(input())
H=list(map(int,input().split()))
x=0
l=[]
for i in range(N-1):
if H[i]>=H[i+1]:
x+=1
else:
l.append(x)
x=0
l.append(x)
print(max(l)) |
p02860 | s343677576 | Wrong Answer | N = int(input())
S = input()
if (N%2 != 0):
print('No')
else:
n = N//2
for i in range(n):
if (S[i] != S[n+i]):
print('No')
break
if (i == n-1):
print('Yes') |
p03309 | s183443858 | Accepted | N = int(input())
Alist = list(map(int,input().split()))
Blist = []
p = 0
q = 0
r = 0
for i in range(N):
Blist.append(Alist[i] - i- 1)
Blist.sort()
u = Blist[N//2]
for i in range(N):
q = q + abs(Blist[i]-u)
print(q) |
p02570 | s758682564 | Accepted | d,t,s = map(int,input().split())
if t*s >=d:
print("Yes")
else:
print("No")
|
p02918 | s125453976 | Wrong Answer | n,k = map(int, input().split())
s = input()
rl_cnt = 0
for s1,s2 in zip(s[:-1],s[1:]):
if s1 == 'R' and s2 == 'L':
rl_cnt += 1
left_happy = 1 if s[0] == 'R' else 0
right_happy = 1 if s[-1] == 'L' else 0
first_happy = n - rl_cnt*2 -2 + left_happy + right_happy
print(first_happy)
if k <= rl_cnt:
print(first_happy + k*2)
else:
rem = k-rl_cnt
ans = first_happy + rl_cnt*2 + min(rem, left_happy+right_happy)
print(ans) |
p03785 | s022841470 | Accepted | n, c, k = map(int, input().split())
t = sorted([int(input()) for _ in range(n)])
l = 0
m = 0
ans = 0
for i in range(n):
if l == 0:
m = t[i]
l += 1
elif l < c:
if m + k >= t[i]:
l += 1
else:
ans += 1
l = 1
m = t[i]
else:
ans += 1
l = 1
m = t[i]
ans += 1
print(ans) |
p02795 | s574315466 | Accepted | import math
h=int(input())
w=int(input())
n=int(input())
if w>=h:
print(math.ceil(n/w))
else:
print(math.ceil(n/h)) |
p03795 | s008194679 | Wrong Answer | n=int(input())
print(800*n-200*n//15) |
p02712 | s227017553 | Wrong Answer | # 入力をint型にする
N = int(input())
ans = 0
for i in range(1,N):
if i%3!=0 and i%5!=0:
ans += i
print(ans) |
p02790 | s833271864 | Accepted | # -*- coding: utf-8 -*-
a, b = input().split()
A = ""
B = ""
for i in range(int(b)):
A += a
for i in range(int(a)):
B += b
if A < B:
print(A)
else:
print(B)
|
p02897 | s941092993 | Accepted | N = int(input())
a = N%2
if a==0:
print(0.5)
else:
print((N//2+1)/N) |
p02756 | s111747704 | Wrong Answer | import sys
s = sys.stdin.readlines()
S = s[0]
Q = s[1]
Qs = s[2:]
for q in Qs:
if len(q.strip()) == 1:
S = S[::-1]
else:
F, C = q.strip().split()[1:3]
if F == "1":
S = C + S
else:
S += C
print(S) |
p03799 | s907137978 | Accepted | n, m = map(int, input().split())
q = m // 2
if n >= q:
print(q)
else:
m -= 2*n
m //= 4
print(n+m) |
p03944 | s265318769 | Accepted | w,h,n = map(int,input().split())
lists = [list(map(int,input().split())) for i in range(n)]
x1 = 0
x2 = w
y1 = 0
y2 = h
for x,y,a in lists:
if a == 1:
x1 = max(x1,x)
elif a == 2:
x2 = min(x2,x)
elif a == 3:
y1 = max(y1,y)
elif a == 4:
y2 = min(y2,y)
x = max(0,(x2 - x1))
y = max(0,(y2 - y1))
ans = max(0,x*y)
print(ans) |
p03457 | s415215826 | Wrong Answer | N = int(input())
cs = []
t1, x1, y1 = 0, 0, 0
ans = 'Yes'
for i in range(N):
t2, x2, y2 = map(int, input().split())
d = abs(x1-x2) + abs(y1-y2)
if d > (t2 - t1) or d % 2 != (t2 - t1) % 2:
ans = 'No'
print(ans)
|
p02676 | s548932479 | Accepted | #B
K = int(input())
S = str(input())
L = len(S)
if L <= K:
print(S)
else:
ans = ""
for i in range(K):
ans+=S[i]
ans+="..."
print(ans)
|
p03448 | s702960327 | Wrong Answer | a = int(input())
b = int(input())
c = int(input())
x = int(input())
rCnt = 0
ttla = 0
ttlb = 0
ia = 0
ib = 0
ic = 0
while ia <= a:
ttla = 500 * ia
ia = ia + 1
while ib <= b:
ttlb = 100 * ib
ib = ib + 1
while ic <= c:
if ttla + ttlb + 50 * ic:
rCnt = rCnt + 1
ic = ic + 1
print(rCnt) |
p03146 | s198450216 | Accepted | s=int(input())
c=set([s])
i=1
while True:
i+=1
if s&1:
s=3*s+1
else:
s//=2
if s in c:
print(i)
break
c.add(s)
|
p02755 | s232129090 | Accepted | A, B = map(int, input().split())
Amin= A*100/8
AMAX= (A+1)*100/8
Bmin= B*100/10
BMAX= (B+1)*100/10
Alist=[0]*1257
Blist=[0]*1257
ANSlist=[10000]*1257
for i in range(1257):
if Amin <=i <AMAX:
Alist[i]=i
for i in range(1257):
if Bmin <=i <BMAX:
Blist[i]=i
for i in range(1257):
if Alist[i]!=0 and Blist[i]!=0:
ANSlist[i]=i
if min(ANSlist)==10000:
print(-1)
else:
print(min(ANSlist))
|
p03127 | s440811101 | Wrong Answer | import numpy as np
n = int(input())
a = input().split(' ')
a = np.array(a).astype(int)
while a[a>0].shape[0] > 1:
not_0_a = a[a!=0]
min_ = not_0_a.min()#0じゃない最小値
min_i = np.where(a == min_)#最小値のインデックス
a = a % min_
a[min_i[0][0]] = min_
print(a)
"""
if a[a>0].shape[0] == 1:
not_0_a = a[a!=0]
min_ = not_0_a.min()
"""
print(min_) |
p03481 | s749640656 | Accepted | def solve():
X, Y = map(int, input().split())
count = 0
while X <= Y:
count += 1
X *= 2;
print(count)
if __name__ == "__main__":
solve() |
p02911 | s771699721 | Wrong Answer | n,k,q = map(int,input().split())
points = [k]*n
for i in range(q):
winner = int(input())
for j in range(n):
points[j] -= 1
points[winner - 1] += 1
for i in points:
if i > 0:
print("YES")
else:
print("NO") |
p03012 | s596605643 | Accepted | n=int(input())
w=list(map(int,input().split()))
s=[0]
for i in w:
s.append(s[-1]+i)
ss=s[-1]
ans=10**20
for i in range(n+1):
ans=min(ans,abs((ss-s[i])-s[i]))
print(ans) |
p03338 | s635257602 | Accepted | from collections import Counter
N = int(input())
S = list(input())
ans = 0
for i in range(1,N):
temp = 0
left = S[:i]
right = S[i:]
left_words = Counter(left)
right_words = Counter(right)
for key1 in left_words.keys():
for key2 in right_words.keys():
if key1 == key2:
temp += 1
if temp > ans:
ans = temp
print(ans) |
p02939 | s305874322 | Accepted | S = list(input())
s = 0
num = 0
ans = 0
for i in range(len(S)):
if i < num:
continue
for j in range(1,len(S)-i+1):
if S[i:i+j] != s:
s = S[i:i+j]
num = i+j
ans += 1
break
print(ans) |
p03637 | s011471062 | Accepted | def main():
length = int(input())
numbers = list(map(int, input().split()))
even_num = 0
odd_num = 0
multiple_of_4 = 0
for num in numbers:
if not num % 4:
multiple_of_4 += 1
elif not num % 2:
even_num += 1
else:
odd_num += 1
if multiple_of_4 >= odd_num or (multiple_of_4 + 1 >= odd_num and even_num == 0):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p03814 | s147871794 | Accepted | S = list(map(str, input().rstrip()))
for i, s in enumerate(S):
if s=="A":
start = i
break
for i, s in enumerate(S[::-1]):
if s=="Z":
end = i
break
print(len(S[start:len(S)-end])) |
p03323 | s561009762 | Accepted | A,B = map(int,input().split())
if A <= 8 and B<=8:
print("Yay!")
else:
print(":(") |
p02860 | s446739014 | Accepted | n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
T = s[0:n//2]
if T + T == s:
print("Yes")
else:
print("No") |
p03241 | s205255104 | Accepted | N,M = map(int,input().split())
if N==1:
nmax=M
else:
nmax = 1
for i in range(2,int(M**0.5)+1):
if M%i==0 and M//i>=N:
nmax = max(nmax,i)
if M%i==0 and i>=N:
nmax = max(nmax,M//i)
print(nmax) |
p03695 | s100788732 | Accepted | n = int(input())
a = list(map(int, input().split()))
l = [0] * 9
for i in a:
if i >= 3200:
l[8] += 1
else:
l[i // 400] += 1
mi = 0
ma = 0
for i in l[:8]:
if i > 0:
mi += 1
ma += 1
if l[8] > 0:
ma += l[8]
if sum(l[:8]) == 0:
print(1, l[8])
exit()
print(mi, ma) |
p02546 | s996479917 | Accepted | s = input()
if s[-1] == 's':
print(s + 'es')
else:
print(s + 's')
|
p02873 | s690723357 | Wrong Answer | s = input()
ans = cnt = 0
s_ = s[0]
for s_i in s:
if s_i == s_:
cnt += 1
ans += cnt
else:
s_ = s_i
ans += cnt
cnt = 0
print(ans) |
p03852 | s213667377 | Accepted | c = input()
print("vowel" if c in "aiueo" else "consonant") |
p03030 | s990714232 | Wrong Answer | n = int(input())
r = [input().split() for _ in range(n)]
for i in range(n):
r[i].append(i+1)
r.sort(key=lambda x:x[1],reverse=True)
r.sort(key=lambda x:x[0])
for i in range(n):
print(r[i][2]) |
p03860 | s073974859 | Accepted | print("".join(s[0] for s in input().split()))
|
p02765 | s933499170 | Accepted | n,r = map(int,input().split())
if(n>10):
print(r)
else:
print(r+(10-n)*100)
|
p02743 | s579229336 | Wrong Answer | import math
A,B,C=map(int,input().split())
X=math.sqrt(A)
Y=math.sqrt(B)
Z=math.sqrt(C)
if X+Y-Z<0:
print("Yes")
else:
print("No") |
p02917 | s492754194 | Accepted | import itertools
import math
import fractions
import functools
n = int(input())
b = list(map(int, input().split()))
a = [0]*n
a[0] = b[0]
for i in range(1,n-1):
a[i] = min(b[i-1],b[i])
a[n-1]=b[n-2]
print(sum(a)) |
p02701 | s266703753 | Accepted | n = int(input())
s = [input() for i in range(n)]
print(len(set(s))) |
p03221 | s879109070 | Accepted | n,m=map(int,input().split())
num=[]
ans=[""]*m
numcount=[1]*n
count=1
for i in range(m):
p,y=map(int,input().split())
num.append([p,y,i])
stry= lambda val: val[1]
num.sort(key=stry)
for i in range(m):
p=str(num[i][0])
y=str(numcount[int(num[i][0])-1])
numcount[int(num[i][0])-1]+=1
ans[num[i][2]]="0"*(6-len(p))+p+"0"*(6-len(y))+y
for i in range(m):
print(ans[i])
|
p03345 | s901092421 | Wrong Answer | a,b,c,k = map(int,input().split())
if abs(a-b) > 10**18:
print('Unfair')
exit()
print(a-b)
|
p03799 | s782873249 | Accepted | N,M = map(int,input().split())
if M//2 <= N:
ans = M//2
print(ans);exit()
A = N*2+M
ans = A//4
print(ans) |
p03910 | s365592956 | Wrong Answer | N = int(input())
l = [int(x) for x in range(1,N+1)]
total_num,max_num = 0,0
if N == 1:
print(1)
exit()
for i in range(1,N):
total_num += i
if total_num >= N:
max_num = i
break
if total_num == N:
for i in range(max_num):
print(i+1)
else:
ng_num = total_num - N
for j in range(max_num):
if j+1 != ng_num:
print(j+1) |
p02972 | s829788454 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
box=[0]*N
for i in range(N, 0,-1):
sm = 0
for j in range(i, N+1, i):
sm += box[j-1]
print(i, sm)
box[i-1] = (sm % 2) ^ a[i-1]
print(sum(box))
print(*box) |
p03767 | s005894744 | Accepted | N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
sm=[]
count=0
for i in range(3*N):
if count==N:
break
if i%2==1:
sm.append(A[i])
count+=1
ans=sum(sm)
print(ans) |
p02811 | s018344264 | Wrong Answer | K,X = map(int,input().split())
if 500*K <= X:
print("No")
else:
print("Yes") |
p03815 | s833310545 | Accepted | x = int(input())
ans = (x//11)*2
remainder = x%11
if remainder == 0:
print(ans)
elif 1 <= remainder <= 6:
print(ans+1)
else:
print(ans+2) |
p02726 | s579851629 | Accepted | n, x, y = map(int, input().split())
a = [0]*(n-1)
for i in range(1, n):
for j in range(i+1, n+1):
b = min(j-i, abs(x-i)+1+abs(y-j))
a[b-1] += 1
print(*a, sep="\n") |
p03623 | s276436252 | Accepted | def ABC_71_A():
X,A,B = map(int, input().split())
if abs(X-A) <= abs(X-B):
print('A')
else:
print('B')
if __name__ == '__main__':
ABC_71_A() |
p03038 | s659210964 | Wrong Answer | import heapq
n, m = map(int, input().split())
a = list(map(int, input().split()))
heapq.heapify(a)
bc = [list(map(int, input().split())) for _ in range(m)]
bc.sort(key = lambda x: x[1], reverse = True)
for i in range(m):
if a[bc[i][0] - 1] >= bc[i][1]:
break
else:
cnt = 0
while cnt < bc[i][0]:
heapq.heapreplace(a, bc[i][1])
cnt += 1
print(sum(a)) |
p03160 | s686389187 | Accepted |
n=int(input())
h=list(map(int,input().split()))
li=[0]*n
li[1]=abs(h[1]-h[0])
for i in range(2,n):
li[i]=min(li[i-1]+abs(h[i]-h[i-1]),li[i-2]+abs(h[i]-h[i-2]))
##print(li)
print(li[n-1])
|
p03067 | s724811425 | Accepted | a,b,c=map(int,input().split())
print(["No","Yes"][a>c>b or a<c<b]) |
p03448 | s093465158 | Accepted | A, B, C, X = [int(input()) for i in range(4)]
print(sum(500*a+100*b+50*c == X for a in range(A+1) for b in range(B+1) for c in range(C+1))) |
p03069 | s299904336 | Accepted | n=int(input())
s=input()
countwhite=[0]*(n+1)
for i in range(n):
if s[i]==".":
countwhite[i+1]=countwhite[i]+1
else:
countwhite[i+1]=countwhite[i]
ans=10**8
for i in range(n+1):
change=i-countwhite[i]+(countwhite[-1]-countwhite[i])
ans=min(ans,change)
print(ans) |
p03274 | s756896471 | Accepted | n,k=map(int,input().split())
x=list(map(int,input().split()))
ans=float('inf')
for i in range(n-k+1):
nowx=(x[i],x[i+k-1])
if nowx[0]>=0 and nowx[-1]>=0:
ans=min(ans, nowx[-1])
elif nowx[0]<=0 and nowx[-1]<=0:
ans=min(ans, abs(nowx[0]))
elif nowx[0]<0 and nowx[-1]>=0:
ans=min(ans, 2*abs(nowx[0])+nowx[-1], abs(nowx[0])+2*nowx[-1])
print(ans) |
p02801 | s669321716 | Accepted | print(chr(ord(input())+1)) |
p03861 | s816435205 | Accepted | a,b,x = map(int, input().split())
a_div=0
b_div = b//x
if a!=0:
a_div = (a-1)//x
count = b_div-a_div
else:
count = b_div-a_div+1
print(count) |
p02684 | s481358881 | Wrong Answer | paramN, paramK = list(map(lambda x: int(x), input().split(' ')))
paramA = list(map(lambda x: int(x), input().split(' ')))
route = [0] * (paramN + 1)
route[0] = 1
for i in range(1, paramN + 1):
route[i] = paramA[route[i - 1] - 1]
loop_start = 0
history = [False] * paramN
for i, r in enumerate(route):
if history[r - 1]:
loop_start = i
break
else:
history[r - 1] = True
x = route[loop_start]
loop_start_0 = route.index(x)
y = paramK - loop_start_0
z = y % (loop_start - loop_start_0)
print(route[loop_start_0 + z]) |
p03339 | s853614598 | Accepted | n=int(input())
s=input()
w=s.count("W")
e=s.count("E")
t=0
ans=n
for i in range(n):
if s[i]=="E":
e-=1
tmp=e+t
if tmp<ans:
ans=tmp
if s[i]=="W":
t+=1
print(ans) |
p02754 | s977968974 | Accepted | n, a, b = map(int, input().split(' '))
if a == 0:
print('0')
else:
base = (n//(a+b))*a
n = n%(a+b)
base += min(n, a)
print(base)
|
p02797 | s005429111 | Accepted | n,k,s = map(int, input().split())
if s == 10**9:
ansl = []
for i in range(n):
if i < k:
ansl.append(s)
else:
ansl.append(1)
print(*ansl)
else:
ansl = []
for i in range(n):
if i < k:
ansl.append(s)
else:
ansl.append(10**9)
print(*ansl) |
p03282 | s681371229 | Accepted | S = [int(i) for i in input()]
K = int(input())
ans = 1
if K<=len(S):
for i in S[:K]:
if i!=1:
ans=i
break
else:
for i in S:
if i!=1:
ans=i
break
print(i) |
p03136 | s310048878 | Accepted | n = int(input())
L = list(map(int,input().split()))
if sum(L)-max(L) > max(L):
print("Yes")
else:
print("No") |
p02842 | s602906121 | Accepted | n=int(input())
for x in range(60000):
if int(x*1.08)==n:
print(x)
exit()
print(":(") |
p02552 | s469049551 | Wrong Answer | n = input()
if n:
print("1")
else:
print("0") |
p02547 | s271418304 | Accepted | #!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
check_list = []
for i in range(n):
d1, d2 = map(int, input().split())
if d1 == d2:
check_list.append(1)
else:
check_list.append(0)
flag = 0
for i in range(n - 2):
if sum(check_list[i:(i+3)]) == 3:
flag = 1
break
if flag:
print("Yes")
else:
print("No") |
p04005 | s942157225 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
a,b,c = map(int, input().split())
ans = min(a*b*(c%2), a*(b%2)*c, (a%2*b*c))
print(ans) |
p03103 | s669938755 | Accepted | n,m=map(int,input().split())
l=sorted([list(map(int,input().split())) for _ in range(n)])
ans=0
for a,b in l:
if b<m:
ans+=(a*b)
m-=b
else:
ans+=(a*m)
break
print(ans)
|
p02811 | s963560804 | Accepted | K, X = map(int, input().split())
if 500 * K >= X:
print("Yes")
else:
print("No") |
p03455 | s066038237 | Accepted | a,b=[int(str1) for str1 in input().split()]
if (a*b)%2==0:
print("Even")
else:
print("Odd") |
p02570 | s847344102 | Accepted | D,V,T = map(int,input().split())
time = D / V
if time <= T:
print("Yes")
else:
print("No") |
p03795 | s276399937 | Accepted | N = int(input())
x = N * 800
y = N // 15 * 200
answer = x - y
# print(x, y)
print(answer) |
p03261 | s688044749 | Accepted | n = int(input())
s = [input() for i in range(n)]
r = "Yes"
if len(set(s)) != n:
r = "No"
else:
for i in range(1, n):
if s[i - 1][-1] != s[i][0]:
r = "No"
print(r) |
p03377 | s178940969 | Wrong Answer | a, b, x = map(int, input().split())
if x<=a or a+b<=x:
print("YES")
else:
print("NO") |
p02640 | s316026190 | Wrong Answer | X, Y = map(int, input().split())
for i in range(1, X + 1):
if Y == (i * 2 + (X - i) * 4):
print('Yes')
break
else:
print('No')
|
p03544 | s812017359 | Accepted | n=int(input())
for i in range(n+1):
if i==0:
a=2
elif i==1:
b=1
else:
a,b=b,a+b
print(b) |
p02658 | s812504372 | Wrong Answer | n = int(input())
lis = list(map(int, input().split()))
a = 1
for i in range(n):
a = a * lis[i]
if a > 1000000000000000000:
a = -1
break
print(a) |
p03105 | s184975768 | Accepted | a,b,c=map(int,input().split())
if c*a<=b:
print(c)
else:
print(b//a)
|
p02583 | s355607099 | Wrong Answer | n = int(input())
l = [int(a) for a in input().split()]
l.sort()
print(l)
count=0
for i in range(n):
for j in range(i+1, n):
for k in range(j+1, n):
if((l[i]+ l[j] > l[k] )&( l[i] != l[j] != l[k])):
count += 1
print(count)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.