problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03264 | s864639833 | Wrong Answer | n = int(input())
print(-(-n//2)*((n+1)//2))
|
p03438 | s074892020 | Accepted | N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
result = False
big_a = sum([ai - bi for ai, bi in zip(a,b) if ai > bi])
big_b = sum([(bi - ai) // 2 for ai, bi in zip(a,b) if bi > ai])
sum_diff = sum(b) - sum(a)
if big_a <= big_b:
result = True
ans = "Yes" if result else "No"
print(ans) |
p03457 | s543964714 | Accepted | N = int(input())
can = True
for i in range(N):
t, x, y = list(map(int, input().split()))
if not t%2 == (x+y)%2 or (x+y) > t:
can = False
break
if can:
s = "Yes"
else:
s = "No"
print(s) |
p02699 | s143872885 | Accepted | s,w=map(int,input().split())
if w>=s:
ans='unsafe'
else:
ans='safe'
print(ans) |
p02983 | s192297586 | Accepted | #133_C
l,r=map(int,input().split())
if r//2019>l//2019: print(0)
else:
r%=2019
l%=2019
ans=2019
for i in range(l,r+1):
for j in range(i+1,r+1):
ans=min(ans,(i*j)%2019)
print(ans) |
p02761 | s323638032 | Accepted | N,M = map(int,input().split())
sc = [list(map(int,input().split())) for _ in range(M)]
i = 0
while len(str(i))<=N:
k = 0
if len(str(i))!=N:
i += 1
continue
for el in sc:
if str(i)[el[0]-1] == str(el[1]):
k += 1
if k == M:
print(i)
exit()
i += 1
print(-1) |
p02911 | s940602479 | Accepted | n,k,q=list(map(int,input().split()))
wins=[0]*n
for i in range(q):
a=int(input())
wins[a-1]+=1
#print(wins)
for w in wins:
if k-(q-w)>0:
print('Yes')
else:
print('No') |
p03001 | s980608108 | Wrong Answer | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)
W, H, x, y = rl()
area = (H*W)/2.0
flag = 0
if x*2 == W or y*2 == H:
flag = 1
print(area, flag)
|
p03627 | s875857638 | Accepted | def INT():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(map(int, input().split()))
from collections import Counter
import sys
N = INT()
A = LI()
count_A = Counter(A)
ans = 0
if sum([c > 1 for c in count_A.values()]) <= 1:
print(ans)
sys.exit()
count_st = []
for k, v in count_A.items():
if v == 1:
continue
count_st.append(k)
if v >= 4:
count_st.append(k)
count_st.sort(reverse = True)
ans = count_st[0] * count_st[1]
print(ans) |
p02814 | s996904488 | Accepted | from fractions import gcd
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
def lcm(values):
ans = values[0]
for i in range(1, len(values)):
ans = ans * values[i] // gcd(ans, values[i])
return ans
def count_div2(value):
count = 0
while value % 2 == 0:
count += 1
value //= 2
return count
min_value = lcm(A)
amount = M * 2 // min_value
div2 = count_div2(A[0])
if any([count_div2(a) != div2 for a in A]):
print(0)
else:
print((amount + 1) // 2)
|
p03219 | s764456591 | Accepted | X, Y = map(int, input().split())
print(X+Y//2) |
p03730 | s009499944 | Wrong Answer | a,b,c=map(int,input().split())
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 'Yes' if c % gcd(a,b) == 0 else 'No'
print(ans) |
p02697 | s682741541 | Accepted | n,m=map(int,input().split())
if n%2==1:
x=""
for i in range(m):
x+=f"{i+1} {n-i} "
print(x)
else:
x=""
for i in range(m):
x+=(f"{i+1} {n-i} " if i<m/2 else f"{i+1} {n-i-1}\n")
print(x) |
p02727 | s725925646 | Accepted | x,y,a,b,c= list(map(int, input().split()))
p= list(map(int, input().split()))
q= list(map(int, input().split()))
r= list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
np=p[0:x]
nq=q[0:y]
np.extend(nq)
m=min(np)
nr=[i for i in r if i>=m]
np.extend(nr)
np.sort(reverse=True)
print(sum(np[0:x+y])) |
p02606 | s042013500 | Accepted | L,R,d = list(map(int, input().split()))
ans = 0
for i in range(L,R+1):
if i % d == 0 :
ans += 1
print(ans) |
p03262 | s697836024 | Wrong Answer | N,X = map(int,input().split())
W = list(map(int,input().split())) + [X]
W = sorted(W)
print(W[1]-W[0]) |
p02743 | s073795883 | Wrong Answer | import math
i = list(map(int, input().split()))
a = i[0]
b = i[1]
c = i[2]
left = a + b + math.sqrt(a*b)
right = c
if (left < right):
print ('Yes')
else:
print ('No') |
p02606 | s933710276 | Accepted | L,R,d = map(int,input().split())
ans=0
for i in range(L,R+1):
if i%d==0:
ans+=1
print(ans)
|
p02556 | s099227546 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *XY = map(int, read().split())
P = [x + y for x, y in zip(*[iter(XY)] * 2)]
mi = min(P)
ma = max(P)
print(abs(mi - ma))
return
if __name__ == '__main__':
main()
|
p02780 | s619521256 | Wrong Answer | n, k = map(int, input().split())
p = list(map(int, input().split()))
exp = 0
for i in range(n - k + 1):
s = 0
for j in range(k):
s += p[i+j]
if exp <= s:
exp = s
print((s + 3) / 2)
|
p02658 | s668165720 | Accepted | n = int(input())
a = 1
s = list(map(int, input().split()))
if 0 in s:
print(0)
exit()
for i in s:
a*=i
if a>10**18:
print(-1)
exit()
else:
print(a) |
p03457 | s136122421 | Accepted | N = int(input())
t_x_y = [list(map(int, input().split())) for _ in range(N)]
t_x_y.insert(0, [0, 0, 0])
ans = 'Yes'
for i in range(N):
dt = t_x_y[i+1][0] - t_x_y[i][0]
dist = abs(t_x_y[i+1][1] - t_x_y[i][1]) + abs(t_x_y[i+1][2] - t_x_y[i][2])
if dt < dist:
ans = 'No'
break
else:
# dt >= dist
if (dt - dist) % 2 != 0:
ans = 'No'
break
print(ans) |
p02796 | s373441868 | Wrong Answer | N = int(input())
ST = []
for i in range(N):
x, l = list(map(int, input().split()))
ST.append([x-l+1, x+l-1])
ST.sort(key = lambda x :x[1])
startT = ST[0][1]
ans = 1
for i in range(1,N):
if startT >= ST[i][0]:
continue
else:
startT = ST[i][1]
ans += 1
print(ans) |
p02645 | s754318947 | Wrong Answer | inp = input('enter :')
inp = inp[0:3]
print(inp) |
p02631 | s741548879 | Accepted |
def main():
n = int(input())
a = list(map(int, input().split(" ")))
all = 0
for ele in a:
all ^= ele
for ele in a:
print(all ^ ele,end = " ")
print()
if __name__ == "__main__":
main() |
p03285 | s283742109 | Accepted | n=int(input())
if n in [1,2,3,5,6,9,10,13,17,24]:
print('No')
else:
print('Yes')
|
p02702 | s341627337 | Wrong Answer | s = input()
s_num = int(s)
len_s = len(s)
list=[0 for x in range(len_s+1)]
for i in range(len_s-1,-1,-1):
for j in range(4,min(9,len_s-i+1)):
if int(s[i:i+j])%2019==0:
list[i]=list[i+j]+1
break
print(sum(list))
|
p02681 | s014218552 | Accepted | s = input()
t = input()
print('Yes' if len(s) + 1 == len(t) and s == t[:-1] else 'No')
|
p02813 | s257249839 | Accepted | n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
import itertools
a = [i for i in range(1, n + 1)]
cnt = 0
t = []
for i in itertools.permutations(a, n):
cnt += 1
if list(i) == p:
t.append(cnt)
if list(i) == q:
t.append(cnt)
print(abs(t[0] - t[1]))
|
p02785 | s106937184 | Accepted | import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
N,K = LI()
H = sorted(LI(),reverse=True)
H_removed = H[K:]
print(sum(H_removed))
main()
|
p03617 | s829538741 | Accepted | Q,H,S,D = map(int,input().split())
N = int(input())
cnt = (N//2)*min(8*Q,4*H,2*S,D)
if N%2==1:
cnt += min(4*Q,2*H,S)
print(cnt) |
p03836 | s221569509 | Accepted | def resolve():
sx, sy, tx, ty = [int(i) for i in input().split()]
x = tx - sx
y = ty - sy
print("U" * y, "R" * x, sep="", end="")
print("D" * y, "L" * x, sep="", end="")
print("L", "U" * y, "U", "R" * x, "RD", sep="", end="")
print("R", "D" * y, "DL", "L" * x, "U", sep="", end="")
print()
resolve()
|
p02743 | s058051210 | Accepted | a, b, c = map(int, input().split())
c -= a + b
ok = True
if c * c <= 4 * a * b:
ok = False
if c <= 0:
ok = False
if ok:
print("Yes\n")
else:
print("No\n")
|
p03639 | s101018234 | Accepted | N=int(input())
A=list(map(int,input().split()))
for i in range(N):
if A[i]%4==0:
A[i]=4
elif A[i]%4!=0 and A[i]%2==0:
A[i]=2
else:
A[i]=1
if A.count(2)==0:
if A.count(4)+1<A.count(1):
print("No")
else:
print("Yes")
else:
if A.count(4)<A.count(1):
print("No")
else:
print("Yes") |
p02681 | s714520821 | Wrong Answer | s=input()
t=input()
l=len(s)
m=len(t)
flag=0
for i in range(0,l):
if s[i]==t[i]:
flag=1
else:
break
if flag==1:
print("Yes")
else:
print("No")
|
p02584 | s898799950 | Accepted | #n = int(input())
#L = list(map(int, input().split()))
x, k, d = map(int, input().split())
#p = list(set(L))
a = abs(x)//d
b = abs(x)%d
if k < a:
print(abs(x) - d*k)
else:
if (k-a)%2 == 0:
print(b)
else:
print(d-b) |
p02613 | s241949160 | Wrong Answer | N = int(input())
S = []
for _ in range(N):
S.append(input())
a = S.count('AC')
b = S.count('WA')
c = S.count('TLE')
d = S.count('RE')
print ('AC ×' +' ' + str(a))
print('WA ×' + ' '+ str(b))
print('TLE ×' +' ' + str(c))
print('RE ×' +' '+ str(d)) |
p03721 | s902359500 | Accepted | n,m=map(int,input().split())
cnt=0
lst=sorted([list(map(int,input().split())) for _ in range(n)])
#print(lst)
i=0
while cnt<m:
cnt+=lst[i][1]
if cnt<m:
i+=1
print(lst[i][0])
|
p02823 | s901747918 | Wrong Answer | N,A,B=map(int,input().split())
if A%2==B%2:
print(int((B-A)/2))
else:
print(min(A-1,N-B)+1+int((B-A-1)/2)) |
p02995 | s651955899 | Wrong Answer | import fractions
a,b,c,d = map(int,input().split())
e,f,g,h,i,j = b//c,b//d,(a-1)//c,(a-1)//d,b//((c*d)/fractions.gcd(c,d)),(a-1)//((c*d)/fractions.gcd(c,d))
print(int(b-(e+f-i)-(a-1-(g+h-j)))) |
p02701 | s497861737 | Accepted | N = int(input())
freebies_list = [input() for i in range(N)]
freebies_set = set(freebies_list)
print(len(freebies_set)) |
p03799 | s074209838 | Accepted | def solve():
n, m = map(int, input().split())
if 2*n <= m:
return n + (m-2*n)//4
else:
return m//2
print(solve())
|
p02603 | s173117702 | Accepted | INF = 300
n = int(input())
a = [INF] + list(map(int, input().split())) + [-INF]
money = 1000
stock = 0
for e1, e2 in zip(a, a[1:]):
if e1 < e2:
buy = money // e1
money -= buy * e1
stock += buy
else:
money += stock * e1
stock = 0
print(money)
|
p02971 | s952907958 | Wrong Answer | N = int(input())
A = []
for i in range(N):
A.append(int(input()))
A.sort()
A.reverse()
for i in range(N):
if A[i]==A[0]:
print(A[1])
else:
print(A[0]) |
p03457 | s413759474 | Accepted | n = int(input())
ans = True
for i in range(n):
t,x,y = map(int,input().split())
if (x+y)%2 != t%2:
ans = False
if x+y>t:
ans = False
if ans:
print("Yes")
else:
print("No") |
p03150 | s862420926 | Accepted | s = input()
k = 'keyence'
r = 'NO'
for i in range(len(k)):
if s[:i] + s[-7+i:] == k:
r = 'YES'
break
print(r) |
p02988 | s894700820 | Accepted | n = int(input())
p = list(map(int,input().split()))
ans = 0
for i in range(1,n - 1):
if p[i - 1] <= p[i] <= p[i + 1] or p[i + 1] <= p[i] <= p[i - 1]:
ans += 1
print(ans)
|
p03611 | s074537637 | Wrong Answer | # yorikatu_58_b.py
def summlize(C,i):
ans = C[i]
if i > 1:
ans += C[i-1]
if i < len(C):
ans += C[i+1]
return ans
N = int(input())
A = list(map(int,input().split()))
import collections
C = collections.Counter(A)
ans = 0
for i in range(100005):
sums = summlize(C,i)
if ans < sums:
ans = sums
print(ans)
|
p02959 | s602552075 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(n):
if a[i]>=b[i]:
ans=ans+b[i]
elif a[i]+a[i+1]>=b[i]:
ans=ans+b[i]
a[i+1]=a[i+1]-b[i]+a[i]
else:
ans=ans+a[i]+a[i+1]
a[i+1]=0
print(ans) |
p03448 | s764772972 | Accepted | a=int(input())
b=int(input())
c=int(input())
x=int(input())
ans=0
for i in range(a+1):
for j in range(b+1):
for h in range(c+1):
if 500*i+100*j+50*h==x:
ans+=1
print(ans) |
p03773 | s571326356 | Accepted | A,B = map(int,input().split())
ans = (A+B)%24
print(ans) |
p02773 | s618355013 | Wrong Answer | n = int(input())
a = [input() for i in range(n)]
b = list(set(a))
b.sort()
max = a.count(b[0])
for i in range(len(b)-1):
if a.count(b[i]) < a.count(b[i+1]):
max = a.count(b[i+1])
for j in range(len(b)):
if a.count(b[j]) == max:
print(b[j]) |
p02989 | s316894998 | Accepted | n = int(input())
d = list(map(int, input().split()))
d.sort()
num = 0
n3 = n//2
n2 = n3-1
if d[n2] == d[n3]:
print(0)
else:
for i in range(d[n2],d[n3]):
num += 1
print(num) |
p02719 | s551631744 | Accepted | n,k = map(int,input().split())
answer = 0
if k >= n:
gap = k-n
if gap > n:
answer = n
else:
answer = gap
else:
sho = n // k
if n % k == 0:
dec = sho - 1
else:
dec = sho
n = n - k*dec
if k >= n:
gap = k-n
if gap > n:
answer = n
else:
answer = gap
print(answer) |
p03486 | s169179571 | Wrong Answer | s = list(input())
t = list(input())
s_a = ''.join(sorted(s))
t_a = ''.join(sorted(t, reverse=True))
print(s_a, t_a)
if s_a < t_a :
print('Yes')
else :
print('No') |
p02791 | s883781819 | Accepted | n = int(input())
p = list(map(int, input().split()))
p_min = p[0]
ans = 1
for i in range(1, n):
if p[i] <= p_min:
ans += 1
p_min = p[i]
print(ans) |
p03817 | s104079315 | Wrong Answer | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
x = I()
y = x % 11
ans = (x // 11) * 2
if y <= 6:
ans += 1
else:
ans += 2
print(ans) |
p03862 | s620127305 | Accepted | N, x = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
keep = a[0]
for i in range(1, N):
if (keep + a[i]) > x:
ans = ans + (keep + a[i] - x)
keep = max(x - keep, 0)
else:
keep = a[i]
print(ans)
|
p03109 | s459424168 | Accepted | s=['2019/04/30']
s.append(input())
s.sort()
if s[0]=='2019/04/30':
if s[1]=='2019/04/30':
print('Heisei')
else:
print('TBD')
else:
print('Heisei') |
p02953 | s615886807 | Accepted | n = int(input())
h = list(map(int, input().split()))
ans = "Yes"
m = h[0]
for i in range(1, n):
m = max(m, h[i])
if h[i] < m - 1:
ans = "No"
print(ans)
|
p03698 | s679622461 | Wrong Answer | data=list(input())
c=0
for i in range(0,len(data)-1):
for j in range(i+1,len(data)):
if data[i]==data[j]:
c=c+1
if c==0:
print('Yes')
else:
print('No') |
p03146 | s737410547 | Accepted | n = int(input())
m=n
lst=[]
while True:
if m in lst:
print(len(lst)+1)
break;
else:
lst.append(m)
if m%2==0:
m=m//2
else:
m=3*m+1
|
p03252 | s570136005 | Wrong Answer | from collections import Counter
s = input()
t = input()
s_cnt = sorted(Counter(s).values(), reverse=True)
t_cnt = sorted(Counter(t).values(), reverse=True)
print(s_cnt)
print(t_cnt)
if s_cnt == t_cnt:
print('Yes')
else:
print('No')
|
p03210 | s151689894 | Wrong Answer | X=int(input())
if X==7 or X==5 or X==3:
print("Yes")
else:
print("No") |
p03105 | s155806760 | Wrong Answer | a, b, c = map(int, input().split())
print(min(c, a // b)) |
p02727 | s301942992 | Accepted | X,Y,A,B,C=map(int,input().split())
p=sorted(map(int,input().split()),reverse=True)
q=sorted(map(int,input().split()),reverse=True)
r=sorted(map(int,input().split()),reverse=True)
li=[]
for i in range(X):
li.append(p[i])
for i in range(Y):
li.append(q[i])
n=0
res=sum(li)
li=sorted(li)
for i in range(len(li)):
if(li[i]<r[n]):
res+=(r[n]-li[i])
n+=1
else:
break
if(n==len(r)):
break
print(res) |
p02578 | s572963908 | Accepted | import sys
N = sys.stdin.readline()
Alst = list(map(int, sys.stdin.readline().split()))
now = 1
x = 0
for i in Alst:
if now < i:
now = i
else:
x += (now - i)
print(x)
|
p03013 | s899344887 | Accepted | n,m = map(int,input().split())
a = [int(input()) for _ in range(m)]
p = 10**9 +7
ans = [0]*(n+1)
ans[0] = 1
ans[1] = 1
broken = [0]*(n+1)
for i in a:
broken[i]= -1
for i in range(1,n):
if broken[i] == -1:
ans[i] = 0
ans[i+1] = ans[i-1]%p
else:
ans[i+1] = (ans[i-1] + ans[i])%p
print(ans[-1]) |
p02553 | s766495372 | Accepted | # -*- coding: utf-8 -*-
import math
numList = []
result = []
user2 = list(map(int, input().split()))
numList.append(user2[0] * user2[2] )
numList.append(user2[0] * user2[3])
numList.append(user2[1] * user2[2] )
numList.append (user2[1] * user2[3])
numList.sort()
print(numList[3])
|
p04012 | s033396414 | Wrong Answer | c_list = list(input())
flag = True
for i in range(len(c_list)):
if(c_list.count(c_list[i])%2 == 1):
print("NO")
flag = False
break
if(flag):
print("YES")
|
p03087 | s405751795 | Accepted | import sys
input = sys.stdin.readline
from collections import deque
N,Q = (int(x) for x in input().split())
S = list(input())
d = deque(S)
cum = [0] * N
count = 0
t1 = d.popleft()
for i in range(1,N):
t2 = d.popleft()
if t1 == 'A' and t2 == 'C':
count += 1
cum[i] = count
t1 = t2
for i in range(Q):
l,r = (int(x) for x in input().split())
print(cum[r-1]-cum[l-1]) |
p03481 | s939018287 | Accepted | x,y=map(int,input().split())
ans=0
while x<=y:x*=2;ans+=1
print(ans) |
p03163 | s148277679 | Accepted | N,W = map(int,input().split())
dp = [[0 for j in range(W+1)] for i in range(N+1)]
for i in range(1,N+1):
w,v = map(int,input().split())
for j in range(W+1):
if j >= w:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-w]+v)
else:
dp[i][j] = dp[i-1][j]
print(dp[N][W]) |
p03408 | s951907215 | Wrong Answer | n=int(input())
s=[input() for _ in range(n)]
m=int(input())
t=[input() for _ in range(m)]
print(max([s.count(s[i]) - t.count(s[i]) for i in range(len(s))]))
|
p03696 | s778392816 | Accepted | n=int(input())
s=input()
l=''
c=0
d=0
for i in range(n):
if s[i]=='(':
c+=1
else:
if c>0:
c-=1
else:
l+='('
print(l+s+')'*c) |
p04045 | s270031235 | 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):
if u >= n:
return u
return min([dfs(u*10 +l,n,letters) for l in letters if u or l])
print dfs(0,n,letters) |
p03910 | s516257131 | Accepted | from itertools import accumulate
import bisect
n = int(input())
A = [n for n in range(1,5*10**3)]
B = list(accumulate(A))
i = bisect.bisect_right(B, n)
if B[i-1] == n:
for j in range(i):
print(A[j])
else:
k = B[i] - n
for j in range(i+1):
if A[j] == k:
continue
print(A[j]) |
p03324 | s456499858 | Wrong Answer | # 問題文の意味はわからんけど（ちょうど1回、ちょうど2回割り切れる？？？？は？？？？？？？？）サンプルを適当に読む
d, n = map(int, input().split())
if d == 0:
if n == 100:
print(101)
else:
print(n)
elif d == 1:
print(n * 100)
else:
print(n * 10000)
|
p03821 | s254277343 | Accepted | n = int(input())
a = []
b = []
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
ans = 0
c = a[::-1]
d = b[::-1]
for i in range(n):
ans += (d[i] - (c[i]+ans)%d[i]) % d[i]
print(ans) |
p02555 | s976669381 | Wrong Answer | s=int(input())
def c(a,p):
x=1
for y in range(p+1,a+1):
x*=y
for y in range(2,a-p+1):
x//=y
return x
mod=10**9+7
ss=s//3
icnt=0
for sss in range(ss):
r=s-3*sss
icnt+=c(ss-1+r,r)
print(icnt)
|
p04029 | s099324361 | Wrong Answer | n = int(input())
print(n * (n +1) / 2)
|
p03624 | s367088813 | Wrong Answer | s = input()
c = set()
for i in range(len(s)):
c.add(s[i])
c = list(c)
c.sort()
abc = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
for e in abc:
if e not in c:
print(e)
break
if e == 'z':
print('None') |
p02681 | s757667110 | Accepted | s=input()
t=input()
if t[:-1]==s:
print("Yes")
else:
print("No") |
p02832 | s949832472 | Accepted | n = int(input())
bricks = map(int, input().split())
ans = 0
cur = 1
for brick in bricks:
if brick != cur:
ans += 1
else:
cur += 1
if cur == 1:
ans = -1
print(ans) |
p03038 | s574337599 | Accepted | # solution
from bisect import bisect_left
from operator import itemgetter
nim, mike = map(int, input().split())
array = list(map(int, input().split()))
array1 = []
array2 = []
for _ in range(mike):
b, c = map(int, input().split())
array2.append((b, c))
array2 = sorted(array2, key=itemgetter(1), reverse=True)
for b, c in array2:
array1.extend([c] * b)
if len(array1) >= nim:
break
Y = array + array1
Y.sort(reverse=True)
answer = sum(Y[:nim])
print(answer) |
p03073 | s535337886 | Accepted | S = input()
a = ''
for i in range(len(S)//2):
a += '0'
a += '1'
if len(S)/2 % 1 != 0:
a += '0'
b = ''
for i in range(len(S)//2):
b += '1'
b += '0'
if len(S)/2 % 1 != 0:
b += '1'
count_a = 0
for i in range(len(S)):
if S[i] != a[i]:
count_a += 1
count_b = 0
for i in range(len(S)):
if S[i] != b[i]:
count_b += 1
print(min(count_a, count_b))
|
p02787 | s511855039 | Wrong Answer | H, N = map(int, input().split())
Attack_Magic = []
max_a = 0
for i in range(N):
a, b = map(int, input().split())
Attack_Magic.append((a, b))
max_a = max(max_a, a)
Point = [1000000] * (H + max_a + 10)
Point[0] = 0
for i in range(H):
for j, k in Attack_Magic:
next = i + j
cost = Point[i] + k
Point[next] = min(Point[next], cost)
print(min(Point[H:]))
|
p03994 | s460105233 | Accepted | s,k,t=input(),int(input()),""
for q in s:
if(p:=(123-ord(q))%26)<=k:t+="a";k-=p
else:t+=q
print(t[:-1]+chr((ord(t[-1])-97+k)%26+97)) |
p02983 | s527259375 | Wrong Answer | import math
L, R = map(int, input().split( ))
mod = 2019
#(i*j mod) = (i mod)*(j mod)
m = 2018
s, t = L%2019, R%2019
d = (R - L)//2019
if d >= 1:
print(0)
exit()
if t < s:
print(0)
else:
print(s*(s+1))
|
p03799 | s224768679 | Accepted | n, m = map(int, input().split())
if n * 2 <= m:
m -= n * 2
print(n + m // 4)
else:
print(m // 2) |
p02707 | s507663019 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
A.insert(0,0)
B=[]
for i in range(len(A)):
cnt=0
for j in range(len(A)):
if A[i]-A[j]==-1:
cnt+=1
continue
B.append(cnt)
print(B) |
p02627 | s810002387 | Accepted | Acase = input()
if(Acase.isupper()):
print("A")
else:
print("a") |
p02683 | s716046737 | Accepted | N, M, X = map(int, input().split())
lis = []
for i in range(N):
CA = list(map(int, input().split()))
lis.append(CA)
ans = 1e9
for i in range(2 ** N):
check = [0 for i in range(M + 1)]
for j in range(N):
if i >> j & 1:
for k in range(M + 1):
check[k] += lis[j][k]
if min(check[1:]) >= X:
ans = min(ans, check[0])
if ans == 1e9:
print(-1)
else:
print(ans)
|
p03037 | s141347849 | Wrong Answer | n,m = map(int, raw_input().split(' '))
def intersection(A,B):
a,b = max(A[0],B[0]), min(A[1],B[1])
return [a,b] if a <= b else []
r = [1,n]
for _ in range(m):
a,b = map(int, raw_input().split(' '))
keys = intersection(r, [a,b])
if len(keys) == 0: break
print (keys[1] - keys[0] + 1) if keys else 0
|
p03493 | s789990008 | Wrong Answer | S=input().split()
print(S.count("1"))
|
p02912 | s165177842 | Accepted | import heapq
n,m = map(int,input().split())
a = list(map(lambda x: int(x)*(-1),input().split()))
heapq.heapify(a)
#print(a)
for _ in range(m):
tmp_min = heapq.heappop(a)
heapq.heappush(a,(-1)*(-tmp_min//2))
print(-sum(a))
|
p03720 | s612796659 | Wrong Answer | N, M = map(int, input().split())
c = []
for _ in range(M):
a, b= map(int, input().split())
c.append(a)
c.append(b)
import numpy as np
C = np.zeros((N,1),dtype = 'int')
for i in range(len(C)):
C[i,0] = c.count(i+1)
print(C) |
p03637 | s738553425 | Accepted | n = int(input())
A = tuple(map(int, input().split()))
c4 = 0
c2 = 0
cn = 0
for a in A:
if a%4==0:
c4 += 1
elif a%2==0:
c2 += 1
else:
cn += 1
if c2 == 0 or c2 == 1:
if cn+c2 <= c4 + 1:
print('Yes')
else:
print('No')
else:
if cn <= c4:
print('Yes')
else:
print('No')
|
p03071 | s991649443 | Wrong Answer | a, b = map(int, input().split())
if a + b >= a + a - 1 and a + b >= b + b - 1:
print(a+b)
elif a + a - 1 >= a + b and a + a - 1 >= b + b - 1:
print(a + a - 1)
elif b + b - 1> a + b and b + b - 1 >= a + a - 1:
print(a + b - 1) |
p02761 | s763863544 | Accepted | n, m = map(int, input().split())
tmp = [10]*n
for _ in range(m):
s,c = map(int, input().split())
if tmp[s-1] == 10 or tmp[s-1]==c:
tmp[s-1] = c
else:
print('-1')
exit()
for i in range(n):
if tmp[i] == 10:
if i == 0 and n != 1:
tmp[i] = 1
else:
tmp[i] = 0
ans = ''.join(map(str,tmp))
if n != 1 and ans[0] == '0':
print('-1')
else:
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.