problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03323 | s167565989 | Wrong Answer | print([":(", "Yay!"][sum(list(map(int, input().split()))) <= 8]) |
p03105 | s455735937 | Accepted | # coding: utf-8
A, B, C = map(int, input().split())
# print(A, B, C)
num = B // A
# print(num)
print(min(num, C)) |
p03986 | s146300189 | Accepted | s=input()
from collections import deque
stack=deque()
for i in s:
if i=="S":
stack.append(i)
if i=="T":
if len(stack)>0 and stack[-1]=="S":
stack.pop()
else:
stack.append(i)
#print(stack)
print(len(stack)) |
p03105 | s019435573 | Wrong Answer | a,b,c = map(int,input().split())
if b >= a:
print(round(b/a))
elif round(b/a) > c:
print(c)
else:
print('0') |
p02613 | s548646753 | Wrong Answer | N = int(input())
l = []
for i in range(N):
i = input()
l.append(i)
b = l.count("AC")
c = l.count("WA")
d = l.count("TLE")
e = l.count("RE")
print("AC ×",b)
print("WA ×",c)
print("TLE ×",d)
print("RE ×",e) |
p03827 | s870026283 | Accepted | def INT():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(map(int, input().split()))
N = INT()
S = input()
x = 0
ans = 0
for s in S:
if s == "I":
x += 1
else:
x -= 1
ans = max(ans, x)
print(ans) |
p02583 | s897533037 | Accepted | import itertools
N = int(input())
L = list(map(int,input().split()))
C = list(itertools.combinations(L,3))
counter = 0
for c in C:
if c[0] != c[1] and c[1] != c[2] and c[2] != c[0] and c[0]+c[1] > c[2] and c[1]+c[2] > c[0] and c[2]+c[0] > c[1]:
counter += 1
print(counter) |
p03323 | s817132851 | Accepted | n, m = map(int, input().split())
if n > 8 or m > 8:
print(':(')
else:
print('Yay!')
|
p03624 | s532165923 | Accepted | s_list = list(input())
result = None
for s_uni in range(ord('a'), ord('z') + 1):
if not chr(s_uni) in s_list:
result = chr(s_uni)
break
if result:
print(result)
else:
print('None')
|
p03427 | s009931714 | Accepted | N = [int(i) for i in list(input())][::-1]
if len(N) == 1:
print(N[0])
exit()
p = N[-1]
q = sum(N)
ans = 0
for i in range(len(N)-1):
if N[i] != 9:
for j in range(i,len(N)):
if N[j] != 0:
N[j] -= 1
N[i] = 9
else:
N[j] = 9
N[-1] = p-1
print(max(sum(N),q))
|
p02882 | s192651731 | Accepted | import math
a, b, x = map(int, input().split())
if a*a*b / 2 > x:
h = x / b * 2 / a
deg = math.atan(h/b)
deg = math.degrees(deg)
deg = 90 - deg
else:
x = a*a*b - x
h = x / a * 2 / a
deg = math.atan(h/a)
deg = math.degrees(deg)
print(deg) |
p02639 | s452438761 | Wrong Answer | variable = input().split()
print(variable.index("0")) |
p03862 | s885709254 | Accepted | n,x = map(int,input().split())
a = list(map(int,input().split()))
count = 0
for i in range(n-1):
if a[i] > x:
count += a[i] - x
a[i] = x
count += a[i+1]
a[i+1] = 0
elif a[i]+a[i+1] > x:
count = count + a[i+1] + a[i] - x
a[i+1] = x - a[i]
print(count)
|
p03672 | s266661418 | Accepted | S = input().strip()
N = len(S)
for i in range(2,N,2):
x = S[:-i]
if x[:(N-i)//2]==x[(N-i)//2:]:
print(N-i)
break |
p03385 | s495281478 | Wrong Answer | print('Yes' if len(set(input().split())) == 3 else 'No')
|
p03862 | s369948328 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
count=0
for i in range(n):
if x<a[i]:
count+=a[i]-x
a[i]=x
#print(a)
for i in range(n-1):
if a[i]+a[i+1]>x:
count+=a[i]+a[i+1]-x
a[i+1]-=a[i]+a[i+1]-x
#print(a)
print(count) |
p03206 | s666356502 | Accepted | print("Christmas" + " Eve" * (25 - int(input()))) |
p03285 | s897406568 | Accepted | N = int(input())
OK = False
for i in range(100//4+1):
for j in range(100//7+1):
if N == 4 * i + 7 * j:
OK = True
if OK:
print('Yes')
else:
print('No') |
p02598 | s453175829 | Accepted | from math import floor, ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
l = 0
r = max(a)
while r - l > 1:
c = (l+r)//2
cnt = 0
for i in a:
cnt += max(ceil(i/c) - 1, 0)
if cnt <= k:
r = c
else:
l = c
print(r) |
p03352 | s122635713 | Accepted | x = int(input())
c=1
for b in range(1,x):
for p in range(2,x):
if b**p<=x:c=max(c,b**p)
else:break
print(c)
|
p03077 | s570078903 | Accepted | n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
limit = min(a,b,c,d,e)
r,q = divmod(n, limit)
print(5+r+min(q,1)-1) |
p02602 | s776947219 | Accepted | n, k = map(int, input().split())
A = [*map(int, input().split())]
for i in range(k, n): print('Yes' if A[i-k] < A[i] else 'No')
|
p03607 | s850375501 | Accepted | n = int(input())
a = [int(input()) for i in range(n)]
a.sort()
cnt = 1
ans = 0
for i in range(1,n):
if a[i] == a[i-1]:
cnt += 1
else:
if cnt%2 != 0:
ans += 1
cnt = 1
else:
if cnt%2 != 0:
ans += 1
print(ans)
|
p02791 | s793556316 | Accepted | N = int(input())
sta = list(map(int, input().split()))
min_i = sta[0]
count_i = 0
for i in sta:
if min_i > i:
min_i = i
if i <= min_i:
count_i += 1
print(count_i) |
p03163 | s555417478 | Wrong Answer | def main():
n, W, *wv = map(int, open(0).read().split())
dp = [0] * (W + 1)
for i in range(n):
w = wv[i * 2]
v = wv[i * 2 + 1]
pv = dp[w]
dp = [max(dp[j], dp[j - w] + v) if j >= w else pv for j in range(0, W + 1)]
print(dp[W])
main() |
p02607 | s618522164 | Accepted | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
if i%2==0 and a[i]%2==1:
c+=1
print(c) |
p02664 | s424708457 | Accepted | s = list(input())
for i in range(len(s)):
if s[i] == "?":
s[i] = "D"
print("".join(s)) |
p02713 | s025074561 | Accepted | K = int(input())
def gcd(a, b):
while b > 0:
a,b = b, a%b
return a
def gcd_3(a,b,c):
g = gcd(a,b)
g = gcd(g,c)
return g
sm = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
sm += gcd_3(a,b,c)
print(sm)
|
p03210 | s193727483 | Accepted | age = int(input())
if age == 3 or age == 5 or age == 7:
print('YES')
else:
print('NO') |
p02802 | s120510876 | Wrong Answer | N, M = map(int, input().split())
S = [[i for i in input().split()] for _ in range(M)]
if M > 0:
wa = [0] * N
ac = set()
ans = [0, 0]
for s in S:
if s[1] == "AC":
ac.add(int(s[0])-1)
elif s[1] == "WA" and int(s[0])-1 not in ac:
wa[int(s[0])-1] += 1
print(len(ac), sum(wa))
else:
print(0, 0)
|
p03625 | s035785606 | Wrong Answer | from collections import Counter
N = int(input())
*A, = map(int, input().split())
c = Counter(A)
ac = [(k, v) for k, v in c.items()]
ac.sort()
ac.reverse()
ans = 0
for k, v in ac:
if v >= 2:
if ans == 0:
ans = -k
else:
ans *= -k
break
print(max(ans, 0))
|
p03545 | s150431863 | Wrong Answer | from itertools import product
a = list(str(input()))
for bit in product([0,1],repeat=3): # 01の組み合わせ
x = ["+","+","+"]
for i,j in enumerate(bit):
#print(bit,i,j)
print(j)
if j == 1:
x[i] = "-"
if eval(a[0]+x[0]+a[1]+x[1]+a[2]+x[2]+a[3]) == 7:
print(a[0]+x[0]+a[1]+x[1]+a[2]+x[2]+a[3]+"=7")
break
|
p03107 | s283382136 | Accepted | s=input()
print(2*min(s.count("0"),s.count("1"))) |
p03254 | s049124437 | Accepted | N,x=map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
a.sort()
for i in a:
if x >= i:
x -= i
cnt +=1
else:
print(cnt)
exit()
if x ==0:
print(cnt)
else:
print(cnt-1) |
p03043 | s431217623 | Accepted | N,K=map(int,input().split())
ans = 0
for i in range(1,N+1):
if i>= K:
ans += (1/N)
else:
cnt = 0
t = i
while(True):
i *= 2
cnt += 1
if i >= K:
ans += (t/N)*(1/i)
break
print(ans) |
p03289 | s241958034 | Accepted | s = list(input())
ans = "WA"
if s[0] == "A":
if s[2:-1].count("C") == 1:
s.remove("C")
k = "".join(s[1:])
if k.islower():
ans = "AC"
print(ans) |
p02948 | s526161197 | Wrong Answer | import heapq
n,m = map(int,input().split())
B = [set() for _ in range(m)]
for i in range(n):
a,b = map(int,input().split())
if 1 <= a <= m:
B[a-1].add(b)
task = []
heapq.heapify(task)
ans = 0
for i in range(m):
for t in B[i]:
heapq.heappush(task,-t)
if task:
ans += heapq.heappop(task)
print(-ans)
|
p03644 | s638925894 | Accepted | # coding: utf-8
N=int(input())
ans=0
for i in range(N):
num=i+1
cnt=0
while num%2==0:
cnt+=1
num=num//2
ans=max(ans,cnt)
print(2**(ans))
|
p02939 | s222043729 | Accepted | S = str(input())
ans = 0
p = ''
q = ''
for s in S:
p += s
if p != q:
ans += 1
q = p
p = ''
print(ans) |
p03408 | s331035490 | Accepted | ans=0
n=int(input())
lst=[]
for i in range(n):
lst.append(input())
m=int(input())
x=[]
for j in range(m):
x.append(input())
for k in set(lst):
c=lst.count(k)-x.count(k)
ans=max(ans,c)
print(ans) |
p02596 | s138598450 | Accepted | def main():
K = int(input())
a = 7 % K
for i in range(1, K+1):
if a == 0:
print(i)
return
a = a * 10 + 7
a %= K
print(-1)
if __name__ == '__main__':
main()
|
p03659 | s279575079 | Wrong Answer | # ABC067c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(input())
a = list(map(int, input().split()))
def cum(array):
result = [0]
for i in range(len(array)):
result.append(array[i]+result[i])
return result
cumArray = cum(a)
# print(cumArray)
ans = 10**9
for i in range(n+1):
ans = min(ans, abs(cumArray[i]-(cumArray[n]-cumArray[i])))
print(ans)
|
p04044 | s205288406 | Accepted | n,l=map(int,input().split())
s=[input() for _ in range(n)]
s.sort()
print("".join(s))
|
p02988 | s487470598 | 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) |
p03030 | s945264924 | Accepted | # coding: utf-8
# Your code here!
N=int(input())
S=[list(map(str,input().split())) for i in range(N)]
A=sorted(S,key=lambda x:int(x[1]), reverse=True)
B=sorted(A,key=lambda x:x[0])
#print(B)
for i in range(N):
ans=S.index(B[i])+1
print(ans)
|
p03331 | s729658401 | Accepted | n = int(input())
ans = 10**5+1
for a in range(1, n//2+1):
a,b = list(str(a)), list(str(n-a))
ans = min(ans, sum(list(map(int, a)))+sum(list(map(int,b))))
print(ans) |
p03274 | s780312975 | Accepted | N, K = map(int, input().split())
X = tuple(map(int, input().split()))
print(min(X[i + K - 1] - X[i] + min(abs(X[i]), abs(X[i + K - 1])) for i in range(N - K + 1))) |
p03860 | s424769034 | Accepted | print("A%sC"%input()[8]) |
p02859 | s854903860 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
r = ini()
print(r * r)
|
p03035 | s526997180 | Wrong Answer | a,b = map(int,input().split())
if a>13:
print(b)
elif 12 >= a >= 6:
print(int(b/2))
else:
print(0) |
p02862 | s687707126 | Wrong Answer | x,y = list(map(int,input().split(" ")))
a = (2*x - y)//3
b = (2*y - x)//3
mod = 10**9+7
g1 = [1, 1]
g2 = [1, 1]
inv = [0, 1]
for i in range(2, 666667):
g1.append((g1[-1] * i) % mod)
inv.append((-inv[mod%i] * (mod//i)) % mod)
g2.append((g2[-1] * inv[-1]) % mod)
def nChoosem(n,m):
return g1[n] * g2[n-m] * g2[m] % mod
res = nChoosem(a+b,a)
print(res) |
p02819 | s025327727 | Accepted | from math import sqrt, ceil
def main():
x = int(input())
while True:
for i1 in range(2, ceil(sqrt(x))):
if x % i1 == 0:
x += 1
break
else:
break
print(x)
if __name__ == '__main__':
main()
|
p03659 | s660235704 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
ans = 10**10
x = 0
y = sum(a)
for i in range(len(a)-1):
x += a[i]
y -= a[i]
d = abs(x-y)
if d < ans:
ans = d
print(ans) |
p02618 | s250748616 | Accepted | from random import *
d=int(input())
c=list(map(int,input().split()))
s=[list(map(int,input().split())) for i in range(365)]
for i in range(365):
cand=0
for j in range(26):
if s[i][cand]<s[i][j]:
cand=j
print(cand+1)
#print(randrange(1,26)) |
p02832 | s493369165 | Wrong Answer | n=int(input())
a=[0]*n
def int1(x):
return int(x)-1
a[:]=map(int1,input().split())
#print(a)
import numpy as np
l=np.argsort(a)
#print(l)
del a[0:l[0]]
r=0
z=0
m=len(a)
j0=0
for ii in range(max(a)):
for jj in np.arange(j0,m):
if a[jj]==ii:
j0=jj+1
r+=1
break
#print(a,r)
if jj==m-1:
#print(a)
if r==0:
print(-1)
else:
print(n-r)
exit()
print(n-r) |
p02829 | s696805213 | Accepted | print(6 - sum([int(input()) for i in range(2)])) |
p03103 | s474864824 | Accepted | N,M=map(int,input().split())
C=[]
ans=0
cnt=0
for i in range(N):
a,b=map(int,input().split())
C.append((a,b))
C=sorted(C)
for i in range(N):
if cnt+C[i][1]<=M:
cnt+=C[i][1]
ans+=C[i][1]*C[i][0]
else:
break
print((M-cnt)*C[i][0]+ans) |
p02910 | s667550170 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
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())
s = S()
ans = 'Yes'
for i in range(len(s)):
if i%2 == 0:
if s[i] == 'L':
ans = 'No'
else:
if s[i] == 'R':
ans = 'No'
print(ans) |
p03095 | s786460553 | Wrong Answer | from collections import Counter
N = int(input())
s = input()
d = Counter(s)
res = 1
for value in d.values():
res *= value + 1
res -= 1
print(res) |
p03380 | s513621670 | Wrong Answer | from scipy.special import comb
_ = int(input())
a = sorted(list(map(int, input().split())))
ans, num, val = 0, a[-1], 0
for i in a[:-1]:
num1 = comb(num, i)
if num1 > val:
val = num1
ans = i
print(num, ans)
|
p02948 | s050650745 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
from bisect import bisect_right
N, M = mapint()
AB = []
for _ in range(N):
a, b = mapint()
AB.append((b, a))
AB.sort(reverse=True)
ans = 0
cnt = 0
for b, a in AB:
if cnt>M-a:
continue
ans += b
cnt += 1
print(ans) |
p02787 | s851204583 | Accepted | # E - Crested Ibis vs Monster
from collections import defaultdict
def main():
H, N, *AB = map(int, open(0).read().split())
dp = defaultdict(lambda: 1 << 30) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for a, b in zip(*[iter(AB)] * 2):
for i in range(H):
if i not in dp:
continue
dp[i + a] = min(dp[i + a], dp[i] + b)
ans = min(magic for health, magic in dp.items() if health >= H)
print(ans)
if __name__ == "__main__":
main()
|
p02900 | s840903824 | Accepted | from fractions import gcd
import math
import numpy as np
N = list(map(int, input().split()))
g = gcd(N[0], N[1])
prime = [1]
for i in range(2, math.ceil(g**0.5)+1):
while g % i == 0:
g /= i
prime.append(i)
prime.append(g)
print(len(set(prime)))
|
p02917 | s936666258 | Accepted | def main():
n = int(input())
b_list = list(map(int, input().split()))
ans = b_list[0] + b_list[n - 2]
for i in range(1, n - 1):
ans += min(b_list[i - 1], b_list[i])
print(ans)
if __name__ == "__main__":
main()
|
p02683 | s329585203 | Accepted | import itertools
n, m, x = map(int, input().split())
A = []
for _ in range(n):
A.append(list(map(int, input().split())))
c = [ (0, 1) for _ in range(n)]
min_price = float('inf')
for cc in itertools.product(*c):
xx = [0] * m
price = 0
for i, ccc in enumerate(cc):
if ccc==1:
price += A[i][0]
xx = [a +b for a, b in zip(xx, A[i][1:])]
if min(xx) >= x:
min_price = min(min_price, price)
if min_price==float('inf'):
print(-1)
else:
print(min_price) |
p03433 | s731374133 | Accepted | n = int(input())
a = int(input())
mod500 = n//500
remain = n - mod500 * 500
if a>=remain:
print('Yes')
else:
print('No')
|
p02796 | s048144326 | Wrong Answer | N = int(input())
robots = []
for _ in range(N):
x, l = map(int, input().split())
robots.append((x-l, x+l))
robots.sort(key=lambda x: x[1]) # 終端を昇順ソート
# print(robots)
rm = 0
rightest_point = robots[0][1] - 1
for i in range(1, N):
if robots[i][0] + 1 > rightest_point: # 被っていないから残せる
rightest_point = robots[i][1] - 1
else:
rm += 1
print(N-rm)
|
p02952 | s178202631 | Wrong Answer | N = int(input())
print(N-100000*(N//100000)+1+N-1000*(N//1000)+1*N-10*(N//10)+1) |
p02819 | s759623962 | Accepted | x = int(input())
num = 0
j = 1
while(j):
ans = 1
for i in range(2,1000):
if (x+num)%i == 0 and x+num > i :
ans = 0
break
elif x + num <= i:
break
else:
pass
if ans == 1:
j = 0
num +=1
print(x+num-1) |
p02687 | s314372734 | Wrong Answer | s=str(input())
if(s=="ABC"):
print("ARC")
else:
print("ARC") |
p02847 | s123644589 | Wrong Answer | S=str(input())
if S == "SUN":
print("MON")
elif S=="MON":
print("TUE")
elif S=="TUE":
print("WED")
elif S=="WED":
print("THU")
elif S=="FRI":
print("SAT")
else:
print("MON")
|
p03433 | s842948340 | Wrong Answer | int_list = [int(input()) for i in range(2)]
if int_list[0] % 500 < int_list[1]:
print("Yes")
else:
print("No") |
p02696 | s729069427 | Wrong Answer | a, b, n = map(int, input().split())
syou = n // b
if syou >= 1:
n = b * syou - 1
print(int((a * n) / b) - a * int(n / b)) |
p02861 | s405850923 | Wrong Answer | from math import sqrt
import numpy as np
N = int(input())
x = []
y = []
for i in range(N):
temp = list(map(int, input().split()))
x.append(temp[0])
y.append(temp[1])
def dist(i, j):
return sqrt((x[i]-x[j])**2 + (y[i] - y[j])**2)
NN = N*N
matrix = np.zeros((N, N))
for i in range(NN):
iy = i%N
ix = i//N
if iy > ix:
matrix[ix, iy] = dist(ix, iy)
print(ix, iy)
avepath = np.sum(matrix)*(N-1)/N
print(avepath) |
p03803 | s899970225 | Accepted | a,b=map(int,input().split())
if a==b:
print('Draw')
elif a==1:
print('Alice')
elif b==1:
print('Bob')
elif max(a,b)==a:
print('Alice')
else:
print('Bob') |
p03815 | s472790791 | Wrong Answer | x = int(input())
# 2回で5, 6 -> 11点
i, j = divmod(x, 11)
if j <= 5:
ans = i * 2 + 1
else:
ans = (i + 1) * 2
print(ans)
|
p02697 | s310306692 | Accepted | n, m = map(int, input().split())
x, y = (m+1) // 2, m // 2
for i in range(x):
print(1+i, 2*x-i)
for i in range(y):
print(2*x+1+i, 2*x+1+2*y-i) |
p02612 | s081475789 | Wrong Answer | n=int(input())
k=0
while k <= n:
k += 1000
print(k-n) |
p03778 | s866979929 | Accepted | w, a, b = [int(x) for x in input().split()]
if abs(a - b) <= w:
res = 0
else:
res = min(abs(a + w - b), abs(b + w - a))
print(res)
|
p03862 | s790251020 | Wrong Answer | 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] + a[i + 1] - x
a[i + 1] -= max(0, a[i] + a[i + 1] - x)
print(ans) |
p03543 | s471548685 | Wrong Answer | n=input()
ns=set(n)
if len(ns)==2 or len(ns)==1:
print('Yes')
else:
print('No') |
p02847 | s858630971 | Accepted | s = input()
if s == "SUN":
print(7)
elif s == "MON":
print(6)
elif s == "TUE":
print(5)
elif s == "WED":
print(4)
elif s == "THU":
print(3)
elif s == "FRI":
print(2)
elif s == "SAT":
print(1) |
p02836 | s045015973 | Wrong Answer | s = input()
reverse_s = s[::-1]
cnt = 0
for i, j in zip(s, reverse_s):
if i != j:
cnt += 1
print(cnt) |
p02760 | s149271233 | Accepted | A=[list(map(int,input().split())) for _ in range(3)]
N=int(input())
b=[int(input()) for _ in range(N)]
flag=0
for i in range(3):
if (A[0][i] in b)and(A[1][i] in b)and(A[2][i] in b):
flag=1
elif (A[i][0] in b)and(A[i][1] in b)and(A[i][2] in b):
flag=1
if (A[0][0] in b)and(A[1][1] in b)and(A[2][2] in b):
flag=1
elif (A[0][2] in b)and(A[1][1] in b)and(A[2][0] in b):
flag=1
print("Yes" if flag==1 else "No") |
p03221 | s120266180 | Accepted | n, m = map(int, input().split())
PY = [list(map(int, input().split())) + [i] for i in range(m)]
PY = sorted(PY, key=lambda x: x[1])
PC = [1] * (n+1)
anss = []
for p, y, i in PY:
anss.append((i, p, PC[p]))
PC[p] += 1
anss = sorted(anss, key=lambda x: x[0])
for i, p, c in anss:
print('{:06}{:06}'.format(p, c))
|
p03592 | s461642700 | Accepted | # 03
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
INF = float('inf')
N, M, K = LI()
for i in range(N+1):
for j in range(M+1):
if i*(M-j) + j*(N-i) == K:
print('Yes')
exit()
print('No')
|
p03317 | s526168533 | Accepted | k,n=map(int,input().split())
a=input()
i=0
while True:
if k<=n+(n-1)*i:print(i+1);break
i+=1 |
p02946 | s630897491 | Accepted | a = list(map(int,input().split()))
ans = ""
for i in range(a[1] - (a[0]-1),(a[0]-1)+a[1]+1):
ans += str(i) + " "
print(ans) |
p03778 | s469571435 | Accepted | w, a, b = map(int, input().split())
if abs(b-a) > w:
print(min(abs(a+w - b), abs(a-b-w)))
else:
print(0) |
p03795 | s180009155 | Accepted | 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 = int(readline())
x = N * 800
y = (N // 15) * 200
print(x - y)
return
if __name__ == '__main__':
main()
|
p03644 | s457249718 | Accepted | N = int(input())
max = 1
for i in range(1,7):
if N < 2**i:
break
else:
max = 2**i
print(max) |
p02707 | s576966756 | Accepted | if __name__ == '__main__':
N = int(input())
countlist = [0] * N
queri = [int(a) for a in input().split()]
for q in queri:
countlist[q-1] += 1
for v in countlist:
print(v) |
p02732 | s455860975 | Accepted | import collections
def c2c(n):
return n*(n-1)//2
N = int(input())
A = list(map(int,input().split()))
c = collections.Counter(A)
c_l = list(c.values())
d2 = sum([c2c(i) for i in c_l])
#print(d2)
for i in range(len(A)):
print(d2-(c[A[i]]-1)) |
p02744 | s625337268 | Accepted | N = int(input())
arr=[1]*N
s = ['' for i in range(N)]
if(N==1):
print("a")
exit()
def num2alpha(num):
return chr(num+97)
def dfs(k,c):
if(k==N):
print("".join(s))
return
for i in range(c):
s[k]=num2alpha(i)
dfs(k+1,c)
s[k]=num2alpha(c)
dfs(k+1,c+1)
dfs(0,0)
|
p02596 | s445445808 | Accepted | import sys
input = sys.stdin.readline
def main():
K = int(input())
if K%2==0:
return -1
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,L+1):
a = (a * 10) % L
if a == 1:
return i
return -1
ans =main()
print(ans) |
p02765 | s940300374 | Accepted | n, m = map(int, input().split())
print(m+(n<10)*100*(10-n)) |
p04034 | s136353000 | Accepted | # coding: utf-8
# Your code here!s = input()
n, m = map(int, input().split())
x = []
y = []
for i in range(m):
xi, yi = map(int, input().split())
x.append(xi)
y.append(yi)
boxes = [False]*n
boxes[0] = True
boxescnt = [1]*n
for i in range(m):
if boxes[x[i]-1] == True:
if boxescnt[x[i]-1] == 1:
boxes[x[i]-1] = False
boxes[y[i]-1] = True
boxescnt[x[i]-1] -= 1
boxescnt[y[i]-1] += 1
print(sum(boxes))
|
p03778 | s255687033 | Accepted | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
w,a,b=INTM()
if a>=b+w:
ans=a-(b+w)
elif b>=a+w:
ans=b-(a+w)
else:
ans=0
print(ans)
if __name__ == '__main__':
do() |
p03471 | s442991417 | Accepted | #nは札枚数
n,y = map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
if i*10000 + j*5000 + (n-i-j)*1000 == y:
print(i,j, n-i-j)
exit()
print('-1 -1 -1')
|
p02663 | s381561657 | Wrong Answer | def main():
h1, m1, h2, m2, k = map(int, input().split())
time = (h2 * 60 + m2 - 1) - (h1 * 60 + m1)
cnt = time // k
print(k * cnt)
if __name__ == "__main__":
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.