problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02786 | s168496686 | Accepted | h = int(input())
i = 1
ans = 0
while h > 0:
ans += i
i *= 2
h //= 2
print(ans) |
p03481 | s206503544 | Wrong Answer | a = list(map(int,input().split()))
x = a[0]
y = a[1]
n = a[0]
count =1
while n <= y:
n = n * 2
count += 1
print(str(count)) |
p03210 | s219700263 | Accepted | X = int(input())
if X == 7 or X == 5 or X == 3:
print('YES')
else:
print('NO')
|
p03632 | s618414926 | Accepted | A,B,C,D = map(int,input().split())
M = [0]*100
for n in range(A,B):
M[n-1]+=1
for n in range(C,D):
M[n-1]+=1
print(M.count(2)) |
p03994 | s238545214 | Accepted | s=input()
k=int(input())
lens=len(s)
alp="azyxwvutsrqponmlkjihgfedcb"
ans=[]
for i in range(lens):
d=alp.index(s[i])
if k>=d:
k-=d
ans.append("a")
else:
ans.append(s[i])
las=ans.pop()
alp="abcdefghijklmnopqrstuvwxyz"
ans.append(alp[(alp.index(las)+k)%26])
print("".join(ans)) |
p03274 | s958816904 | Accepted | n, k = map(int, input().split())
X = list(map(int, input().split()))
ans = 10 ** 9
for i in range(n - k + 1):
x_min = X[i]
x_max = X[i + k - 1]
if x_min <= 0 <= x_max:
dist_min = min(abs(x_min), x_max)
dist_max = max(abs(x_min), x_max)
ans = min(ans, 2 * dist_min + dist_max)
else:
ans = min(ans, max(abs(x_min), abs(x_max)))
print(ans)
|
p03799 | s313705935 | Wrong Answer | N, M = map(int, input().split())
print((N * 2 + M) // 4)
|
p03474 | s618896425 | Wrong Answer | a,b=map(int,input().split())
S=input()
d=0
c=a+b+3
for i in range(a+b+1):
if S[i]=='-':
c=i+1
d+=1
if c==a+1:
print('Yes')
else:
print('No') |
p02959 | s248381109 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[i] <= b[i]:
ans += a[i]
b[i] -= a[i]
elif a[i] > b[i]:
ans += b[i]
b[i] = 0
if b[i] > 0:
if a[i+1] <= b[i]:
ans += a[i+1]
elif a[i+1] > b[i]:
ans += b[i]
print(ans) |
p02676 | s390147433 | Accepted | k = int(input())
s = input()
if (len(s) <= k):
print(s)
else:
print(s[:k] + "...") |
p02572 | s487276219 | Accepted | N = int(input())
A = [int(a) for a in input().split()]
mod = 10**9 + 7
print(((sum(A)**2 - sum([i**2 for i in A]))//2) % mod) |
p03481 | s191979659 | Accepted | # AtCoder Regular Contest 088
# C - Multiple Gift
X,Y=map(int,input().split())
count=0
while X<=Y:
X*=2
count+=1
print(count)
|
p03796 | s752950099 | Accepted | n=int(input())
i=1
j=1
while j!=n+1:
i=(i*j)%(10**9+7)
j+=1
print(i) |
p03478 | s686161552 | Wrong Answer | n, a, b = map(int, input().split())
x = 0
for i in range(n+1):
q = i
w = i / 10
e = i / 100
r = i / 1000
sum = q + w + e + r
if sum >= a and sum <= b:
x += i
print(x) |
p02988 | s236263552 | Wrong Answer | n = int(input())
number = input().split(" ")
ans = 0
for i in range(n-2):
if number[i] > number[i+1]:
if number[i+1] > number[i+2]:
ans += 1
elif number[i] < number[i+1]:
if number[i+1] < number[i+2]:
ans += 1
else:
pass
print(ans) |
p03075 | s211220690 | Accepted | a,b,c,d,e,k=[int(input())for _ in range(6)]
print(':(' if e-a>k else 'Yay!') |
p03062 | s551674436 | Wrong Answer | n=int(input())
a=[0]*n
a=map(int,input().split())
z=0
p=0
result=0
min=1000000002
for i in a:
if i<0:
z+=1
if i==0:
p=1
result+=abs(i)
if abs(i)<min:
min=abs(i)
if p==0 & z//2==1:
result-=min*2
print(result) |
p02860 | s582519750 | Accepted | import math
n = math.floor(int(input())/2)
s = input()
a = s[n:]
b = s[:n]
if a == b:
print('Yes')
else:
print('No') |
p03359 | s816563888 | Accepted | a, b = map(int, input().split())
ans = a - 1
if b >= a:
ans += 1
print(ans)
|
p02723 | s626048599 | Accepted |
S = input()
if S[2] == S[3] and S[4] == S[5]:
print("Yes")
else:
print("No") |
p02946 | s548002296 | Accepted | import io
nim,mike=map(int,input().split())
for i in range(mike-nim+1,mike+nim):
print(i) |
p02760 | s149732024 | Wrong Answer | #!python3.4.3
a = []
result = []
for i in range(3):
a.append(list(map(int, input().split(' '))))
a_flat = sum(a, [])
n = int(input())
for _ in range(n):
b = int(input())
if b in a_flat:
result.append(a_flat.index(b))
if result and (result in [0, 1, 2] or [3, 4, 5] or [6, 7, 8] or [0, 3, 4] or [1, 4, 7] or [2, 5, 8] or [0, 4, 8] or [2, 4, 6]):
print('Yes')
else:
print('No')
|
p03720 | s069577204 | Accepted | n,m = map(int, input().split())
l = [0]*n
for _ in range(m):
a, b = map(int,input().split())
l[a-1] += 1
l[b-1] += 1
for i in range(n):
print(l[i])
|
p03127 | s902481679 | 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()
min_i = np.where(not_0_a == min_)
a = a % min_
if len(min_i[0]) == 1:
a[min_i] = min_
if a[a>0].shape[0] == 1:
not_0_a = a[a!=0]
min_ = not_0_a.min()
print(min_) |
p02951 | s385781569 | Wrong Answer | A, B, C = map(int, input().split())
print(max(A-B-C, 0)) |
p02691 | s169401102 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
l = [0]*(10**6+10)
for i in range(1,len(A)):
x = i-A[i]
if x<0:
continue
else:
l[x]+=1
if A[0]<=10**6:
ans+=l[A[0]]
for i in range(1,N):
x = i+A[i]
if x<0:
continue
if x>10**6:
continue
l[i-A[i]]-=1
ans+=l[x]
print(ans)
|
p03126 | s032011256 | Wrong Answer | N, M = map(int, input().split())
list=[]
s=[]
if N == 1:
print(len(input())-1)
else:
for i in range(N):
list.append(input().split())
s = set(s) & set(list[1:])
list=[]
print(len(s)) |
p03835 | s871043586 | Accepted | [K, S] = list(map(int, input().split()))
cnt = 0
for x in range(K+1):
for y in range(K+1):
z = S - (x+y)
if 0 <= z <= K:
cnt += 1
else:
continue
print(cnt) |
p03262 | s472995147 | Accepted | #!/usr/bin/env python3
import math
N, X = map(int, input().split())
A = sorted(list(map(int, input().split()))+[X])
B = []
for i in range(len(A)-1):
B.append(A[i+1] - A[i])
g = B[0]
for b in B[1:]:
g = math.gcd(b, g)
print(g)
|
p03163 | s351511641 | Accepted | N, W = map(int, input().split())
w, v = [0]*N, [0]*N
for i in range(N):
w[i], v[i] = map(int, input().split())
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(1, N+1):
for w_sum in range(1, W+1):
if w_sum >= w[i-1]:
dp[i][w_sum] = max(dp[i-1][w_sum-w[i-1]] + v[i-1], dp[i-1][w_sum])
else:
dp[i][w_sum] = dp[i-1][w_sum]
print(dp[N][W]) |
p02629 | s754221149 | Accepted | n = int(input())-1
ans = []
while n >= 0:
n, y = divmod(n, 26)
ans.append(y)
n -= 1
ans.reverse()
def to_alpha(x):
return chr(x+ord('a'))
print(''.join(map(to_alpha, ans))) |
p03345 | s834680116 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
a,b,c,k=map(int, input().split())
num=0
if b-a>10**18:
num='Unfair'
else:
if k%2==0:
num=a-b
else:
num=b-a
print(num)
resolve() |
p02861 | s512516791 | Accepted | import math
from itertools import permutations
N = int(input())
points = [tuple(map(int, input().split(' '))) for _ in range(N)]
s = 0
count = 0
for routes in permutations(points):
count += 1
for p1, p2 in zip(routes, routes[1:]):
x1, y1 = p1
x2, y2 = p2
s += math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)
print(s / count)
|
p03994 | s602890799 | Accepted | s = input()
K = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i,w in enumerate(s):
if i != len(s)-1 and (26-(ord(w)-ord('a')))%26 <= K:
ans += 'a'
K -= (26-(ord(w)-ord('a')))%26
elif i != len(s)-1:
ans += w
if i == len(s)-1:
#ans = ans[:-1]
lastlidx = (ord(w)-ord('a') + K%26)%26
ans += alp[lastlidx]
print(ans)
|
p03160 | s995323293 | Wrong Answer | N = int(input())
hs = list(map(int, input().split()))
Cost = [1e7 for _ in range(N)]
Cost[0] = 0
for i in range(N):
if (i+1 > N-1):
continue
Cost[i+1] = min(Cost[i+1], Cost[i] + abs(hs[i]-hs[i+1]))
if (i+2 > N-1):
continue
Cost[i+2] = min(Cost[i+2], Cost[i] + abs(hs[i]-hs[i+2]))
print(Cost[N-1]) |
p02693 | s659808241 | Wrong Answer | k=int(input())
a,b=map(int,input().split())
import math
if math.floor(b/k)-math.ceil(a/k)>=1:
print('OK')
else:
print('NG')
|
p03693 | s275847964 | Wrong Answer | three = list(map(int, input().split()))
r = three[0]
g = three[1]
b = three[2]
g = str(g)
b = str(b)
gb = g + b
gb = int(gb)
if gb%4 ==0:
print('Yes')
else:
print('No') |
p02602 | s013545583 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n-k):
print("Yes" if a[i] < a[i+k] else "No") |
p02748 | s379764153 | Wrong Answer | A, B, M = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
xyc = [[int(_) for _ in input().split()] for i in range(M)]
rets = [ai+bi for ai, bi in zip(a, b)]
for x, y, c in xyc:
rets += [a[x-1] + b[y-1] - c]
print(min(rets)) |
p03657 | s237155072 | Accepted | a,b=map(int,input().split());print("Possible" if (a%3==0 or b%3==0 or (a+b)%3==0) else "Impossible") |
p02819 | s029244110 | Accepted | n=int(input())
m=10**5+4
for i in range(n,m):
lst=[]
if all(( i % j) !=0 for j in range(2,int(n**0.5//1+1))):
print(i)
break
|
p02959 | s576195621 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans0 = sum(a)
for i in range(n):
if b[i] > a[i]:
a[i+1] -= b[i]-a[i]
a[i] = 0
if a[i+1] < 0:
a[i+1] = 0
elif b[i] <= a[i]:
a[i] -= b[i]
ans1 = sum(a)
print(ans0-ans1) |
p03109 | s671223516 | Wrong Answer | y,m,d=map(int,input().split("/"))
if y<2019:
print("Heisei")
elif y==2019:
if m<=4:
print("Heisei")
else:
print("TBD") |
p04045 | s074856841 | Wrong Answer | def main():
n, k = map(int, input().split())
d = list(map(int, input().split()))
a = 0
for i in range(n, 10000):
if checknum(i, d):
a = i
break
print(a)
def checknum(n, d):
for s in str(n):
if d.count(int(s)) > 0:
return False
return True
if __name__ == '__main__':
main()
|
p03672 | s672410943 | Accepted | S = input()
n = len(S)
ok = False
while not ok:
n -= 2
flag = True
for i in range(n//2):
if S[i] != S[i+n//2]:
flag = False
if flag:
ok = True
print(n) |
p03211 | s778671664 | Accepted | S = input()
ans = 753
for i in range(len(S)-2):
ans = min(ans, abs(753-int(S[i:i+3])))
print(ans) |
p03485 | s339173957 | Accepted | import math
a, b = map(int, input().split())
print(math.ceil((a + b) / 2))
|
p03150 | s617962499 | Accepted | import itertools,sys
def S(): return sys.stdin.readline().rstrip()
S = S()
for i,j in itertools.combinations(range(len(S)+2),2):
if S[:i]+S[j-1:]=='keyence':
print('YES')
break
else:
print('NO')
|
p02912 | s242181944 | Accepted | n,m = map(int,input().split())
a = [int(c) for c in input().split()]
from heapq import *
from math import *
a = [-i for i in a]
heapify(a)
while m > 0:
heappush(a,-((-heappop(a))//2))
m -=1
print(-sum(a))
|
p02756 | s196376685 | Wrong Answer | S = input()
Q = int(input())
que2 = []
que2.append(S)
rv_flag= 0
for _ in range(Q):
que = list(map(str, input().split()))
if que[0] == "1":
rv_flag = rv_flag + 1
elif que[1] == "1":
que2.insert(0,que[2])
elif que[1] == "2":
que2.append(que[2])
if rv_flag % 2 == 1:
que2.reverse()
ans = "".join(que2)
print(ans) |
p02612 | s849212202 | Accepted | import math
n = int(input())
x = math.ceil(n/1000)
print(x*1000-n) |
p03943 | s455669092 | Wrong Answer | a, b, c = map(int, input().split())
if a+b==c or b+c==a or c+a==b:
print("YES")
else:
print("NO") |
p03011 | s656247010 | Accepted | [P,Q,R] = list(map(int,input().split()))
A = P + Q
B = Q + R
C = R + P
print(min(A,B,C)) |
p03478 | s593168672 | Accepted | def myfunc(A, B):
def resfunc(x):
if A <= sum(map(int,list(str(x)))) <=B:
return x
else:
return 0
return resfunc
N, A, B = map(int, input().split())
print(sum(map(myfunc(A,B), range(1, N+1)))) |
p03761 | s156608862 | Wrong Answer | n=int(input())
P=[]
for i in range(n):
s=input()
x=len(s)
P.append([x,s])
P=sorted(P)
m=P[0][0]
B=[]
for i in range(m):
B.append(P[0][1][i])
que=[]
for i in B:
cnt=0
for j in range(n):
if i in P[j][1]:
cnt+=1
if cnt==n:
que.append(i)
que=sorted(que)
print(''.join(que)) |
p03860 | s430287308 | Wrong Answer | s=input()
ss=s[0]
sss=ss.upper()
print("A"+sss+"C") |
p03035 | s680111085 | Accepted | A,B = map(int,input().split())
if A<=5:
print(0)
elif A<=12:
print(B//2)
else:
print(B) |
p02820 | s034711922 | Wrong Answer | n,k = map(int,input().split())
r,s,p = map(int,input().split())
a = list(input())
hand = {"r":p,"s":r,"p":s}
ans = 0
for i in range(n):
if a[i-k] == a[i] and i-k >= 0:
ans += 0
else:
ans += hand[a[i]]
print(ans)
|
p03208 | s105448481 | Accepted | n, k = map(int, input().split())
h = [int(input()) for i in range(n)]
h.sort()
ans = 1000000000
for i in range(n - k + 1):
temp = h[i + k - 1] - h[i]
ans = min(temp, ans)
print(ans)
|
p02695 | s534051238 | Accepted | import itertools
n, m, q = map(int, input().split())
ls = []
for _ in range(q):
a, b, c, d = map(int, input().split())
ls.append((a, b, c, d))
def calc(x, ls):
s = sum([d for a, b, c, d in ls if x[b - 1] - x[a - 1] == c])
return s
ans = 0
cands = range(1, m+1)
c = itertools.combinations_with_replacement(cands, n)
for x in c:
ans = max(ans, calc(x, ls))
print(ans) |
p02731 | s819080760 | Accepted | # coding:utf-8
def main():
l = int(input())
ippen = l / 3
print(ippen*ippen*ippen)
if __name__ == '__main__' :
main() |
p02862 | s793623675 | Accepted | X, Y = map(int,input().split())
MOD = 10 ** 9 + 7
if (X + Y) % 3 != 0 or 2 * X < Y or 2 * Y < X:
print(0)
elif 2 * X == Y or 2 * Y == X:
print(1)
else:
turn = (X + Y) // 3
turn2 = X - turn
turn1 = turn - turn2
ans = turn
inv = [0, 1]
for i in range(2, min(turn1, turn2) + 1):
ans = ans * (turn - i + 1) % MOD
ans = ans * (-inv[MOD % i] * (MOD // i)) % MOD
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
print(ans % MOD) |
p03493 | s916727792 | Accepted | n = str(input())
# N,A,B = map(int, input().split())
print(n.count('1')) |
p02771 | s930847134 | Accepted | A, B, C = map(int,input().split())
li = [A, B, C]
li.sort()
ans = "No"
if li[0] == li[1] and li[1] != li[2] :
ans = "Yes"
elif li[0] != li[1] and li[1] == li[1] == li[2]:
ans = "Yes"
print(ans) |
p04033 | s388588468 | Wrong Answer | def resolve():
'''
code here
'''
a,b = [int(item) for item in input().split()]
if a > 0:
print('Positive')
else:
if a <= 0 and 0 <= b:
print('zero')
else:
cnt = b - a + 1
if cnt % 2 == 0:
print('Posivite')
else:
print('Negative')
if __name__ == "__main__":
resolve()
|
p02963 | s324304846 | Accepted | #!/usr/bin/env python3
def main():
S = int(input())
M = 10**9
if S % M == 0:
print(0,0,M,0,0,S//M)
else:
X = (S+M-1) // M
a,b,c,d = M,1,M-S%M,X
print(0,0,a,b,c,d)
# print(a*d-b*c,S)
if __name__ == "__main__":
main()
|
p02600 | s154359511 | Accepted | a=int(input())
if 400<=a and a<=599:
print(8)
if 600<=a and a<=799:
print(7)
if 800<=a and a<=999:
print(6)
if 1000<=a and a<=1199:
print(5)
if 1200<=a and a<=1399:
print(4)
if 1400<=a and a<=1599:
print(3)
if 1600<=a and a<=1799:
print(2)
if 1800<=a and a<=1999:
print(1) |
p03469 | s600689626 | Accepted | s = str(input())
s = "2018/01" + s[7:10]
print(s) |
p02780 | s890750143 | Wrong Answer | a,b=map(int,input().split())
d = list(map(int, input().split(" ")))
w = [0]*len(d)
# 累積和の計算
w[0] = d[0]
for i in range(1, len(d)):
w[i] = w[i-1] + d[i]
ans = 0
for i in range(a-b):
ans = max([ans,w[i+b]-w[i]])
d2 = 0.5*b + ans/2
print(d2) |
p03785 | s172916382 | Accepted | def solve():
N, C, K = map(int, input().split())
ans = 1
cnt = 0
T = [int(input()) for _ in range(N)]
T.sort()
for i in range(N):
if i==0:
now = T[i]
cnt += 1
if now+K<T[i] or cnt>C:
ans += 1
cnt = 1
if i<N-1:
now = T[i]
return ans
print(solve()) |
p02771 | s170618129 | Accepted | a = [int(x) for x in input().split()]
a.sort()
if a[0] == a[1] == a[2]: print("No")
elif a[0] == a[1] or a[1] == a[2]: print("Yes")
else: print("No") |
p03126 | s619418588 | Accepted | n, m = map(int, input().split())
food = {i+1 for i in range(m)}
for i in range(n):
k, *l = map(int, input().split())
food = set(l) & food
print(len(food)) |
p03254 | s602175253 | Accepted | N,X = map(int,input().split(' '))
num_list = list(map(int,input().split(' ')))
num_list_s = sorted(num_list)
total = 0
index = 0
for i in range(N):
total += num_list_s[i]
if total > X:
break
else:
index += 1
if sum(num_list) < X:
print(index-1)
else:
print(index) |
p03352 | s866141768 | Accepted | import math
X = int(input())
ans = 1
Y = math.floor(math.sqrt(X))
for i in range(2, Y+1):
for j in range(2, 10):
a = i**j
if a <= X:
ans = max(ans, a)
print(ans)
|
p02631 | s031391835 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = []
for i in range(N):
xor = 0
for j in range(N):
if i == j:
xor ^= a[j]
ans.append(xor)
print(*ans) |
p02982 | s984657782 | Accepted | import numpy as np
n,d = map(int,input().split())
arr = np.zeros((n,d))
for i in range(n):
arr[i,:] = list(map(int,input().split()))
ans = 0
for i in range(n):
for j in range(i+1,n):
l = np.sum((arr[i,:] - arr[j,:])**2)**0.5
if l.is_integer():
ans+=1
print(ans)
|
p02633 | s038479124 | Accepted | X=int(input())
for i in range(1,180):
if (i*360%X==0):
print((i*360)//X)
exit() |
p02939 | s855004943 | Wrong Answer | import sys, math
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(10**9)
MOD = 10**9+7
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp)]
S = input()
def g(i):
if i == 0:
return 0
if i < 2:
return 1
if S[i] != S[i-1]:
return g(i-1)+1
return g(i-3)+2
print(g(len(S)-1))
|
p03815 | s949458788 | Wrong Answer | x = int(input())
print(x % 11)
if x % 11 == 0:
print(x // 11 * 2)
elif x % 11 <= 6:
print(x // 11 * 2 + 1)
else:
print(x // 11 * 2 + 2) |
p03699 | s518499745 | Accepted | n = int(input())
s = sorted([int(input()) for _ in range(n)])
a = sum(s)
if a %10:
print(a)
exit()
for i in range(n):
b = a - s[i]
if b%10:
print(b)
break
else:
print(0) |
p02689 | s792224279 | Wrong Answer | def main():
n, m = map(int, input().strip().split())
h = list(map(int, input().strip().split()))
flg = [True] * n
for i in range(m):
a, b = map(int, input().strip().split())
if(h[a-1]<h[b-1]):
flg[a-1] = False
elif(h[a-1]<h[b-1]):
flg[b-1] = False
else:
flg[a-1] = False
flg[b-1] = False
print(flg.count(True))
main() |
p03625 | s007662433 | Accepted |
N = int(input())
A = list(map(int, input().split()))
from collections import Counter
ans = []
for (key, value) in Counter(A).items():
if value >=2:
ans.append(key)
if value >= 4:
ans.append(key)
if len(ans) <= 1:
print(0)
else:
ans = sorted(ans, reverse=True)
print(ans[0] * ans[1]) |
p03474 | s070953438 | Wrong Answer | a,b=map(int,input().split())
s=input()
print(s)
if s[a]!="-":
print("No")
#print(1)
elif s.count("-")>1:
print("No")
#print(2)
else:
s=s.replace("-","")
#print(3)
#print(s)
if s.isdigit()==True:
print("Yes")
else:
print("No") |
p03721 | s791935595 | Accepted | import sys
input=sys.stdin.readline
n,k=map(int,input().split())
lst=[0]*100001
for i in range(n):
a,b=map(int,input().split())
lst[a]+=b
for i in range(100001):
k-=lst[i]
if k<=0:
print(i)
break |
p02771 | s523421314 | Accepted | a = list(map(int, input().split()))
s = set(a)
if len(s) == 2:
print('Yes')
else:
print('No')
|
p02618 | s853121351 | Accepted | import random
D = int(input())
c_list = list(map(int, input().split()))
for i in range(D):
S_list = list(map(int, input().split()))
for i in range(D):
print(random.randint(1,26))
|
p02832 | s740121557 | Accepted | n = int(input())
a = list(map(int,input().split()))
index = 1
cnt = 0
for i in range(len(a)):
if a[i] != index:
cnt +=1
else:
index +=1
if min(a)!=1:
print("-1")
else:
print(cnt) |
p03251 | s997125313 | Accepted | N, M, X, Y = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))
x_max = max(x)
y_min = min(y)
ans = 'War'
for i in range(-100,101):
if (X < i <= Y ) and (x_max < i <= y_min):
ans = 'No War'
print(ans) |
p03814 | s568196720 | Wrong Answer | s = 'HASFJGHOGAKZZFEGA'
rs = s[::-1]
x = s.index('A')
y = rs.index('Z')
print(len(s)-y-x)
|
p03206 | s258634430 | Accepted | d = int(input())
if (d == 25):
print('Christmas')
elif (d == 24):
print('Christmas Eve')
elif (d == 23):
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve Eve')
|
p03360 | s414066314 | Wrong Answer | ABC = sorted(map(int, input().split()))
K = int(input())
print(ABC[0] + ABC[1] + ABC[2] * K**2)
|
p02909 | s117781308 | Wrong Answer | S = input()
weather = ["Sunny", "Cloudy", "Rainy"]
a = weather.index(S)
print(weather[(a+1)//3])
|
p03779 | s318993064 | Wrong Answer | import sys
def tousa(n):
return int((n*(n-1))/2)
X = int(input())
kyori = 0
count = 0
x = 0
if X < 3:
print(X)
else:
while tousa(x) < X:
x += 1
count+=1
a = X-tousa(x-1)
ans = count -2 + a
print(ans) |
p02725 | s998042736 | Wrong Answer | k, n = map(int, input().split())
a = list(map(int, input().split()))
space = []
for i in range(n - 1):
s = a[i + 1] - a[i]
space.append(s)
space.append(k - a[n - 1])
print(k + a[1] - max(space)) |
p03254 | s177902940 | Accepted | N, x, *A = map(int, open(0).read().split())
A.sort()
ans = 0
for a in A[:-1]:
if x - a >= 0:
x -= a
ans += 1
else:
break
if x == A[-1]:
ans += 1
print(ans)
|
p02783 | s029441200 | Wrong Answer | import math
H, A = map(int, input().split())
ans = H % A
mod = H // A
if A == 1:
print(math.floor(H/A))
else:
if mod == 0:
print(ans)
else:
print(ans+1)
|
p02971 | s415095341 | Accepted | import sys
n = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for i in range(n)]
B = sorted(A)
m1 = B[-1]
m2 = B[-2]
for a in A:
if a == m1:
print(m2)
else:
print(m1) |
p03861 | s684641457 | Accepted | a,b,x = map(int,input().split())
print(max(b//x-(a-1)//x,0)) |
p03095 | s159695621 | Accepted | n = int(input()); s = input()
a = [0]*26; b = 1
for i in range(n): a[ord(s[i])-97] += 1
for i in range(26): b *= a[i]+1
print((b-1)%(10**9+7)) |
p02748 | s384666569 | Wrong Answer | A,B,M = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
b = [int(s) for s in input().split()]
min_cost = 10 ** 6
for i in range(M):
x,y,c = [int(s) for s in input().split()]
if min_cost > a[x-1] + b[y-1] - c:
min_cost = a[x-1] + b[y-1] - c
print(min_cost) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.