problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03250
|
s206217446
|
Accepted
|
a=list(map(int,input().split()))
b=sorted(a)
c=b[::-1]
d=10*c[0]+c[1]
print(d+b[0])
|
p04045
|
s886011784
|
Accepted
|
#1000 8
#1 3 4 5 6 7 8 9
n,k = map(int, raw_input().split())
s = set(map(int, raw_input().split()))
letters = [u for u in range(10) if u not in s]
def dfs(u,n,letters):return min([dfs(u*10 +l,n,letters) for l in letters if u or l]) if u < n else u
print dfs(0,n,letters)
|
p03624
|
s114059532
|
Accepted
|
S = input()
L = [chr(i) for i in range(ord('a'), ord('z')+1)]
for l in L:
if l not in S:
print(l)
exit(0)
print("None")
|
p02600
|
s152525061
|
Accepted
|
X = int(input())
if 400 <= X <= 599:
print(8)
elif 600 <= X <= 799:
print(7)
elif 800 <= X <= 999:
print(6)
elif 1000 <= X <= 1199:
print(5)
elif 1200 <= X <= 1399:
print(4)
elif 1400 <= X <= 1599:
print(3)
elif 1600 <= X <= 1799:
print(2)
elif 1800 <= X <= 1999:
print(1)
|
p03433
|
s386487174
|
Accepted
|
N = int(input())
A = int(input())
if N % 500 > A:
print('No')
else :
print('Yes')
|
p03836
|
s983952569
|
Wrong Answer
|
sx,sy,tx,ty = list(map(int, input().strip().split()))
dx = tx-sx
dy = ty-sy
result = ""
for i in range(dy):
result += "U"
for i in range(dx):
result += "R"
for i in range(dy):
result += "D"
for i in range(dx):
result += "L"
for i in range(dy+1):
result += "U"
for i in range(dx+1):
result += "R"
result += "DR"
for i in range(dy+1):
result += "D"
for i in range(dx+1):
result += "L"
result += "U"
print(result)
|
p03827
|
s963059263
|
Wrong Answer
|
import itertools
n = int(input())
s = list(input())
s1 = [1 if s[i] == 'I' else -1 for i in range(n)]
cumsum = list(itertools.accumulate(s1))
print(s1)
print(cumsum)
ans = max(cumsum)
print(max(ans, 0))
|
p03328
|
s045124463
|
Accepted
|
a,b = map(int,input().split())
delta = b-a
tower_b = (delta+1)*delta//2
print(tower_b - b)
|
p02912
|
s648314039
|
Accepted
|
#Priority Queueを使った解法
import heapq
N,M = map(int,input().split())
A = list(map(lambda x:(-1)*int(x),input().split()))
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
heapq.heappush(A,(-1)*(-a//2))
print(-sum(A))
|
p03457
|
s408267975
|
Accepted
|
n = int(input())
t = 0
x = 0
y = 0
for i in range(n):
nt , nx , ny = map(int,input().split())
if nt - t >= nx - x + ny -y and ((nt - t) - (nx -x + ny -y)) % 2 == 0:
t = nt
x = nx
y = ny
else:
print("No")
exit()
print("Yes")
|
p02732
|
s000085098
|
Wrong Answer
|
n=int(input())
array=list(map(int,input().split()))
tot=0
x=0
count=[0]*10000000
for c in range(n):
count[array[c]]+=1
for c in range(n):
if x<array[c]:
x=array[c]
t=count[array[c]]
tot+=int(t*(t-1)/2)
for i in range(n):
ans=tot
l=count[array[i]]
ans-=int(l*(l-1)/2)
ans+=int((l-1)*(l-2)/2)
print(ans)
|
p02775
|
s155769196
|
Wrong Answer
|
N = input()
s = str(N)
l = len(s)
A = 0
k = 0
for i in range(-1, -l-1,-1):
j = int(s[i])
if j < 5:
A = A + j
k = 0
else:
A = A + 11 - j - k
k = 2
print(A)
|
p03645
|
s922762513
|
Wrong Answer
|
import collections
n,m = map(int,input().split())
s = [list(map(int,input().split())) for i in range(m)]
q = collections.deque()
q.append(1)
for k in range(2):
for j in range(len(q)):
tmp = q.pop()
for i in s:
if tmp in i:
if tmp > i[0]:
q.append(i[0])
else:
q.append(i[1])
if n in q:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
|
p02882
|
s687708481
|
Wrong Answer
|
import math
a, b, x = map(int, input().split())
if a**2*b >= 2*x:
l, r = 0, 45
while r-l > pow(10, -15):
k = (r+l)/2
if x <= a*b*b*math.atan(math.radians(k))/2:
r = k
else:
l = k
ans = 90-(r+l)/2
else:
l, r = 0, 45
while r-l > pow(10, -15):
k = (r+l)/2
if a**2*b-x <= a**3*math.tan(math.radians(k))/2:
r = k
else:
l = k
ans = (r+l)/2
print(ans)
|
p02595
|
s805511661
|
Accepted
|
N, D = map(int, input().split())
ans = 0
for _ in range(N):
x, y = map(int, input().split())
if x**2+y**2<=D**2:
ans += 1
print(ans)
|
p02775
|
s124237472
|
Accepted
|
N = input()
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i in range(len(N)):
n = int(N[i])
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + 10 - n)
dp[i + 1][1] = min(dp[i][0] + n + 1, dp[i][1] + 10 - (n + 1))
print(dp[-1][0])
|
p03679
|
s052232606
|
Wrong Answer
|
X,A,B=map(int,input().split())
if(X > A):
print("delicious")
elif(X < (A+B)):
print("safe")
else:
print("dangerous")
|
p02607
|
s022267913
|
Accepted
|
#!/usr/bin/env python3
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if (i + 1) % 2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans)
|
p02759
|
s883834931
|
Accepted
|
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)
def read_values():
return map(int, input().split())
def read_index():
return map(lambda x: x - 1, map(int, input().split()))
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in range(N)]
def functional(N, mod):
F = [1] * (N + 1)
for i in range(N):
F[i + 1] = (i + 1) * F[i] % mod
return F
def main():
N = int(input())
print((N - 1) // 2 + 1)
if __name__ == "__main__":
main()
|
p03804
|
s274298662
|
Accepted
|
N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(N - M + 1):
for j in range(N - M + 1):
flg = True
for k in range(M):
if A[i + k][j:j+M] == B[k]:
continue
else:
flg = False
break
if flg:
print('Yes')
exit()
print('No')
|
p02571
|
s467048745
|
Accepted
|
s = input() #sys.stdin.readlineは最後が改行
t = input() #sys.stdin.readlineは最後が改行
ans= 1000
for i in range(len(s)-len(t)+1):
tmp = 0
for j in range(len(t)):
if s[i+j]!=t[j]: tmp+=1
ans = min(ans,tmp)
print(ans)
|
p02880
|
s418351397
|
Wrong Answer
|
N = int(input())
answers = []
for i in range(1, 10, 1):
for j in range(1,10, 1):
answers.append(i*j)
if N in answers:
print('YES')
else:
print('NO')
|
p03665
|
s432433749
|
Wrong Answer
|
N,P = map(int,input().split())
A = list(map(int,input().split()))
n0=0
n1=0
for i in range(N):
if A[i]%2==0:
n0 += 1
n1 = N-n0
if n1==0:
if P==0:
print(2**n0-1)
else:
print(0)
elif P==0 and n0>0:
print(2**(n1-1)*2**n0-1)
elif P==0 and n0==0:
print(2**(n1-1)*2**n0)
elif P==1:
print(2**(n1-1)*2**n0)
|
p02910
|
s178487062
|
Accepted
|
S = input()
n = len(S)
good = True
for i in range(n):
if i % 2 == 0:
if S[i] == 'L':
good = False
break
else:
if S[i] == 'R':
good = False
break
if good:
print('Yes')
else:
print('No')
|
p02793
|
s099074453
|
Wrong Answer
|
# coding: utf-8
# Your code here!
n=int((input()))
a=list(map(int,input().split()))
mod=10**9+7
b=0
for i in a:
b+=(pow(i,mod-2,mod))
tmp=b%mod
def gcd(x,y):
while y!=0:
x,y=y,x%y
return x
def lcm(x,y):
G=gcd(x,y)
return (x)*(y)*pow(G,mod-2,mod)
L=a[0]%mod
for i in a:
L=lcm(L,i)%mod
print(L*tmp%mod)
|
p02916
|
s584501911
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
lis=[]
for i in range(0,n-1):
if a[i]==a[i+1]-1:
lis.append(a[i])
plus=0
for j in range(0,len(lis)):
plus+=c[lis[j]-1]
print(sum(b)+plus)
|
p03241
|
s301342233
|
Accepted
|
def cd_generator(num):
i=1
lower=[]
upper=[]
while i*i<=num:
if num%i==0:
lower.append(i)
if num!=i*i:
upper.append(num//i)
i+=1
return reversed(lower+upper[::-1])
n,m=map(int,input().split())
for ele in cd_generator(m):
if m/ele>=n:
print(ele)
exit()
|
p02642
|
s164523313
|
Wrong Answer
|
import math
n = int(input())
aL = sorted(list(map(int, input().split(" "))))
ans = n
for i in range(n - 1, -1, -1):
for j in range(i):
if aL[j] * 2 > aL[j]:
break
if aL[i] % aL[j] == 0:
ans -= 1
break
d = set()
for a in aL:
d.add(a)
if len(d) == 1 and n != 1:
print(0)
exit()
print(ans)
|
p02695
|
s953010568
|
Wrong Answer
|
n,m,q = map(int,input().split())
a = []
b = []
c = []
d = []
for i in range(q):
e,f,g,h = map(int,input().split())
a.append(e)
b.append(f)
c.append(g)
d.append(h)
counter = 0
for i in range(n-1):
counter += m - 1
m -= 1
sum_c = 0
count = 0
for i in sorted(c):
sum_c += i
if sum_c > counter:
break
count += 1
d_count = 1
ans = 0
for i in sorted(d,reverse = True):
if d_count > count:
break
ans += i
d_count += 1
print(ans)
|
p02546
|
s104768748
|
Wrong Answer
|
s = input()
if s[-1] == s:
print(s+'es')
else:
print(s+'s')
|
p02958
|
s852152219
|
Accepted
|
n=int(input())
p=list(map(int,input().split()))
count=0
ans='YES'
for i in range(n):
if p[i]!=i+1:
count+=1
if count>2:
ans='NO'
break
print(ans)
|
p04044
|
s296647109
|
Accepted
|
N,L=map(int, input().split())
S=[input()for i in range(N)]
print(''.join(sorted(S)))
|
p02624
|
s954847183
|
Accepted
|
#!/usr/bin/env python3
n = int(input())
ans = 0
for i in range(1, n+1):
num = n//i
ans += (1+num)*i*num//2
print(ans)
|
p02786
|
s316337098
|
Wrong Answer
|
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
h = ii()
count = 0
while h >= 2:
h = (h+1)//2
count += 1
#print(count)
if count == 0:
print(1)
else:
print(2**(count)-1)
|
p03693
|
s676757369
|
Accepted
|
r, g, b = map(int, input().split())
if (10*g + b) % 4 == 0:
print("YES")
else:
print("NO")
|
p03994
|
s383957143
|
Accepted
|
string = input()
k = int(input())
ans = list(string)
alpha = "abcdefghijklmnopqrstuvwxyz"
alpha_to_num = {}
for i in range(26):
alpha_to_num[alpha[i]] = i
for i, s in enumerate(ans):
if s == "a":
continue
pos = alpha_to_num[s]
kk = 26 - pos
if kk > k:
continue
k -= kk
ans[i] = "a"
pos = alpha_to_num[ans[-1]]
new_pos = (k + pos) % 26
ans[-1] = alpha[new_pos]
print("".join(ans))
|
p02789
|
s136478981
|
Accepted
|
from sys import stdin
def main():
n,m = map(int,stdin.readline().split())
if(n==m):
print("Yes")
else:
print("No")
main()
|
p02918
|
s490227179
|
Wrong Answer
|
import itertools
def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]
def main():
N, K = ZZ()
S = input()
gr = itertools.groupby(S)
ll = []
for c, d in gr: ll.append([c, len(list(d))])
output = N - len(ll)
i = 1
for _ in range(K):
if i < len(ll): output += 2
else: break
i += 2
print(output)
return
if __name__ == '__main__':
main()
|
p02696
|
s159662611
|
Accepted
|
A,B,N = map(int,input().split())
x = min(N,B-1)
ans = int(A*x/B) - A*int(x/B)
print(ans)
|
p02697
|
s482138515
|
Accepted
|
N,M = map(int,input().split())
if N % 2:
for i in range(M):
print(1+i,N-i,sep=" ")
else:
even = M // 2
odd = M - even
for i in range(odd):
print(1+i,N-i,sep=" ")
st = 1 + odd
en = st + even * 2
for i in range(even):
print(st+i,en-i,sep=" ")
|
p02775
|
s904801876
|
Accepted
|
string_n = input()
string_n = '0' + string_n
len_n = len(string_n)
dp = [[0, 0] for _ in range(len_n + 1)]
for i in range(len_n):
for j in range(2):
if j == 0:
dp[i + 1][j] = min(dp[i]) + int(string_n[i])
else:
dp[i + 1][j] = min(dp[i][0] + 1 + 10 - int(string_n[i]), dp[i][1] + 9 - int(string_n[i]))
print(min(dp[len_n]))
|
p03485
|
s446926154
|
Accepted
|
a,b = map(int,input().split())
x = -(-(a+b)//2)
print(x)
|
p03220
|
s146407711
|
Accepted
|
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
b = 10 ** 5
c = 0
for i in range(len(h)):
if abs((t - h[i] * 0.006) - a) < b:
b = abs((t - h[i] * 0.006) - a)
c = i
print(c + 1)
|
p03852
|
s755308767
|
Accepted
|
d = input()
if (d == 'a') or (d == 'e') or (d == 'i') or (d == 'o') or (d == 'u'):
print("vowel")
else:
print("consonant")
|
p03723
|
s443339472
|
Accepted
|
a,b,c=map(int,input().split())
for i in range(500000):
if a%2==1 or b%2==1 or c%2==1:
print(i);exit()
else:
p=(b+c)//2 ;q=(a+c)//2 ; r=(a+b)//2
a=p ; b=q;c=r
else:
print(-1)
|
p03548
|
s460225365
|
Wrong Answer
|
x, y, z = map(int, input().split())
print((x-1)//(y+z))
|
p02677
|
s786045470
|
Wrong Answer
|
import sys
import math
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
a,b,h,m = map(int,readline().split())
degree = abs(h*30+30*(m/60) - m*6)
degree = min(degree,360-degree)
if degree == 0 or degree == 180:
print(0)
exit()
print(math.sqrt(a**2+b**2-2*a*b*math.cos(math.radians(degree))))
|
p03611
|
s515999581
|
Wrong Answer
|
n = int(input())
cnt = [0] * 10**5
for i in map(int, input().split()):
cnt[i] += 1
res = 0
for i in range(1, len(cnt)-2):
val = sum(cnt[i:i+3])
if res < val:
res = val
print(res)
|
p04043
|
s646035662
|
Accepted
|
S=input();print('NYOE S'[S.count('5')==2 and S.count('7')==1::2])
|
p02760
|
s739098554
|
Accepted
|
import itertools
a1, b1, c1 = map(int, input().split())
a2, b2, c2 = map(int, input().split())
a3, b3, c3 = map(int, input().split())
checker = [
(a1,b1,c1),
(a2,b2,c2),
(a3,b3,c3),
(a1,a2,a3),
(b1,b2,b3),
(c1,c2,c3),
(a1,b2,c3),
(c1,b2,a3)
]
N = int(input())
numbers = []
for i in range(N):
numbers.append(int(input()))
ans="No"
tuples = itertools.permutations(numbers,3)
for i in tuples:
if i in checker:
ans = "Yes"
break
print(ans)
|
p02993
|
s858815875
|
Wrong Answer
|
S = [int(x) for x in input()]
cnt = 0
for i in range(2):
if S[i] == S[i+1]:
cnt += 1
if cnt >= 1:
print("Bad")
else:
print("Good")
|
p03254
|
s046515365
|
Wrong Answer
|
n,x = map(int,input().split())
A= list(map(int,input().split()))
A.sort()
a_sum=0
for i in range(n):
a_sum+= A[i]
if x<a_sum:
print(i)
exit()
print(n)
|
p03386
|
s907578830
|
Wrong Answer
|
a,b,k = map(int,input().split())
A=[]
for i in range(a,a+k):
A.append(i)
B=[]
for i in range(b,b-k,-1):
B.append(i)
C=list(set(A+B))
C.sort(reverse=False)
print(C)
|
p02607
|
s393874989
|
Accepted
|
#
import sys
input=sys.stdin.readline
def main():
N=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(N):
if A[i]%2==1 and i%2==0:
cnt+=1
print(cnt)
if __name__=="__main__":
main()
|
p03785
|
s041163541
|
Accepted
|
n, c, k = map(int, input().split())
t_lst = [int(input()) for _ in range(n)]
t_lst.sort()
ans = 0
cnt = 0
last = 0
if c == 1:
print(n)
exit()
for t in t_lst:
if t > last:
ans += 1
last = t + k
cnt = 1
else:
cnt += 1
if cnt == c:
last = 0
cnt = 0
print(ans)
|
p02793
|
s741830667
|
Accepted
|
from fractions import gcd
N = int(input())
A = [int(i) for i in input().split()]
lcm = A[0]
MOD = 10**9 + 7
for a in A:
lcm = (lcm // gcd(lcm,a) * a)
res = 0
for a in A:
res += lcm //a
print(res % MOD)
|
p03986
|
s079396445
|
Accepted
|
S = str(input())
ans = 0
s_ctr = 0
# s の後の t をひたすら省く
for i in range(len(S)):
if S[i] == "S":
s_ctr += 1
else:
if s_ctr > 0:
ans += 1
s_ctr -= 1
print(len(S) - ans * 2)
|
p03720
|
s440736693
|
Accepted
|
n,m=map(int,input().split())
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
ans[a-1]+=1
ans[b-1]+=1
[print(i) for i in ans]
|
p03160
|
s394921222
|
Wrong Answer
|
N = int(input())
h = tuple(map(int, input().split()))
cost = [float('inf')] * N
cost[0] = 0
cost[1] = abs(h[0] - h[1])
for i in range(N-2):
cost[i+1] = min(cost[i+1], cost[i] + abs(h[i] - h[i+1]))
cost[i+2] = min(cost[i+2], cost[i] + abs(h[i] - h[i+2]))
print(cost[-1])
|
p02994
|
s209939808
|
Wrong Answer
|
N, L = map(int, input().split())
l = []
for i in range(N):
l.append(L + i)
l.sort()
if l[0]*l[-1] <= 0:
print(0)
else:
if l[0] > 0:
l.pop(0)
print(sum(l))
else:
l.pop(-1)
print(sum(l))
|
p03673
|
s487736569
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
if n%2==0:
s=a[-1::-2]+a[0::2]
else:
s=a[-1::-2]+a[1::2]
print(" ".join(map(str,s)))
|
p02628
|
s751034739
|
Accepted
|
n,k=map(int,input().split())
p=list(map(int, input().split()))
p_s=sorted(p)
ans=0
for i in range(k):
ans+=p_s[i]
print(ans)
|
p03761
|
s940250197
|
Accepted
|
n = int(input())
S = [input() for _ in range(n)]
f_inf = float("inf")
ans = [f_inf] * 26
for i in range(26):
subs = 97 + i
for s in S:
ans[i] = min(ans[i], s.count(chr(subs)))
for i in range(26):
for j in range(ans[i]):
print(chr(97 + i), end="")
|
p02957
|
s797585167
|
Accepted
|
import sys
a, b = map(int, sys.stdin.read().split())
if (a + b) % 2 == 1:
print('IMPOSSIBLE')
else:
print(int((a + b) / 2))
|
p03852
|
s279843498
|
Accepted
|
# ABC 049: A – 居合を終え、青い絵を覆う / UOIAUAI
vowels = ['a', 'i', 'u', 'e', 'o']
c = input()
print('vowel' if c in vowels else 'consonant')
|
p03645
|
s549102488
|
Accepted
|
n, m = map(int, input().split())
s = set()
t = set()
for i in range(m):
a, b = map(int, input().split())
if a > b : a, b = b, a
if a == 1:
s.add(b)
if b == n:
t.add(a)
if s & t:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
|
p02613
|
s150727330
|
Accepted
|
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
s = input()
if s == "AC":
ac += 1
elif s == "WA":
wa += 1
elif s == "TLE":
tle += 1
else:
re += 1
print("AC x", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)
|
p03323
|
s601690023
|
Accepted
|
A,B=input().split()
if int(A)<=8 and int(B)<=8:
print("Yay!")
else:
print( ":(")
|
p03408
|
s354262587
|
Accepted
|
n = int(input())
b_list = []
uni = []
for i in range(n):
b = input()
b_list.append(b)
if not b in uni:
uni.append(b)
m = int(input())
r_list = []
r_uni = []
for i in range(m):
r = input()
r_list.append(r)
if not r in uni:
uni.append(r)
uni.append("aaaaaaaaaaa")
uni_l = len(uni)
c = []
for i in range(uni_l):
c.append(b_list.count(uni[i]) - r_list.count(uni[i]))
print(max(c))
|
p02688
|
s602979152
|
Accepted
|
n,k = [int(x) for x in input().split()]
a = []
for _ in range(k):
_ = input()
tmp = [int(x) for x in input().split()]
for x in tmp:
a.append(x)
print(n - len(set(a)))
|
p02618
|
s324263486
|
Wrong Answer
|
import numpy as np
def last(d, i):
return 0
def loss(d, i):
pass
precon = [[0]]*25
#print(precon)
D = int(input())
c = [int(n) for n in input().split()]
s = [[]]*D
t = []
for i in range(D):
s[i] = [int(n) for n in input().split()]
#for i in range(D):
# t.append(int(input()))
#print(s)
#print(t)
for i in range(D):
print(np.random.randint(1, 26, 1))
|
p02916
|
s296194278
|
Accepted
|
n = int(input())
aList = list(map(int,input().split()))
bList = list(map(int,input().split()))
cList = list(map(int,input().split()))
manzoku = bList[aList[0]-1]
for i in range(1,n):
if aList[i]-1 == aList[i-1]:
manzoku += bList[aList[i]-1]+cList[aList[i]-1-1]
else:
manzoku += bList[aList[i]-1]
print(manzoku)
|
p02946
|
s363802708
|
Accepted
|
K, X = map(int, input().split())
for i in range(X-K+1, X+K):
print(i, end=" ")
|
p03136
|
s193461604
|
Accepted
|
input()
x = list(map(int, input().split()))
if sum(x) - max(x) > max(x):
print('Yes')
else:
print('No')
|
p03494
|
s461274095
|
Accepted
|
N=int(input())
Y=10**100
A=list(map(int,input().split()))
for a in A:
H=0
while a%2==0:
a//=2
H+=1
Y=min(Y,H)
print(Y)
|
p03000
|
s929569285
|
Wrong Answer
|
n, x = map(int, input().split())
l = list(map(int, input().split()))
d=[0]
for i in range(1, n+1):
d.append(d[-1]+l[i-1])
print(d)
print(len([i for i in d if i <= x]))
|
p02994
|
s092598638
|
Accepted
|
N, L = map(int, input().split())
ans = 0
for i in range(1, N+1):
ans += L+i-1
if L+N-1 < 0:
ans -= (L+N-1)
elif L <= 0 <= L+N-1:
ans = ans
else:
ans -= L
print(ans)
|
p03838
|
s701499906
|
Wrong Answer
|
x, y = map(int, input().split())
a_cnt = abs(abs(x) - abs(y))
if y >= x:
print(a_cnt)
elif abs(y) == abs(x):
print(1)
else:
print(a_cnt + 2)
|
p03317
|
s376453883
|
Accepted
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
index = 1
while index <= (N - 1):
ans += 1
index += (K-1)
print(ans)
|
p03137
|
s310114991
|
Wrong Answer
|
def main():
n, m = map(int, input().split())
Xs = sorted(list(map(int, input().split())))
Xs_diff = []
for i in range(1, m):
Xs_diff.append(Xs[i]-Xs[i-1])
Xs_diff.sort()
ans = sum(Xs_diff[:(m-n)])
print(ans)
if __name__ == "__main__":
main()
|
p04019
|
s499513320
|
Wrong Answer
|
import numpy as np
S = input()
NSEW = [S.count("N"), S.count("S"), S.count("E"), S.count("W")]
if np.prod(NSEW) > 0:
print("Yes")
elif NSEW[0] + NSEW[1] > 0:
if NSEW[0] == 0 or NSEW[1] == 0:
print("No")
exit()
elif NSEW[2] + NSEW[3] > 0:
if NSEW[2] == 0 or NSEW[3] == 0:
print("No")
exit()
print("Yes")
|
p03281
|
s298653717
|
Wrong Answer
|
n = int(input())
res = 0
for i in range(1,n+1, 2):
if i % 1:
cnt = 0
for j in range(i+1):
if i % j == 0:
cnt += 1
if cnt == 8:
res += 1
print(res)
|
p03289
|
s515065201
|
Accepted
|
#abc104 b
s=input()
x=s[2:-1]
flag=True
if s[0]!="A" or s[1].isupper() or s[-1].isupper():
flag=False
cnt=0
for i in range(len(x)):
if x[i]=="C":
cnt+=1
else:
if x[i].islower()==False:
flag=False
if cnt!=1:
flag=False
if flag:
print("AC")
else:
print("WA")
|
p03067
|
s282359633
|
Accepted
|
a,b,c=map(int,input().split())
if a <= c <= b or a >= c >= b:
print('Yes')
else:
print('No')
|
p03150
|
s217625548
|
Accepted
|
from itertools import product
S = input()
for i, j in product(range(len(S)), range(len(S))):
if S[:i] + S[j:] == "keyence":
print("YES")
break
else:
print("NO")
|
p02631
|
s092726483
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
temp=a[0]
for i in range(n-1):
temp=temp^a[i+1]
for i in range(n):
print(temp^a[i])
|
p03017
|
s823872855
|
Accepted
|
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,a,b,c,d = iim()
s = input()
st = s[b-2:min(c,d)+1]
s = s[a-1:max(c,d)]
if '##' in s:
print('No')
elif c < d:
print('Yes')
else:
print('Yes' if '...' in st else ' No')
|
p03862
|
s444998868
|
Accepted
|
def resolve():
n, x = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i != 0:
if (a[i] + a[i-1]) > x:
diff = a[i] + a[i-1] - x
ans += diff
a[i] = a[i] - diff
if a[0] > x:
ans += a[0] - x
a[0] = x
print(ans)
resolve()
|
p03438
|
s177007091
|
Accepted
|
n = int(input())
a_ls = list(map(int, input().split()))
b_ls = list(map(int, input().split()))
times_add = 0
diff_to_pad = 0
for i in range(n):
diff = b_ls[i] - a_ls[i]
if diff > 0:
times_add += -(-diff//2)
if diff % 2 == 1:
diff_to_pad += 1
elif diff < 0:
diff_to_pad += -diff
if diff_to_pad > times_add:
res = 'No'
else:
res = 'Yes'
print(res)
|
p02823
|
s524770192
|
Wrong Answer
|
n,a,b = map(int,input().split())
print(min(abs(a-b),max(a-1,b-1),max(n-a,n-b)))
|
p02730
|
s325536354
|
Wrong Answer
|
S = input()
N = len(S)
left = S[:N // 2]
right = S[N // 2 + 1:]
print('Yes') if left == left[::-1] and right == right[::-1] else print('No')
|
p03679
|
s804937609
|
Accepted
|
a,b,c=map(int,input().split())
if b>=c:
print("delicious")
elif a>=(c-b):
print("safe")
else:
print("dangerous")
|
p03377
|
s370897225
|
Accepted
|
A, B, X = map(int, input().split())
if (A + B >= X) and (A <= X):
print('YES')
else:
print('NO')
|
p03243
|
s624524122
|
Accepted
|
print(0--int(input())//111*111)
|
p03071
|
s601617531
|
Accepted
|
a, b = list(map(int, input().split()))
result = 0
for i in range(2):
if a >= b:
result += a
a -= 1
else:
result += b
b -= 1
print(result)
|
p03721
|
s554986978
|
Accepted
|
n, k = map(int, input().split())
mat = [list(map(int, input().split())) for _ in range(n)]
mat.sort(key=lambda x: x[0])
for a, b in mat:
k -= b
if k <= 0:
print(a)
exit()
|
p03592
|
s748398407
|
Accepted
|
N,M,K = map(int,input().split())
for i in range(N+1):
for j in range(M+1):
black = i * (M - j) + j * (N - i)
if black == K:
print("Yes")
exit()
print("No")
|
p02678
|
s894508655
|
Accepted
|
N,M = map(int, input().split())
G = [[] for _ in range(N+1)]
for _ in range(M):
A, B = map(int, input().split())
G[A].append(B)
G[B].append(A)
D = [None]*(N+1)
D[1] = 0
Q = set([1])
while len(Q) > 0:
Q2 = set()
for q in Q:
for r in G[q]:
if D[r] == None:
D[r] = q
Q2.add(r)
Q = Q2
print('Yes')
for d in D[2:]:
print(d)
|
p02995
|
s233314536
|
Accepted
|
def main():
import fractions
a,b,c,d=map(int, input().split())
def lcm(c,d):
return c*d//fractions.gcd(c,d)
e=lcm(c,d)
ans=(b-a+1)-((b//c-(a-1)//c)+(b//d-(a-1)//d))+(b//e-(a-1)//e)
print(ans)
if __name__=='__main__':
main()
|
p02622
|
s134957552
|
Accepted
|
def main():
from builtins import int, map, list, print, len
import sys
sys.setrecursionlimit(10 ** 6)
input = (lambda: (sys.stdin.readline()).rstrip())
input_list = (lambda: input().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
S = input()
T = input()
ans = 0
for i in range(len(T)):
if S[i] != T[i]:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.