problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03767 | s427265937 | Accepted | N = int(input())
a = sorted([int(i) for i in input().rstrip().split(' ')])
print(sum(a[N::2])) |
p03309 | s166927753 | Accepted | n = int(raw_input())
ais = map(int, raw_input().split())
bis = sorted([ai - i - 1 for i,ai in enumerate(ais)])
if len(bis) % 2:
b = bis[len(bis)/2]
else:
b = (bis[len(bis)/2 -1] + bis[len(bis)/2]) /2
q = 0
for i in range(len(ais)):
u = i+1
q += abs(ais[i] - (b+u))
print q
|
p03778 | s992823980 | Accepted | W, a, b = map(int, input().split())
xa = abs(a - b-W)
xb = abs(b - a-W)
if (a <= b <=a+W) or (b <= a <= b+W):
print("0")
else:
print(min(xa,xb)) |
p03556 | s596921861 | Accepted | N = int(input())
print(int(N**0.5)**2) |
p02701 | s508042553 | Wrong Answer | p = input()
a = p.strip()
l = a.split()
print(len(set(l)) - 1)
|
p02917 | s486552521 | Accepted | N = int(input())
B = [int(n) for n in input().split()]
total = B[0] + B[-1]
for i in range(N-2):
total += min(B[i], B[i+1])
print(total) |
p03284 | s551057934 | Accepted | N,K = map(int,input().split())
print(N%K%2) |
p04011 | s702148361 | Wrong Answer | N, K, X, Y = [int(input()) for i in range(4)]
print(X*K+(Y*(N-K))) |
p02879 | s539619925 | Accepted | a,b=[int(i) for i in input().split()]
if a<10 and b<10:
print(a*b)
else:
print(-1) |
p03624 | s126080544 | Accepted | S=list(set(input()))
S.sort()
import string
switch=True
A=list(string.ascii_lowercase)
for i in A:
if not i in S:
print(i)
switch=False
break
if switch:
print("None") |
p03548 | s733463655 | Wrong Answer | X,Y,Z = map(int,input().split())
t = Z
c = 0
while (True):
t+=Y
if t>=X:
print(c)
exit()
t+=Z
c+=1 |
p02963 | s169154208 | Wrong Answer | S = int(input())
v = 10**9
b2 = S//v
b1 = v*b2-S
print(v, 1, 0, 0, b1, b2)
|
p03161 | s091113323 | Wrong Answer | import sys
n,k=list(int(i) for i in input().split())
A=list(int(i) for i in input().split())
# n,k=10,4
# A=[40,10,20,70,80,10,20,70,80,60]
dpmincost=[0 for i in range(n)]
dpmincost[0]=0
for i in range(1,n):
x=sys.maxsize
for j in range(1,k+1):
if i-j>=0:
x=min(dpmincost[i-j]+abs(A[i]-A[i-j]),x)
dpmincost[i]=x
print(dpmincost)
|
p02982 | s717914760 | Accepted | import math
import itertools
n, d = map(int, input().split())
ary = []
for i in range(n):
x = list(map(int, input().split()))
ary.append(x)
c = 0
for j,k in itertools.combinations(ary,2):
s = 0
for l in range(d):
s += (j[l]-k[l])**2
ss = math.sqrt(s)
if ss.is_integer():
c += 1
print (c)
|
p02660 | s995602392 | Accepted | n = int(input())
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
f = factorize(n)
ans = 0
for i,j in f:
ans += int((-1+pow(1+8*j,0.5))/2)
print(ans) |
p03219 | s937264197 | Wrong Answer | a,b=map(int,input().split())
print(a+(b/2)) |
p03317 | s362783739 | Accepted | n,k=map(int,input().split())
a = list(map(int,input().split()))
if (n-1)%(k-1) != 0:
cnt = (n-1)//(k-1)+1
else:
cnt = (n-1)//(k-1)
print(cnt) |
p02753 | s248716302 | Accepted | s = input()
if s[0] == s[1] and s[1] == s[2]:
print("No")
else:
print("Yes")
|
p02701 | s743897659 | Wrong Answer | N = int(input())
a = []
for i in range(N):
a.append(input())
b = set(a)
print(len(a)) |
p02753 | s258365180 | Accepted | S=list(input())
S=set(S)
if len(S)==1:
print("No")
else:
print("Yes") |
p02675 | s138488396 | Wrong Answer | n=input()
n=n[-1]
print(n)
if n=='3':
print('bon')
if n=="0" or n=="1" or n=="6" or n=="8":
print('pon')
if n=="2" or n=="4" or n=="5" or n=="7" or n=="9":
print('hon')
|
p03951 | s386903825 | Accepted | n = int(input())
s = input()
t = input()
t = t[::-1]
i = 0
for i in range(n):
ch = t[i:]
ch = ch[::-1]
if ch in s:
break
else:
i += 1
print(n+i) |
p03380 | s920541526 | Accepted | n = int(input())
A = map(int, input().split())
A = sorted(A)
maxa = max(A)
from bisect import bisect_left
m = (maxa+1)//2
l2 = bisect_left(A, m)
if abs(A[l2] - m) >= abs(A[l2-1] - m):
print(maxa, A[l2-1])
else:
print(maxa, A[l2])
|
p02899 | s407784290 | Accepted | n=int(input())
as_=list(map(int,input().split()))
l=as_.copy()
for i,a in enumerate(as_):
l[a-1]=i+1
for v in l:
print(v, end=' ')
print('') |
p02608 | s984993568 | Accepted | n =int(input())
ans = [0 for _ in range(10050)]
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
v = i*i+j*j+k*k+i*j+j*k+k*i
if v<10050:
ans[v]+=1
for i in range(n):
print(ans[i+1]) |
p02775 | s882979485 | Wrong Answer | N = input()
ans = 0
flag = False
for i in N[::-1]:
tmp = int(i)
if flag:
if tmp < 5:
ans += tmp + 1
flag = False
else:
ans += 10 - tmp
else:
if tmp < 6:
ans += tmp
else:
ans += 9 - tmp
flag = True
print(ans) |
p03001 | s904019358 | Accepted | W,H,x,y = map(int,input().split())
S = (W*H)/2
if 2*x==W and 2*y==H:
flag = 1
else:
flag = 0
print(S,flag) |
p02726 | s993430337 | Accepted | import sys
input = sys.stdin.readline
n,x,y = map(int,input().split())
x,y = x-1,y-1
cnt = [0]*(n-1)
for i in range(n):
for j in range(i+1,n):
mi = min(j-i,abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-y))
#print(i,j,mi)
cnt[mi-1] += 1
print(*cnt,sep="\n")
|
p03693 | s981822261 | Accepted | r,g,b=map(int,input().split())
if (10*g+b)%4==0:
print("YES")
else:
print("NO")
|
p02717 | s526072457 | Wrong Answer | A,B,C = map(int, input().split())
tmp = A
A = B
B = tmp
tmp = A
A = C
C = tmp
print(A, end="")
print(B, end="")
print(C, end="") |
p02748 | s166037738 | Wrong Answer | import sys
input = sys.stdin.readline
A, B, M = map(int, input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
m = [list(map(int, input().split())) for _ in range(M)]
ans = 0
for x in m:
if not ans:
ans = a[x[0] - 1] + b[x[1] - 1] - x[2]
else:
ans = min(ans, a[x[0] - 1] + b[x[1] - 1] - x[2])
print(min(min(a) + min(b), ans))
|
p03962 | s956095354 | Wrong Answer | a, b, c = map(int, input().split())
count = 0
if a == b == c:
print(1)
elif a == b and not b == c:
print(2)
elif not a == b and not b == c:
print(3) |
p03481 | s128223806 | Wrong Answer | n,m=map(int,input().split())
m /= n
ans = 0
while m >= 1:
m /= 2
ans +=1
print(ans) |
p02818 | s473138077 | Accepted | A,B,K = map(int, input().split())
S=max([0,A-K])
if A<K:
T=max([0,B-(K-A)])
else:
T=B
print(str(S)+" "+str(T)) |
p03416 | s920818511 | Wrong Answer | A, B = map(int, input().split())
ans = 0
for i in range(A, B+1):
a = str(i)
l = len(a)
if a[:l//2] == a[l//2+1:]:
ans += 1
print(ans) |
p03797 | s722737202 | Accepted | n,m = map(int,input().split())
if m//2 >=n:
print(n+(m//2-n)//2)
else:
print(m//2)
|
p02677 | s961063661 | Accepted | import math
a,b,h,m = map(int,input().split())
ans = math.sqrt((a*math.cos((math.pi/6)*(h+m/60))-b*math.cos(2*math.pi*(h+m/60)))**2+(a*math.sin((math.pi/6)*(h+m/60))-b*math.sin(2*math.pi*(h+m/60)))**2)
print(ans) |
p04033 | s835831068 | Accepted | def mium():
a, b = map(int, input().split())
if a > 0:
print("Positive")
elif a == 0:
print("Zero")
elif b >= 0:
print("Zero")
else:
if ( b - a ) % 2 == 1:
print("Positive")
else:
print("Negative")
if __name__ == "__main__":
mium() |
p03262 | s337368291 | Wrong Answer | from math import gcd
n, x = map(int, input().split())
m = [x]+list(map(int, input().split()))
res = float('inf')
m.sort()
if n==1:
print(m[1]-x)
else:
for i in range(n-1):
a = m[i+1]-m[i]
b = m[i+2]-m[i+1]
res = min(res, gcd(a, b))
print(res) |
p03821 | s874942041 | Accepted | n = int(input())
A, B = zip(*[tuple(map(int, input().split()))for _ in range(n)])
cnt = 0
for a, b in zip(A[::-1], B[::-1]):
cnt += -(-(cnt+a)//b)*b-(cnt+a)
print(cnt)
|
p03625 | s488970961 | Accepted | from collections import Counter
n = int(input())
d = Counter(list(map(int, input().split())))
ans = -1
for k in sorted(d.keys())[::-1]:
if ans == -1 and d[k] >= 4:
print(k*k)
exit()
elif ans == -1 and d[k] >= 2:
ans = k
elif ans != -1 and d[k] >= 2:
print(ans*k)
exit()
print(0) |
p02677 | s745224962 | Accepted | a,b,h,m = map(int,input().split())
ans = 0
import math
rada = (2*math.pi/12)*(h+m/60)
radb = (2*math.pi/60)*m
if rada >= radb:
theta = rada - radb
else:
theta = radb - rada
if theta < math.pi:
pass
else:
theta = 2*math.pi - theta
ans = math.sqrt(a**2+b**2 - 2*a*b*math.cos(theta))
print(ans) |
p03862 | s061498012 | Accepted | candi_num, can_exist_num = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 0
# first candi
ofs = max(0, A[0] + A[1] - can_exist_num)
if ofs > A[1]:
A[0] -= ofs - A[1]
ans += ofs - A[1]
for i in range(1, candi_num):
two_sum = A[i - 1] + A[i]
ofs = max(0, two_sum - can_exist_num)
A[i] -= ofs
ans += ofs
print(ans) |
p03076 | s606457133 | Wrong Answer | list=[int(input()) for i in range(5)]
sum=0
max=0
for x in list:
y = -(-x//10)*10
sum+=y
max=(y-x, max)
print(sum) |
p03041 | s515227237 | Accepted | N, K = map(int, input().split())
S = input()
ans = ''
for i in range(N):
if i == K-1:
if S[i] == 'A':
ans += 'a'
elif S[i] == 'B':
ans += 'b'
else:
ans += 'c'
else:
ans += S[i]
print(ans) |
p02598 | s559845714 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
L = 0
R = max(A)
while R-L > 1:
X = (L+R)/2
m = 0
for i in range(N):
c = A[i]/X
if c == int(c):
m += int(c) - 1
else:
m += int(c)
if m <= K:
R = X
else:
L = X
print(int(R))
|
p02690 | s750878734 | Wrong Answer | def main():
x=int(input())
for i in range(10**9):
y=x-i**5
if y>0:
s=1
else:
s=-1
if(abs(y)**0.2).is_integer():
return (i,-s*int(abs(y)**0.2))
if(abs(x+i**5)**0.2).is_integer():
return (-i,-s*int(abs(y)**0.2))
print(main()) |
p03986 | s975295634 | Accepted | S = input()
s, t = 0, 0
for i in S:
if i == "S":
s += 1
else:
if s == 0:
t += 1
else:
s -= 1
print(s + t) |
p02597 | s280583867 | Accepted | n = int(input())
c = input()
w = 0
r = c.count('R')
ans = r
for k in range(n):
if c[k] == 'W':
w += 1
elif c[k] == 'R':
r -= 1
cnt = max(w, r)
if ans > cnt:
ans = cnt
print(ans) |
p03695 | s941619079 | Accepted | n = int(input())
la = [int(w) for w in input().split()]
cnt = [0]*9
for a in la:
if a > 3200:
a = 3200
cnt[a // 400] += 1
mi = len([_ for _ in cnt[:8] if _ > 0])
ma = mi+cnt[8]
if mi == 0:
mi = 1
print(mi, ma)
|
p03438 | s492675530 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
t = sum(b)-sum(a)
res=0
for i in range(n):
if b[i]>a[i]:
res += (b[i]-a[i]+1)//2
if res > t:
print('No')
else:
print('Yes') |
p03407 | s575818857 | Accepted | a,b,c=map(int,input().split())
print('Yes' if a+b>=c else 'No') |
p03146 | s554981286 | Wrong Answer | s = int(input())
def f(n):
if n % 2 == 0:
return n // 2
else:
return 3 * n + 1
temp = []
count = 0
ans = 0
for i in range(s, 1000000):
if i == s:
a = i
else:
a = f(temp[count-1])
temp.append(a)
count += 1
if a == 4:
ans = i - s + 4
break
print(ans) |
p02696 | s192888636 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Sat May 2 22:26:54 2020
@author: Kanaru Sato
"""
a,b,n = list(map(int,input().split()))
def floorspecial(x):
u = int((a*x)/b)
v = a*int(x/b)
print(int(u-v))
if a == 1:
print(0)
elif n < b:
floorspecial(n)
else:
p = int(n/b)*b
p = p-1
floorspecial(p) |
p03994 | s476337974 | Wrong Answer | X='abcdefghijklmnopqrstuvwxyz'*2
S=input()
k=int(input())
N=[]
for s in S:
if s=='a':
N.append(0)
else:
N.append(26-X.index(s))
ans=''
for i in range(len(S)):
if N[i]<=k :
k-=N[i]
ans+='a'
else:
ans+=S[i]
for i in reversed(range(len(S))):
if ans[i]!='a':
ans=ans[:i]+X[X.index(ans[i])+k]+ans[i+1:]
break
print(ans) |
p03339 | s967117009 | Accepted | #!/usr/bin/env python3
from itertools import accumulate
n = int(input())
s = [0 if i == "E" else 1 for i in str(input())]
s_cumsum = list(accumulate(s))
s_cumsum_rev = list(accumulate(reversed(s)))
ans = 10**10
for i in range(1, n-1):
a_1 = s_cumsum[i-1]
a_0 = i - a_1
b_1 = s_cumsum_rev[-2-i]
b_0 = (n-1-i) - b_1
# print(a_1+b_0)
ans = min(ans, a_1+b_0)
ans = min(ans, s_cumsum[-2])
ans = min(ans, (n-1)-s_cumsum_rev[-2])
print(ans)
|
p03637 | s957092246 | Wrong Answer | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter
#from scipy.misc import comb
N = int(input())
A = list(map(int, input().split()))
cnt1 = 0
cnt4 = 0
for a in A:
if a%4 == 0:
cnt4 += 1
elif a%2 != 0:
cnt1 += 1
if cnt1 <= cnt4:
print("Yes")
else:
print("No") |
p03696 | s822758537 | Wrong Answer | from itertools import groupby
N = int(input())
S = input()
ans = []
#S1 = groupby(S)
a=0
a1=0
b=0
b1=0
S1 = groupby(list(S))
for key,group in S1:
group = list(group)
if list(key)==['(']:
a=len(group)
a1+=a
else:
b=len(group)
if a1==0:
b1+=b
else:
a1-=b
S = "("*b1+S
S = S+")"*a1
print("".join(S)) |
p03827 | s651802780 | Wrong Answer | n = int(input())
ans = list(input())
count = 0
for i in range(n):
if ans[i] == 'I':
count += 1
elif ans[i] == 'D':
count -= 1
print(count + 1) |
p02624 | s438338961 | Wrong Answer | N = int(input())
lst = [0]*N
for i in range(1,N+1):
for j in range(1,i):
if i % j == 0:
lst[i-1] += i
print(sum(lst)) |
p03633 | s629356479 | Accepted | import fractions
N = int(input())
x = int(input())
ans = x
for i in range(N-1):
input_x = int(input())
ans = (ans * input_x // fractions.gcd(ans, input_x))
print(ans) |
p02759 | s645742084 | Accepted | import math
N=int(input())
print(math.ceil(N/2)) |
p04020 | s237380733 | Wrong Answer | n=int(input())
a=[int(input())for i in range(n)]
c=0
for i in a:c+=i//2
print(c) |
p02647 | s631781803 | Accepted | n,k,*a=map(int,open(0).read().split())
r=range(n)
while(min(a)<n)*k:
k-=1;b=[0]*n*3
for i in r:t=a[i];b[max(0,i-t)]+=1;b[i-~t]-=1
for i in r:b[i+1]+=b[i]
a=b[:n]
print(*a) |
p02761 | s341968719 | Accepted | n, m = map(int, input().split())
s = []
c = []
for i in range(m):
line = list(map(int, input().split()))
s.append(line[0])
c.append(line[1])
l = 10**(n-1)
if n == 1:
l = 0
for i in range(l, 10**n):
flag = 0
flag2 = 0
for j in range(m):
if str(i)[s[j]-1] != str(c[j]):
flag = 1
if flag == 0:
print(i)
flag2 = 1
break
if flag2 == 0:
print(-1) |
p03705 | s029850357 | Accepted | n, a, b = map(int, input().split())
if b - a > n + 1:
ans = 0
elif a > b:
ans = 0
else:
diff = b - a
ans = (b - a) * (n - 2) + 1
print(ans) |
p03162 | s413699898 | Accepted | N = int(input())
H = []
for _ in range(N):
h = tuple(map(int, input().split()))
H.append(h)
dp = H[0]
for i in range(1, N):
a, b, c = H[i]
dp_next = [
max(dp[1] + a, dp[2] + a),
max(dp[0] + b, dp[2] + b),
max(dp[0] + c, dp[1] + c),
]
dp = dp_next
print(max(dp)) |
p02687 | s245732746 | Accepted | s=input()
if(s=="ABC"):
print("ARC")
else:
print("ABC") |
p03773 | s705514567 | Accepted | A,B = [int(i) for i in input().split()]
C = A + B
if C >=24:
print(C - 24)
else:
print(C) |
p02873 | s951513014 | Accepted | s = input()
n = len(s)
ans = 0
c = [0]*(n+1)
for i in range(n):
if s[i]=='<':
c[i+1] = c[i]+1
for i in range(n-1,-1,-1):
if s[i]=='>':
c[i] = max(c[i],c[i+1]+1)
print(sum(c))
|
p02910 | s176575468 | Accepted | s = input()
if "L" in s[0::2] or "R" in s[1::2]:
print("No")
else:
print("Yes") |
p03797 | s347699032 | Accepted | n,m=map(int,input().split())
ans=0
if n*2<=m:
ans+=n
m-=2*n
ans+=int(m/4)
print(ans)
else:
ans+=int(m/2)
print(ans) |
p03486 | s235827817 | Wrong Answer | s = str(input())
t = str(input())
ans1 = [0]*26
ans2 = [0]*26
for i in s:
ans1[ord(i)-97] += 1
for i in t:
ans2[ord(i)-97] += 1
#print(ans1)
#print(ans2)
for i in range(1,27):
if ans2[-i] < ans1[-i]:
print("No")
exit()
elif ans2[-i] > ans1[-i]:
print("No")
exit()
elif i == 26 and ans1[0] == ans2[0]:
print("No")
exit()
else:
print("No") |
p03427 | s408316517 | Accepted | N = input()
tmp = len(N) - 1
NL = list(N)
if len(N) == 1:
print(int(N))
elif all(x == "9" for x in NL[1:]):
print(int(N[0]) + tmp * 9)
else:
print(int(N[0]) - 1 + tmp * 9) |
p02742 | s971061191 | Accepted | h, w = list(map(int, input().split()))
if h != 1 and w != 1:
print((h * w + 1) // 2)
else:
print(1)
|
p03693 | s494787076 | Accepted | r,g,b = map(int,input().split())
a = 100*r + 10*g + b
if a%4 == 0:
m = "YES"
else:
m = "NO"
print(m) |
p02707 | s656644236 | Accepted | n=int(input())
a=list(map(int,input().split()))
rank=[0]*n
for i in a:
rank[i-1]+=1
for i in rank:
print(i) |
p02629 | s261636460 | Wrong Answer | import math
import numpy
n = int(input())
x = list(numpy.base_repr(n,26))
s = list("abcdefghijklmnopqrstuvwxyz")
t = list("0123456789")
for i in range(16):
t.append(s[i].upper())
for i in x:
print(s[t.index(i)-1],end = "") |
p02570 | s933099214 | Accepted | D, S, T= map(int, input().split())
time = D/S
if T >= time:
print("Yes")
else :
print("No")
|
p03351 | s026841724 | Wrong Answer | a,b,c,d = map(int, input().split())
if abs(a-b)<= d and abs(b-c)<=d:
print('Yes')
else:
print('No') |
p02639 | s685275820 | Accepted | l = list(map(int,input().split()))
for i in range(5):
if l[i] == 0:
print(i+1)
|
p02910 | s904165728 | Accepted |
k = ["R","U","D"]
g = ["L","U","D"]
S = list(input())
ans = "Yes"
for n,s in enumerate(S):
if(n % 2 == 0):
if((s in k) == False):
ans = "No"
break
else:
if((s in g) == False):
ans = "No"
break
print(ans)
|
p02959 | s051561809 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
taoshita = 0
for i in range(n):
taoshita += min(a[i], b[i])
yoryoku = max(a[i]-b[i], 0)
taoshita += min(a[i+1], yoryoku)
a[i+1] = max(a[i+1]-yoryoku, 0)
print(taoshita) |
p02583 | s516295135 | Wrong Answer | n=int(input())
a=list(map(int,input().split(" ")))
ans=0
for x in range(n):
for y in range(x+1,n):
for z in range(y+1,n):
if a[x]+a[y]>a[z] and a[y]+a[z]>a[x] and a[z]+a[x]>a[y] and a[x]!=a[y]!=a[z]:
ans=ans+1
print(ans)
|
p03555 | s655794026 | Accepted | if input()==input()[::-1]:
print("YES")
else:
print("NO") |
p02601 | s607500330 | Accepted | A,B,C = list(map(int,input().split()))
K = int(input())
for i in range(K):
for j in range(K-i):
k = K-i-j
if 2**i*A<2**j*B<2**k*C:
print('Yes')
exit()
print('No') |
p02832 | s271635289 | Accepted | N = int(input())
A = list(map(int, input().split()))
if(1 not in A):
print(-1)
else:
right = 1
ans = 0
for i in range(N):
if(A[i] == right):
right += 1
ans += 1
print(N - ans) |
p03457 | s629549323 | Wrong Answer | N=int(input())
t=[0]*100001
x=[0]*100001
y=[0]*100001
for i in range(1,N+1):
t[i],x[i],y[i]=map(int, input().split())
count=0
for i in range(1,N+1):
dt=(t[i])-(t[i-1])
dist=abs(x[i]-x[i-1])+abs(y[i]-y[i-1])
if dist>dt:
break
else:
pass
if dist%2==dt%2:
pass
else:
break
count+=1
if count==N:
print('YES')
else:
print('NO') |
p02761 | s527962600 | Accepted |
def main():
n, m = map(int, input().split(' '))
if m == 0:
print(10 ** (n - 1) if n > 1 else 0)
return
num_list = [0] * n
done_list = [-1] * n
for _ in range(m):
s, c = map(int, input().split(' '))
if (n > 1 and s == 1 and c == 0) or (done_list[s - 1] != -1 and done_list[s - 1] != c):
print(-1)
exit()
num_list[s - 1] = c
done_list[s - 1] = c
if num_list[0] == 0:
num_list[0] = 0 if n == 1 else 1
print("".join(map(str, num_list)))
main()
|
p02973 | s172261721 | Accepted | from bisect import *
def solve():
ans = 0
N = int(input())
A = [-int(input()) for _ in range(N)]
lis = [A[0]]
for i in range(1,N):
if A[i]>=lis[-1]:
lis.append(A[i])
else:
ind = bisect_right(lis,A[i])
lis[ind] = A[i]
ans = len(lis)
return ans
print(solve()) |
p03386 | s341823918 | Wrong Answer | a,b,k = map(int, input().split())
nums = []
for i in range(a, min(b,a+k)): nums.append(i)
for i in range(b, max(0,b-k), -1): nums.append(i)
for i in sorted(set(nums)): print(i) |
p03220 | s551513126 | Accepted | n = int(input())
t,a = map(int,input().split())
H = list(map(int,input().split()))
A = []
for i in range(n):
tmp = abs((t-int(H[i])*0.006)-a)
A.append(tmp)
B = min(A)
print(A.index(B)+1) |
p03479 | s344537026 | Wrong Answer | import math
X, Y = map(int, input().split())
n = math.log(Y / X, 2)
n = math.floor(n)
print(n + 1) |
p03035 | s169322996 | Accepted | N, K = map(int,input().split())
if N > 12:
print(K)
elif N > 5:
print(K//2)
else:
print(0) |
p02556 | s152646556 | Wrong Answer | def f(x, y):
return x-y, x+y
n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
max_x = 0
min_x = 2000000000
max_y = 0
min_y = 2000000000
for xi, yi in p:
x_, y_ = f(xi, yi)
max_x = max(max_x, x_)
min_x = min(min_x, x_)
max_y = max(max_y, y_)
min_y = min(min_y, y_)
print(max(max_x - min_x, max_y - min_y)) |
p03774 | s668961795 | Wrong Answer | N,M = map(int,input().split())
a = [list(map(int,input().split())) for x in range(N)]
c = [list(map(int,input().split())) for x in range(M)]
min_cpoint = -1
num_stack = 999999
for i in range(N):
for j in range(M):
if num_stack > abs(a[i][0]-c[j][0]) + abs(a[i][1]-c[j][1]):
num_stack = abs(a[i][0]-c[j][0]) + abs(a[i][1]-c[j][1])
min_cpoint = j+1
print(min_cpoint)
min_cpoint = -1
num_stack = 9999999
|
p02664 | s409267477 | Accepted | t=input().strip()
print(t.replace('?', 'D')) |
p02658 | s044945217 | Accepted | n = int(input())
ln =list(map(int, input().split()))
a = 1
for i in sorted(ln):
if a > 10**18 or a == 0:
break
else:
a = a*i
if a> 10**18:
print('-1')
else :
print(a)
|
p02594 | s698786708 | Accepted | x=int(input())
if(x>=30):
print('Yes')
else:
print('No') |
p03778 | s191184073 | Wrong Answer | w, a, b = map(int, input().split())
if w >= abs(a-b):
print(0)
elif a > b:
print(w-b)
elif b > a:
print(w-a) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.