problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02597 | s845871695 | Accepted | from collections import deque
n=int(input())
d=deque(list(input()))
#print(d)
r=0
while n>1:
#print(d)
tempr=False
n-=1
if d.pop()=="W":
pass
else:
while n>0:
n-=1
if d.popleft()=="R":
pass
else:
r+=1
break
#print(d,r)
print(r) |
p02924 | s258408113 | Accepted | s=0
for i in range(1,int(input())):
s+=i
print(s) |
p02933 | s827278859 | Wrong Answer | a=int(input())
s=str(input())
if a>=3200:
print('red')
else:
print(s)
|
p03285 | s243692078 | Accepted | n = int(input())
a = True
for i in range(n//4+1):
if (n-i*4)%7==0:
print('Yes')
a = False
break
if a:
print('No') |
p02970 | s419571693 | Wrong Answer | n, d = map(int, input().split())
i = 0
if((2 *(d + i) + 1) * 2 >= n):
i += 0
else:
while((2 * (d + i) + 1) * 2 >= n):
i += 1
print(i + 1)
|
p02554 | s999775394 | Accepted | p=10**9+7
n=int(input())
print((pow(10,n,p)-2*pow(9,n,p)+pow(8,n,p))%p) |
p02923 | s781314076 | Wrong Answer | N=int(input())
H=list(map(int,input().split()))
cnt=0
ans=0
for i in range(1,N):
if H[i-1]>=H[i]:
cnt=cnt+1
else:
ans=cnt
cnt=0
if ans>cnt:
print(ans)
else:
print(cnt) |
p03035 | s172568544 | Accepted | A,B= map(int,input().split())
if A>=13:
print(B)
elif (A<=12) & (A>=6):
print(int(B/2))
elif A<=5:
print(int(0))
else:
pass |
p02730 | s929168182 | Accepted | s=input()
n=len(s)
def isk(S):
l=len(S)
f=1
for i in range(l//2+1):
if S[i]==S[l-i-1]:
f*=1
else:
f=0
if f:
return True
else:
return False
if isk(s) and isk(s[:(n-1)//2]) and isk(s[(n+1)//2:]):
print('Yes')
else:
print('No') |
p03352 | s380195250 | Accepted | import math
X = int(input())
list1 = []
for i in range(2,X+1):
for j in range(2,int((X + 1)/2)):
a = math.log10(i)/math.log10(j)
if a.is_integer():
list1.append(i)
if list1 == []:
print(1)
else:
print(max(list1))
|
p02793 | s417861070 | Wrong Answer | import fractions
import math
n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
lcm = a[0]
for i in range(1, n):
lcm = lcm * a[i] // fractions.gcd(lcm, a[i])
#lcm = lcm * a[i] // math.gcd(lcm, a[i])\
lcm %= MOD
for i in range(n):
ans += lcm * pow(a[i] , MOD-2, MOD)
# ans %= MOD
print(ans)
|
p02854 | s279726772 | Accepted | from itertools import accumulate
n = int(input())
a = list(map(int, input().split()))
ac = list(accumulate(a))
total = ac[-1]
ans = float('inf')
for i in range(n-1):
l, r = ac[i], total - ac[i]
ans = min(ans, abs(l-r))
print(ans) |
p03612 | s649515624 | Accepted | n = int(input())
p = list(map(int,input().split()))
c = 0
for i in range(n-1):
if p[i] == i+1:
p[i],p[i+1] = p[i+1],p[i]
c += 1
if p[n-1] == n:
c += 1
print(c) |
p02832 | s535005025 | Accepted | n = int(input())
a = list(map(int,input().split()))
v = 1
for i in range(n):
if a[i] == v:
v += 1
if v == 1:
print(-1)
else:
print(n - (v-1))
|
p03721 | s557317530 | Accepted | N, K = map(int, input().split())
now = 0
ab = [list(map(int, input().split())) for _ in range(N)]
ab = sorted(ab)
for a, b in ab:
if now < K <= now+b:
print(a)
exit()
now += b |
p02912 | s313495230 | Wrong Answer | import heapq
N, M = map(int, input().split())
a = [-int(x) for x in input().split()]
heapq.heapify(a)
num = 0
hq = 1
while num <= M and hq != 0:
hq = -heapq.heappop(a)//2
heapq.heappush(a, -hq)
num += 1
print(-sum(a)) |
p02720 | s308563240 | Wrong Answer | K = int(input())
data = []
C = 0
num = 0
def runrun(a):
if len(str(a)) == 1:
return True
else:
for i in range(len(str(a))-1):
difference_digit = int(str(a)[i+1])-int(str(a)[i])
if difference_digit**2 <= 1:
return True
while C < K:
num += 1
if runrun(num):
data.append(num)
C += 1
print(data[-1]) |
p02797 | s623666886 | Accepted | N,K,S = map(int,input().split())
if S == 10**9:
A = [S]*K + [S-1]*(N-K)
else:
A = [S]*K + [S+1]*(N-K)
print(*A) |
p03449 | s646991064 | Accepted | n = int(input())
grid = []
ans = []
for i in range(2):
grid.append(list(map(int, input().split())))
for i in range(n):
anst = 0
for _ in range(n):
anst = sum(grid[0][:i+1])
anst += sum(grid[1][i:n])
ans.append(anst)
print(max(ans))
|
p03160 | s049877447 | Wrong Answer | N = int(input())
H = list(map(int, input().split())) + [0] * 100
dp = [10**5] * (N+10)
dp[0] = 0
for i in range(0, N):
dp[i+1] = min(dp[i+1], dp[i] + abs(H[i]-H[i+1]))
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i]-H[i+2]))
# print(dp)
print(dp[N-1])
|
p03037 | s697581843 | Accepted | N,M = map(int,input().split())
min = 0
max = N
for _ in range(M):
L_i,R_i = map(int,input().split())
if L_i > min:
min = L_i
if R_i < max:
max = R_i
if min > max:
print(0)
else:
print(max - min + 1)
|
p03105 | s762385328 | Wrong Answer | A, B, C = map(int,input().split())
X =A//B
if X >= C:
print(C)
else:
print(X) |
p03030 | s735739554 | Accepted | n = int(input().strip())
res = []
for i in range(1, n + 1):
res.append(input().strip().split() + [i])
res[-1][1] = int(res[-1][1])
res.sort(key=lambda s: (s[0], -s[1]))
for i in res:
print(i[-1]) |
p03544 | s800729750 | Accepted | n = int(input())
a,b = 2,1
for i in range(n-1):
a,b = b,a+b
print(b)
|
p02793 | s267540199 | Accepted | from fractions import gcd
from functools import reduce, partial
import sys
def input():
return sys.stdin.readline()[:-1]
def lcm(a, b):
return a * b // gcd(a, b)
def func(a, b, l):
mod = 10**9 + 7
return (a + l*modinv(b, mod)) % mod
def modinv(a, b):
return pow(a,b-2,b)
def main():
mod = 10**9 + 7
N = int(input())
A = tuple(map(int, input().split()))
l = reduce(lcm, A) % mod
A = (0,) + A
ans = reduce(partial(func, l=l), A)
print(ans)
if __name__ == "__main__":
main()
|
p03862 | s005063211 | Wrong Answer | import collections
import sys
N, x = map(int, input().split())
A_lis = list(map(int, input().split()))
A_q = collections.deque(A_lis)
sys.setrecursionlimit(10 ** 9)
con = 0
tmp1 = A_q.popleft()
for i in range(N-1):
tmp2 = A_q.popleft()
if tmp1 + tmp2 > x:
con += (tmp1 + tmp2) - x
tmp1 = max(0, tmp1 - x)
else:
tmp1 = tmp2
print(con)
|
p03479 | s179756870 | Wrong Answer | x, y = map(int, input().split())
al = []
a = x
al.append(a)
for i in range(1, int(x)):
a *= 2
if a > y:
break
al.append(a)
print(len(al)) |
p03696 | s002118131 | Accepted | from collections import deque
n=int(input())
s=deque(input())
left=0
right=0
for i in range(n):
if s[i]=="(":
left+=1
else:
if left>0:
left-=1
else:
right+=1
for _ in range(left):
s.append(")")
for _ in range(right):
s.appendleft("(")
print("".join(s)) |
p02820 | s683008278 | Wrong Answer | N,K=map(int,input().split())
p=[int(x) for x in input().split()]
T=[0 if x=='r' else (1 if x=='s' else 2) for x in input()]
B=[-1]*K
s=0
for i in range(N):
v=(T[i]+2)%3
if v!=B[i%K]:
s+=p[v]
B[i%K]=v
else:
B[i%K]=T[i]
print(s)
|
p02727 | s862690643 | Wrong Answer | from heapq import heappop, heapify, heappush
x, y, a, b, c = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
AB = A[:x] + (B[:y])
heapify(AB)
heapify(C)
ans = 0
for _ in range(len(C)):
c = heappop(C)
ab = heappop(AB)
if ab > c:
heappush(AB, ab)
break
heappush(AB, c)
ans = sum(AB)
print(ans)
|
p02778 | s693563384 | Accepted | s = input()
num = len(s)
for i in range (num):
print('x', end="") |
p03681 | s005571274 | Wrong Answer | import math
n, m = map(int, input().split())
d = 10 ** 9 + 7
fn = math.factorial(n) % d
fm = math.factorial(m) % d
if abs(n - m) > 2:
print(0)
elif abs(n - m) == 1:
print((fn * fm) % d)
elif abs(n - m) == 0:
print((2 * fn * fm) % d) |
p02882 | s319688477 | Wrong Answer | import numpy as np
a, b, x = map(int, input().split())
ans = np.rad2deg(np.arctan2(2 * (b - x/a**2), a))
print('{:.10f}'.format(ans))
|
p02595 | s707731610 | Wrong Answer | n,d=input().split()
a=[]
for x in range(int(n)):
x,y=input().split()
if (((int(x)**2)+(int(y)**2))**0.5)==float(int(d)):
a.append(1)
print(len(a))
|
p03359 | s135446021 | Wrong Answer | a, b = map(int,input().split())
print(min(a,b)) |
p02717 | s309144860 | Accepted | x,y,z=map(int,input().split())
print(z,x,y) |
p02888 | s279436824 | Accepted | import bisect
N = int(input())
num_list = list(map(int,input().split()))
num_list.sort()
res = 0
for a in range(N-2):
for b in range(a+1,N-1):
k = bisect.bisect_left(num_list,num_list[a]+num_list[b])
res += max(k-(b+1),0)
print(res) |
p02814 | s314867643 | Accepted | def gcd(a, b):
while b:
a, b = b, a % b
return a
def div_ceil(x, y): return (x + y - 1) // y
N, M = map(int, input().split())
*A, = map(int, input().split())
A = list(set([a // 2 for a in A]))
L = A[0]
for a in A[1:]:
L *= a // gcd(L, a)
for a in A:
if (L // a) % 2 == 0:
ans = 0
break
else:
ans = div_ceil(M // L, 2)
print(ans) |
p02696 | s713048404 | Accepted | A, B, N = map(int, input().split())
from math import floor
if B <= N:
x = B - 1
else:
x = N
cand = floor(A*x/B) - A * floor(x/B)
print(cand) |
p04019 | s762997301 | Accepted | def resolve():
S = str(input())
n = S.count('N')
s = S.count('S')
w = S.count('W')
e = S.count('E')
if n > 0 and s == 0:
print('No')
return
if n == 0 and s > 0:
print('No')
return
if w > 0 and e == 0:
print('No')
return
if w == 0 and e > 0:
print('No')
return
print('Yes')
return
resolve() |
p02600 | s094249491 | Accepted | n = int(input())
a = 10 - n // 200
print(a) |
p03455 | s276741422 | Accepted | a, b = map(int, input().split())
if a % 2 ==0 or b % 2 ==0:
print('Even')
else:
print('Odd') |
p03779 | s591871976 | Accepted | x = int(input())
ans = 0
t = 0
d = 0
while x > d:
t += 1
d += t
ans += 1
print(ans) |
p02933 | s255765209 | Wrong Answer | a = int(input())
s = input()
print(s if a > 3200 else 'red') |
p03059 | s356270288 | Wrong Answer | A,B,T=map(int,input().split())
print(((T+0.5)//A)*B) |
p03605 | s171755063 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
s = input()
if "9" in s:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p02783 | s431014695 | Accepted | h,a = map(int,input().split())
print(h//a if h%a == 0 else h//a+1) |
p02993 | s832758012 | Wrong Answer | a=list(input())
if a[0]==a[1] or a[0]==a[2] or a[0]==a[3] or a[1]==a[2] or a[1]==a[3] or a[2]==a[3]:
print('Good')
else:
print('Bad')
|
p02657 | s988294099 | Wrong Answer | #intの場合
L,R = map(int,input().split())
print(type(L),L,R)
# <class 'int'> 12 34
ans = L*R
print(ans) |
p03419 | s656091409 | Wrong Answer | N, M = map(int, input().split())
if N == 1:
if M == 1:
print(1)
else:
print(M-2)
else:
if N <= M:
print((N-2)*(M-2))
else:
print(0) |
p02681 | s441848882 | Accepted | S = input()
T = input()
print('Yes' if S == T[:-1] else 'No') |
p03705 | s133230258 | Wrong Answer | N,A,B = map(int,input().split())
check = B - A + 1
loop = N - 2
if B < A or (N == 1 and A != B):
print(0)
exit(0)
elif N == 1:
print(1)
exit(0)
if loop % 2 == 0:
ans = (check + check - loop +1)*(loop/2)
else:
ans = (check + check - loop+1)*((loop-1)/2)+check -(loop -1)/2
print(ans)
|
p02900 | s617770835 | Accepted | import fractions
A, B = map(int, input().split())
gcd = fractions.gcd(A, B)
ans = 1
sqrt = gcd ** 0.5
for i in range(2, int(sqrt) + 2):
if gcd % i == 0:
ans += 1
while True:
gcd //= i
if gcd % i != 0:
break
if sqrt < gcd:
ans += 1
print(ans) |
p03351 | s965579323 | Accepted | a,b,c,d=map(int,input().split())
print("Yes" if (abs(a-b)<=d and abs(b-c)<=d) or abs(a-c)<=d else "No") |
p02690 | s439318647 | Wrong Answer | X = int(input())
flag = False
for i in range(-10 ** 2, 10 ** 2):
for j in range(-10 ** 2, 10 ** 2):
if pow(i, 5) - pow(j, 5) == X:
print(i, j)
flag = True
break
if flag:
break |
p03109 | s772067712 | Accepted | s=input()
if int(s[5:7])<=4 and int(s[8:9])<=30:
print("Heisei")
else:
print("TBD") |
p02818 | s661239668 | Accepted | a,b,k=map(int,input().split())
print(max(a-k,0),min(b,(max(b-(k-a),0)))) |
p02731 | s778183099 | Wrong Answer | # -*- coding: utf-8 -*-
L = int(input())
maxV = 0
for x in range(1,L+1):
for y in range(1,L+1):
z = L-(x+y)
V = x*y*z
if maxV < V:
maxV = V
print(maxV) |
p02801 | s488775684 | Accepted | a=str(input())
print(chr(ord(a) + 1)) |
p03861 | s860981159 | Accepted | a, b, x = map(int, input().split())
print(b // x - (a - 1) // x) |
p03486 | s123058372 | Accepted | # abc082_b.py
S = input()
T = input()
S = sorted(S, reverse=False)
T = sorted(T, reverse=True)
if S >= T:
print('No')
else:
print('Yes')
|
p03095 | s558998826 | Wrong Answer | from collections import Counter
N = int(input())
S = list(input())
C = Counter(S)
count = 1
mod = 10*9 + 7
for i in C.values():
count *= i+1
count %= mod
print(count-1) |
p03012 | s203852635 | Accepted | n = int(input())
w = list(map(int, input().split()))
ans = []
for i in range(n):
x = abs(sum(w[:i])-sum(w[i:]))
ans.append(x)
print(min(ans)) |
p03679 | s163901734 | Accepted | X,A,B = map(int,input().split())
if B <= A:
print("delicious")
elif (B-A) <= X:
print("safe")
else:
print("dangerous") |
p03761 | s291336071 | Wrong Answer | n = int(input())
s =[[0]*26 for i in range(n)]
a =[0]*26
sa=''
for i in range(n):
s1=list(input())
for j in s1:
s[i][ord(j)-ord('a')]+=1
for j in range(26):
for i in range(n):
if a[j]==0:
a[j]=s[i][j]
elif a[j]>s[i][j]:
a[j]=s[i][j]
for i in range(26):
sa+=chr(ord('a')+i)*a[i]
print(sa)
|
p03251 | s477511102 | Wrong Answer | n,m,x,y=map(int,input().split())
xl=list(map(int,input().split()))
yl=list(map(int,input().split()))
cnt=0
for i in range(x,y+1):
if max(xl)<i and i<=min(yl):
cnt+=1
if cnt == 0:
print('War')
else:
print('No War') |
p03592 | s062914548 | Accepted | #!/usr/bin/env python3
n, m, k = [int(x) for x in input().split()]
for i in range(0, m + 1):
for j in range(0, n + 1):
c = i * (n - j) + j * (m - i)
if c == k:
print("Yes")
exit()
print("No")
|
p03493 | s209382939 | Accepted | s = input()
res = 0
for i in range(3):
if s[i] == "1":
res += 1
print(res) |
p03998 | s239987097 | Wrong Answer | SA = input()
SB = input()
SC = input()
turn = "a"
while(len(SA) > 0 and len(SB) > 0 and len(SC) > 0):
if turn == "a":
turn = SA[len(SA) - 1]
SA = SA[:-1]
elif turn == "b":
turn = SB[len(SB) - 1]
SB = SB[:-1]
elif turn == "c":
turn = SC[len(SC) - 1]
SC = SC[:-1]
if len(SA) == 0:
print("A")
elif len(SB) == 0:
print("B")
elif len(SC) == 0:
print("C") |
p04012 | s767320166 | Wrong Answer | w=input()
list_w=list(w)
count1=0
for i in range(0,len(list_w)):
a=list_w.count(list_w[i])
if(a%2==0):
count1+=1
elif(a%2 != 0):
count1-=1
if(count1>0):
print("Yes")
elif(count1<0):
print("No")
|
p03163 | s630414563 | Wrong Answer | import sys
input = sys.stdin.buffer.readline
N, W = map(int, input().split())
w = []
v = []
for i in range(N):
tmp_w,tmp_v = map(int,input().split())
w.append(tmp_w)
v.append(tmp_v)
dp = [[0]*(W+1) for j in range(N+1)]
for i in range(N):
for j in range(W+1):
if j < w[i]:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = dp[i][j-w[i]] + v[i]
print(dp[N][W]) |
p02696 | s481218909 | Accepted | import math
a, b, n = map(int, input().split())
x = b - 1
if x > n:
x = n
ans = math.floor(a * x / b) - a * math.floor(x / b)
print(ans)
|
p03962 | s361517785 | Accepted | #!/usr/bin/env python3
l = list(map(int, input().split()))
l = set(l)
print(len(l))
|
p02994 | s684838896 | Wrong Answer | import numpy as np
N,L=map(int,input().split())
taste=list(range(L,L+N))
#print(sum(taste))
min_abs=10**5
for i in range(N):
if abs(taste[i])<min_abs:
min_abs=taste[i]
#rec=taste[i]
#print(rec)
print(sum(taste)-min_abs) |
p02761 | s777269240 | Wrong Answer | N, M = map(int, input().split())
ans = [0] * N
for i in range(M):
s, c = map(int, input().split())
if [s, c] == [1, 0]:
ans = -1
break
if ans[s-1] in [0, c]:
ans[s-1] = c
else:
ans = -1
break
if ans != -1:
s = ""
for i in ans:
s += str(i)
ans = int(s)
print(ans) |
p02814 | s595020302 | Accepted | import math
def n_2(n):
c=0
while n%2==0:
c+=1
n>>=1
return (n,c)
N,M=map(int,input().split())
A=list(map(int,input().split()))
A[0],a=n_2(A[0])
p=False
for i in range(1,N):
A[i],b=n_2(A[i])
if a!=b:
p=True
break
if p:
print(0)
exit()
n=1
for _ in range(a-1):
n*=2
l=n
for a in A:
l=l*a//math.gcd(l,a)
ans=M//l-M//(2*l)
print(ans) |
p03437 | s400661432 | Accepted | x, y = map(int, input().split())
if x == y: print(-1)
elif (x/y).is_integer(): print(-1)
else: print(x)
|
p03838 | s689861205 | Accepted | x,y = map(int,input().split())
ans=abs(abs(x)-abs(y))
if x<0 and y<=0 or x>=0 and y>0:
if x>y:
ans+=2
else:
ans+=1
print(ans) |
p03281 | s981841922 | Accepted | n = int(input())
def get_divisors(n):
return [i for i in range(1, n//2+1) if n%i == 0] + [n]
ans = 0
for i in range(1, n+1, 2):
if len(get_divisors(i)) == 8:
ans += 1
print(ans) |
p02572 | s955845179 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
S = 0
P = 10**9 + 7
for i in range(N):
S = (S + A[i])%P
ans = 0
for i in range(N):
S = (S-A[i]+P)%P
a = (A[i]*S)%P
ans = (ans + a)%P
print(ans) |
p02897 | s071344344 | Accepted | n = int(input())
if n % 2 != 0:
print((int(n/2) + 1)/n)
else:
print((n/2)/n)
|
p03345 | s456018512 | Accepted | mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
a, b, c, k = map(int, input().split())
if k & 1:
print(b-a)
else:
print(a-b)
if __name__ == '__main__':
main()
|
p02963 | s432872662 | Accepted | def f():
s = int(input())
i9 = 10**9
if s == i9 ** 2:
print(i9, 0, 0, i9, 0, 0)
else:
print(i9 - (s%i9), s//i9 + 1, i9, 1, 0, 0)
if __name__ == '__main__':
f()
|
p02718 | s972958880 | Accepted | a=list(map(int, input().split()))
n=a[0]
m=a[1]
l=list(map(int, input().split()))
lm=sum(l)
l=sorted(l, reverse=True)
for i in range(m):
if l[i]*4*m<lm:
print("No")
exit()
print("Yes") |
p03293 | s891521821 | Accepted | S = input()
T = input()
import sys
for i in range(len(S)):
if S[i:len(S)] + S[:i] == T:
print("Yes")
sys.exit()
print("No") |
p02744 | s168736958 | Wrong Answer | import sys
sys.setrecursionlimit(100000)
strings=["a","b","c","d","e","f","g","h","i","j"]
N=int(input())
def f(x):
for i in x:
print(strings[i],end="")
if x[-1]==N-1:
return ""
print("")
if x[-1]-1==x[-2]:
x[-1]+=1
return f(g(x,N-1))
else:
x[-1]+=1
return f(x) |
p03607 | s988323057 | Wrong Answer | import collections
n = int(input())
an = []
for i in range(n):
a = input()
an.append(a)
c = list(str(collections.Counter(an).values()).replace('dict_values([','').replace('])','').replace(', ',''))
Ans = 0
for i in range(len(c)):
if int(c[i]) % 2 == 1:
Ans = Ans + 1
print(Ans) |
p02724 | s895693038 | Accepted | x = int(input())
fh = x // 500 * 1000
f = x % 500 // 5 * 5
print(fh + f) |
p02691 | s061781473 | Accepted | from collections import defaultdict
N = int(input())
A = list(map(int,input().split()))
B = [(i + 1) + A[i] for i in range(N)]
C = [(i + 1) - A[i] for i in range(N)]
d = defaultdict(int)
for b in B:
d[b] += 1
ans = 0
for c in C:
ans += d[c]
print(ans) |
p02663 | s768797903 | Accepted | h1, m1, h2, m2, k = map(int, input().split())
start = h1*60 + m1
end = h2*60 + m2
print(end- start - k)
|
p02731 | s885833513 | Wrong Answer | n = int(input())
if n % 3 == 2:
print(n//3 * (n//3+1) * (n//3+1))
else:
print(n//3 * n//3 * (n//3+n % 3)) |
p02996 | s000795566 | Wrong Answer | n = int(input())
time=0
alist=[]
for i in range(n):
a,b=map(int, input().split())
alist.append([a,b-a])
if b>time:
time=b
alist.sort(key=lambda x: x[1])
ans='Yes'
for i in range(n-1,-1,-1):
if time<alist[i][1]:
ans='No'
time=time-alist[i][0]
print(ans) |
p02957 | s517569621 | Accepted | a,b=map(int,input().split())
if abs(a-b)%2:
print('IMPOSSIBLE')
else:
print((a+b)//2) |
p02548 | s163164917 | Accepted | N = int(input())
ans = 0
for i in range(1, N):
for j in range(i, (N // i) + 1):
if i * j < N:
if i == j:
ans += 1
else:
ans += 2
print(ans) |
p02647 | s177175330 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(min(K,100)):
imos = [0]*(N+1)
for i, ai in enumerate(A):
imos[max(0, i-ai)] += 1
imos[min(N, i+ai+1)] -= 1
A = [imos[0]]
for i in range(1, N):
A += [imos[i]+A[i-1]]
print(' '.join(map(str, A))) |
p02556 | s571536882 | Accepted | n = int(input())
xpy_max = -1001001001
xpy_min = 1001001001
xmy_max = -1001001001
xmy_min = 1001001001
for i in range(n):
x, y = map(int, input().split())
xpy_max = max(xpy_max, x+y)
xpy_min = min(xpy_min, x+y)
xmy_max = max(xmy_max, x-y)
xmy_min = min(xmy_min, x-y)
ans = max(xpy_max - xpy_min, xmy_max - xmy_min)
print(ans)
|
p03767 | s018146241 | Accepted | n,*a=map(int, open(0).read().split())
print(sum(sorted(a)[n:][::2]))
'''
why do people think there is a purpose in life''' |
p03261 | s878229023 | Wrong Answer | n = int(input())
alist = [input() for i in range(n)]
if len(set(alist))==n:
if all(alist[i][-1]==alist[i+1][0] for i in range(n-1)):
print("Yes")
else:
print("No") |
p02765 | s776612031 | Accepted | N,R = (int(x) for x in input().split())
if N >= 10:
print(R)
else:
print(R+(10- N)*100) |
p03623 | s436081396 | Accepted | x, a, b = map(int, input().split())
print("A" if abs(x-a)<abs(x-b) else "B") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.