problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03679 | s090353024 | Accepted | x, a, b = map(int, input().split())
if b - a <= 0:
print("delicious")
elif 0 < b - a <= x:
print("safe")
else:
print("dangerous") |
p02860 | s911739099 | Accepted | N=int(input())
S=input()
if S[:(N//2)]==S[(N//2):]:
print("Yes")
else:
print("No") |
p03076 | s993555889 | Wrong Answer | A = [0]*5
for i in range(5):
A[i] = int(input())
mi = 10
sm = 0
min_r = 0
for i in range(5):
d = A[i] // 10
r = A[i] % 10
if r == 0:
sm += (d)*10
else:
sm += (d+1)*10
if r != 0 and min(mi,r) < mi:
mi = min(mi,r)
idx = i
min_r = r
min_d = d
#print(min_r,min_d,i,sm)
print(sm - (10-min_r)) |
p02697 | s569048744 | Wrong Answer | n, m = map(int, input().split())
if n % 2 != 0:
for i in range(1, m + 1):
print(i, n - i)
else:
flag = False
j = 0
for i in range(1, m + 1):
if i == n / 2:
flag = True
if flag:
j += 1
print(i, n - j)
j += 1 |
p02663 | s967718120 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
H1, M1, H2, M2, K = map(int, input().split())
start_time = H1*60 + M1
end_time = H2*60 + M2
print(end_time - start_time - K)
|
p03427 | s213038263 | Accepted | # coding: utf-8
# Your code here!
N=int(input())
if len(str(N))==1:
ans=N
else:
if 1==len(set(list(str(N))[1:])) and int(str(N)[1])==9:
ans=9*(len(str(N))-1) + int(str(N)[0])
else:
ans=9*(len(str(N))-1) + int(str(N)[0])-1
print(ans)
|
p03632 | s409492034 | Accepted | a,b,c,d=map(int,input().split())
print(max(min(b,d)-max(a,c),0)) |
p02983 | s218002025 | Accepted | L, R = map(int, input().split())
ans = 2019
if L//2019 != R//2019:
print(0)
exit(0)
else:
L = L%2019
R = R%2019
for i in range(L,R+1):
for j in range(i+1,R+1):
ans = min(ans,(i*j)%2019)
print(ans) |
p03161 | s514499126 | Accepted | import math
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp_list = [math.inf] * N
dp_list[0] = 0
for i, h in enumerate(H[:-1]):
for j in range(1, min(K + 1, N - i)):
cost_step = abs(H[i] - H[i + j])
cost_total = dp_list[i] + cost_step
if dp_list[i + j] > cost_total:
dp_list[i + j] = cost_total
print(dp_list[-1]) |
p02690 | s019335880 | Wrong Answer | X = int(input())
for i in range(-1000, 1000):
for j in range(-10, 10):
if i**5 - j**5 == X:
print(i, j)
exit() |
p03681 | s519544146 | Accepted | import sys
import math
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
MOD = 10 ** 9 + 7
if abs(M - N) >= 2:
print(0)
return
d = math.factorial(N)
m = math.factorial(M)
if N == M:
d *= 2
print(d * m % MOD)
if __name__ == '__main__':
main()
|
p03254 | s421732615 | Wrong Answer | import numpy as np
n, x = map(int, input().split())
a = np.array(list(map(int, input().split())))
a = np.sort(a)
cnt = 0
for a_ in a:
cnt += 1
if a_ <= x:
x -= a_
elif a_ > x:
break
print(cnt if x == 0 else cnt - 1) |
p02628 | s560326558 | Wrong Answer | N, K = [int(n) for n in input().split()]
P = sorted([int(n) for n in input().split()])
print(sum(P[0:3]))
|
p03107 | s942089458 | Wrong Answer | S=input()
num0=0
num1=1
for i in range(len(S)):
if S[i]=='0':
num0+=1
else:
num1+=1
print(min(num0,num1))
|
p02753 | s466434868 | Accepted | S = str(input())
if S[0] == S[1]:
if S[1] == S[2]:
print("No")
quit()
print("Yes") |
p03067 | s353662512 | Accepted | a,b,c = map(int,input().split())
if(b < c and a > c):
print("Yes")
elif(a < c and b > c):
print("Yes")
else:
print("No") |
p02696 | s806496337 | Accepted | import math
a,b,n=map(int,input().split())
def func(a,b,x):
return math.floor(a*x/b)-a*math.floor(x/b)
print(func(a,b,min(b-1,n)))
|
p02646 | s948433763 | Accepted | def LI():return list(map(int,input().split()))
def yes():print("YES")
def no():print("NO")
a,v=LI()
b,w=LI()
t=int(input())
if a<b:
if a+v*t>=b+w*t:
yes()
else:
no()
if a>b:
if a-v*t<=b-w*t:
yes()
else:
no()
|
p02801 | s353668571 | Wrong Answer | n = input()
print(n,'is followed by',chr(ord(n) + 1)) |
p03408 | s506750468 | Wrong Answer | n = int(input())
S = [input() for i in range(n)]
m = int(input())
T = [input() for j in range(m)]
ANS = []
for i in range(len(S)):
p = 0
q = 0
for j in range(len(S)):
if S[i]== S[j]:
p += 1
for k in range(len(T)):
if S[i] == T[k]:
q += -1
ANS.append(p+q)
print(S) |
p02747 | s052285096 | Accepted | s = input()
ans = s.split('hi')
if ''.join(ans) == '':
print('Yes')
else:
print('No') |
p02982 | s275588354 | Wrong Answer | n,d = map(int,input().split())
x = [list(map(int,input().split())) for i in range(n)]
l = []
s = []
for i in range(n):
for j in range(i+1,n):
t = 0
for k in range(d):
t += abs(x[i][k] - x[j][k]) ** 2
l.append(t)
m = max(l)
i = 1
while i ** 2 <= l[-1]:
s.append(i ** 2)
i += 1
ans = 0
for i in range(len(s)):
ans += l.count(s[i])
print(ans) |
p02832 | s797007072 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = sorted(set(a))
len_a = len(a)
len_b = len(b)
ans = len_a - len_b
if b[0] != 1:
print(-1)
elif b[0] == 1 and b[len_b-1] == len_b:
print(ans)
|
p02778 | s861289607 | Wrong Answer | S = input()
print("*"*len(S)) |
p02790 | s215565437 | Accepted | a, b = map(int, input().split())
c = max(a,b)
d = min(a,b)
e = 0
for i in range(c):
e += d*(10**i)
print(e) |
p03862 | s490567538 | Wrong Answer | n,x=map(int,input().split())
a=list(map(int,input().split()))
asum=[0]*(n-1)
for i in range(n-1):
asum[i]+=(a[i]+a[i+1])
temp=0
for j in range(n-1):
if asum[j]>=x:
if j!=n-2:
asum[j+1]-=(asum[j]-x)
temp+=(asum[j]-x)
print(temp) |
p02768 | s889759130 | Wrong Answer | n, a, b = map(int, input().split())
from math import factorial
ans = 0
if n % 2 == 1:
for i in range(1, n // 2 + 1):
ans += factorial(n) // factorial(i) // factorial(n - i)
ans *= 2 + 1
else:
for i in range(1, n // 2):
ans += factorial(n) // factorial(i) // factorial(n - i)
ans *= 2
ans += factorial(n) // factorial(n // 2) // factorial(n - n // 2) + 1
ans -= factorial(n) // factorial(a) // factorial(n - a)
ans -= factorial(n) // factorial(b) // factorial(n - b)
print(ans) |
p02603 | s629414779 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
money=1000
num=0
for i in range(n-1):
if a[i]==a[i+1]:
money=money
elif a[i]<a[i+1]:
num+=money//a[i]
money-=(money//a[i])*a[i]
elif a[i]>a[i+1]:
money+=a[i]*num
num=0
if a[-1]>a[-2]:
money+=a[-1]*num
elif a[-1]<=a[-2]:
money=money
print(money) |
p03221 | s261261891 | Accepted | N, M = map(int, input().split())
dic = {i+1:[] for i in range(N)}
for i in range(M):
p, y = map(int, input().split())
dic[p].append((i,y))
for i in range(N):
dic[i+1].sort(key=lambda x:x[1])
ans = [0] * M
for k, vs in dic.items():
order = 1
for c, y in vs:
ans[c] = (k, order)
order += 1
for city, order in ans:
print(str(city).zfill(6)+str(order).zfill(6))
|
p02657 | s754603261 | Wrong Answer | import math
S = list(input().split())
a = int(S[0])
b = S[1].replace('.', '')
B = int(b)
ans = (a * B) // 100
print(ans) |
p02796 | s093315272 | Accepted | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt) |
p03481 | s496263582 | Accepted | x, y = map(int, input().split())
cnt = 0
while x <= y:
x *= 2
cnt += 1
print(cnt) |
p03494 | s431693377 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
print(A)
count = 0
while all(a % 2 == 0 for a in A):
A = [a/2 for a in A]
count +=1
print(A)
print(count)
|
p02935 | s489182650 | Accepted | n = int(input())
v = list(map(int,input().split(" ")))
v.sort()
# print(v)
w = []
w0 = (v[0] + v[1])/2
w.append(w0)
for i in range(1,n-1):
y = (v[i+1] + w[i-1])/2
w.append(y)
# print(w)
# print(w)
print(w[n-2]) |
p03379 | s112394860 | Accepted | #!/usr/bin/env python
import sys
import copy
input = sys.stdin.readline
n = int(input())
x = list(map(int, input().split()))
xx = sorted(x)
l = xx[(n-1)//2]
r = xx[n//2]
mid = (l+r)/2
for i in range(n):
if x[i] >= mid:
print(l)
else:
print(r)
|
p02612 | s458050428 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
pay = (N + 1000 - 1) // 1000 * 1000
ans = pay - N
print(ans)
if __name__ == "__main__":
main()
|
p03637 | s596649026 | Accepted | from collections import deque
n = int(input())
A = list(map(int, input().split()))
cnt_2 = 0
cnt_4 = 0
for i in range(n):
a = A[i]
if a%4==0:
cnt_4+=1
elif a%2==0:
cnt_2+=1
cnt_else = n-cnt_2-cnt_4
cnt_else += cnt_2%2
if cnt_else-1 <= cnt_4:
print("Yes")
else:
print("No") |
p02814 | s111017976 | Accepted | from fractions import gcd
N,M = map(int,input().split())
a = list(map(int,input().split()))
def count_2(x):
count = 0
while x%2 == 0:
count += 1
x /= 2
return count
flag = True
for i in range(N-1):
if count_2(a[i]) != count_2(a[i+1]):
flag = False
break
if not flag:
print(0)
exit()
lcm=1
for i in range(N):
lcm = lcm*a[i]//gcd(a[i],lcm)
ans=0
if lcm//2<=M:
ans=(M-lcm//2)//lcm+1
print(ans) |
p02642 | s532716585 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = [0] * (10 ** 6 + 1)
a.sort()
ans = 0
for i in a:
cnt[i] += 1
a = set(a)
for k in a:
for l in range(k * 2, (10 ** 6 + 1), k):
cnt[l] += 1
for m in a:
if cnt[m] == 1:
ans += 1
print(ans) |
p03611 | s820690165 | Accepted | n = int(input())
cnt = [0] * 100002
a = list(map(int, input().split()))
for v in a:
cnt[v] += 1
cnt[v-1] += 1
cnt[v+1] += 1
print(max(cnt)) |
p03860 | s546066792 | Accepted | a,b,c=map(str,input().split())
print("A"+b[0]+"C") |
p02873 | s389774928 | Wrong Answer | s = input()
a = [0]*(len(s)+1)
for i in range(len(s)):
if s[i] == '<':
a[i+1] = max(a[i+1], a[i]+1)
for i in range(len(s)-2, -1, -1):
if s[i] == '>':
a[i] = max(a[i], a[i+1]+1)
print(sum(a))
|
p04012 | s332519947 | Wrong Answer | strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
if not strlist.count(a) % 2:
flag = "No"
print(flag) |
p03862 | s549035712 | Accepted | n, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if A[i]+A[i+1]>x:
ans += A[i+1]+A[i]-x
A[i+1] = max(0,x-A[i])
print(ans) |
p03797 | s856129244 | Accepted | N,M=list(map(int, input().split()))
K=M-2*N
if K>=0:
print(N+K//4)
else:
print(min(N, M//2))
|
p02866 | s620924252 | Wrong Answer | N,*D=map(int,open(0).read().split())
c=[0]*N
for i in D:c[i]+=1
if D[0]>0 or c[0]>1:print(0);exit()
a=1
for i in range(max(D)):a*=c[i]**c[i+1]
print(a)
|
p03352 | s979374789 | Accepted | # solution
data=int(input())
array=[]
for i in range(1,34):
for j in range(2,11):
if (i**j)<=data:
array.append(i**j)
print(max(array)) |
p03773 | s778985798 | Wrong Answer | n=sum(list(map(int,input().split())));print(n-24 if n>24 else n) |
p02988 | s649428498 | Accepted | n=int(input())
cnt=0
*s,=map(int,input().split())
for i in range(n-2):
if (s[i]<s[i+1]<=s[i+2])or(s[i+2]<s[i+1]<=s[i]):
cnt += 1
else:
pass
print(cnt) |
p02729 | s106722758 | Accepted | score = list(map(int,input().split()))
if score[0] == 1:
evennum = 0
else:
evennum = score[0]*(score[0]-1)/2
if score[1] == 1:
oddnum = 0
else:
oddnum = score[1]*(score[1]-1)/2
print(int(evennum+oddnum)) |
p02843 | s952296253 | Wrong Answer | X = int(input())
DP=[0]*(X+1)
def dp(n):
if n<100:
return 0
if 100<=n and n<=105:
return 1
res = 0
for i in range(100,106):
res |= DP[n-i]
return res
for i in range(X):
DP[i] = dp(i)
ans=DP[X]
#print(DP)
print(ans)
#print(*ans, sep='/n') |
p03293 | s503327881 | Wrong Answer | s = list(input())
t = list(input())
f = False
l = len(s)
p = list("a"*l)
for i in range(l):
if s == p:
f = True
break
for j in range(l):
p[(j+i)%l] = t[j]
if f: print("Yes")
else: print("No") |
p04030 | s326913698 | Accepted | s = list(input())
x = len(s)
a = []
for i in range(x):
if s[i] == '0':
a.append('0')
elif s[i] == '1':
a.append('1')
elif s[i] == 'B':
if a == []:
continue
else:
a.pop(-1)
b = ''.join(a)
print(b) |
p03795 | s630195080 | Accepted | N = int(input())
print(800 * N - 200 * (N // 15)) |
p02548 | s354199668 | Wrong Answer | from functools import lru_cache
N = int(input())
# A * B <= N - 1はいくつありますか？
count = 0
for A in range(1, N-1):
# B <= (N - 1) // A
count += (N - 1) // A
print(count) |
p03767 | s030911493 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
if N ==1:
print(a[1])
else:
for n in range(N):
ans += a[2*n-1]
print(ans) |
p02657 | s255268352 | Wrong Answer | for a in range (1, 101):
for b in range (1, 101):
print(a * b)
|
p02779 | s227662441 | Wrong Answer | n = int(input())
an = map(int, input().split())
an = list(an)
if len(set(an)) == n :
print("Yes")
else :
print("No")
|
p02836 | s622474778 | Accepted | S = input()
rS = "".join([S[-i] for i in range(1,len(S)+1) ])
c = 0
for i in range(len(S)):
if S[i] != rS[i]:
c +=1
print(int(c/2)) |
p02726 | s931693990 | Accepted |
N,X,Y = list(map(int,input().split()))
X,Y = X-1,Y-1
ans = [0]*N
for i in range(N):
for j in range(i+1,N):
a = min(j-i,abs(X-i)+abs(Y-j)+1,abs(X-j)+abs(Y-i)+1)
ans[a]+=1
#print(i,j,a)
print(*ans[1:],sep="\n")
|
p02608 | s818926865 | Accepted | from numba import jit
N = int(input())
@jit
def f():
ret = [0] * 10001
for i in range(1, 200):
for j in range(1, 200):
for k in range(1, 200):
z = i**2 + j**2 + k**2 + i*j + j*k + k*i
if z < 10001:
ret[z] += 1
return ret
ans = f()
for x in range(1, N+1):
print(ans[x])
|
p03274 | s077518081 | Accepted | N, K = map(int, input().split())
m = float("inf")
x = sorted(list(map(int, input().split())))
for i in range(N-K+1):
m = min(abs(x[i])+abs(x[i+K-1]-x[i]), abs(x[i+K-1])+abs(x[i]-x[i+K-1]), m)
print(m) |
p03910 | s606602628 | Wrong Answer | n = int(input())
bott = 0
rem = -1
for i in range(10000):
bott = i*(i+1)//2
bott2 = (i+1)*(i+2)//2
if(bott<=n and n<bott2):
rem = n-bott
bott = i
break
ans = []
for i in range(bott):
ans.append(i+1)
ans[-1] += rem
for i in range(bott):
print(ans[i])
|
p02719 | s543152301 | Wrong Answer | n, k = map(int, input().split())
t = n % k
if t < k:
print(t)
else:
print(k)
|
p03644 | s422446502 | Accepted | n=int(input())
ans = 1
while ans <= n:
ans = ans*2
print(ans//2) |
p02973 | s654227027 | Accepted | import bisect
import collections
N = int(input())
A = [int(input()) for i in range(N)]
q = collections.deque([-1])
for x in A:
id = bisect.bisect_left(q, x)
# print(id, x, q)
if id == 0:
q.appendleft(x)
else:
q[id-1] = x
print(len(q))
|
p03795 | s971193210 | Wrong Answer | n = int(input())
print(n*800-(n%15)*200) |
p02784 | s254497559 | Accepted | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
print('Yes' if sum(A) >= H else 'No') |
p02597 | s829511358 | Accepted | n = int(input())
c = input()
rl = [ i for i,_ in enumerate(c) if _ == 'R' ]
cnt = 0
loc = 0
rid = -1
while True:
try:
if c[loc] == 'W':
rloc = rl[rid]
rid -= 1
if rloc < loc:
break
else:
cnt += 1
loc += 1
if loc == n:
break
#print(c,cnt)
except:
break
print(cnt) |
p03328 | s325535578 | Accepted | a, b = map(int, input().split())
cum = [0]
for i in range(1000):
cum.append(cum[-1] + i)
for i in range(len(cum)-1):
if cum[i+1] - cum[i] == (b-a):
print(cum[i] - a)
exit() |
p02771 | s862586882 | Wrong Answer | a,b,c = map(int, input().split())
if a == b and b == c and c == a:
print("No")
else:
print("Yes")
|
p02861 | s141604423 | Wrong Answer | import numpy as np
import itertools as it
n = int(input())
city = [np.array(list(map(int,input().split()))) for i in range(n)]
dist = [[[] for i in range(n)] for i in range(n)]
for i in range(n):
for j in range(n):
v = city[i] - city[j]
dist[i][j] = np.linalg.norm(v, ord=2)
ps = it.permutations([i for i in range(n)])
anss = []
for p in ps:
ans = 0
print(p)
for i in range(n-1):
ans += dist[p[i]][p[i+1]]
anss.append(ans)
print(anss)
print(np.average(anss))
|
p03427 | s009103900 | Wrong Answer | # https://atcoder.jp/contests/agc021/tasks/agc021_a
n = input()
ans = int(n[0]) - 1 + 9 * (len(n) - 1)
print(ans) |
p03852 | s956613613 | Wrong Answer | c=input()
if c=="a" or c=="b" or c=="c" or c=="d" or c=="e":
print("vowel")
else:
print("consonant") |
p02957 | s753683077 | Accepted | a, b = map(int, input().split())
if (a + b) % 2 == 0:
print((a + b) // 2)
else:
print("IMPOSSIBLE")
|
p03814 | s194844948 | Accepted | s=input()
fdl=s.find("A")
fdr=s.rfind("Z")
print((fdr-fdl)+1) |
p02765 | s800851582 | Wrong Answer | n, r = map(int,input().split())
print(r)
if n < 10:
r = r + 100*(10-n)
print(r) |
p02817 | s074045138 | Wrong Answer | print(input().replace(" ", "")) |
p03627 | s737348094 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
tate = 0
yoko = 0
i = 0
while i < (N - 1):
if A[i] == A[i + 1]:
if tate == 0:
tate = A[i]
else:
yoko = A[i]
if tate > 0 and yoko > 0:
break
i += 1
i += 1
print(tate * yoko)
|
p03625 | s922611658 | Wrong Answer | from collections import Counter
n = int(input())
a = Counter(map(int, input().split()))
xy = [0] * 2
for i in a.items():
if i[1] >= 2:
if i[0] > xy[0] and i[0] > xy[1]:
xy[1] = xy[0]
xy[0] = i[0]
elif i[0] > xy[1]:
xy[1] = i[0]
else:
pass
print(xy[0] * xy[1]) if xy[0] != 0 and xy[1] != 0 else print(0)
|
p03971 | s556354746 | Wrong Answer | N,A,B = map(int,input().split())
S =input()
for i in range(N):
if S[i]=='a' and i < A+B:
print('Yes')
elif S[i]=='b' and i < B:
print('Yes')
else:
print('No') |
p02842 | s735474658 | Accepted | N = int(input())
if (N*100)%108 == 0 :
print(int(N/1.08))
else :
for i in range(1,100) :
if (N*100+i) % 108 == 0 :
print(int((N*100+i)/108))
break
else :
print(":(")
|
p03680 | s021816533 | Accepted | import sys
n = int(input())
a = [int(input()) for a in range(n)]
cnt = 1
a.insert(0,0)
if a[1] ==2:
print(1)
sys.exit()
sel = a[1]
for i in range(n+1):
if a[sel] == 2:
cnt += 1
print(cnt)
sys.exit()
else:
cnt += 1
sel = a[sel]
print(-1) |
p03719 | s992752886 | Wrong Answer | #Between Two Integers
def ABC_61_A():
A,B,C = map(int, input().split())
if C>=A and C<=B:
print('YES')
else:
print('NO')
if __name__ == '__main__':
ABC_61_A() |
p03262 | s220518621 | Accepted | def gcd(n,m):
if n%m==0:
return m
elif m%n==0:
return n
elif n>m:
n=n%m
return gcd(n,m)
else:
m=m%n
return gcd(n,m)
N,X=map(int,input().split())
x=list(map(int,input().split()))
m=0
for i in range(0,N):
if i==0:
m=abs(X-x[i])
else:
m=gcd(m,abs(X-x[i]))
print(m) |
p03761 | s994562998 | Wrong Answer | from collections import Counter
n = int(input())
L = [Counter(sorted(str(input()))) for _ in range(n)]
ans = ''
for k in L[0]:
for i in range(n):
m = L[0][k]
if L[i][k] < L[0][k]:
m = min(m, L[i][k])
ans = ans + k * m
print(ans)
|
p04034 | s233383757 | Accepted | n,m = map(int,input().split())
flag = [False]*n
balls = [1]*n
flag[0]= True
for i in range(m):
x,y = map(int,input().split())
x -= 1
y -= 1
balls[x] -=1
balls[y] += 1
if flag[x] == True:
flag[y] =True
if flag[x] == True and balls[x] == 0:
flag[x] = False
cnt = 0
for i in range(n):
if flag[i] == True and balls[i]>=1:
cnt += 1
print(cnt) |
p02958 | s203593082 | Accepted | N = int(input().rstrip())
l1 = [int(i) for i in input().rstrip().split()]
l2 = sorted(l1)
result = 'YES'
dnum = 0
for i in range(N):
if l1[i] != l2[i]:
dnum = dnum + 1
if dnum > 2:
result = 'NO'
break
print(result)
|
p02791 | s933260314 | Wrong Answer | def main():
import sys
N = int(input())
input_2 = sys.stdin.readline
P_list = list(input_2().split())
i_num = 0
for i in range(N):
if P_list[i] <= min(P_list[:i+1]):
i_num += 1
print(i_num)
if __name__ == "__main__":
main()
|
p03438 | s539810859 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
Da=[-(-(b-a)//2) for a,b in zip(A,B) if a<b]
Db=[a-b for a,b in zip(A,B) if a>b ]
if sum(B)-sum(A)>=max(sum(Da),sum(Db)):print("Yes")
else:print("No")
if __name__=='__main__':
main() |
p02595 | s255839506 | Wrong Answer | n,d=map(int,input().split())
x=[0 for i in range(n)]
for i in range(n):
x[i]=list(map(int,input().split()))
a=0
for i in range(i):
if x[i][0]**2+x[i][1]**2<=d**2:
a+=1
print(a)
|
p02753 | s019752275 | Accepted | s=input()
if (s == 'AAA') or (s == 'BBB'):
print('No')
else:
print('Yes')
|
p03030 | s556547084 | Wrong Answer | N = int(input())
X = [[input().split(), i + 1] for i in range(N)]
print(X)
X = sorted(X, key = lambda x:(x[0][0], -int(x[0][1])))
print(X)
for i in range(N):
print(X[i][1]) |
p03627 | s391153539 | Wrong Answer | from collections import Counter
N = int(input())
A = sorted(map(int, input().split()), reverse=True)
c = Counter(A)
check = 0
for i in range(N):
if (c[A[i]] > 1):
check += 1
if (check <= 1):
print(0)
exit()
L = []
for i, v in c.items():
if (v > 1):
L.append(i)
L.sort(reverse=True)
print(L[0] * L[1])
|
p03799 | s158441650 | Wrong Answer | N, M = map(int, input().split())
if (M >= 2*N):
print(N+(M-2*N)//4)
else:
print(N//2) |
p02767 | s588912990 | Accepted | n = int(input())
xn = [int(num) for num in input().split()]
answer = []
for n in range(1,max(xn)+1):
sum = 0
for x in xn:
sum += (x-n)**2
answer.append(sum)
print(min(answer)) |
p02973 | s844812721 | Wrong Answer | import bisect
N=int(input())
A=[int(input()) for _ in range(N)]
color=[]
A=A[::-1]
for a in A:
i=bisect.bisect_left(color,a)
if i==len(color):
color.append(a)
else:
color[i]=a
print(len(color)) |
p02630 | s616735282 | Wrong Answer | N=int(input())
lst=list(map(int,input().split()))[:N]
Q=int(input())
for i in range(Q):
x,y=map(int,input().split())
lst.sort()
for i in range(len(lst)):
if lst[i]==x:
lst[i]=y
else:
break
print(sum(lst)) |
p02597 | s379686754 | Accepted | n = input()
data = input()
w = []
r = []
for i in range(len(data)):
if data[i] == "W":
w.append(i)
else:
r.append(i)
ans = 0
if len(w) == 0:
print(ans)
elif len(r) == 0:
print(ans)
else:
r = r[::-1]
for i in range(min(len(w), len(r))):
tmp_w = w[i]
tmp_r = r[i]
if tmp_w <= tmp_r:
r.append(tmp_w)
w.append(tmp_r)
ans += 1
else:
break
print(ans) |
p02787 | s342672299 | Wrong Answer | inf = 10**10
H, N = map(int, input().split())
A = []
B = []
for n in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
dp = [inf] * (H + 10 ** 4)
for n in range(N):
for h in range(H):
if dp[h] == inf:
continue
dp[h + A[n]] = min(dp[h + A[n]], dp[h] + B[n])
print(min(dp[H:]))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.