problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03339 | s640057878 | Wrong Answer | n = int(input())
a = list(input())
wcnt,ecnt,ans,box = 0,0,0,[]
W = a.count("W")
E = a.count("E")
for i in range(n):
if a[i] == "W":
box.append(E+wcnt)
wcnt += 1
W -= 1
else:
box.append(E+wcnt)
ecnt += 1
E -= 1
print(min(box)) |
p02796 | s348064063 | Accepted | N = int(input())
r = [list(map(int, input().split())) for _ in range(N)]
a = []
for i in r:
a.append((i[0]-i[1],i[0]+i[1]))
a.sort(key=lambda x:x[1])
ans = 0
cur = -float('inf')
for i in a:
if i[0] < cur:
continue
ans += 1
cur = i[1]
print(ans) |
p03637 | s799912137 | Wrong Answer | n = int(input())
a_lst = list(map(int, input().split()))
cnt = 0
for a in a_lst:
if a % 4 == 0:
cnt += 2
elif a % 2 == 0:
cnt += 1
else:
pass
if cnt >= n:
print('Yes')
else:
print('No') |
p02843 | s311645665 | Wrong Answer | x = int(input())
dp = [0]*(x + 105 + 1)
dp[100] = 1
dp[101] = 1
dp[102] = 1
dp[103] = 1
dp[104] = 1
dp[105] = 1
for i in range(100,x-105+5):
for j in range(100,106):
dp[i+j] = max(dp[i] , dp[i+j])
print(dp) |
p03345 | s241082270 | Accepted | A, B, C, K = map(int, input().split())
if K%2:
ans = -1*(A-B)
else:
ans = A-B
if ans > 1000000000000000000:
print("Unfair")
else:
print(ans) |
p03013 | s234477625 | Wrong Answer | n,m=map(int,input().split())
dp=[0]*(n+7)
dp[0]=1
a=[int(input())for _ in range(m)]
a=set(a)
for i in range(n):
if i+1 not in a:
dp[i+2]+=dp[i]
dp[i+1]+=dp[i]
print(dp[n])
|
p02797 | s044471046 | Accepted | N, K, S = map(int, input().split())
if S != 10**9:
ans = [S] * K + [10**9] * (N - K)
else:
ans = [S] * K + [10**9-1] * (N - K)
print(*ans) |
p03557 | s808812231 | Wrong Answer | import bisect
n = int(input())
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
print(A,B,C,sep="\n")
ans = 0
b_memo = [0]
for b in B:
a = bisect.bisect_left(A, b)
b_memo.append(b_memo[-1]+a)
for c in C:
b = bisect.bisect_left(B, c)
if (b == 0):
continue
ans += b_memo[b]
print(ans)
|
p02615 | s644932035 | Accepted | n=int(input())
l=list(map(int, input().split(' ')))
l=sorted(l)[::-1]
ans=l[0]
a=2
for i in range(1,n):
ans+=(min(2,n-a))*l[i]
a+=min(2,n-a)
if a==n:
break
print(ans)
|
p03645 | s884221915 | Accepted | import sys
readline = sys.stdin.readline
N, M = map(int, readline().split())
x = set()
y = set()
for _ in range(M):
a, b = map(int, readline().split())
if a == 1:
x.add(b)
if b == N:
y.add(a)
print('POSSIBLE' if x & y else 'IMPOSSIBLE')
|
p03408 | s798493756 | Wrong Answer | N = int(input())
s_lst = [input() for i in range(N)]
M = int(input())
t_lst = [input() for i in range(M)]
dict = {}
for i in s_lst:
dict[i] = 0
for i in t_lst:
dict[i] = 0
for i in s_lst:
dict[i] += 1
for i in t_lst:
dict[i] -= 1
infinity = float('inf')
max = -infinity
for i in dict.values():
if max < i:
max = i
print(max)
|
p03251 | s680241532 | Accepted | #!/usr/bin/env python3
n, m, x, y = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
x, y = min(x, y), max(x, y)
X, Y = max(X), min(Y)
x = max(X, x)
y = min(Y, y)
if x < y:
print("No War")
else:
print("War")
|
p03495 | s568629310 | Wrong Answer | from collections import Counter
n, k = list(map(int, input().split()))
balls = list(map(int, input().split()))
b_list = set(balls)
nums = len(b_list)
yoso, s_yoso = [], []
counter = Counter(balls)
kakikae, t = 0, 1
if nums > k:
for i, v in counter.most_common():
yoso += [v]
if nums <= k:
print(0)
else:
s_yoso = sorted(yoso, reverse=True)
while nums - k > t:
kakikae += s_yoso[t-1]
t += 1
print(kakikae) |
p03557 | s231305947 | Wrong Answer | from bisect import bisect_left, bisect_right
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(n):
b = B[i]
pos_a = bisect_right(A, b)
pos_c = bisect_left(C, b)
ans += pos_a * (n - pos_c)
# print(b, pos_a, pos_c)
print(ans)
|
p02818 | s137819892 | Accepted | A,B,K=map(int,input().split())
print(A-K,B) if K<=A else print(0,B-(K-A)) if K<=A+B else print(0,0) |
p04029 | s900549085 | Wrong Answer | import math
N = int(input())
print((1 + N)/2*N) |
p03309 | s307361938 | Accepted | N=int(input())
A=sorted(a-i-1 for i,a in enumerate(map(int,input().split())))
print(sum(abs(a-A[N//2]) for a in A)) |
p02640 | s273426962 | Accepted | X,Y = (map(int, input().split()))
X2= X*2
num = 0
for i in range(X+1):
if X2+num == Y:
print("Yes")
quit()
num +=2
print("No")
|
p02787 | s657363770 | Wrong Answer | import math
import numpy as np
H, N = map(int,input().split())
A_list = []
B_list = []
for _ in range(N):
A, B = map(int,input().split())
A_list.append(A)
B_list.append(B)
A = np.array(A_list)
B = np.array(B_list)
magic_used = 0
def choose_attack(H):
A_star = np.minimum(A, H)
performace = np.divide(A_star,B)
ind = np.argmax(performace)
return ind
while H >= 0:
ind = choose_attack(H)
magic_used += B[ind]
H = H - A[ind]
print(magic_used)
|
p03698 | s900749846 | Accepted | S = input()
for s in S:
if S.count(s) != 1:
print("no")
exit()
print("yes") |
p03127 | s420150795 | Accepted | #! -*- coding: utf -*-
import fractions
n = int(input())
monsters = list(map(int, input().split()))
for i in range(n-1):
monsters[i + 1] = fractions.gcd(monsters[i], monsters[i + 1])
print(monsters[-1])
|
p02640 | s560319607 | Accepted | x, y = [int(x) for x in input().split()]
canbe = "No"
for i in range(1, x + 1):
a = (i * 2) + (x - i) * 4
b = (i * 4) + (x - i) * 2
if a == y or b == y:
canbe = "Yes"
break
print(canbe)
|
p03293 | s664990134 | Accepted | from collections import deque
s = deque(list(input()))
t = deque(list(input()))
for i in range(len(s)):
if s == t:
print('Yes')
exit()
s.appendleft(s.pop())
print('No') |
p02786 | s517999177 | Wrong Answer | n = int(input())
a = [1]
if n % 2 == 1:
n -= 1
if n % 2 == 0:
for i in range(int(n / 2)):
a.append(2 * a[i])
ans = a[-1]*2 - 1
print(ans) |
p02723 | s448755607 | Wrong Answer | s=input()
if s[2]==s[3] and s[4]==s[5] and s[0]!=s[1] and s[0]!=s[2] and s[0]!=s[4] and s[1]!=s[2] and s[1]!=s[4] and s[2]!=s[4] :
print ('Yes')
else :
print ('No')
|
p03696 | s918428180 | Accepted | n = int(input())
s = str(input())
c = 0
from collections import deque
res = deque([])
for i in range(n):
if s[i] =='(':
c += 1
else:
c -= 1
if c < 0:
res.appendleft('(')
c = 0
res.append(s[i])
if c > 0:
res.append(')'*c)
print(''.join(list(res)))
|
p03419 | s980600135 | Wrong Answer | n,m = map(int, input().split())
if n == 1: print(m-2 if m >=2 else 0)
elif n == 1: print(n-2 if n>=2 else 0)
else: print((n-2) * (m-2)) |
p02882 | s261343299 | Wrong Answer | a,b,x = list(map(int,input().split()))
import math
if x >= a*a*b:
print(math.atan(2*(a*a*b-x)/(a*a*a)) * 180/math.pi)
else:
print(math.atan(a*b*b/(2*x)) * 180/math.pi)
|
p03317 | s193183716 | Accepted | from math import ceil
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(ceil((n-1)/(k-1))) |
p03478 | s955480881 | Accepted | n, a, b = map(int, input().split())
ans = 0
for i in range(1, n+1):
t = 0
v = i
while v > 0:
t += v%10
v//=10
if a <= t <= b:
ans += i
print(ans) |
p02791 | s926659418 | Wrong Answer | import numpy as np
from collections import Counter
# 最頻値
def mode(list):
c = Counter(list)
freq_scores = c.most_common()
max_count = freq_scores[0][1]
modes = []
for num in freq_scores:
if num[1] == max_count:
modes.append(num[0])
return(modes)
n = int(input())
p_list = list(map(int, input().split()))
ans = 1
for i in range(n - 1):
if p_list[i] >= p_list[i + 1]:
ans += 1
print(ans) |
p03778 | s880832536 | Accepted | w,a,b = map(int,input().split())
print(max(0,max(a,b)-(min(a,b)+w))) |
p03471 | s882021814 | Accepted | n,Y=map(int,input().split())
ans=0
for x in range(0,n+1):
if ans>0:
break
for y in range(0,n+1-x):
z=n-x-y
if 10000*x+5000*y+1000*z==Y:
ans+=1
print(str(x)+' '+str(y)+' '+str(z))
if ans>0:
break
if ans==0:
print(str(-1)+' '+str(-1)+' '+str(-1)) |
p02572 | s989308917 | Wrong Answer | #ここまでテンプレ
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n = int(stdin.readline().rstrip())
a = list(map(int,stdin.readline().rstrip().split()))
point = 0
mod = 10**9+7
su_a = sum(a)%mod
for i in a:
point += (su_a-i)*i
point %= mod
print(point//2) |
p03774 | s749246242 | 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):
dim, num = 10*10, -1
for j in range(m):
if abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1]) < dim:
dim = abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1])
num = j
print(num+1) |
p02725 | s707200356 | Wrong Answer | k,n = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n-1):
a.append(k+a[i])
ans = a[n-1]-a[0]
for i in range(n,n*2-1):
ans = min(ans,a[i]-a[i-n])
print(ans) |
p02676 | s005146545 | Accepted | k = int(input())
s = input()
if len(s) <= k:
print(s)
else:
print(s[:k] + '...')
|
p03486 | s594154147 | Accepted | s = sorted(input())
t = sorted(input())[::-1]
print("Yes" if s < t else "No") |
p02583 | s157315309 | Accepted | #!/usr/bin/env python3
import sys
input=sys.stdin.readline
n=int(input())
arr=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
tmp=[arr[i],arr[j],arr[k]]
tmp=sorted(tmp)
s=set(tmp)
if len(s)==3 and tmp[0]+tmp[1]>tmp[2]:
ans+=1
print(ans) |
p03324 | s871798580 | Accepted | d,n = map(int,input().split())
if n != 100:
print(100**d * n)
else:
print(100**d * n + 100**d)
|
p02917 | s515391132 | Accepted | N = int(input())
B = list(map(int, input().split()))
A = [B[0]]
for i in range(1, N-1):
c = min(B[i-1], B[i])
A.append(c)
A.append(B[N-2])
ans = 0
for j in range(N):
ans += A[j]
print(ans)
|
p03998 | s936078473 | Accepted | s = {'a':input(), 'b':input(), 'c':input()}
t = 'a'
while s[t] != '':
tmp = s[t][0]
s[t] = s[t][1:]
t = tmp
print(t.upper()) |
p02608 | s240108398 | Wrong Answer | n = int(input())
ans = [0 for _ in range(n+1)]
for x in range(1, int(n ** 0.5) + 1):
for y in range(1, int(n ** 0.5) + 1):
for z in range(1, int(n ** 0.5) + 1):
a = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if a <= n:
ans[a] += 1
for i in ans:
print(i)
|
p02629 | s415283503 | Accepted | import string
N = int(input()) - 1
ss = string.ascii_lowercase
ans = ""
while N >= 0:
ans += ss[N % 26]
N = N // 26 - 1
if N < 0:
break
print(ans[::-1])
|
p03720 | s704854451 | Accepted | # B - Counting Roads
def main():
import collections
n, m = map(int, input().split())
cnt = []
for _ in range(m):
temp = list(input().split())
cnt += temp
else:
ans = collections.Counter(cnt)
for i in range(1, n+1):
print(ans[str(i)])
if __name__ == "__main__":
main() |
p02946 | s950978254 | Accepted | k,x=map(int,input().split())
a=x-k+1
b=x+k-1
c=[]
for i in range(a,b+1):
c.append(i)
print(" ".join(map(str, c)))
|
p03639 | s042968138 | Accepted | N = int(input())
a = list(map(int,input().split()))
four = 0
two = 0
for i in range(N):
if(a[i] % 4 == 0):
four += 1
elif(a[i] % 2 == 0):
two += 1
if(four + two//2 >= N // 2):
print("Yes")
else:
print("No") |
p02882 | s106857375 | Accepted | import math
a, b, x = map(int, input().split())
if x <= (a**2*b)/2:
ans = math.degrees(math.atan((a*b*b)/(2*x)))
else:
ans = math.degrees(math.atan(2*(a**2*b-x)/a**3))
print(ans) |
p03817 | s012637074 | Accepted | x = int(input())
d, m = divmod(x, 11)
ans = d * 2
if m > 6:
ans += 2
elif m > 0:
ans += 1
print(ans) |
p02660 | s844967839 | Accepted |
n=int(input())
pf={}
for i in range(2,int(n**0.5)+1):
while n%i==0:
pf[i]=pf.get(i,0)+1
n//=i
if n>1:pf[n]=1
#print(pf)
cnt = 1
ans = 0
for i in pf.values():
tmp = i
while tmp >= cnt:
ans += 1
tmp = tmp - cnt
cnt += 1
cnt = 1
print(ans) |
p03043 | s690215943 | Accepted |
import math
n,k = map(int,input().split())
m = min(n, k)
win = 0#負ける確率
for i in range(1, m + 1):
a = math.ceil(math.log2(k / i)) #a回連続で表で勝利
win += 1 / n * pow(1 / 2, a) #iが出る確率*a回連続で表の確率
#print(i, a, 1 / n * pow(1 / 2, a), win)
win += 1 / n * max(0, n - k) #さいころでk以上が出る確率
print(win)
|
p02718 | s874519369 | Accepted | n, m = map(int, input().split())
x = [int(i) for i in input().split(maxsplit=(n-1))]
sum = 0
count = 0
for i in x:
sum += i
con = (1/(4*m))*sum
for i in x:
if i >= con:
count += 1
if count == m:
print('Yes')
exit()
print('No') |
p03284 | s105487747 | Accepted | n,k=map(int,input().split())
if n%k==0:
print(0)
else:
print(1) |
p02995 | s774215869 | Accepted | a, b, c, d = map(int, input().split())
def gcd(x,y):
while y:
x, y = y, x%y
return x
lcm = c*d // gcd(c,d)
def cnt(z):
return b//z - (a-1)//z
print(b+1-a-cnt(c)-cnt(d)+cnt(lcm)) |
p03109 | s718648135 | Wrong Answer | S = input()
print('Heisei' if S[5:7] < '04' or (S[6] == 4 and S[8:] < '31') else 'TBD') |
p03435 | s007289303 | Wrong Answer | c = [list(map(int, input().split())) for _ in range(3)]
print('Yes' if not sum(sum(c, [])) % 3 else 'No') |
p03387 | s693226026 | Wrong Answer | A = list(map(int, input().split()))
A = sorted(A)
if (A[2]-A[0]-(A[2]-A[1]))%2==0:
ans = A[2]-A[1]+(A[2]-A[0]-(A[2]-A[1]))/2
else:
ans = A[2]-A[1]+round((A[2]-A[0]-(A[2]-A[1]))/2)+2
print(int(ans)) |
p03773 | s662647269 | Accepted | A, B = [int(i) for i in input().split()]
print((A+B) % 24)
|
p02684 | s236013746 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
s = []
order = [-1] * (n+1)
l = 1
while order[l] == -1:
order[l] = len(s)
s.append(l)
l = A[l-1]
new = s[order[l]:]
t = len(new)
first = len(s) - t
if k > first:
print(new[(k-first)%t])
else:
print(s[k]) |
p03011 | s390555376 | Wrong Answer | x=list(map(int,input().split()))
sorted(x)
print(x[0]+x[1]) |
p02621 | s347191059 | Accepted | a = int(input())
print(a**3+a**2+a) |
p03693 | s600355960 | Accepted | rgb=input()
print("YES" if int(rgb[::2])%4==0 else "NO") |
p04030 | s984736418 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
s = input()
q = []
for i in range(len(s)):
if s[i] == "0":
q.append(0)
elif s[i] == "1":
q.append(1)
elif s[i] == "B" and len(q)!=0:
q.pop()
ans = ""
for i in range(len(q)):
ans += str(q[i])
print(ans) |
p02615 | s892304644 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
cnt = 0
j = 0
for i in range(n-1):
if i%2 == 1:
j += 1
cnt += a[j]
print (cnt) |
p03673 | s751585170 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append(0)
k = 0
if(n%2==1):
k = (n-1)//2
m = -1
else:
k = n//2
m = 1
for i in range(n):
if(i%2==0):
b[k+m*i//2]=a[i]
else:
b[k-m*(i+1)//2]=a[i]
ans = ""
for i in range(n):
ans += str(b[i])+" "
print(ans)
|
p03471 | s212680938 | Wrong Answer | a,b=map(int,input().split())
c,d,e=10000,5000,1000
for i in range(a):
for j in range(a):
for k in range(a-i-j):
if i*c+j*d+k*e==b:print(i,j,k)
else:print(-1,-1,-1) |
p02917 | s428705738 | Accepted | n = int(input())
b = list(map(int, input().split()))
max_value = b[0] + b[n - 2]
for i in range(n - 2):
max_value += min(b[i], b[i + 1])
print(max_value)
|
p03962 | s136345019 | Wrong Answer | s = input()
s = set(s)
print(len(s)) |
p03339 | s333385589 | Wrong Answer | n=int(input())
s=str(input())
s=list(s)
tempw=s.count("W")
ans=n-tempw
cnt=n-tempw
if s[0]=="W":
ans=ans-1
cnt=cnt-1
for i in range(1,n):
if s[i-1]=="W":
cnt=cnt+1
if s[i]=="E":
cnt=cnt-1
ans=min(ans,cnt)
print(ans) |
p02594 | s076185479 | Accepted | x = int(input())
if x >= 30:
print("Yes")
else:
print("No")
|
p03328 | s592539172 | Accepted | a, b = map(int, input().split())
height = (1 + (b - a)) * (b - a) / 2
print(int(height - b)) |
p02772 | s984302136 | Accepted | input()
aa = [int(i) for i in input().split()]
ans = "APPROVED"
for a in aa:
if a % 2 == 0 and a % 3 != 0 and a % 5 != 0:
ans = "DENIED"
break
print(ans)
|
p03804 | s944345348 | Accepted | from itertools import product
n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
for i, j in product(range(n - m + 1), repeat=2):
if all(a[i + k][j:j + m] == b[k] for k in range(m)):
print('Yes')
break
else:
print('No')
|
p02832 | s410969997 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in a:
if i == (ans + 1):
ans += 1
if ans:
print(N - ans)
else:
print(-1)
|
p02727 | s060407171 | Wrong Answer | import sys
#from collections import deque
input = sys.stdin.buffer.readline
x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int,input().split())),reverse=True)
q = sorted(list(map(int,input().split())),reverse=True)
r = sorted(list(map(int,input().split())),reverse=True)
ans = p[:x]
ans[x:x] = q[:y]
ans=sorted(ans,reverse=True)
i = 0
result = 0
for A in ans:
if A < r[i]:
result += r[i]
if i < c - 1:
i += 1
continue
result += A
print(result) |
p02697 | s781825138 | Accepted | n,m=map(int,input().split())
if n%4==0:
l=m//2+1
else:
l=m//2
if n%2==0:
for i in range(l):
print(i+1,n-i)
for i in range(m-l):
print(i+1+l,n-i-l-1)
else:
for i in range(m):
print(i+1,n-i) |
p04043 | s271606878 | Accepted | a=''.join(sorted(map(str,input().split())))
print('YES' if a=='557' else 'NO') |
p02791 | s239983423 | Accepted | import sys
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]
def main():
N = II()
P = LI()
ans = 0
min = N+1
for i in range(N):
if P[i]<min:
ans += 1
min = P[i]
print(ans)
if __name__ == "__main__":
main() |
p03761 | s917136400 | Accepted | n = int(input())
alphabet_cnt = [[0] * n for i in range(26)]
# [listA, listB, listC, ..., listZ]
# listA = [0, 1, 3, 2, 1, 4, ...] -> the number of A in Si (only min val is needed)
alphabet = list("abcdefghijklmnopqrstuvwxyz")
alphabet_map = dict(zip(alphabet, list(range(26))))
for i in range(n):
si = input()
for j in range(len(si)):
alphabet_cnt[alphabet_map[si[j]]][i] += 1
alphabet_intersect = [min(alp) for alp in alphabet_cnt]
print("".join([alphabet[idx] * cnt for idx, cnt in enumerate(alphabet_intersect)])) |
p03774 | s074890612 | Accepted | n,m = map(int, input().split())
num_list = []
for i in range(n):
num_list.append(list(map(int,input().split())))
check_list = []
for i in range(m):
check_list.append(list(map(int,input().split())))
for i in range(n):
d = 10**9
h = 0
for j in range(m):
if d > (abs(num_list[i][0]-check_list[j][0])+abs(num_list[i][1]-check_list[j][1])):
d = abs(num_list[i][0]-check_list[j][0])+abs(num_list[i][1]-check_list[j][1])
h = j+1
print(h) |
p03069 | s977227820 | Wrong Answer | N = int(input())
S = input()
w = S.count(".")
bl = S.count("#")
cnt = 0
for i in S[::-1]:
if i != "#":
break
cnt += 1
bl -= cnt
cnt = 0
for i in S:
if i != ".":
break
cnt += 1
w -= cnt
print(min(w, bl)) |
p03387 | s354693377 | Accepted | def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
A, B, C = mi()
m = max(A, B, C)
s = sum([A, B, C])
cnt = 0
while True:
if s%3==0 and s>=3*m:
break
s += 2
cnt += 1
print(cnt)
if __name__ == '__main__':
main() |
p02796 | s635058041 | Accepted | N = int(input())
XL = []
for i in range(N):
XL.append(list(map(int, input().split())))
XL = list(map(lambda x: [x[0] - x[1], x[0] + x[1]], XL))
XL = sorted(XL, key=lambda x: x[1])
r = XL[0][1]
cnt = 1
for i in range(1, N):
if XL[i][0] >= r:
r = XL[i][1]
cnt += 1
print(cnt)
|
p02963 | s559873471 | Wrong Answer | s = int(input())
v = 1e9
x=(v-s%v)%v
y=(s+x)/v
print("0 0 1000000000 1 ",x,y)
|
p03773 | s592434372 | Accepted | def actual(A, B):
return (A + B) % 24
A, B = map(int, input().split())
print(actual(A, B)) |
p03862 | s215316810 | Accepted | n,x = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if a[i] <= x:
if a[i]+a[i+1] <= x: continue
else:
ans += (a[i]+a[i+1])-x
a[i+1] -= (a[i]+a[i+1])-x
else:
ans += a[i]-x + a[i+1]
a[i], a[i+1] = x, 0
if a[-1] > x: ans += a[-1]-x
print(ans) |
p03555 | s327532068 | Accepted | print('YES') if input()[::-1]==input() else print('NO') |
p02729 | s233580201 | Accepted | N,M=list(map(int, input().split()))
print(N*(N-1)//2+M*(M-1)//2) |
p02833 | s883824818 | Wrong Answer | n = int(input())
ans = 0
if n % 2 != 0:
print(0)
exit()
denominator = 10
while n > denominator:
ans += n//denominator
denominator *= 5
print(ans) |
p03854 | s882216615 | Wrong Answer | import re
print("Yes" if re.match("^(dream|dreamer|erase|eraser)+$", input()) else "No") |
p03037 | s408450527 | Accepted |
S = input()
N = int(S.split(" ")[0])
M = int(S.split(" ")[1])
lArr = []
rArr = []
for i in range(M):
S = input()
l1 = int(S.split(" ")[0])
r1 = int(S.split(" ")[1])
lArr.append(l1)
rArr.append(r1)
lArr.sort()
rArr.sort()
l1 = max(lArr)
r1 = min(rArr)
if r1 < l1:
print(0)
else:
print(r1 - l1 + 1)
|
p02924 | s585958991 | Accepted | n=int(input())
print((n-1)*n//2) |
p02817 | s249314805 | Accepted | S, T = input().split()
print(T+S) |
p02645 | s830025194 | Accepted | x = input()
print(x[:3]) |
p03817 | s858687968 | Wrong Answer | x = int(input())
if x % 11 == 0:
ans = x // 11 * 2
else:
if x % 11 < 6:
ans = x // 11 * 2 + 1
else:
ans = x // 11 * 2 + 2
print(ans) |
p02946 | s097462507 | Wrong Answer | K,X=map(int,input().split())
for i in range(X-K+1,X+K-1):
print(i) |
p02792 | s974112442 | Accepted | n = int(input())
l = [[0 for j in range(9)]for i in range(9)]
for i in range(1,n+1):
if i % 10 != 0:
s_i = str(i)
l[int(s_i[-1])-1][int(s_i[0])-1] += 1
ans = 0
for i in range(9):
for j in range(9):
ans += l[i][j] * l[j][i]
print(ans) |
p02631 | s791628529 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
S=0
for a in A:
S ^= a
b = [S^a for a in A]
print(b) |
p03163 | s966461351 | Wrong Answer | n, w = map(int, input().split())
g = []
for i in range(n):
g.append(list(map(int, input().split())))
m = [[0 for j in range(w+1)]for i in range(n+1)]
for i in range(n+1):
for j in range(w+1):
if j-g[i-1][0] < 0:
m[i][j] = m[i-1][j]
else:
m[i][j] = max(m[i-1][j], m[i-1][j-g[i-1][0]]+g[i-1][1])
print(m[n][w]) |
p02817 | s902684527 | Accepted | s, t = map(str, input().split())
print(''.join([t, s])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.