problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02785 | s213054373 | Wrong Answer | import sys
import math
from collections import deque
input = sys.stdin.readline
N, K = map(int,input().split())
H = deque(map(int,input().split()))
ans = 0
for i in range(N-K):
ans += H[i]
print(ans) |
p02622 | s293881004 | Wrong Answer | input_str1 = input()
input_str2 = input()
sum([input_str1[i]!=input_str2[i] for i in range(len(input_str1))]) |
p02725 | s692073480 | Accepted | import math
k, n = map(int,input().split())
a = list(map(int,input().split()))
ans = 10**9
for i in range(n):
if i == 0:
a1 = a[-1]-a[0]
a2 = a[0]+(k-a[1])
ans = min(ans,a1,a2)
else:
a1 = (k-a[i])+a[i-1]
ans = min(ans,a1)
print(ans)
|
p03035 | s951464032 | Wrong Answer | a, b = map(int, input().split())
if a >= 13:
print(b)
elif a >= 5:
print(b//2)
else:
print(0)
|
p03262 | s944306390 | Wrong Answer | N,X=map(int,input().split())
*C,=map(int,input().split())
t=[c-X for c in C]
import math
from functools import reduce
print(reduce(math.gcd, t)) |
p02760 | s099943832 | Wrong Answer | A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
m = [[0]*3 for i in range(3)]
ans,l,r = 0,1,1
for _ in range(N):
b = int(input())
for i in range(3):
if b in A[i]:
m[i][A[i].index(b)]=1
for i in range(3):
l *= m[i][i]
t,y = 1,1
for j in range(3):
y *= m[j][i]
t *= m[i][j]
if i+j == 2:
r *= m[i][j]
if t or y or r or l:
ans=1
print('Yes' if ans else 'No') |
p02582 | s393004640 | Accepted | W = list(input())
ans = []
a = 0
for i in W:
if i == 'R':
a += 1
else:
ans.append(a)
a = 0
ans.append(a)
print(max(ans))
|
p02860 | s496526921 | Accepted | N = int(input())
S = str(input())
T = S[0:N//2]
if S == (T+T):
print('Yes')
else:
print('No') |
p02659 | s602856203 | Wrong Answer | from sys import stdin
input = stdin.readline
def main():
A, B = input().split()
A = int(A)
B = int(100*float(B))
print((A*B)//100)
if(__name__ == '__main__'):
main()
|
p03219 | s755810609 | Wrong Answer | x, y = map(int, input().split())
print(x + y/2) |
p02675 | s945090048 | Accepted | n=input()
if int(n[-1]) in [2, 4, 5, 7, 9]:
print("hon")
elif int(n[-1]) in [0, 1, 6, 8]:
print("pon")
else:
print("bon") |
p02801 | s372068894 | Accepted | # -*- coding: utf-8 -*-
a = input()
print(chr(ord(a)+1)) |
p02866 | s594175773 | Wrong Answer | n = int(input())
d = list(map(int ,input().split()))
d.sort()
mod = 998244353
s = [0 for i in range(max(d)+1)]
for i in range(n):
s[d[i]] += 1
ans = 1
for i in range(len(s)):
if s[i] == 0:
print (0)
exit()
if i == 0:
if s[i] > 1:
print (0)
exit()
continue
ans *= s[i-1]**(s[i])
ans %= mod
print (ans) |
p03693 | s307441597 | Wrong Answer | a,b,c = list(map(int,input().strip().split()))
if a*100 + b*10 +c %4 ==0:
print("YES")
else:
print("NO") |
p02598 | s696488259 | Accepted | n, k, *aa = map(int, open(0).read().split())
imp_length = 0
psbl_length = max(aa)
while psbl_length - imp_length > 1:
mid = (psbl_length + imp_length) // 2
cost = sum(0 - -a // mid - 1 for a in aa)
if cost <= k:
psbl_length = mid
else:
imp_length = mid
print(psbl_length) |
p02973 | s082531732 | Accepted | from bisect import bisect
N = int(input())
dp = [1]*N
for _ in range(N):
a=-int(input())
n=bisect(dp,a)
dp[n]=a
print(sum(1 for i in dp if i <= 0)) |
p02576 | s640039962 | Wrong Answer | n, x, t = map(int, input().split())
yash = n / x
pattu = yash * t
print(int(pattu)) |
p03323 | s874925413 | Accepted | A,B = map(int,input().split())
if A < 9 and B < 9:
print('Yay!')
else:
print(':(') |
p03239 | s967489297 | Wrong Answer | n,T= map(int,input().split())
min = 1000
for i in range(n):
c,t = map(int,input().split())
if T >= t and min > c:
min = c
if min ==1000:
print('TLE')
else:
print(min) |
p02572 | s485808352 | Accepted | import sys
import itertools
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
A = A[::-1]
B = list(itertools.accumulate(A))
MOD = 10**9+7
ans = 0
for i in range(N - 2, -1, -1):
ans = (ans + A[i + 1] * B[i]) % MOD
print(ans)
if __name__ == '__main__':
main()
|
p02882 | s726810404 | Wrong Answer | import math
a,b,x=map(int,input().split())
if x==a*a*b:
print(90)
elif x/2>=a*b/2:
tangent=a**2 / ((a*b-x/a)*2)
print(90-math.atan(tangent)*180/math.pi)
else:
tangent=2*x/(a*(b**2))
print(90-math.atan(tangent)*180/math.pi)
|
p02988 | s239732206 | Accepted | n = int(input())
p = list(map(int,input().split(' ')))
c = 0
for i in range(1, len(p)-1):
f = p[i-1]
s = p[i]
t = p[i+1]
ma = max(f,t)
mi = min(f,t)
if s > mi and s < ma:
c += 1
print(c) |
p03210 | s478542392 | Accepted | X=int(input())
if X==7 or X==5 or X==3:
print("YES")
else:
print("NO") |
p03012 | s125469465 | Accepted | n = int(input())
w = [int(s) for s in input().split()]
acc = [sum(w[:x]) for x in range(1, n + 1)]
center = acc[n - 1] / 2
index = 0
for i in range(n):
if acc[i] >= center:
if abs(center - acc[i]) < abs(center - acc[i - 1]):
index = i
else:
index = i - 1
break
print(abs((acc[n - 1] - acc[index]) - acc[index])) |
p02848 | s472269195 | Accepted | n = int(input())
s = input()
t = ''
for i in range(len(s)):
num = ord(s[i]) + n
if num > 90: t += chr(num-26)
else: t += chr(num)
print(t) |
p02623 | s613190042 | Wrong Answer | n , m , k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
counter = 0
while k >= 0:
if len(a) == 0 and len(b) == 0:
break
elif len(a) == 0:
k -= b.pop(0)
elif len(b) == 0:
k -= a.pop(0)
else:
if a[0] > b[0]:
k -= b.pop(0)
else:
k -= a.pop(0)
counter += 1
if k < 0:
counter -= 1
print(counter)
|
p02861 | s903369317 | Accepted | import itertools
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
citys = [i for i in range(n)]
roots = list(itertools.permutations(citys))
sum = 0
for root in roots:
for i in range(n-1):
sum += ((xy[root[i]][0] - xy[root[i+1]][0])**2 + (xy[root[i]][1] - xy[root[i+1]][1])**2)**(0.5)
print(sum/len(roots))
|
p03679 | s773132211 | Accepted | X,A,B=map(int,input().split())
date=A-B
if date>=0:
ans="delicious"
elif abs(date)>X:
ans="dangerous"
else:
ans="safe"
print(ans) |
p03252 | s361280728 | Wrong Answer | from collections import Counter
s=input()
t=input()
c1=Counter(s)
c2=Counter(t)
k1=sorted(c1.keys())
k2=sorted(c2.keys())
if len(k1)==len(k2):
for i in range(len(k1)):
if c1[k1[i]]!=c2[k2[i]]:
print('No')
exit()
print('Yes')
else:
print('No') |
p02657 | s556584302 | Wrong Answer | import sys
A,B=list(map(int,sys.stdin.readline().split()))
if A%2==0:
print(A*B)
else:
print('k') |
p03679 | s387849372 | Wrong Answer | x,a,b = map(int, input().split())
if b - a <= x:
print("safe")
elif b - a <= 0 :
print("delicious")
else:
print("dangerous") |
p02628 | s182307432 | Accepted | n,k = map(int,input().split())
p = list(map(int,input().split()))
p = sorted(p)
ans = 0
for i in range(k):
ans += p[i]
print(ans) |
p03612 | s040638140 | Wrong Answer | N = int(input())
p = list(map(int,input().split()))
cnt = 0
for i in range(N):
if p[0] == 1:
value = p[i]
p[i] = p[i+1]
p[i+1] = value
cnt += 1
elif p[i] == i+1:
value = p[i]
p[i] = p[i-1]
p[i-1] = value
cnt += 1
print(cnt)
|
p03434 | s520507376 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
t=0
for i in range(len(a)):
if i%2==0:
t+=a[n-i-1]
else:
t-=a[n-i-1]
print(t) |
p02742 | s340639260 | Wrong Answer | H,W = (int(x) for x in input().split())
if (H*W)%2==1:
print(int((H*W-1)//2 + 1))
else:
print(int((H*W)//2)) |
p02727 | s587045457 | Accepted | x, y, a, b, c = map(int, input().split())
p = [int(x) for x in input().split()]
p.sort(reverse=True)
p = p[:x]
q = [int(x) for x in input().split()]
q.sort(reverse=True)
q = q[:y]
r = [int(x) for x in input().split()]
r.sort(reverse=True)
sub = p+q+r
sub.sort(reverse=True)
ans = sum(sub[:x+y])
print(ans) |
p03723 | s602225203 | Wrong Answer | a,b,c = list(map(int, input().strip().split()))
f=0
if a==b and b==c:
f=-1
print(f)
else:
while a%2==0 and b%2==0 and c%2==0:
A=a
B=b
C=c
a=B//2+C//2
b=A//2+C//2
c=A//2+B//2
f=f+1
else:
print(f) |
p03076 | s467875136 | Accepted | dish = list(int(input()) for _ in range(5))
res = 0
s = 0
for i in dish:
i %= 10
if i != 0:
res = max(res, 10 - i)
s += 10 - i
print(sum(dish) + s - res)
|
p03723 | s953019232 | Wrong Answer | A,B,C = map(int, input().split())
def even(a):
if a % 2 == 0:
return True
else:
return False
cnt = 0
if A == B and B == C:
cnt = -1
elif not (even(A) and even(B) and even(C)):
cnt = 0
else:
cnt = 0
while even(A) and even(B) and even(C):
tmp1, tmp2, tmp3 = A,B,C
A = (tmp2+tmp3) // 2
B = (tmp3+tmp1) // 2
C = (tmp1+tmp2) // 2
cnt += 1
print(cnt)
|
p02553 | s301943685 | Accepted | # -*- coding: utf-8 -*-
# 整数の入力
lis = list(map(int,input().split()))
lists = []
inc = 0
# スペース区切りの整数の入力
for i in range(2):
for j in range(2):
lists.append(lis[i]*lis[j+2])
inc += 1
# 出力
print("{}".format(max(lists))) |
p03767 | s813814182 | Accepted | n = int(input())
as_ = list(map(int, input().strip().split()))
as_ = sorted(as_, reverse=True)
total = sum([as_[i] for i in range(n * 2) if i % 2 == 1])
print(total)
|
p02881 | s021129811 | Accepted | #144_C
import math
n = int(input())
m = math.floor(math.sqrt(n))
div = 1
for i in range(1,m+1):
if n % i == 0:
div = i
print(int(div + n/div -2)) |
p03817 | s930287930 | Accepted | x = int(input())
jitubu = x//11
tiisai = x-(jitubu*11)
if x%11 == 0:
print(jitubu*2)
elif tiisai>6:
print((jitubu*2)+2)
else:
print((jitubu*2)+1)
|
p02646 | s390414161 | Accepted | a,v = map(int,input().split())
b,w = map(int,input().split())
t=int(input())
if abs(b - a) <= (v - w) * t:
print('YES')
else:
print('NO') |
p02795 | s080678460 | Wrong Answer | H = int(input())
W = int(input())
N = int(input())
count = 0
n_black = 0
list_mesh = [H, W]
while n_black < N:
id_max = list_mesh.index(max(list_mesh))
n_black += list_mesh[id_max]
list_mesh[id_max] -= 1
count += 1
print(count) |
p03997 | s982262549 | Accepted | a,b,h=[int(input()) for i in range(0,3)]
print((a+b)*h//2)
|
p03778 | s785550699 | Accepted | # https://atcoder.jp/contests/abc056/tasks/abc056_b
W, a, b = map(int, input().split())
if a < b and a+W < b:
ans = abs(a+W - b)
elif b < a and b+W < a:
ans = abs(b+W - a)
else:
ans = 0
print(ans) |
p02838 | s867743752 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(61):
count0=0
count1=0
for j in a:
if not (j>>i & 1):
count0+=1
if j>>i & 1:
count1+=1
ans+=((count0*count1)*(2**i))%mod
print(count0,count1)
print(ans%mod) |
p03284 | s143401126 | Accepted | n,k = map(int,input().split())
if n%k:
print(1)
else:
print(0) |
p03379 | s367898772 | Wrong Answer | n = int(input())
li = list(map(int,input().split()))
lee = len(li)
sorted_li = sorted(li)
mid = sorted_li[lee//2]
mid_next = sorted_li[lee//2-1]
for l in li:
if l != mid:
print(mid)
else:
print(mid_next) |
p03407 | s162589109 | Accepted | a,b,c = map(int,(input().split()))
if a+b >= c:
print("Yes")
else:
print("No") |
p02951 | s734481463 | Accepted | a,b,c = map(int,input().split())
if(b+c >= a):
print(b+c-a)
else:
print(0)
|
p02630 | s014810763 | Accepted | #D
#バケットnum[v]:=A1,A2,...,Anの中に値vが何個あるか を作って考える
n = int(input())
a = list(map(int,input().split()))
q = int(input())
#合計を計算しておく
sum_a = sum(a)
#バケットの作成
v = [0 for _ in range(10**5)]
for i in range(n):
v[a[i]-1] += 1
# main loop
for i in range(q):
b,c = map(int,input().split())
sum_a += (c - b)* v[b-1]
v[c-1] += v[b-1]
v[b-1] = 0
print(sum_a) |
p02882 | s772213110 | Wrong Answer | a,b,x= map(int,input().split())
import math
print(math.degrees(math.atan(a*b*b/(2*x)))) |
p03041 | s611886473 | Accepted | def main():
n,k=map(int,input().split(' '))
s=input()
print(s[0:k-1],end='')
print(s[k-1].lower(),end='')
print(s[k:n+1])
main()
|
p03493 | s735171269 | Wrong Answer | s=input()
c=0
for i in range(0,3):
if s[i]==1:
c+=1
print(c) |
p03475 | s810732399 | Accepted | N=int(input())
CSF=[list(map(int,input().split())) for _ in range(N-1)]
for j in range(N):
t=0
for i in range(j,N-1):
if t<CSF[i][1]:
t=CSF[i][1]
else:
x=(t-1)//CSF[i][2]+1
t=CSF[i][2]*x
t+=CSF[i][0]
print(t) |
p03293 | s495624961 | Accepted | S = list(input())
T = list(input())
flag = True
for _ in range(len(S)):
last = S.pop()
S.insert(0, last)
if S == T:
print('Yes')
flag = False
break
if flag:
print('No') |
p02706 | s595469163 | Wrong Answer | n, m = map(int,input().split())
a_list = list(map(int,input().split()))
r = n-sum(a_list)
print(r if r > 0 else -1)
|
p03720 | s958103615 | Accepted | n, m = map(int, input().split())
ab = [0] * m
for i in range(m):
ab[i] = list(map(int, input().split()))
roads = [0] * n
for a, b in ab:
roads[a-1] += 1
roads[b-1] += 1
for i in roads:
print(i)
|
p03345 | s428171197 | Wrong Answer | A, B, C, K = map(int, input().split())
if K % 2 == 0:
ans = B - A
if abs(ans) > 10**18:
print("Unfair")
else:
print(ans)
else:
ans = A - B
if abs(ans) > 10**18:
print("Unfair")
else:
print(ans) |
p03317 | s742461131 | Accepted | n,k=map(int,input().split())
k-=1
a=list(map(int, input().split()))
i=n-1
print(-(-i//k)-(-(n-i-1)//k))#pythonで切り上げの書き方 |
p03778 | s068288219 | Accepted | W,a,b = map(int,input().rstrip().split(" "))
if abs(a-b) <= W:print(0)
else:print(abs(a-b) - W) |
p02831 | s921371212 | Wrong Answer | import fractions
a, b = map(int, input().split())
print(a * b / fractions.gcd(a, b)) |
p03544 | s200112853 | Accepted | n = int(input())
l = [2,1]
for i in range(2,n+1):
a = l[-1]+l[-2]
l.append(a)
print(l[-1])
|
p02693 | s572974391 | Wrong Answer | K = int(input())
S = input().split()
A = int(S[0])
B = int(S[1])
for i in range(A, B + 1):
if i % K == 0:
print("OK")
break
exit()
print("NG")
|
p02983 | s137458214 | Wrong Answer | L, R = map(int, input().split())
ans = 10**9
for i in range(L, R):
for j in range(i+1, R+1):
tmp = (i*j) % 2019
if tmp == 0:
print(ans)
exit(0)
else:
ans = min(ans, tmp)
print(ans)
|
p02729 | s210624204 | Wrong Answer | N,M=map(int, input().split())
print((N+M)*(N+M-1)/2-N*M) |
p03327 | s307630168 | Wrong Answer | n=int(input())
if n<1000:
print('ABC'+str(n))
else:
print('ABD'+str(n)) |
p02731 | s258358144 | Accepted | n = int(input())
a=n/3
print(a*a*a) |
p03471 | s705526813 | Wrong Answer | N, Y = map(int, input().split())
for a in range(N):
for b in range(N):
for c in range(N):
if 10000 * a + 5000 * b + 1000 * c == Y and a + b + c == N:
print(a,b,c)
exit()
print(-1,-1,-1) |
p02917 | s156022113 | Accepted | n = int(input())
b = list(map(int, input().split()))
ans = b[0] + b[n-2]
for i in range(n-2):
ans += min(b[i], b[i+1])
print(ans)
|
p03434 | s795197367 | Wrong Answer | a = sorted(map(int, input().split()))[::-1]
print(sum(a[::2])-sum(a[1::2])) |
p02624 | s543511935 | Wrong Answer | n=int(input())
ans=0
lastk=n
for i in range(1,n+1):
if i>=lastk:
break
k=n//i
ans+=k*(k+1)//2*i
ans+=i*(i-1)//2*(lastk+k+1)*(lastk-k)//2
lastk=k
print(ans)
|
p02640 | s570847206 | Wrong Answer | X, Y = map(int, input().split())
if Y%X ==0 or Y%X ==2 or Y%X ==4:
if Y/X <= 4:
print("Yes")
exit()
else:
print("No")
exit()
print("No") |
p03681 | s003941781 | Wrong Answer | N,M = map(int,input().split())
MOD = 10 ** 9 + 7
if abs(N-M) >= 2:
print(0)
exit()
N,M = max(N,M),min(N,M)
fctr_M = 1
for i in range(1,M+1):
fctr_M *= i
fctr_M %= MOD
ans = fctr_M * fctr_M
ans %= MOD
ans *= N
if N == M:
ans *= 2
ans %= MOD
else:
ans *= N
ans %= MOD
print(ans)
|
p03544 | s419580556 | Accepted | N = int(input())
L = [0] * (N+1)
L[0] = 2
L[1] = 1
for i in range(2,N+1):
L[i] = L[i-1] + L[i-2]
print(L[N])
|
p03854 | s882302038 | Accepted | s = input()
s = s[::-1]
s = s.replace('resare','/')
s = s.replace('esare', '/')
s = s.replace('remaerd','/')
s = s.replace('maerd','/')
s = s.replace('/', '')
if len(s) == 0:
print('YES')
else:
print('NO') |
p02900 | s602945522 | Accepted | A, B = map(int, input().split())
def prime_factor(n):
d = set()
for i in range(2, n + 1):
if i * i > n:
break
while n % i == 0:
d.add(i)
n //= i
if n != 1:
d.add(n)
return d
a = prime_factor(A)
b = prime_factor(B)
print(len(set(a) & set(b)) + 1)
|
p02584 | s862512497 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
x, K, D = map(int, readline().split())
if x - K * D >= 0:
print(abs(x - K * D))
elif x + K * D <= 0:
print(abs(x + K * D))
else:
low, high = 0, K
while high - low > 1:
mid = (high + low) // 2
if x + (-K + 2 * mid) * D <= 0:
low = mid
else:
high = mid
print(min(abs(x + (-K + 2 * low) * D), abs(x + (-K + 2 * high) * D))) |
p03338 | s874583210 | Accepted | n=int(input())
s=input()
result = 0
for i in range(1,n):
x = s[:i]
y = s[i:]
x_set = set(x)
y_set = set(y)
num = x_set & y_set
result = max(result, len(num))
print(result)
|
p02645 | s401459962 | Wrong Answer | name = input()
for i in range(3):
print(name[i]) |
p02790 | s888148846 | Wrong Answer | a,b=map(int,input().split())
c=str("a")*b
d=str("b")*a
if a>=b:
print(d)
else:
print(c)
|
p03309 | s873460236 | Accepted | import collections
n=int(input())
a=list(map(int,input().split() ))
absa=[]
za=[]
for i in range(n):
za.append(a[i]-(i+1))
#print(za)
#print(sum(za))
za.sort()
z=sum(za)
#print(z)
if n%2==1:
b=za[n//2]
else:
b=(za[n//2-1]+za[n//2])//2
#print(b)
for i in range(n):
absa.append(abs(a[i]-(b+(i+1))))
#print(absa)
print(sum(absa))
|
p03105 | s839365282 | Accepted | a,b,c = map(int,input().split())
oto = b // a
if oto <= c :
print(oto)
elif oto > c :
print(c)
|
p03319 | s419221182 | Accepted | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
if (n-1) % (k-1) == 0:
print((n-1)//(k-1))
else:
print((n-1)//(k-1)+1) |
p02831 | s119172164 | Accepted | from fractions import gcd
def lcm(x, y):
return (x * y) // gcd(x, y)
A, B = map(int, input().split())
print(lcm(A, B))
|
p03637 | s805845621 | Accepted | n = int(input())
a = list(map(int, input().split()))
c0 = c1 = c2 = 0
for i in a:
if i % 4 == 0:
c0 += 1
elif i % 2:
c1 += 1
else:
c2 += 1
if c2:
if c1 <= c0:
print('Yes')
else:
print('No')
else:
if c1 <= c0 + 1:
print('Yes')
else:
print('No') |
p03284 | s510120903 | Wrong Answer | tmp = input().split(" ")
N = int(tmp[0])
K = int(tmp[1])
print(N % K)
print(1) if N % K else print(0) |
p03145 | s487015651 | Accepted | from sys import stdin
def main():
readline=stdin.readline
c,a,b=map(int,readline().split())
print(c*a//2)
if __name__=="__main__":
main() |
p02576 | s623743571 | Accepted | from math import ceil
n,x,t=map(int, input().split())
val=ceil(n/x)
#print(val)
print(t*val) |
p02699 | s365425192 | Accepted | s,w = map(int, input().split())
if w >= s: print("unsafe")
else: print("safe") |
p03633 | s528913687 | Wrong Answer | N=int(input())
T=list(int(input()) for _ in range(N))
def gcd(a, b):
while b:
a, b = b, a%b
return a
l=T[0]
for t in T:
l=l / gcd(l, t) * t
print(l) |
p02753 | s282534523 | Accepted | S = input()
if 'A' in S and 'B' in S:
print('Yes')
else:
print('No') |
p03796 | s580794371 | Accepted | N = int(input())
mod = 10**9+7
power = 1
for i in range(1,N+1):
power = power*i%mod
print(power) |
p03386 | s132155751 | Wrong Answer | a,b,k=map(int,input().split())
r=range(a, b+1)
for i in sorted(set(r[:k]) or set(r[-k:])):
print(i) |
p02773 | s210850758 | Accepted | N = int(input())
S = [input() for i in range(N)]
d = dict()
for s in S:
if s in d:
d[s] += 1
else:
d[s] = 1
l = sorted(d.items(), key=lambda x: x[1], reverse=True)
maxv = l[0][1]
res = []
for x in l:
if x[1] == maxv:
res.append(x[0])
for x in sorted(res):
print(x)
|
p03645 | s870495363 | Wrong Answer | N,M=map(int,input().split())
l,r=[0]*N,[0]*N
for i in range(M):
a,b=map(int,input().split())
if a==1:
l[b-1]==1
if b==N:
r[a-1]==1
for i in range(N):
if l[i]+r[i]==2:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') |
p03059 | s508800505 | Accepted | a,b,t=map(int,input().split())
print((t//a)*b) |
p03623 | s699416512 | Accepted | x,a,b=map(int,input().split())
ad=abs(x-a)
bd=abs(x-b)
if ad > bd:
print("B")
elif ad < bd:
print("A") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.