problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03433 | s044647676 | Accepted | N = int(input())
A = int(input())
if N%500 > A:
print("No")
else:
print("Yes") |
p03681 | s087486194 | Wrong Answer | n, m = map(int, input().split())
if abs(n-m)>1:
ans = 0
else:
if m > n:
n, m = m, n
print(n, m)
total_n = 1
for i in range(1,n+1):
total_n *= i
if total_n >= 1000000007:
total_n = total_n % 1000000007
if n != m:
ans = (total_n * total_n / n) % 1000000007
else:
ans = (total_n * total_n * 2) % 1000000007
print(int(ans)) |
p02624 | s774968112 | Wrong Answer | ans = 0
n = int(input())+1
for i in range(1,n):
for j in range(1,n,i):
ans += j
print(ans) |
p02631 | s642952600 | Accepted | N = int(input())
A = list(map(int,input().split()))
ALL = 0
for a in A:
ALL ^= a
ans = []
for a in A:
ans.append(ALL ^ a)
print(*ans)
|
p03262 | s774095749 | Wrong Answer | N, X = [int(i) for i in input().split()]
x = [int(i) for i in input().split()]
x.append(X)
num_list = sorted(x)
D = min(map(lambda x: abs(x[0] - x[1]), zip(num_list[:-1],num_list[1:])))
print(D) |
p03076 | s330517783 | Accepted | A = []
B = []
for i in range(5):
n = int(input())
B.append(n)
tmp = -(-n//10)*10
A.append(tmp)
C = []
for j in range(5):
tmp = A[j] - B[j]
C.append(tmp)
L = max(C)
print(sum(A)-L) |
p03611 | s326492502 | Accepted | if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
h = [0] * (max(a) + 2)
minus = 0
for i in a:
h[i] += 1
h[i + 1] += 1
if i == 0:
minus += 1
else:
h[i - 1] += 1
print(max(minus, max(h)))
|
p02772 | s561439708 | Accepted | input()
paper_values = list(map(int, input().split()))
is_approved = True
for val in paper_values:
if val % 2 != 0:
continue
if val % 3 == 0:
continue
if val % 5 == 0:
continue
is_approved = False
print("APPROVED" if is_approved else "DENIED") |
p03493 | s512193150 | Wrong Answer | list = list(input())
print(list.count(1)) |
p04012 | s232074159 | Wrong Answer | import sys
input = sys.stdin.readline
def solve():
w = list(input())
s = set(w)
for i in s:
if len([x for x in w if x == i]) % 2 == 1:
print('No')
exit()
print('Yes')
if __name__ == "__main__":
solve() |
p02729 | s284660398 | Wrong Answer | n,m=map(int,input().split())
ans=n*(n-1)/2+m*(m-1)/2
print(ans) |
p02700 | s731790120 | Wrong Answer | List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0
Turn_T = HP_A/AT_T
Turn_A = HP_T/AT_A
print(Turn_T, Turn_A)
if Turn_T - Turn_A >= 0:
result = "No"
else:
result = "Yes"
print(result) |
p02820 | s142746593 | Accepted | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
ans = 0
commands = [''] * N
for i, t in enumerate(T):
if t == 'r':
command = 'p'
point = P
elif t == 's':
command = 'r'
point = R
elif t == 'p':
command = 's'
point = S
if (i - K >= 0) and (commands[i - K] == command):
command = ''
point = 0
ans += point
commands[i] = command
print(ans) |
p02689 | s191613254 | Wrong Answer | n, m = map(int, input().split())
H = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
a, b = map(int, input().split())
if H[a-1]<H[b-1]:
ans[a-1] = 0
elif H[b-1]>H[a-1]:
ans[b-1] = 0
else:
ans[a-1], ans[b-1] = 0, 0
print(sum(ans))
|
p02873 | s148334006 | Accepted | s=input()
if s[0]==">":a=[0,1]
if s[0]=="<":a=[1]
for i in range(1,len(s)):
if s[i-1]!=s[i]:a.append(1)
else:a[-1]+=1
if len(a)%2:a.append(0)
ans=0
for i in range(len(a)//2):
m=max(a[i*2],a[i*2+1])
ans+=m*(m+1)//2
m=min(a[i*2],a[i*2+1])
ans+=m*(m-1)//2
print(ans) |
p03962 | s880961276 | Wrong Answer | s = list(map(int, input().split()))
if(max(s) == (sum(s)//2)):
print("Yes")
else:
print("No") |
p02624 | s404135596 | Wrong Answer | N = int(input())
M = 0
for K in range(1, N+1):
A = [d for d in range(1,K+1) if K % d ==0]
print(len(A))
M += K * len(A)
print(M) |
p02664 | s349373504 | Accepted | p=list(input())
ans=''
for i in p:
if i=='P':
ans+='P'
else:
ans+='D'
print(ans) |
p03705 | s507042565 | Accepted | N,A,B = map(int,input().split())
if N < 1 or B - A < 0:
print(0)
exit(0)
if N == 1 and A < B:
print(0)
exit(0)
if A == B or N <= 2:
print(1)
exit(0)
c = N-2
r = B-A+1
ans = c*(r-1) + 1
print(ans)
|
p02612 | s730524835 | Accepted | N = int(input())
ans = 1000-(N%1000)
if ans != 1000:
print(ans)
else:
print(0) |
p02911 | s267687422 | Accepted | from collections import Counter
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
a = Counter(a)
for i in range(1,n+1):
if a[i] > q-k:
print('Yes')
else:
print('No') |
p02665 | s498459689 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
bottom = sum(A)
if A[0] >= 1:
print(-1)
exit()
ret = 1
children = 1
for i in range(N):
children = children * 2 - A[i+1]
if children <= -1:
ret = -1
break
bottom -= A[i+1]
if children >= bottom:
children = bottom
ret += children + A[i+1]
print(children)
print(bottom)
print(ret) |
p02848 | s032871313 | Accepted | n = int(input())
s = input()
lst_search = [chr(i) for i in range(65, 65+26)]
lst = [chr(i) for i in range(65, 65+26)] *2
ans = ''
for i in s:
idx = lst_search.index(i)
ans += lst[idx+n]
print(ans) |
p02657 | s718683440 | Accepted | a, b =map(int, input().split())
c = a*b
print(c) |
p02860 | s851150306 | Accepted | n = int(input())
if n % 2 == 1:
print('No')
exit()
s = input()
if s[:n//2] == s[n//2:]:
print('Yes')
else:
print('No') |
p04034 | s502230281 | Wrong Answer | n, m = list(map(int, input().split()))
xy = [list(map(int, input().split())) for i in range(m)]
ans = [1] * (n)
ans[0] = 1
ball = {0}
for i in range(m):
x, y = xy[i]
if (x - 1) in ball:
ans[y-1] += 1
ans[x-1] -= 1
ball.add(y - 1)
if ans[x-1] == 0:
ball -= set([x-1])
cnt = 0
for i in list(ball):
if ans[i] > 0:
cnt += 1
print(cnt) |
p02578 | s737435147 | Wrong Answer |
n=int(input())
l=list(map(int,input().split()))
x = 0
for a in range(n-1):
if l[a]>l[a+1] :
x=l[a] - l[a+1] + x
l[a+1]=l[a]
print("l[a],x,l[a+1]=", l[a], x, l[a+1])
print(x)
|
p03338 | s079283157 | Wrong Answer | n = int(input())
s = list(input())
ans = 0
for i in range(1,n-1):
sa = set(s[:i])
sb = set(s[i+1:])
ans = max(ans,len(sa&sb))
print(ans)
|
p03319 | s230526558 | Accepted | from math import ceil
n,k = map(int,input().split())
a=list(map(int,input().split()))
#index = a.index(1)
#left, right = index, n-index-1
#if n!=k: print(ceil(left/(k-1))+ceil(right/(k-1)))
if n!=k: print(1+ceil((n-k)/(k-1)))
else: print(1) |
p02879 | s313723701 | Accepted | A,B=map(int , input().split())
a,b=str(A),str(B)
if len(a)>1 or len(b)>1:
print("-1")
else:
print(A*B) |
p03803 | s845910266 | Accepted | i = [p+2 for p in range(12)]
i.append(1)
x, y = map(int, input().split())
if i.index(x) == i.index(y):
print("Draw")
if i.index(x) > i.index(y):
print("Alice")
if i.index(x) < i.index(y):
print("Bob")
|
p02963 | s575465589 | Wrong Answer | #!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
S = int(input())
M = 10**9
X = (S+M-1) // M
print(0,0,M,1,M-S%M,X)
if __name__ == "__main__":
main()
|
p02933 | s759020371 | Wrong Answer | a=int(input())
s=input()
print(s if a<3200 else 'red') |
p03319 | s037871468 | Wrong Answer | # https://atcoder.jp/contests/arc099/tasks/arc099_a
n, k = map(int, input().split())
nums = [int(i) for i in input().split()]
MIN = min(nums)
index = nums.index(MIN)
ans = index // (k - 1) + (len(nums) - index) // (k - 1)
print(ans) |
p03815 | s909268341 | Accepted | import sys
input = sys.stdin.readline
x=int(input())
print(x//11*2-(-(x%11))//6)
|
p02603 | s771737288 | Accepted | n=int(input())
a=list(map(int,input().split()))
r=1000
k=0
for ii in range(n-1):
if a[ii+1]<a[ii]:
r+=k*a[ii]
k=0
else:
dk=r//a[ii]
r-=dk*a[ii]
k+=dk
#print(ii,r,k)
print(r+k*a[n-1])
|
p03814 | s603703266 | Wrong Answer | s=input()
frag=False
count=0
ans=0
for i in range(len(s)):
if frag:
count+=1
if s[i]=="A":
frag=True
count+=1
elif s[i]=="Z":
frag=False
ans=max(ans,count)
print(ans) |
p03760 | s884961120 | Accepted | from collections import deque
o = deque(input())
e = deque(input())
if len(o) > len(e):
e.append('')
ans = ''
while len(o):
ans += o.popleft()
ans += e.popleft()
print(ans) |
p03556 | s266721344 | Accepted | n = int(input())
for i in range(int(n**0.5)+1):
if i*i <= n:
ans = i*i
print(ans) |
p03720 | s504599945 | Wrong Answer | import collections
n, m = map(int, input().split())
a = []
for _ in range(m):
tmp1,tmp2 = map(int, input().split())
a.append(tmp1)
a.append(tmp2)
ans = collections.Counter(a)
ans_sorted = sorted(ans.items(), key=lambda x:x[0])
#print(ans_sorted)
for i in ans_sorted:
print(i[1]) |
p02946 | s549780136 | Wrong Answer | k,x=map(int,input().split())
s=list(range(x-k+1,x+k))
print(s)
|
p03076 | s804031990 | Accepted | l = [int(input()) for i in range(5)]
a = min(l, key=lambda x: (x-1)%10)
ret = 0
flag = 0
for i in l:
if i != a or flag == 1:
ret += i
else:
flag = 1
if ret%10 != 0:
ret += 10-(ret%10)
ret += a
print(ret) |
p03077 | s380708823 | Accepted | N = int(input())
a = []
for i in range(5):
a.append(int(input()))
if N % min(a) == 0:
ans = N//min(a)+4
else:
ans = N//min(a)+5
print(ans)
|
p03407 | s214127967 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p03951 | s225608068 | Wrong Answer | n = int(input())
s = input()
t = input()
cnt = 0
for i in range(n):
for j in range(n-i):
if not s[i+j] == t[j]:
break
else:
print(i+n)
exit()
print(2*n) |
p03644 | s545502794 | Accepted | import math
n = int(input())
for i in range(n, 0, -1):
if math.log2(i).is_integer():
print(i)
exit() |
p03086 | s256121244 | Wrong Answer | S = input()
ans = 0
cnt = 0
for i in range(len(S)):
if S[i] in "ACGT":
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
print(ans) |
p03779 | s379838715 | Accepted | x = int(input())
n = 1
while n*(n+1)//2 < x: n += 1
print(n) |
p02621 | s616298878 | Accepted | from sys import stdin
input = stdin.readline
a = int(input())
print(a ** 3 + a ** 2 + a)
|
p03011 | s582179529 | Accepted | p, q, r = map(int, input().split())
a = max(p, q, r)
print(p+q+r-a) |
p02814 | s055630686 | Accepted | n,m=map(int,input().split())
a=list(map(int,input().split()))
def gcd(a,b):
while b:a,b=b,a%b
return a
def lcm(a,b):return a*b//gcd(a,b)
l=a[0]//2
ll=a[0]
for i in range(1,n):
if a[i]%2:odd=True
else:even=True
l=lcm(l,a[i]//2)
ll=lcm(ll,a[i])
if l>m:print(0);exit()
for i in range(n):
if l%a[i]==0:print(0);exit()
print((m-l)//ll+1) |
p03077 | s099388764 | Wrong Answer | N = int(input())
mylist = []
for i in range(5):
mylist.append(N//int(input()))
print(5+max(mylist)) |
p03860 | s952992577 | Accepted | import sys
input = sys.stdin.readline
def main():
_, s, _ = input().split()
ans = "A" + s[0].upper() + "C"
print(ans)
if __name__ == "__main__":
main()
|
p02959 | s005050706 | Accepted | n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
if B[i] - A[i] >= 0:
ans += A[i]
B[i] = B[i] - A[i]
if B[i] - A[i+1] >= 0:
ans += A[i+1]
A[i+1] = 0
else:
ans += B[i]
A[i+1] = A[i+1] - B[i]
else:
ans += B[i]
print(ans)
|
p03107 | s012026869 | Accepted | import re
s = input()
c0, c1 = 0, 0
for i in s:
if i=='0':
c0 += 1
else:
c1 += 1
print(min(c0, c1)*2)
"""TLE
def trans_word(text):
replacements = {'01': '', '10': ''}
return re.sub('({})'.format('|'.join(map(re.escape, replacements.keys()))), lambda m: replacements[m.group()], text)
ans = 0
flag = True
while flag:
s_tmp = s
s = trans_word(s)
ans += (len(s_tmp) - len(s))
flag = len(s_tmp) - len(s)
print(ans)
""" |
p03469 | s952913965 | Wrong Answer | S = input()
# Pythonでは S[3]='8' のような操作は許されないので間接的な方法を用いる
print('2018/01' + S[-2]) |
p02832 | s739572412 | Accepted |
def main():
n = int(input())
al = list(map(int, input().split()))
#print(n)
#print(al)
#print(len(al))
cnt = 1
bl = []
for ai in al:
if ai == cnt:
bl.append(ai)
cnt += 1
b_cnt = len(al) - len(bl)
if(cnt == 1):
print(-1)
else:
print(b_cnt)
if __name__ == "__main__":
main() |
p02714 | s322387618 | Accepted | n = int(input())
s = input()
to_int = {"R":0, "G":1, "B":2}
cnt = [0] * 3
for char in s:
cnt[to_int[char]] += 1
ans = 1
for num in cnt:
ans *= num
for i in range(n):
for length in range(1, n):
if i - length < 0 or i + length >= n:
break
if len(set([to_int[s[i - j * length]] for j in (-1, 0, 1)])) == 3:
ans -= 1
print(ans)
|
p03494 | s127914639 | Accepted | import sys
N = int(input())
A = list(map(int, input().split()))
cnt = flg = 0
while flg == 0:
for i in range(N):
if A[i]%2 == 0:
A[i] = int(A[i]/2)
elif A[i]%2 ==1 or A[i] == 1:
print(cnt)
sys.exit()
cnt += 1
print(max(0,cnt-1)) |
p03457 | s346096285 | Wrong Answer | def solve():
N = int(input())
t_i, x_i, y_i = map(int, input().split())
for i in range(N-1):
t_j, x_j, y_j = map(int, input().split())
dt = t_j - t_i
dxy = x_i + x_j - y_i - y_j
if (dt > (t_j - t_i)) | (dt < (t_i - t_j)):
return "No"
if ((t_i - t_j) % 2) != (dxy % 2):
return "No"
return "Yes"
if __name__ == "__main__":
print(solve())
|
p02909 | s101663033 | Accepted | Weather=["Sunny", "Cloudy", "Rainy"]
Today=input()
for i in range(3):
if Today== Weather[i]:
if i==0 or i==1:
print(Weather[i+1])
else:
print(Weather[0]) |
p02909 | s529767121 | Wrong Answer | # A - Weather Prediction
S = input()
if S == 'Sunny':
print('Cloudy')
elif S == 'Rainy':
print('Sunny')
elif S == 'Cloudy':
print('Sunny')
|
p02742 | s726533437 | Wrong Answer | a,b=map(int,input().split())
if a==b==1:
print(1)
elif a%2==1 and b%2==1:
print((a*b)//2+1)
else:
print(a*b//2)
|
p03437 | s671260380 | Wrong Answer | X, Y = map(int, input().split())
if X % Y == 0:
print(-1)
else:
for i in range(10**18):
X1 = int(X*i)
if X1 % Y != 0:
print(str(X1))
break
|
p03434 | s879389620 | Wrong Answer | N = int(input())
A = sorted(list(map(int, input().split())))
print(sum(A[0::2])-sum(A[1::2])) |
p03705 | s422494095 | Accepted | N,A,B = map(int, input().split())
if A > B or (A != B and N == 1):
print(0)
else:
N -= 2
print(N*(B-A)+1) |
p03487 | s430422393 | Wrong Answer | import collections
N = int(input())
a = [int(i) for i in input().split()]
c = collections.Counter(a)
s = 0
for k,v in c.items():
s += abs(v - k)
print(s) |
p02607 | s180116605 | Accepted | n=int(input())
count=0
a = input().split(" ")
lista = [int(n) for n in a]
for i in range(0,n,2):
if lista[i]%2==1:
count+=1
print(count)
|
p03815 | s303936415 | Wrong Answer | import math
x = int(input())
print(math.ceil(x/11 * 2))
|
p02696 | s545088385 | Accepted | import math
a,b,n = map(int,input().split())
if (b-1) <= n:
ans = math.floor(a*(b-1)/b) - (a * math.floor((b-1)/b))
else:
ans = math.floor(a*n/b) - (a * math.floor(n/b))
print(ans)
|
p03611 | s068601255 | Accepted | N = int(input())
A = list(map(int, input().split()))
maxim = max(A)
counter = [0]*(maxim+1)
dif = [-1, 0, 1]
for a in A:
for d in dif:
i = a + d
if i < 0 or maxim < i:
continue
else:
counter[i] += 1
print(max(counter)) |
p03625 | s782117017 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
l = []
for i in range(n):
if a.count(a[i]) >= 2 and a[i] not in l:
l.append(a[i])
l.sort()
print(a[-1]*a[-2]) |
p02911 | s187464568 | Wrong Answer | N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
points = [K - Q] * N
for i in A:
points[i - 1] += 1
for p in points:
if p > 0:
print("yes")
else:
print("No") |
p03592 | s379861016 | Accepted | n,m,k = map(int,input().split())
nya = False
for i in range(n+1):
for j in range(m+1):
if i*m + j*n - 2*i*j == k:
nya = True
break
if nya:
print('Yes')
else:
print('No')
|
p03821 | s949142742 | Wrong Answer | """
Nは10**5以下。O(N)なら通る
"""
N = int(input())
A = []
B = []
for i in range(N):
s = list(map(int, input().split()))
A.append(s[0])
B.append(s[1])
count = 0
for i in reversed(range(N)):
if A[i] % B[i] == 0:
continue
else:
s = B[i] - (count + A[i]) % B[i]
count += s
print(count) |
p03137 | s928338460 | Accepted | N, M = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
if N >= M:
print(0)
exit()
Xs = sorted(X)
dst = []
for i in range(M-1):
dst.append(Xs[i+1] - Xs[i])
#print(Xs)
#print(dst)
dsts = sorted(dst)
#print(dsts[:len(dsts)-N+1])
print(sum(dsts[:len(dsts)-N+1])) |
p02700 | s715695040 | Accepted | # 164 B
a, b, c, d = map(int, input().split())
while a != 0 or c != 0:
c = c - b
if c <= 0:
print("Yes")
break
a = a - d
if a <= 0:
print("No")
break |
p02613 | s401615225 | Wrong Answer | n = int(input())
ac = "AC"
wa = "WA"
tle = "TLE"
re = "RE"
ans = [0, 0, 0, 0]
for _ in range(n):
a = input()
if (a == ac):
ans[0] += 1
if (a == wa):
ans[1] += 1
if (a == tle):
ans[2] += 1
if (a == re):
ans[3] += 1
print("AC x ",ans[0])
print("WA x ",ans[1])
print("TLC x ",ans[2])
print("RE x ",ans[3])
|
p02784 | s604551579 | Accepted | H,N = map(int,input().split())
A = list(map(int, input().split()))
count = 0
for i in A:
H = H - i
if H <=0:
print("Yes")
else:
print("No") |
p02681 | s664933526 | Accepted |
s = input()
t = input()
if s == t[:len(t)-1]:
print("Yes")
else:
print("No")
|
p03001 | s643902408 | Wrong Answer | W,H,x,y=map(int,input().split())
a=[]
judge=0
a.append(min(x,W-x)*H)
a.append(min(y,H-y)*W)
if a[0]==a[1]:
judge=1
print(max(a),judge) |
p03086 | s748083347 | Accepted | S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i, N):
if all('ACGT'.count(c)==1 for c in S[i:j+1]):
ans = max(ans, j-i+1)
print(ans) |
p03557 | s788444770 | Accepted | # coding: utf-8
import itertools
import math
import bisect
N = int(input())
A = list(map(int, input().split(" ")))
A.sort()
B = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
C.sort()
res = 0
for bi in B:
res += bisect.bisect_left(A, bi) * (N-bisect.bisect_right(C, bi))
print(res)
|
p02660 | s562934079 | Accepted | import sys
input=lambda: sys.stdin.readline().rstrip()
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
ans=0
for p in pf.keys():
d=pf[p]
tot=1
cur=1
ct=0
while tot<=d:
ct+=1
if tot+cur+1>d:
break
else:
cur+=1
tot+=cur
ans+=ct
print(ans)
|
p03075 | s351091095 | Wrong Answer | A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())
K=int(input())
a=abs(A-B)
b=abs(A-C)
c=abs(A-D)
d=abs(A-E)
e=abs(B-C)
f=abs(B-D)
g=abs(B-E)
h=abs(C-D)
i=abs(C-E)
j=abs(D-E)
if K>a and K>b and K>c and K>d and K>e and K>f and K>g and K>h and K>i and K>j:
print('Yay!')
else:
print(':(') |
p02597 | s471907629 | Wrong Answer | n=int(input())
stone=str(input())
count=0
for i in range(n-1):
if stone[i]=='W' and stone[i+1]=='R':
count=count+1
m=1
while m<=i and stone[i-m]=='W':
if stone[i-m-1]=='W':
count=count+1
m=m+1
else:
m=m+1
print(count)
|
p03241 | s389312927 | Accepted | n, m = map(int, input().split())
val = m//n
i = val
while i > 0 :
if m % i == 0:
print(i)
exit()
i -= 1 |
p02606 | s960821009 | Accepted | L, R, d = list(map(int, input().split()))
ans_r = R // d
ans_l = L // d
ans = ans_r - ans_l
if ((L % d) == 0):
ans += 1
print(ans)
|
p03359 | s316378396 | Wrong Answer | a, b=map(int,input().split())
if a<=b:
print(a)
else:
print(b) |
p03645 | s387970576 | Wrong Answer | N, M = map(int, input().split())
an = []
nb = []
for i in range(M):
a, b = map(int, input().split())
if a == 1:
an.append(b)
elif b == 5:
nb.append(a)
print('IMPOSSIBLE' if len(set(an) & set(nb))==0 else 'POSSIBLE') |
p02707 | s834489349 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
for i in a:
ans[i]+=1
for i in ans[1:]:
print(i)
print(0) |
p02754 | s497796965 | Accepted | n, a, b = map(int, input().split())
print((n // (a + b) * a + min(n % (a + b), a)))
|
p02742 | s221475153 | Wrong Answer | h, w = map(int, input().split())
if h==1 and w==1:
print(0)
elif h%2==1 and w%2==1:
print((h*w+1)//2)
else:
print(h*w//2)
|
p02939 | s651208098 | Wrong Answer | S = input()
ans=0
for i in range(len(S)-1):
if S[i]==S[i+1]:
ans=ans+1
print(len(S)-ans+1)
|
p03815 | s395694905 | Wrong Answer | N=int(input())
k=(N-1)//11
ans=2*k
if N-k*11<=5:
ans+=1
else:
ans+=2
print(ans) |
p02972 | s204296371 | Accepted | N,A = int(input()), list(map(int, input().split()))
b,r = [0]*N,[]
for i,x in enumerate(reversed(A)):
if not x == sum(b[N-i-1::N-i])%2:
b[N-1-i] = 1
for i,x in enumerate(b):
if x:
r.append(i+1)
print(len(r))
print(' '.join(map(str, r))) |
p02595 | s517235239 | Wrong Answer | import math
t,d=map(int,input().split())
c=0
for i in range(t):
x,y=map(int,input().split())
s=math.sqrt(x*x+y*y)
if s<=d:
c+=1
print(c)
|
p02761 | s093752733 | Wrong Answer | N, M = map(int, input().split())
Q = [list(map(int, input().split())) for i in range(M)]
for n in range(1000):
X = list(map(int, list(str(n))))
for s, c in Q:
s -= 1
if len(X) != N:
break
if X[s] != c:
break
else:
print(n)
exit()
print(-1)
|
p02612 | s570943168 | Accepted | N = int(input())
mod = N % 1000
if mod == 0:
print(0)
else:
print(1000 - N % 1000) |
p03385 | s014982293 | Accepted |
import numpy as np
s=sorted(input())
if(s==list("abc")):print("Yes")
else:print("No")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.