problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02820 | s839399631 | Wrong Answer | n,k = map(int,input().split())
R,S,P = map(int,input().split())
points = {'r':P,'s':R,'p':S}
l = list(input())
ans = 0
for i,j in enumerate(l):
if (i-k<=0) or l[i] != l[i-k]:
ans += points[j]
print(ans)
|
p03339 | s338788675 | Accepted | # coding: utf-8
def main():
N = int(input())
S = input()[:N]
min_count = count = S[1:].count('E')
for i in range(1, N):
if S[i - 1] == 'W':
count += 1
if S[i] == 'E':
count -= 1
if count < min_count:
min_count = count
print(min_count)
if __name__ == '__main__':
main()
|
p02630 | s207143341 | Accepted | n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = {}
for i in range(1000000):
m[i] = 0
for e in a:
m[e] += 1
ans = sum(a)
for i in range(q):
b,q = map(int,input().split())
diff = (q-b) * m[b]
m[q] += m[b]
m[b] = 0
ans += diff
print(ans)
|
p03136 | s611048767 | Wrong Answer | n = int(input())
l = input().split(" ")
for i in range(len(l)):
l[i] = int(l[i])
l.sort()
sum = 0
for i in range(1, n):
sum += l[i]
if sum >= l[0]:
print("Yes")
else:
print("No")
|
p03681 | s693723025 | Accepted | from math import factorial
N, M = map(int, input().split())
if abs(N - M) > 1:
print(0)
else:
print(factorial(N) * factorial(M) * (2 if N == M else 1) % (10**9+7))
|
p02946 | s594997634 | Accepted | k, x = map(int, input().split())
apple = []
for i in range((x - k) + 1, (x + k)):
apple.append(i)
print(*apple) |
p03860 | s599071712 | Accepted | print("A" + input()[8] + "C") |
p03472 | s934583591 | Accepted | n,h = map(int,input().split())
s1 = []
s2 = []
for _ in range(n):
a, b = map(int,input().split())
s1.append(a)
s2.append(b)
maxa = max(s1)
s2.sort(key=lambda x:-x)
ans = 0
for s2i in s2:
if s2i > maxa:
ans += 1
h -= s2i
if h <= 0:
break
if h > 0:
if h % maxa == 0:
ans += h // maxa
else:
ans += h // maxa + 1
print(ans)
else:
print(ans)
|
p02778 | s170839237 | Accepted | s = input()
answer = ''
for _ in range(len(s)):
answer += 'x'
print(answer)
|
p02755 | s439344034 | Wrong Answer | import math
A,B = list(map(int,input().split()))
def problem_gksn(A, B):
x_min = A / (0.08)
x_max = (A+1)/0.08
y_min = B / (0.10)
y_max = (B+1) / (0.10)
# print(x_min,x_max,y_min,y_max)
if max(x_min, y_min) <= min(x_max, y_max):
return math.ceil(max(x_min, y_min))
else:
return -1
print(problem_gksn(A,B)) |
p03163 | s518380006 | Wrong Answer | import numpy as np
N,Max_W = map(int,input().split())
dp = [0 for _ in range(Max_W + 1)]
dp = np.array(dp)
for i in range(N):
w,v = map(int,input().split())
a = dp[:-w] + v
b = dp[w:]
m = np.maximum(a,b)
dp[w:] = m |
p02947 | s337561297 | Accepted | N = int(input())
s = [''.join(sorted(input())) for i in range(N)]
dic = {}
ans = 0
for i in range(N):
if not s[i] in dic:
dic[s[i]] = 0
dic[s[i]] += 1
for v in dic.values():
ans += v*(v-1)//2
print(ans)
|
p02664 | s856708646 | Wrong Answer | t = input()
print(t[0],end="")
for i in range(1,len(t)):
if t[i] == "?":
if t[i-1] == "D":
print("P",end="")
else:
print("D",end="")
else:
print(t[i],end="") |
p03210 | s412074606 | Accepted | x = int(input())
if [7,5,3].count(x) > 0:
print('YES')
else:
print('NO') |
p03693 | s388694329 | Accepted | r, g, b = map(int, input().split())
x = 100 * r + 10 * g + b
if x % 4 == 0:
print('YES')
else:
print('NO')
|
p03633 | s645185155 | Accepted | def main():
def gcd(a,b):
while b!=0:
a, b = b, a%b
return a
def lcm(a,b):
return a*b // gcd(a,b)
N = int(input())
T = [int(input()) for _ in range(N)]
ans = 1
for t in T:
ans = lcm(ans, t)
print(ans)
if __name__ == '__main__':
main()
|
p02771 | s811299101 | Wrong Answer | i=input().split()
a=i[0]
b=i[1]
c=i[2]
if(a==b and b==c):
print("Yes")
else:
print("No") |
p02880 | s792888060 | Wrong Answer | n = int(input())
for i in range(1,10):
if 1 <= n%i <= 9 and (n/i).is_integer():
print('Yes')
exit()
print('No') |
p02843 | s401425492 | Wrong Answer | X=input()
Y=int(X)
if Y<=99:
print(0)
else:
a=10*int(X[-2])+int(X[-1])
b=a//5
if a%5!=0:
b+=1
if b>Y//100:
print(0)
else:
print(1)
print(b)
print(Y//100) |
p04043 | s371580876 | Accepted | a,b,c=map(int,input().split())
if (a==7 and b==5 and c==5) or (a==5 and b==7 and c==5) or (a==5 and b==5 and c==7):
print("YES")
else:
print("NO") |
p03286 | s689183798 | Accepted | def mainusbin(num):
base = -2
dst = ""
i = 0
if abs(base) > abs(num):
return num
while abs(base**i) <= abs(num):
i += 1
amari = num % base**i
if amari:
dst = "1" + dst
num -= base**(i-1)
else:
dst = "0" + dst
return dst
src = int(input())
dst = mainusbin(src)
print(dst)
|
p02594 | s124551986 | Wrong Answer | print("YNeos"[max(int(input())//30,0):5:2]) |
p03951 | s187598986 | Accepted | n = int(input())
s = input()
t = input()
p = n * 2
for i in range(n):
if t[0:i+1] in s:
p -= 1
else:
break
print(p) |
p02578 | s571587733 | Wrong Answer | n = input()
a_list = list(map(int, input().split()))
score = 0
for i in range(len(a_list) - 1):
if a_list[i] < a_list[i+1]:
score += a_list[i+1] - a_list[i]
print(score) |
p02729 | s087442223 | Accepted | n, m = map(int, input().split())
ans1 = n * (n - 1) // 2
ans2 = m * (m - 1) // 2
print(ans1 + ans2)
|
p03042 | s604381889 | Accepted | S = input()
l = S[:2]
r = S[2:]
lcnt = 0
rcnt = 0
if 0 < int(l) <= 12:
lcnt = 1
if 0 < int(r) <= 12:
rcnt = 1
if lcnt and rcnt:
print('AMBIGUOUS')
exit()
elif lcnt:
print('MMYY')
exit()
elif rcnt:
print('YYMM')
exit()
else:
print('NA') |
p03862 | s124218028 | Wrong Answer | N, x = map(int,input().split())
a = list(map(int,input().split()))
b = [a[i] + a[i+1] for i in range(N-1)]
ans = 0
for i in range(N-1):
if b[i] > x:
temp = b[i] - x
ans += temp
b[i] = x
if i != N-2:
b[i+1] -= temp
print(ans) |
p03379 | s187492114 | Wrong Answer | N=int(input())
X=list(map(int, input().split()))
XX = sorted(X)
mid = (XX[N//2-1] + XX[N//2])/2
for i in range(N):
if X[i] < mid:
print(X[ N//2 ])
else:
print(X[N//2-1])
|
p03657 | s213689852 | Wrong Answer | A, B = map(int, input().split())
print('Possible' if not A + B % 3 else 'Impossible')
|
p02645 | s101707605 | Wrong Answer | import fileinput
lines = list(fileinput.input())
print(lines)
|
p03817 | s162734810 | Accepted | import math
X = int(input())
#6565が最小になるはず
x = X//11
amari = X%11
ans = x*2+math.ceil(amari/6)
print(ans) |
p03434 | s403412076 | Wrong Answer | n = int(input())
l = sorted(list(map(int, input().split())), reverse = True)
ans = 0
for i in range(n // 2):
ans += l[i] - l[n - 1 - i]
if n & 1:
ans += l[n // 2]
print(ans)
|
p03910 | s292105929 | Wrong Answer | N = int(input())
i = 0
total = 0
while True:
total += i
if total >= N:
tmp = i
break
i += 1
for j in range(tmp, 0, -1):
if N - tmp >= 0:
N -= tmp
if N == 0:
break
tmp -= 1
|
p02548 | s528057065 | Accepted | n = int(input()) - 1
ans = 0
for i in range(1, n + 1):
ans += int(n/i)
print(ans) |
p02744 | s778757540 | Accepted | n = int(input())
abc = list('abcdefghijk')
def solve(ans):
if len(ans) == n:
print(*ans, sep='')
else:
idx = max([abc.index(ans[i]) for i in range(len(ans))])
for i in range(idx+2):
nans = ans + [abc[i]]
solve(nans)
solve(['a']) |
p03543 | s957762885 | Accepted | a,b,c,d = input()
if a==b==c or b==c==d:
print("Yes")
else:
print("No")
|
p02761 | s447504261 | Accepted | from collections import defaultdict
def solve():
N, M = map(int, input().split())
d = defaultdict(lambda: -1)
for i in range(M):
x,y = map(int, input().split())
if d[x]>=0 and d[x]!=y:
return -1
if N>1 and x==1 and y==0:
return -1
d[x] = y
if N==1 and d[1]==-1:
return 0
if d[1]==-1:
d[1] = 1
for i in range(2,N+1):
if d[i]==-1:
d[i] = 0
ans = ''
for i in range(1,N+1):
ans += str(d[i])
return ans
print(solve()) |
p03759 | s833489719 | Accepted | a, b, c = map(int, input().split())
if b-a == c-b:
print("YES")
else:
print("NO") |
p03944 | s268317233 | Accepted | w,h,n=map(int,input().split())
b=w
c=h
d=0
e=0
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
d=max(x,d)
elif a==2:
b=min(x,b)
elif a==3:
e=max(y,e)
elif a==4:
c=min(y,c)
if b<d or c<e:
print(0)
else:
print((b-d)*(c-e)) |
p03264 | s350398630 | Accepted | k=int(input())
if k%2==0:
print((k//2)**2)
else:
print((k//2)*(k//2+1)) |
p03077 | s883238626 | Accepted | import math
N = int(input())
carry = [int(input()) for _ in range(5)]
print(math.ceil(N / min(carry))+4) |
p03821 | s094201791 | Wrong Answer | #!/usr/bin/env python
n = int(input())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = map(int, input().split())
ans = 0
for i in reversed(range(n)):
if a[i]%b[i] == 0:
continue
else:
ans += (a[i]//b[i]+1)*b[i]-a[i]
if i!=0:
a[i-1] += ans
print(ans) |
p02687 | s114046871 | Accepted | S = input()
if S == "ABC":
print("ARC")
else:
print("ABC") |
p02854 | s786781095 | Accepted | n = int(input())
stick = list(map(int, input().split()))
total = sum(stick)
mid = total // 2
cum = 0
midi = 0
for i, block in enumerate(stick):
cum += block
if cum >= mid:
midi = i
break
l1 = sum(stick[:midi])
r1 = sum(stick[midi:])
diff1 = abs(l1 - r1)
l2 = l1 + stick[midi]
r2 = r1 - stick[midi]
diff2 = abs(l2 - r2)
print(min(diff1, diff2)) |
p03126 | s486765454 | Wrong Answer | n,m=map(int,input().split())
f=[0]*(m+1)
count=0
for i in range(n):
a=list(map(int,input().split()))
k=a[0]
a=a[1:]
for i in range(k):
f[a[i]]+=1
for i in range(m):
if f[i]==n:
count+=1
print(count) |
p03607 | s197281422 | Wrong Answer | n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
a=int(input())
list.append(a)
list=sorted(list)
for i in range(n):
if i!=0:
if list[i]==list[i-1]:
sa+=1
else:
sas=sa
sa=1
if sas%2!=0:
ans+=1
print(ans) |
p02622 | s169185433 | Accepted | a = list(input())
b = list(input())
ans = 0
for p, q in zip(a, b):
if p != q:
ans += 1
print(ans)
|
p03556 | s184866109 | Wrong Answer | import math
x=int(input())
print(int(math.sqrt(x))) |
p02607 | s595875191 | Accepted | import sys
import math
import itertools
import random
n=int(input())
a=list(map(int, input().split()))
cnt=0
for i in range(n):
if(i%2==0 and a[i]%2==1):
cnt+=1
print(cnt) |
p03075 | s149750997 | Accepted | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
l = []
l.append(a)
l.append(b)
l.append(c)
l.append(d)
l.append(e)
ans = 0
for i in range(5):
for j in range(i+1,5):
if l[j] - l[i] > k :
ans += 1
if ans == 0 :
print("Yay!")
else :
print(":(")
|
p03456 | s584824255 | Accepted | a, b = map(str, input().split())
s = int(a+b)
for i in range(1, s+1):
if i**2 == s:
print('Yes')
exit()
else:
print('No')
|
p03814 | s719468538 | Accepted | s=input()
#Aのインデックス
num_a=s.index("A")
#Zのインデックス
num_z=len(s)-1-s[::-1].index("Z")
print(num_z-num_a+1) |
p02797 | s633908224 | Wrong Answer | n,k,s = map(int,input().split())
ans = []
kazu = 0
for i in range(n):
if kazu != k:
ans.append(s)
kazu += 1
else:
ans.append(s+1)
for i in ans:
print(i,end=' ')
print()
|
p03041 | s202590124 | Wrong Answer | n,k=map(int,input().split())
s=input()
print(s.replace(s[k-1],s[k-1].lower(),1)) |
p03862 | s588748735 | Accepted | n, x = map(int, input().split())
a_list = list(map(int, input().split()))
cnt = 0
for i in range(n-1):
total = a_list[i] + a_list[i+1]
if total > x:
diff = total - x
cnt += diff
if a_list[i+1] >= diff:
a_list[i+1] -= diff
else:
a_list[i] = diff - a_list[i+1]
a_list[i+1] = 0
print(cnt) |
p02785 | s354005258 | Accepted | # coding: utf-8
import heapq
n,k = [int(x) for x in input().split()]
h = sorted([int(x) for x in input().split()])
#print(h)
s = 0
if k >= n:
print(0)
else:
h = h[:n-k]
for j in h:
s += j
print(s) |
p02688 | s544454152 | Accepted | n,k = map(int,input().split())
count = [0]*n
for _ in range(k):
d = int(input())
a = map(int,input().split())
for i in a:
count[i-1]+=1
ans = 0
for i in count:
if i == 0:
ans += 1
print(ans) |
p04029 | s795282290 | Wrong Answer | n = int(input())
print(n*(n+1)/2) |
p03835 | s544185344 | Accepted | K, S = list(map(int, input().split()))
cnt = 0
for x in range(K + 1):
for y in range(K + 1):
if 0 <= S - x - y <= K:
cnt += 1
print(cnt) |
p03345 | s706703797 | Accepted | # coding:utf-8
a, b, c, k = map(int, input().split())
if abs(a - b) > 10 ** 18:
print('Unfair')
elif k % 2 == 0:
print(a - b)
else:
print(b - a)
|
p03371 | s581873665 | Accepted | #<100q.全探索（計算量注意）>
a, b, c, x, y = map(int,input().split())
ans1 = a * x + b * y
if x <= y:
ans2 = c * 2 * x + b * (y - x)
ans5 = c * 2 * y
else:
ans2 = c * 2 * y + a * (x - y)
ans5 = c * 2 * x
ans3 = a * x + c * 2 * y
ans4 = b * y + c * 2 * x
##print(ans1)
##print(ans2)
##print(ans3)
##print(ans4)
##print(ans5)
print(min(ans1,ans2, ans3, ans4, ans5))
|
p02833 | s946016869 | Wrong Answer | n = int(input())
if n < 2:
print(1)
elif n % 2 != 0:
print(0)
else:
ans = 0
for i in range(1, 100):
ans += n//(5**i*2)
print(ans)
|
p03779 | s178340477 | Wrong Answer | x = int(input())
ans = 0
k = 0
while x - k > 0:
for i in range(int((2*(x-k))**0.5),int((2*(x+1-k))**0.5)+2):
if i*(i+1) == 2*(x - k):
#print(i,k)
print(i+k)
break
else:
k += 1
continue
break
else:
print(k)
|
p02952 | s370004090 | Wrong Answer | S = input()
slen = len(S)
count = 0
for i in range(0,slen, 2):
if ( i == slen-1):
inv = 0 if i == 0 else 10 ** i
count = count + (int(S)-inv) + 1
# print(i, (int(S)-inv) + 1)
else:
count = count + 10 ** (i+1) - 10 ** (i)
# print(i, 10 ** (i+1) - 1)
print(count) |
p02623 | s151154904 | Accepted | import sys
from bisect import bisect
from itertools import accumulate
n, m, k, *ab = map(int, sys.stdin.buffer.read().split())
aaa = [0] + ab[:n]
bbb = [0] + ab[n:]
acc = list(accumulate(aaa))
bcc = list(accumulate(bbb))
ans = 0
for i in range(n + 1):
r = k - acc[i]
if r < 0:
break
j = bisect(bcc, r) - 1
ans = max(ans, i + j)
print(ans)
|
p02775 | s675876666 | Accepted | S = map(int, input())
a, b = 0, 1
for s in S:
a, b = min(a + s, b + 10 - s), min(a + (s + 1), b + 10 - (s + 1))
print(a) |
p02860 | s441345251 | Accepted | N = int(input())
S = input()
print('Yes' if (N % 2 == 0) and (S[:N // 2] == S[N // 2:]) else 'No')
|
p02724 | s192234511 | Wrong Answer | X = int(input())
hap_yen = int(X / 500)
to_hap_yen = hap_yen * 1000
remain_X = X - (hap_yen * 500)
remain_hap_yen = (remain_X / 5) * 5
total_hap_yen = to_hap_yen + remain_hap_yen
print(int(total_hap_yen)) |
p03481 | s479743278 | Accepted | X, Y = map(int, input().split())
ans = 0
while True:
if X <= Y:
ans += 1
X *= 2
else:
break
print(ans) |
p03317 | s959504916 | Accepted |
def solve():
N, K = map(int, input().split())
Ax = list(map(int, input().split()))
if N == K:
print(1)
exit()
N -= K
ans = 1
while N > 0:
N = N-(K-1)
ans += 1
print(ans)
# Solve
if __name__ == "__main__":
solve()
|
p02725 | s182006423 | Accepted | k,n = map(int,input().split())
a_list = list(map(int,input().split()))
re_a = []
for x in a_list:
re_a.append(x-k)
a_list_add_re = re_a+a_list
result = []
x = n - 1
for i in range(len(a_list_add_re)-x):
result.append(a_list_add_re[i+x] - a_list_add_re[i])
print(min(result)) |
p02546 | s947820874 | Wrong Answer | N=input()
l=len(N)
if(N[:l]=='e'):
print(N+'s')
elif(N[-1]=='x'):
print(N+'s')
else:
print(N+'es') |
p03377 | s858523903 | Accepted | def main():
a, b, x = map(int, input().split())
if a+b < x or a > x:
print("NO")
else:
print("YES")
if __name__ == "__main__":
main() |
p04043 | s509322291 | Wrong Answer | #!/usr/bin/env python3
import sys
if sorted(sys.stdin.read().split(' ')) == ['5', '5', '7']:
print('YES')
else:
print('NO') |
p03745 | s505975667 | Accepted | def f(n,a):
if n==1:
print(1)
exit()
pre=a[1]-a[0]
ans=1
for i in range(2,n):
if pre*(a[i]-a[i-1])<0:
pre=0
ans+=1
else:
if a[i]-a[i-1]:###
pre=a[i]-a[i-1]
return ans
n=int(input())
*a,=map(int,input().split())
print(f(n,a)) |
p02897 | s587708088 | Wrong Answer | n=int(input())
if n==1:
print('1,0')
elif n%2==0:
print(n//2/n)
else:
print(n/2/n) |
p03345 | s201619520 | Wrong Answer | a,b,c,k=map(int,input().split())
inf=10**18+1
flag=True
nin=min(a,b,c)
temp=1
for j in range(k):
temp*=nin
if temp>inf:
flag=False
break
if flag:
for j in range(k):
tempa=a
tempb=b
tempc=c
a=tempb+tempc
b=tempa+tempc
c=tempa+tempb
ans=a-b
if not(flag) or abs(ans)>inf:
print('Unfair')
else:
print(ans) |
p03127 | s385659195 | Accepted | import fractions
n = int(input())
a = list(map(int, input().split()))
ans = a[0]
for x in a:
ans = fractions.gcd(ans, x)
print(ans) |
p02664 | s880770164 | Accepted | T = list(input())
for i in range(len(T)):
if T[i] == '?':
T[i] = 'D'
print(''.join(T)) |
p03696 | s110665878 | Accepted | from collections import deque
def main():
N = int(input())
S = list(input())
Stmp = S.copy()
Stmp = deque(Stmp)
cnt = 0
for s in S:
cnt += (s=='(') - (s==')')
if cnt < 0:
Stmp.appendleft('(')
cnt += 1
for _ in range(cnt):
Stmp.append(')')
print(''.join(Stmp))
if __name__ == "__main__":
main()
|
p03380 | s864598555 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a_i = max(a)
a.sort(key=lambda x: abs(a_i/2-x))
print(a_i, a[0])
|
p02696 | s566384833 | Accepted | import math
A, B, N = list(map(int, input().split()))
ans = 0
if B+1 < N:
C = B+1
else:
C = N
if B//A == 0:
D = 1
elif B//A > 1:
D = B//A-1
else:
D = B//A
for i in range(1, C+1, D):
val = math.floor(A*i/B) - A*math.floor(i/B)
#print("i", i, "val", val)
ans = max(ans, val)
print(ans)
|
p02713 | s023978291 | Accepted | import math
import math
from functools import reduce
#import itertools
#import statistics
#import numpy as np
#import collections
n = int(input())
#h = list(map(int, input().split()))
#h, w = list(map(int, input().split()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
ans += gcd(i, j, k)
#print(gcd(27, 18, 3))
print(ans)
|
p03699 | s162063690 | Accepted | def main():
N = int(input())
A = [int(input()) for _ in range(N)]
s = sum(A)
if s%10 != 0:
print(s)
return
m = 10000
for a in A:
if a%10 != 0:
m = min(m, a)
print(s - m if m != 10000 else 0)
return
if __name__ == '__main__':
main() |
p03994 | s362115250 | Accepted | #codinf utf-8
s = list(input())
K = int(input())
N = len(s)
alp = [chr(i) for i in range(97, 97+26)]
for i in range(N):
idx = alp.index(s[i])
if K + idx >= 26 and idx != 0:
K = K - ( 26 - idx )
s[i] = 'a'
if K == 0:
break
if K > 0:
id = alp.index(s[N-1])
id_ = ( id + K ) % 26
s[N-1] = alp[id_]
print(''.join(s)) |
p02820 | s850470800 | Accepted | import sys
readline = sys.stdin.readline
N,K = map(int,readline().split())
R,S,P = map(int,readline().split())
T = list(readline().rstrip())
P = {"r":P,"s":R,"p":S}
ans = 0
for i in range(len(T)):
if i < K:
ans += P[T[i]]
continue
if T[i] == T[i - K]:
T[i] = "x"
else:
ans += P[T[i]]
print(ans) |
p03309 | s166704038 | Accepted | N = int(input())
A = list(map(int, input().split()))
import math
B = sorted([a-i for i,a in enumerate(A, start=1)])
ans = []
if N%2 == 1:
b = B[N//2]
ans.append(sum([abs(x - b) for x in B]))
else:
b_left = (B[N//2 - 1] + B[N//2])//2
b_right = math.ceil((B[N//2 - 1] + B[N//2])/2)
ans.append(sum([abs(x - b_left) for x in B]))
ans.append(sum([abs(x - b_right) for x in B]))
print(min(ans)) |
p02771 | s367957446 | Accepted | ABC = set(map(int, input().split()))
print("Yes" if len(ABC) == 2 else "No") |
p03219 | s314286363 | Wrong Answer | n,m = map(int,input().split())
print(n+(m/2)) |
p03778 | s177936380 | Wrong Answer | w,a,b = map(int,input().split())
c = b - a
if c - w >= 0:
print(c - w)
else:
print("0") |
p02923 | s483387565 | Accepted | N = int(input())
H = list(map(int, input().split()))
base = H[-1]
cnt = 0
ans = 0
if N == 1:
print(0)
else:
for h in H[N-2::-1]:
if base <= h:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
base = h
print(max(ans,cnt)) |
p03774 | s901886881 | Wrong Answer | N,M=map(int,input().split())
A=[list(map(int,input().split())) for i in range(N)]
C=[list(map(int,input().split())) for i in range(M)]
for i in range(N):
z=10**10
ans=0
for t in range(M):
if abs(A[i][0]-C[t][0])+abs(A[i][0]-C[t][1])<z:
z=abs(A[i][0]-C[t][0])+abs(A[i][0]-C[t][1])
ans=t+1
else:
continue
print(ans) |
p02909 | s751928589 | Wrong Answer | # -*- coding:utf-8 -*-
S = input()
if S == "Sunny":
print("Cloudy")
elif S == "Cloudy":
print("Rainy")
else:
print("Rainy")
|
p02989 | s974213510 | Wrong Answer | import sys
N = int(input())
D = sorted(list(map(int,input().split())))
if N % 2 != 0:
print(0)
sys.exit()
low = D[0:N//2]
high = D[N//2::]
cnt = 0
flg = True
for i in range(low[-1] - 1, min(high) + 1):
flg = False
flg = all( i > x for x in low )
flg |= all( i >= x for x in high )
if flg == True:
cnt = cnt + 1
print(cnt)
|
p03284 | s408857900 | Wrong Answer | N,K=map(int,input().split())
print(N%K) |
p03435 | s895693976 | Accepted | def l(): return list(map(int, input().split()))
def m(): return map(int, input().split())
def main():
c = [0]*3
for i in range(3):
c[i] = l()
for i in range(2):
x = c[2][i+1] - c[2][i]
for j in range(2):
if c[j][i+1] - c[j][i] != x:
print('No')
exit()
print('Yes')
if __name__ == '__main__':
main() |
p02629 | s024153237 | Wrong Answer | N=int(input())
N = 27
ans = ""
def n(N):
ans= ""
for i in range(N):
if N%26 ==0:
ans = "z" +ans
N -= 1
else:
ans = chr(64+ N%26) +ans
if N <= 26:
break
N = N // 26
return ans
for i in range(1,10000):
print(n(i))
print(ans.lower()) |
p03284 | s975444027 | Accepted | n,k=map(int,input().split())
if n%k==0:
print(0)
else:
print(1) |
p03693 | s108115393 | Wrong Answer | r,g,b=map(int,input().split())
if (r*100+g*10+b) % 4 == 0:
print("Yes")
else:
print("No") |
p02646 | s417274871 | Accepted | def resolve():
a, v = map(int, input().split())
b, w = map(int, input().split())
T = int(input())
if v <= w:
print("NO")
return
if abs(a - b) <= T * abs(v - w):
print("YES")
else:
print("NO")
resolve() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.