problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03645 | s321762151 | Accepted | n,m = map(int,input().split())
s = [[int(i) for i in input().split()] for i in range(m)]
d = {}
for i in range(m):
if s[i][0] == 1:
d[s[i][1]] = 1
for i in range(m):
if s[i][1] == n and s[i][0] in d:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") |
p02696 | s214549257 | Accepted | A, B, N = map(int, input().split())
ans = max((A*N)//B - A*(N//B), 0)
def func(x):
return (A*x)//B - A * (x//B)
if N < B - 1:
print(func(N))
else:
print(func(B-1))
|
p02772 | s308664608 | Wrong Answer | n = int(input())
li = list(map(int,input().split()))
flag = False
for i in li:
if i % 6 == 0 or i % 10 == 0:
continue
else:
print("DENIED")
flag = True
if not flag:
print("APPROVED") |
p02802 | s554390799 | Wrong Answer | hist = []
nm = list(map(int, input().split()))
for i in range(nm[1]):
a,b=input().split()
hist.append((int(a), b))
ac = [0] * nm[0]
wa = [0] * nm[0]
for i in range(nm[1]):
if hist[i][1] == "AC":
if ac[hist[i][0]-1] != 1:
ac[hist[i][0]-1] = 1
else:
if ac[hist[i][0]-1] != 1:
wa[hist[i][0]-1] = wa[hist[i][0]-1] + 1
print(sum(ac), sum(wa)) |
p02970 | s717700782 | Accepted | N, D = map(int, input().split())
D = 2*D + 1
print((N+D-1)//D) |
p02785 | s183361353 | Accepted | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H.sort(key=lambda x: -x)
c = min(K, N)
i = 0
while 0 < c:
H[i] = 0
c -= 1
i += 1
ans = 0
for j in range(i, N):
ans += H[j]
print(ans) |
p02602 | s789998958 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
sum=0
for i in range(k,n):
if a[i-k]<a[i]:
print("Yes")
else:
print("No") |
p03387 | s534856180 | Accepted | A = list(map(int,input().split()))
A.sort(reverse = True)
X = A[0] - A[1]
Y = A[0] - A[2]
ans = 0
if (X % 2 == 0) and (Y % 2 == 0):
ans = X//2 + Y//2
elif (X % 2 == 1) and (Y % 2 == 1):
ans = X//2 + Y//2 + 1
else:
ans = X//2 + Y//2 + 2
print(ans) |
p03605 | s084021972 | Wrong Answer | print('YNeos'['9' in input()::])
|
p03997 | s000611537 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2) |
p04019 | s366533291 | Accepted | s = str(input())
a = s.count("N")
b = s.count("W")
c = s.count("S")
d = s.count("E")
if (a == 0 and c != 0) or (c == 0 and a != 0) or (b == 0 and d != 0) or (d == 0 and b != 0):
print("No")
else:
print("Yes") |
p03672 | s810919692 | Accepted | S = input()
for i in range(1, len(S)):
if i % 2 > 0: continue
ans = None
for j in range((len(S) - i) // 2):
if S[j] == S[j + (len(S) - i) // 2]:
continue
else:
break
else:
ans = len(S) - i
#
if ans != None: break
print(ans) |
p02910 | s252203406 | Accepted | S = input()
flg = True
for i, c in enumerate(S):
if (i%2==0 and c=='L') or (i%2==1 and c=='R'):
flg = False
print('Yes' if flg else 'No')
|
p03455 | s880656362 | Accepted | a, b = [int(i) for i in input().split()]
print("Even" if(a * b % 2 == 0) else "Odd") |
p03210 | s987984041 | Accepted | x = int(input())
if x == 3 or x == 5 or x == 7:
print("YES")
else:
print("NO") |
p03069 | s387354868 | Accepted | n = int(input())
s = input()
ans = 0
c = 0
for i in range(n):
if s[i] == "#":
c += 1
else:
if c >= 1:
ans += 1
c -= 1
print(ans) |
p02917 | s452638704 | Accepted | n = int(input())
b = [int(i) for i in input().split()]
s = 0
s = b[0]+b[-1]
for i in range(1, n-1):
s += min(b[i],b[i-1])
print(s) |
p02952 | s201537807 | Accepted | N = int(input())
ans = 0
for i in range(1,N + 1):
if(len(str(i)) % 2 == 1):
ans += 1
print("%d"%(ans))
|
p02957 | s976775277 | Accepted | # https://atcoder.jp/contests/abc135/tasks/abc135_a
A, B = map(int, input().split())
K = (A + B) / 2
if (A + B) % 2 == 0:
print(int(K))
else:
print('IMPOSSIBLE')
|
p03076 | s837094491 | Accepted | parr = [int(input()) for _ in range(5)]
arr = []
for x in parr:
if x%10 == 0:
arr.append([0,x,x])
else:
arr.append([x%10, (x//10 + 1)*10,x])
arr.sort()
found = False
ans = 0
for cur in arr:
r,v,o = cur
if r == 0:
ans += v
else:
if found:
ans += v
else:
ans+= o
found = True
print(ans)
|
p03042 | s804069295 | Accepted | s=int(input())
s1=s//100
s2=s-s1*100
if 0<s1<=12 and 0<s2<=12:
print("AMBIGUOUS")
elif (s1>12 or s1==0) and 0<s2<=12:
print("YYMM")
elif 0<s1<=12 and (s2>12 or s2==0):
print("MMYY")
else:
print("NA") |
p02859 | s070351929 | Accepted | r = int(input())
print (r*r) |
p03043 | s386717761 | Wrong Answer | n, k = map(int, input().split())
a = []
for i in range(1,n+1):
x = i
for j in range(100001):
x = x*2
if x >= k:
#print(j)
a.append(1/n * (0.5**(j)))
break
print(sum(a)) |
p02897 | s825848553 | Wrong Answer | N = input()
n = int(N)
output = float((2*n - 1)/n)
print(output)
|
p03208 | s934039402 | Accepted | def solve():
n, k = map(int, input().split())
s = []
for i in range(n):
s.append(int(input()))
s.sort()
res = 10 ** 10
for i in range(n + 1 - k):
tmp = s[i + k - 1] - s[i]
res = min(res, tmp)
print(res)
solve() |
p03699 | s099890709 | Accepted | N = int(input())
s = sorted([int(input()) for _ in range(N)])
ans = sum(s)
if ans % 10 != 0:
print(ans)
else:
for s_i in s:
if s_i % 10 != 0:
ans -= s_i
print(ans)
break
else:
print(0)
|
p02899 | s428273932 | Accepted | def actual(N, A):
records = []
for i, a in enumerate(A, start=1):
record = dict(student_id=str(i), num_students=a)
records.append(record)
records_asc = sorted(records, key=lambda x: x['num_students'])
return ' '.join([record['student_id'] for record in records_asc])
N = int(input())
A = list(map(int, input().split()))
print(actual(N, A)) |
p03323 | s773341964 | Accepted | a,b = map(int,input().split())
if max(a,b)*2<=16:
print('Yay!')
else:
print(':(') |
p02553 | s757115476 | Wrong Answer | a,b,c,d = map(int,input().split())
if b*c >= b*d:
print(b*c)
elif a*c >= b*d:
print(a*c)
elif a*d >= b*d:
print(a*d)
else:
print(b*d)
|
p02612 | s261018842 | Accepted | n = int(input())
if((n%1000) == 0):
ans = 0
else:
ans = 1000-(n%1000)
print(ans) |
p02730 | s488896565 | Wrong Answer | S = input()
def is_palindrome(s):
N = len(s)
half = N // 2
f = s[:half]
r = s[-half:][::-1]
return f == r
if is_palindrome(S) and is_palindrome(S[: (len(S) - 1) // 2]):
print("Yes")
else:
print("No")
|
p03838 | s613091946 | Accepted | x, y = map(int, input().split())
print(min(max(y-x, x-y+2), abs(y+x)+1)) |
p02785 | s526415679 | Accepted | import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().split()))
l = len(li)
t = 0
if l > k:
li.sort()
li.reverse()
t = sum(li[k:])
print(t)
|
p02817 | s927806351 | Accepted | # import math
# from itertools import permutations as permus
# from fractions import gcd
# import numpy as np
# import scipy as scp
# 入力の受け取り
s,t = input().split()
ans = t + s
print(ans) |
p03862 | s703247258 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
if x == 0:
print(sum(A))
exit()
count = 0
for i in range(N - 1):
d = A[i] + A[i + 1] - x
if d <= 0:
continue
if A[i + 1] >= d:
A[i + 1] -= d
count += d
else:
count += d
A[i] = d - A[i + 1]
A[i + 1] = 0
print(count)
|
p03854 | s221617905 | Accepted | s = input()[::-1]
templates = [s[::-1] for s in ["dream", "dreamer", "erase", "eraser"]]
while s:
for template in templates:
if s.startswith(template):
s = s.replace(template, "", 1)
break
else:
break
print("YES" if not s else "NO") |
p02916 | s043463848 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
pre = -1
for a in A:
ans += B[a-1]
if a - 1 == pre:
ans += C[a-2]
pre = a
print(ans) |
p02683 | s311988168 | Accepted | N,M,X=map(int,input().split())
CA=[list(map(int,input().split())) for i in range(N)]
ans=10**18
x=[0]*M
for i in range(1,2**N):
_ans=0
_x=x[:]
f=True
for j in range(N):
if i%2==1:
for k,a in enumerate(CA[j]):
if k==0:
_ans+=a
else:
_x[k-1]+=a
i=i//2
for _ in _x:
if _<X:
f=False
break
if f:
ans=min(ans,_ans)
if ans==10**18:
ans=-1
print(ans) |
p02624 | s037375038 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
num = N // i
ans += i * num * (num+1) // 2
print(ans) |
p03145 | s934177416 | Wrong Answer | a, b, c =map(int,input().split())
if a**2+b**2 ==c**2:
print(a*b/2)
elif b**2 + c**2 ==a**2:
print(b*c/2)
else:
print(c*a/2) |
p02631 | s104608147 | Accepted | N = int(input())
alphas = list(map(int, input().split()))
all_xor = alphas[0] ^ alphas[1]
for i in range(2, N):
all_xor = all_xor ^ alphas[i]
ans_list = []
for i in range(N):
num_i = all_xor ^ alphas[i]
ans_list.append(str(num_i))
ans = " ".join(ans_list)
print(ans) |
p03012 | s490379643 | Wrong Answer | # input
N = int(input())
W = list(map(int, input().split()))
# check
W = sorted(W)
sub_abs = [
abs(sum(W[i:]) - sum(W[:i]))
for i in range(N)
]
print(min(sub_abs)) |
p02714 | s326755990 | Wrong Answer | import collections
N=int(input())
S=list(input())
s=collections.Counter(S)
m=s["R"]*s["G"]*s["B"]
for i in range(N-2):
for j in range(i+1,N-1):
k=2*j-i
if k>=N:
break
if s[i]!=s[j] and s[j]!=s[k] and s[i]!=s[k]:
m-=1
print(m) |
p03723 | s409211247 | Wrong Answer | A,B,C = map(int,input().split())
ans = 0
if A == B == C:
print(-1)
else:
while A % 2 == 0 and B % 2 == 0 and C % 2 == 0:
n_A = (B + C) / 2
n_B = (A + C) / 2
n_C = (A + B) / 2
A = n_A
B = n_B
C = n_C
ans += 1
print(ans) |
p02584 | s225088431 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
K_main = X // D
K_sub = K - K_main
if (K_sub < 0):
print(abs(X - D * K))
else:
answer = abs(X - D * K_main)
if (K_sub % 2 == 0):
print(answer)
else:
print(abs(answer -D)) |
p02847 | s871372530 | Accepted | a = ('SUN,MON,TUE,WED,THU,FRI,SAT')
b = a.split(',')
n = input()
for i in range(7):
if b[i] == n:
ans = 7 - i
print(ans) |
p03659 | s454496724 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ruiseki = [0]
for i in range(n):
ruiseki.append(ruiseki[i] + a[i])
ans = 10 ** 9
for i in range(1, n):
snuk = ruiseki[i] - ruiseki[0]
arai = ruiseki[n] - ruiseki[i]
ans = min(ans, abs(snuk - arai))
print(ans) |
p03017 | s854187895 | Accepted | # A - Kenken Race
N,A,B,C,D = map(int,input().split())
S = input()
should_change = int(C>D)
can_change = 0
space = 1
ans = 'Yes'
for i in range(A,max(C,D)):
if S[i]=='.':
space += 1
if B<=i<=D and space==3:
can_change = 1
else:
if space==0:
ans = 'No'
break
space = 0
if can_change<should_change:
ans = 'No'
print(ans) |
p04012 | s476125368 | Accepted | W = input()
ji={}
for i in W:
if i not in ji:
ji[i]=1
else:
ji[i]+=1
for j in ji.values():
if j % 2 ==0:
result="Yes"
else:
result="No"
break
print(result) |
p02823 | s476446665 | Wrong Answer | n,a,b = map(int,input().split())
if (b-a)%2 == 0:
print(int((b-a)/2))
else:
print(min(a,n-b+1)+int((b-a)/2)) |
p03592 | s873804043 | Wrong Answer | N, M, K = map(int, input().split())
for k in range(N+1):
for l in range(M+1):
if k * (N-l) + l * (M-k) == K:
print("Yes")
import sys
sys.exit()
print("No") |
p02694 | s117714461 | Accepted | X = int(input())
ans = 0
money = 100
for i in range(1, 10**18):
money = (money * 101) // 100
if money >= X:
ans = i
break
print(ans) |
p03495 | s573566248 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
D = {}
for a in A:
if a not in D:
D[a] = 1
else:
D[a] += 1
D = sorted(D.items())
c = 0
i = 0
l = len(D)
while l > K:
c += D[-1 -i][1]
l -= D[-1 -i][1]
i += 1
print(c) |
p02916 | s203848111 | Wrong Answer | n = int(input())
a = [int(i)-1 for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
#ここまで入力
manzoku = 0
for i in range(n):
if a[i] ==n-1:
manzoku += b[a[i]]
elif i == n-1:
manzoku += b[a[i]]
else:
manzoku += (b[a[i]]+c[a[i]])
print(manzoku) |
p03324 | s251261641 | Wrong Answer | d,x=map(int,input().split())
print(x*100**d+(x==100)) |
p02660 | s171560972 | Accepted | def pfact(m):
pf = {}
for i in range(2,int(m**0.5)+1):
while m%i == 0:
pf[i] = pf.get(i,0) + 1
m //= i
if m>1 : pf[m]=1
return pf
n = int(input())
pl = pfact(n).values()
ans = 0
for i in pl:
k = i
for j in range(1,41):
k -= j
if k < 0:
break
ans += 1
print(ans) |
p03633 | s364808520 | Accepted | import fractions
N = int(input())
T = [None] * N
for i in range(N):
T[i] = int(input())
ans = 1
for i in range(N):
ans = (ans * T[i]) // fractions.gcd(ans,T[i])
print(ans) |
p02546 | s373932851 | Wrong Answer | import sys
input = sys.stdin.readline
s = input()
if s[-1] == "s":
s += "es"
else:
s += "s"
print(s)
|
p02600 | s145155944 | Accepted | import sys
input = sys.stdin.readline
X = int(input().rstrip('\n'))
if X>=1800:
print(1)
elif X>=1600:
print(2)
elif X>= 1400:
print(3)
elif X>=1200:
print(4)
elif X>=1000:
print(5)
elif X>=800:
print(6)
elif X>=600:
print(7)
else:
print(8)
|
p03371 | s598798830 | Accepted | a,b,c,x,y=map(int,input().split())
loop=max(x*2,y*2)+1
ans=10**9
for i in range(loop):
ab=i//2
if x-ab>=0 and y-ab>=0:
ans=min(ans,a*(x-ab)+b*(y-ab)+c*i)
if x>=ab and y<ab:
ans=min(ans,a*(x-ab)+c*i)
if x<ab and y>=ab:
ans=min(ans,b*(y-ab)+c*i)
if x<ab and y<ab:
ans=min(ans,c*i)
print(ans) |
p03469 | s781226185 | Wrong Answer | s = input()
print("2018" + s[:4]) |
p02759 | s886487890 | Accepted | N = int(input())
print((N+1)//2) |
p03359 | s269296220 | Accepted | a,b=map(int, input().split())
if a<=b:
print(a)
else:
print(a-1)
|
p02814 | s324400110 | Wrong Answer | def gcd(x,y):
if(y == 0):
return x
else:
return gcd(y, x%y)
n,m = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] = a[i] // 2
val = a[0]
for i in range(1,n):
val = (val*a[i]) // gcd(val, a[i])
result = m//val - m//(val*2)
print(result) |
p02989 | s147169022 | Wrong Answer |
N = int(input())
data = list(map(int, sorted(input().split())))
median = int(N / 2)
#print(data)
print(data[median] - data[median - 1]) |
p02988 | s983572565 | Accepted | n=int(input())
p=list(map(int, input().split()))
count=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]:
count+=1
print(count) |
p03455 | s150638442 | Accepted | a,b = input().split()
c = int(a)*int(b)%2
if c==1:
print("Odd")
else:
print("Even") |
p02818 | s578827576 | Wrong Answer | a,b,k=map(int,input().split())
if k<=a:
print(a-k,b)
elif a<=k<b:
print(0,b-(k-a))
else:
print(0,0)
|
p03073 | s987976179 | Wrong Answer | s=list(input())
c1 = 0
c2 = 0
for i in range(len(s)):
if i%2 == "0":
if s[i] == "0":
c1 += 1
else:
if s[i] != "0":
c1 += 1
if i%2 != "0":
if s[i] == "0":
c2 += 1
else:
if s[i] != "0":
c2 += 1
print(min(c1,c2)) |
p03592 | s930699028 | Accepted | n, m, k = [int(w) for w in input().split()]
cond = False
for i in range(n + 1):
for j in range(m + 1):
b = i * (m - j) + j * (n - i)
if b == k:
cond = True
break
if cond:
break
print("Yes" if cond else "No")
|
p03338 | s609084301 | Accepted | n = int(input())
S = input()
idx = n//2
x = S[:idx]
y = S[idx:]
if x == y:
print(1)
exit()
cs = 0
for i in range(idx):
x = S[:idx-i]
y = S[idx-i:]
cs = max(cs, len(set(x) & set(y)))
x = S[:idx+i]
y = S[idx+i:]
cs = max(cs, len(set(x) & set(y)))
print(cs) |
p03479 | s551127110 | Wrong Answer | x, y = map(int, input().split())
al = []
a = x
al.append(a)
for i in range(int(x)):
a *= 2
if a >= y:
break
al.append(a)
print(len(al)) |
p02759 | s174952722 | Wrong Answer | # -*- coding: utf-8 -*-
N = int(input())
g = N // 2
k = ( N + 1 ) // 1
if N % 2 == 0:
print(g)
else:
print(k) |
p02789 | s539371660 | Wrong Answer | a,b = map(int,input().split())
if a==b:
print('yes')
else: print('no') |
p03285 | s104891281 | Accepted | x=int(input())
t=0
while x>=0:
if x%7==0:
t=1
x-=4
if t==0:
print('No')
else: print('Yes') |
p03075 | s280658462 | Accepted | l = [int(input()) for i in range(5)]
k = int(input())
if l[4] - l[0] > k:
print(":(")
else:
print("Yay!") |
p03854 | s917686134 | Wrong Answer | S = input().strip()
#-----
i=0
while i <= len(S)-5:
if S[i:(i+7)] == "dreamer":
i=i+7
elif S[i:(i+6)] == "eraser":
i=i+6
elif S[i:(i+5)] == "dream" or S[i:(i+5)] == "erase":
i=i+5
else:
print("NO")
break |
p03126 | s831097115 | Accepted | N, M = map(int, input().split())
KA = list(map(int, input().split()))
like = set(KA[1:])
for i in range(1, N):
KA = list(map(int, input().split()))
A = KA[1:]
like = like & set(A)
print(len(like))
|
p03386 | s783871049 | Wrong Answer | # -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#N = int(input())
A, B, K = map(int, input().split())
if B-A <= K*2 :
for i in range(A, B+1) :
print (str(i))
else :
for i in range(A, A+K) :
print (str(i))
for i in range(B-K+1, B+1) :
print (str(i))
|
p02970 | s201598279 | Accepted | import math
a,b=map(int,input().split())
print(math.ceil(a/(b*2+1))) |
p03632 | s370261517 | Accepted | A, B, C, D = map(int, input().split())
print(max(0, min(B, D) - max(A, C))) |
p02947 | s924636624 | Wrong Answer | n = int(input())
s = [input() for _ in range(n)]
for i in range(n):
s[i] = ''.join(sorted(s[i]))
t = {}
for i in range(n):
if s[i] in t:
t[s[i]] += 1
else:
t[s[i]] = 1
print(t)
print(sum(t[k] * (t[k] -1) // 2 for k in t))
|
p02760 | s302971865 | Wrong Answer | import sys
A = [[0] for _ in range(3)]
for i in range(3):
A[i] = list(map(int, input().split()))
N = int(input())
B = []
for i in range(N):
B.append(int(input()))
for i in range(3):
if A[i] <= B or (A[0][i] in B and A[1][i] in B and A[2][i] in B):
print('Yes')
sys.exit()
if (A[0][0] in B and A[1][1] in B
and A[2][2] in B) or (A[0][2] in B and A[1][1] in B and A[2][0] in B):
print('Yes')
sys.exit()
print('No') |
p03705 | s934604023 | Wrong Answer | N,A,B = map(int,input().split())
if B < A:
print(0)
exit()
num = B-A+1
mi = A*(N-1) + B
ma = B*(N-1) + A
ans = ma - mi + 1
print(ans) |
p02719 | s412348606 | Wrong Answer | N,K = map(int,input().split())
import fractions
if N==0:
print(K)
elif K == 1:
print(0)
elif N*2 == K or N == K*2:
print(0)
else:
print(fractions.gcd(N,K)) |
p02553 | s131988315 | Accepted | def resolve():
a, b, c, d = map(int, input().split())
print(max(a * c, b * d, a * d, b * c))
resolve() |
p03317 | s266036131 | Accepted | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(math.ceil( (n-k)/(k-1) )+1) |
p03433 | s483741995 | Wrong Answer | N=int(input())
A=int(input())
for x in range(A-1):
if N%500<=A:
print("Yes")
break
else:
print("No") |
p02723 | s540447849 | Wrong Answer | a=input()
if(a[3]==a[2] and a[4]==a[5]):
print("YES")
else:
print("NO") |
p04045 | s542008746 | Accepted | from sys import stdin
input = stdin.readline
N, K = map(int, input().split())
D = set(map(int, input().split()))
while True:
tmp = set(str(N))
b = True
for x in tmp:
if int(x) in D:
b = False
break
if b == True:
break
else:
N += 1
print(N) |
p02645 | s947168549 | Wrong Answer | import random
s = str(input())
t = random.randint(0, len(s)-2)
print(s[t:t+3]) |
p02802 | s341885437 | Accepted | N, M = map(int, input().split())
accepted = [0] * N
penalties = [0] * N
for _ in range(M):
p, ac = input().split()
p, ac = int(p) - 1, ac == "AC"
accepted[p] |= ac
penalties[p] += not accepted[p]
print(sum(accepted), sum(p for ac, p in zip(accepted, penalties) if ac))
|
p03760 | s423169040 | Wrong Answer | O = input()
E = input()
for i in range(len(E)):
print(O[i],end="")
print(E[i],end="")
if O>E:
print(O[-1]) |
p02628 | s057081957 | Accepted | n,k = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
ans = 0
for i in range(k):
ans += p[i]
print(ans) |
p02705 | s502999465 | Accepted | import math
R = int(input())
print(R*2*math.pi)
|
p02681 | s489776370 | Wrong Answer | #!/usr/bin/env python
"""AtCoder Beginner Contest 167: A -
https://atcoder.jp/contests/abc167/tasks/abc167_a
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def main():
S = input()
T = input()
if S == T[0:-1]:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
p03351 | s764578116 | Accepted | a, b, c, d= map(int, input().split())
if (abs(b - a) <= d and abs(c - b) <= d) or abs(c - a) <= d:
print('Yes')
else:
print('No') |
p02957 | s926547193 | Accepted | A, B = map(int,input().split())
if (A+B)%2 == 0:
print( (A+B)//2 )
else:
print("IMPOSSIBLE") |
p02759 | s533716493 | Wrong Answer | N = int(input())
ansewr = 0
if N % 2 != 0 :
answer = N//2 + 1
else:
answer = N / 2
print(answer)
|
p02882 | s335518300 | Accepted | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7
a, b, x = rm()
x /= a
if a*b / 2 >= x:
a = 2*x / b
print(90 - math.degrees(math.atan(a/b)))
else:
x = a*b - x
b = 2*x / a
print(math.degrees(math.atan(b/a)))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.