problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03854 | s377323748 | Accepted | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = input()
words = ('dream', 'dreamer', 'erase', 'eraser')
while True:
if S == '':
print("YES")
break
for word in words:
if S.endswith(word):
... |
p03095 | s224832695 | Accepted | # あるアルファベットがN個あったとき、
# N個から一つ選ぶ or 選ばないのN + 1通り。これを全て掛け合わせ、1(一つも選ばない)を引く
import sys
readline = sys.stdin.readline
N = int(readline())
S = readline().rstrip()
from collections import defaultdict
dic = defaultdict(int)
for c in S:
dic[c] += 1
ans = 1
DIV = 10 ** 9 + 7
for val in dic.values():
ans *= ((val + 1) %... |
p03150 | s310255077 | Wrong Answer | from collections import defaultdict
from collections import deque
import itertools
import copy
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
s = list(input())
d = deque(["k","e","y","e","n","c","e"]... |
p02861 | s825961141 | Accepted | import math
import itertools
N = int(input())
c = []
for _ in range(N):
x, y = map(int, input().split())
c.append((x, y))
P = itertools.permutations(range(N))
ans = []
for p in P:
s = 0
for i in range(len(p) - 1):
s += math.sqrt(
math.pow(c[p[i]][0] - c[p[i + 1]][0], 2)
... |
p02789 | s724994501 | Accepted | x = input().split()
flg = 0
if x[0] == x[1]:
flg = 1
if flg == 1:
print('Yes')
else:
print('No') |
p03469 | s938313877 | Accepted | y, m, d = input().split('/')
ans = '2018/'+m+'/'+d
print(ans)
|
p03962 | s290119601 | Wrong Answer | a,b,c=map(int,input().split())
if (a==b and b==c and a==c):
print(4)
elif(a==b and b!=c):
print(2)
elif(b==c and c!=a):
print(2)
elif(c==a and a!=b):
print(2)
else:
print(1) |
p02552 | s042631597 | Accepted | x = int(input())
if x == 0:
print(1)
if x == 1:
print(0) |
p02713 | s623843711 | Accepted | # -*- coding: utf-8 -*-
import math
INF = 2**62-1
def read_int():
return int(input())
def slv(K):
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += math.gcd(math.gcd(i, j), k)
return ans
def main():
K = read_int()
prin... |
p03778 | s936317133 | Accepted | #abc056 b
w,a,b=map(int,input().split())
if a>b:
tmp=a
a=b
b=tmp
if b<a+w:
print(0)
else:
print(b-a-w) |
p02791 | s025425603 | Accepted | n = int(input())
p = list(map(int,input().split()))
count = 1
num = p[0]
for i in range(1,len(p)):
if p[i] <= num:
count += 1
num = p[i]
print(count) |
p03221 | s502982287 | Accepted | from collections import defaultdict
N, M = map(int, input().split())
P, Y = [], []
ylist = defaultdict(list)
pset = set()
for i in range(M):
p, y = map(int, input().split())
P.append(p)
Y.append(y)
ylist[p].append(y)
pset.add(p)
cdict = defaultdict(dict)
for p in pset:
syear = sorted(ylist[p])... |
p02819 | s099976568 | Wrong Answer |
X = int(input())
flg = 1
ans = 0
print(10**5)
for i in range(X, 10**100):
flg = 1
for j in range(2, i):
if i % j == 0:
flg = 0
break
if flg == 1:
ans = i
break
print(ans) |
p03962 | s175604598 | Accepted | x,y,z = map(int,input().split())
if x == y and y==z:
print(1)
elif x == y or y == z or z ==x :
print(2)
else:
print(3)
|
p03944 | s078905737 | Wrong Answer | # -*- coding : utf-8 -*-
w,h,n = map(int, input().split())
l,r,u,d = 0,w,h,0
for i in range(n) :
x,y,a = map(int, input().split())
if a == 1:
l = min(l,x)
elif a == 2:
r = max(r,x)
elif a == 3:
d = min(d,y)
elif a == 4:
u = max(u,y)
S = max(0, u-d) * max(0,l-d)
print(int(S)) |
p02612 | s214163239 | Accepted | def actual(N):
if N % 1000 == 0:
return 0
return (N // 1000 + 1) * 1000 - N
N = int(input())
print(actual(N)) |
p03162 | s952057615 | Accepted | N = int(input())
ABC = list()
for _ in range(N):
ABC.append(list(map(int, input().split(" "))))
dp = [ABC[0][0], ABC[0][1], ABC[0][2]]
for day in range(1, N):
new_dp = [max(dp[1], dp[2])+ABC[day][0],
max(dp[0], dp[2])+ABC[day][1],
max(dp[0], dp[1])+ABC[day][2]]
dp = new_dp
... |
p02694 | s236564238 | Accepted | n = 100
ans = 0
X = int(input())
while n < X:
n = n + int(n*0.01)
ans += 1
print(ans) |
p03274 | s156391297 | Wrong Answer | N,K = map(int,input().split())
candle = list(map(int,input().split()))
min_value = 10**6
for i in range(N-K+1):
left = abs(candle[i])+abs(candle[i]-candle[i+K-1])
right = abs(candle[i+K-1])+abs(candle[i]-candle[i+K-1])
if min_value > min(left,right):
min_value = min(left,right)
p... |
p02647 | s560976688 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
cnt=0
while a[0]!=n and cnt<k:
cnt+=1
for i in range(n):
b[max(0,i-a[i]):min(n,i+a[i]+1)]=map(lambda x:x+1,b[max(0,i-a[i]):min(n,i+a[i]+1)])
a=b
b=[0]*n
print(*a) |
p02911 | s470259974 | Accepted | n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
point=[k-q]*n
for i in a:
point[i-1]+=1
for i in point:
if i>0:
print("Yes")
else:
print("No")
|
p02546 | s262545296 | Wrong Answer | s = input()
if s[-1] == "e":
print(s + "s")
else:
print(s + "es") |
p03548 | s027623140 | Wrong Answer | x,y,z = map(int,input().split())
people = 0
x = x-2*z
while x-y >0:
x = x-y
people += 1
x -= z
print(people)
|
p02711 | s936751218 | Accepted | N = input()
if '7' in N:
print('Yes')
else:
print('No') |
p02659 | s383246632 | Accepted | A,B = input().split()
A = int(A)
B = "".join(list(B.split(".")))
B = int(B)
print((A*B)//100) |
p02707 | s780531805 | Accepted | i= int(input())
l=list(map(int, input().split()))
time=[]
for i in range(i):
time.append([])
for i in l:
time[i-1].append(i)
for i in time:
print(len(i))
|
p03471 | s636500680 | Accepted | #085_C
n,y=map(int,input().split())
for a in range(0,n+1):
mon=y-10000*a
cnt=n-a
if (mon-1000*cnt)%4000==0 and (5000*cnt-mon)%4000==0:
b=(mon-1000*cnt)//4000
c=(5000*cnt-mon)//4000
if 0<=b<=n and 0<=c<=n:
print(a,b,c)
exit()
print(-1,-1,-1) |
p03592 | s773336245 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-07-26 12:46:01 +0900
# LastModified: 2020-07-26 13:19:34 +0900
#
import os
import sys
def main():
n, m, k = map(int, input().split())
for s in range(m+1):
for t in range(n+1):
if k == n*s+m*t-2*s*t:
... |
p02661 | s377332337 | Accepted | n = int(input())
a = [0] * n
b = [0] * n
for i in range(n):
a[i],b[i] = map(int,input().split())
a.sort()
b.sort()
if n % 2 == 1:
print(b[n//2] - a[n//2] + 1)
else:
front = n//2
back = (n-1)//2
print((b[front] + b[back] - (a[front] + a[back]) + 1))
|
p02548 | s663604363 | Wrong Answer | valmax = int(input())
cnt = 0
for i in range(1,valmax):
tmp = int(10*valmax/i)
tmp = tmp - tmp%10
cnt += int(tmp/10) -1
print(cnt) |
p02916 | s702227595 | Accepted | n = int(input())
a_list = [0] + list(map(int, input().split()))
b_list = [0] + list(map(int, input().split()))
c_list = [0] + list(map(int, input().split()))
sum = 0
for i in range(1, n+1):
sum += b_list[a_list[i]]
if i >= 2:
if a_list[i] == a_list[i-1] + 1:
sum += c_list[a_list[i-1]]
... |
p02584 | s602633127 | Wrong Answer | x,k,d = map(int,input().split())
r = x % d
m = x // d
if m > k:
print(x - k * d)
elif (-m) > k:
print(x + k * d)
elif (k - m) % 2 == 0:
print(r)
else:
print(d - r) |
p02780 | s200728342 | Wrong Answer | n, k = map(int, input().split())
p_bef = list(map(int, input().split()))
p_aft = sorted(p_bef, reverse = True)
ans = 0
for i in range(k):
ans += (1 + p_aft[i]) / 2
print(ans) |
p02681 | s346595540 | Accepted | s=input()
t=input()
if len(t)-len(s)==1 and s==t[:len(s)]:
print("Yes")
else:
print("No") |
p03681 | s219531425 | Accepted | n,m = map(int, input().split())
f = [1]
p = 10**9 + 7
for i in range(1, max(n,m) + 1):
f.append(f[-1] * i % p)
if abs(n-m) == 1:
print(f[n] * f[m] % p)
elif abs(n-m) == 0:
print(f[n] * f[m] * 2 % p)
else:
print(0)
|
p02946 | s866283767 | Wrong Answer | k,x=map(int,input().split())
for i in range(k*2-1):
if(i==k*2-2):
print((k-x)+i)
else:
print((k-x)+i,end=(" ")) |
p03679 | s190946198 | Accepted | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
x, a, b = na()
if a >= b:
print("delicious")
elif (a+x) >= b:
print("safe")
else:
print("dangerous")
|
p02983 | s149785901 | Wrong Answer | L,R=map(int,input().split())
min_val = 2019
flag = 1
for i in range(L,R):
tmp = (i*(i+1)) % 2019
if tmp == 0:
flag = 0
break
elif tmp < min_val:
min_val = tmp
if flag == 0:
print(0)
else:
print(min_val) |
p02777 | s633641496 | Accepted | S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:
A -= 1
else:
B -= 1
print('{} {}'.format(A, B))
|
p03264 | s868645901 | Wrong Answer | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
def lcm(x, y):
return (x * y) // math.gcd(x, y)
if __name__ == '__main__':
a = [int(i) for i in input().split()]
if a[0] %2 ==1:
print(... |
p02682 | s619115288 | Accepted | a,b,c,d=map(int, input().split())
if d<a:
print(d)
elif d<b:
print(a)
else:
print(2*a-d+b) |
p03481 | s695782905 | Wrong Answer | from math import log
X, Y = map(int,input().split())
print(int(log(Y, 2) - log(X, 2)) + 1) |
p03251 | s698756676 | Wrong Answer | n, m, a, b = map(int, input().split())
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
x.sort()
y.sort()
if max(x) < min(y):
print("No War")
exit()
print("War") |
p03797 | s460769150 | Accepted | n,m = map(int,input().split())
if 2*n >=m:
print(int(m/2))
else:
print(n + int((m-2*n)/4)) |
p02699 | s581964940 | Accepted | s,w=map(int,input().split())
if s>w:
print('safe')
else:
print('unsafe') |
p03012 | s073780193 | Wrong Answer | n = int(input())
w = list(map(int, input().split()))
a = sum(w) // 2
c = 0
for i in w:
c += i
if c >= a:
break
print(abs(sum(w) - c - c))
|
p03971 | s358163731 | Accepted | n, a, b = map(int, input().split())
S = input()
cnt = 0
no = 0
for i in range(n):
if S[i] == 'a':
if cnt < a+b:
print('Yes')
cnt += 1
else:
print('No')
if S[i] == 'b':
no += 1
if cnt < a+b and no <= b:
print('Yes')
cnt +... |
p02697 | s888548416 | Accepted | n,m=map(int,input().split())
for i in range(m):print(i+1,n-i-((i>=m/2)&~n)) |
p03611 | s468836071 | Accepted | from collections import Counter
N=int(input())
a=list(map(int,input().split()))
for i in range(N):
a.append(a[i]+1)
a.append(a[i]-1)
c=Counter(a).most_common()
print(c[0][1]) |
p02607 | s641349785 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if ((i % 2) == 0):
continue
if ((a[i] % 2) != 0):
ans += 1
print(ans)
|
p03803 | s220080062 | Accepted | a,b=map(int,input().split())
if a==b:
print('Draw')
elif a==1:
print('Alice')
elif b==1:
print('Bob')
elif a<b:
print('Bob')
else:
print('Alice') |
p02831 | s856669578 | Wrong Answer | def main():
a, b = map(int, input().split())
import math
print(math.gcd(a,b))
if __name__ == "__main__":
main()
|
p02881 | s998109046 | Wrong Answer | N = int(input())
A = []
import math
for i in range(2, 53):
if N % i == 0:
A.append(i)
if len(A) == 0:
print(N-1)
exit()
C = range(2,N)
B = 10 **13
for a in range(int(math.sqrt(N)) + 1, 1, -1):
if N % a == 0:
print(a + (N // a) - 2)
break
|
p03071 | s602456804 | Accepted | a, b = map(int, input().split())
if a > b:
ans = a + max(a-1, b)
else:
ans = b + max(a, b-1)
print(ans) |
p03799 | s533903345 | Wrong Answer | s,c=map(int,input().split())
if s > c*2:
print(c//2)
else:
c-=s*2
s+=c//4
print(s) |
p02681 | s108002980 | Accepted | s = [input() for i in range(2)]
s_length = len(s[0])
s2_length = len(s[1])
if s2_length==s_length+1 and s[0]==s[1][:s_length]:
print("Yes")
else:
print("No") |
p02603 | s679679506 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
#print(N)
#print(A)
syozi = 1000
kabu = 0
for i in range(N-1):
if A[i] < A[i+1]:
kabu = int( syozi / A[i] )
syozi = int( syozi % A[i] )
elif A[i] > A[i+1]:
syozi += A[i] * kabu
kabu = 0
else:
pass
if kabu > 0:
syozi += A[N-1] * kabu
... |
p04012 | s445706815 | Wrong Answer | import collections
s = input()
lst = []
for i in s:
lst.append(i)
c = collections.Counter(lst)
if sum(c.values()) % 2 == 0:
print('Yes')
else:
print('No') |
p02657 | s577565954 | Wrong Answer | a,b = map(float, input().split())
b *= 1000
c = a*b
print(c//1000)
|
p03456 | s727039964 | Accepted | a,b=input().split()
print('Yes' if int(int((int(a+b))**0.5)**2)==int(a+b) else 'No') |
p03329 | s163758417 | Accepted | import numpy as np
n=int(input())
dp=[float("inf")]*(n+1)
dp[0]=0
for i in range(1,n+1):
dp[i]=min(dp[i],dp[i-1]+1)
for j in range(1,n+1):
if i-6**j<0: break
dp[i]=min(dp[i],dp[i-6**j]+1)
if i-9**j<0: continue
dp[i]=min(dp[i],dp[i-9**j]+1)
#print("debug:",i,",",dp[i])
print(dp[n]) |
p02768 | s848825058 | Accepted | n, a, b = map(int, input().split())
MOD = 1000000007
ans = pow(2, n, MOD)
ans -= 1
x = 1
y = 1
for i in range(b):
x = x * (n - i) % MOD
y = y * (i + 1) % MOD
if i == a - 1:
ans -= x * pow(y, MOD - 2, MOD) % MOD
ans -= x * pow(y, MOD - 2, MOD) % MOD
while ans < 0:
ans += MOD
print(ans)
|
p03264 | s079651976 | Accepted | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq... |
p02731 | s943674519 | Accepted | l = int(input())
l /= 3
print(l * l * l) |
p02571 | s872897705 | Wrong Answer | s,t=open(0)
print(min(sum(a!=b for a,b in zip(s[i:]+t,t[:-1]))for i in range(len(s)))) |
p02743 | s305541610 | Wrong Answer | from math import sqrt
a,b,c=map(int, input().split())
if sqrt(a)+sqrt(b)<sqrt(c):
print("Yes")
else:
print("No")
|
p03243 | s623608250 | Wrong Answer | n=[x for x in input()]
print(max(n)*3)
|
p03095 | s837037787 | Accepted | N = int(input())
S = input()
from collections import Counter
c = Counter(S)
ans = 1
for v in c.values():
# print(v)
ans *= v+1
ans %= 10**9+7
print(ans-1)
|
p02791 | s302235846 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
mini = 100000
cnt = 0
for i in range(n):
mini = min(p[i], mini)
if p[i] == mini:
cnt+=1
print(cnt)
|
p03407 | s011674978 | Accepted | a,b,c = map(int,input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p03407 | s708277701 | Wrong Answer | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
A,B,C = MI()
print('Yes' if A+2*B >= C else 'No') |
p02717 | s685820633 | Wrong Answer | a,b,c = map(int,input().split())
print(c,b,a)
|
p03261 | s631975189 | Wrong Answer | N = int(input())
W = [input() for i in range(N)]
l = []
for i in range(N):
if i != 0:
if W[i-1] == W[i]:
print('No')
break
if W[i] in l:
print('No')
break
l.append(W[i])
else:
print('Yes') |
p03386 | s805469726 | Accepted | a, b, k = [int(x) for x in input().split()]
if a + k - 1 < b - k + 1:
l = list(range(a, a + k)) + list(range(b - k + 1, b + 1))
else:
l = list(range(a, b + 1))
for ans in l:
print(ans)
|
p02690 | s850491759 | Accepted | X = int(input())
for A in range(-1000, 1000):
for B in range(-1000, 1000):
if(A**5 - B**5 == X):
print(A, B)
exit(0)
|
p03485 | s616567612 | Wrong Answer | from math import floor
a, b = map(int,input().split())
print(floor((a + b) / 2)) |
p03264 | s281848148 | Wrong Answer | K=int(input())
eve=0
odd=0
for i in range(1,K+1,1):
if i%2==0:
eve+=1
else:
odd+=1
print(eve,odd) |
p02832 | s004092187 | Accepted | n = int(input())
a = list(map(int, input().split()))
if 1 not in a:
print(-1)
exit()
d = 1
cnt = 0
for i in range(n):
if a[i] == d:
d += 1
else:
cnt += 1
print(cnt)
|
p02933 | s756930813 | Accepted | a=int(input())
s=input()
if a>=3200:
print(s)
else:
print('red') |
p03338 | s487349021 | Wrong Answer | n = int(input())
a = input()
dic="abcdefghijklmnopqrstuvwxyz"
maxcount = 0
for i in range(n):
for j in range(26):
count = 0
if str(dic[j]) in a[:i] and str(dic[j]) in a[i:]:
count+=1
maxcount = max(count,maxcount)
print(maxcount) |
p03485 | s307797375 | Accepted | def resolve():
# 整数 1 つ
# n = int(input())
# 整数複数個
a, b = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
# N = [int(input()) for i in range(N)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
# A = [list(map(int, input().split())) for i in range(H)]
... |
p03544 | s726362941 | Accepted | n = int(input())
l = [2,1]
for i in range(n):
l.append(l[i]+l[i+1])
print(l[-2]) |
p02778 | s535793575 | Wrong Answer | c=str(input("please enter a string"))
i= len(c)
print ("x"*i) |
p02829 | s156360156 | Wrong Answer | a = int(input())
b = int(input())
l = [1,2,3]
l.remove(a)
l.remove(b)
print(str(l)) |
p03042 | s474681719 | Wrong Answer | def solve():
S = input()
l = int(S[:2])
r = int(S[2:])
if l == 0 or r == 0:
return 'NA'
if l >= 20 or r >= 20:
return 'NA'
if 12 < l <= 19 and r <= 12:
return 'YYMM'
elif l <= 12 and r <= 19:
return 'MMYY'
elif l <= 12 and r <= 12:
return 'AM... |
p02947 | s998002607 | Wrong Answer | n = int(input())
s = [input() for i in range(n)]
a = [0]*n
for i in range(n):
for j in range(10):
a[i] += 10**(ord(s[i][j])-97)
a.sort()
print(a)
cnt = 1
ans = 0
for i in range(n-1):
if a[i] == a[i+1]:
cnt += 1
if i == n-2:
ans += cnt*(cnt-1)//2
cnt = 0 ... |
p02989 | s899171381 | Accepted | def q3():
n = int(input())
d = [int(i) for i in input().split()]
d.sort()
ans = d[int(n/2)] - d[int(n/2)-1]
print(ans)
if __name__ == '__main__':
q3()
|
p03251 | s290667379 | Accepted | n,m,x,y = map(int,input().split())
xi = list(map(int,input().split()))
xi.append(x)
yi= list(map(int,input().split()))
yi.append(y)
if max(xi)<min(yi):
print('No War')
else:
print('War') |
p02900 | s466744387 | Accepted | from fractions import gcd
A,B=map(int,input().split())
C=gcd(A,B)
count=1
C_copy=C
n=2
while n**2<=C: #C==1になるまでCを割る方針では、Cに大きい素因数が含まれている場合にTLEする
if C_copy==1:
break
flag=False
while C_copy%n==0:
C_copy//=n
flag=True
if flag:
count+=1
n=n+1 if n==2 else n+2
else:
n=n... |
p02689 | s801787526 | Accepted | n,m = map(int,input().split())
h = list(map(int,input().split()))
p = [0 for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
if h[a-1] >= h[b-1]:
p[b-1] = -1
if h[a-1] <= h[b-1]:
p[a-1] = -1
print(p.count(0)) |
p03043 | s177454462 | Accepted | n, k = list(map(int, input().split()))
p = 0
for i in range(1, n+1):
j = i
q = 1 / n
while j < k:
q *= 1 / 2
j *= 2
p += q
print(p) |
p02911 | s019137246 | Accepted | import sys
sys.setrecursionlimit(10**6)
n,k,q = map(int, input().split())
readline = sys.stdin.readline
A = [int(input()) for i in range(q)]
score = [k-q for i in range(n)]
for a in A:
score[a-1] += 1
for s in score:
if s > 0:
print('Yes')
else:
print('No') |
p02888 | s191581953 | Wrong Answer | from bisect import bisect_left
N = int(input())
L = [int(i) for i in input().split()]
L.sort()
cnt = 0
for i in range(0,N):
for j in range(i+1,N):
t = L[i]+L[j]
idx = bisect_left(L,t,lo=j+1)
print(L[i],L[j],idx)
cnt += max(0,idx-j-1)
print(cnt) |
p03379 | s939128566 | Accepted | n = int(input())
X = list(map(int, input().split()))
s = sorted(X)
med_low = s[n//2 - 1]
med_high = s[n//2]
for x in X:
if x <= med_low: print(med_high)
else: print(med_low) |
p02957 | s966059913 | Wrong Answer | a,b=map(int, input().split())
print((a+b)/2 if (a+b)%2==0 else 'IMPOSSIBLE')
|
p03962 | s593088191 | Wrong Answer | a, b, c = map(int, input().split())
count = 0
if a != b :
count += 1
if a != c :
count += 1
if b != c :
count += 1
print(count) |
p02547 | s683669140 | Wrong Answer | cnt = 0
n = int(input())
for i in range(0,n):
d1, d2 = map(int, input().split())
if d1 == d2:
cnt += 1
if cnt == 3 :
print("Yes")
break
else:
cnt == 0
if cnt != 3 and i == n-1:
print("No") |
p03211 | s794619397 | Accepted | S = input()
li = []
for i in range(0, len(S)-2):
sli = int(S[i:i+3])
li.append(sli)
ans = 1000
for j in li:
ans = min(ans, abs(j-753))
print(ans)
|
p03910 | s256343189 | Wrong Answer | n=int(input())
for i in range(n):
if i*(i+1)//2>n:break
ans=[]
for j in range(i,0,-1):
if j<=n:
n-=j
ans+=[j]
print(*ans,sep='\n') |
p03785 | s079282567 | Accepted | N,C,K = map(int,input().split())
T = [int(input()) for i in range(N)]
T.sort()
busCount = 0
pCount = 0
time = 0
firstTime = 0
for i in range(N):
time = T[i]
if firstTime == 0:
firstTime = T[i]
busCount += 1
pCount += 1
if time > firstTime + K:
firstTime = T[i]
busCount +=... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.