problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02729
|
s486342255
|
Accepted
|
n, m = map(int,input().split())
print(n*(n-1)//2+m*(m-1)//2)
|
p03910
|
s515118966
|
Accepted
|
n = int(input())
x = int(n**0.5)
while x*(x+1)//2 < n:
x += 1
skip = x*(x+1)//2 - n
for i in range(1,x+1):
if skip != i: print(i)
|
p02606
|
s474716386
|
Wrong Answer
|
l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
if i % d:
ans += 1
print(ans)
|
p02627
|
s399871857
|
Wrong Answer
|
a = input()
print(a.swapcase())
|
p02771
|
s167724343
|
Accepted
|
X = list(map(int,input().split()))
for i in [0,1]:
if X.count(X[i]) == 2:
print('Yes')
exit()
print('No')
|
p03815
|
s423684999
|
Accepted
|
x = int(input())
num = x//11
if x % 11 > 6:
print(num * 2 + 2)
elif x % 11 > 0:
print(num * 2 + 1)
else:
print(num * 2)
|
p02996
|
s009310858
|
Wrong Answer
|
N = int(input())
dic = {}
B = []
for i in range(N):
a, b = map(int,input().split())
B.append(b)
if '{}'.format(b) in dic:
dic['{}'.format(b)] += a
else:
dic['{}'.format(b)] = a
Bs = sorted(B)
time = 0
for i, num in enumerate(Bs):
time += dic['{}'.format(num)]
if num < time:
print('NO')
break
if i == len(Bs)-1:
print('Yes')
|
p03377
|
s908700913
|
Accepted
|
a,b,x=map(int, input().split())
print("YES" if a<=x<=a+b else "NO")
|
p03211
|
s536659899
|
Accepted
|
S = input()
v = 10**10
for i in range(len(S) - 2):
s = int(S[i:i + 3])
s = abs(753 - s)
v = min(v, s)
print(v)
|
p02780
|
s334576867
|
Wrong Answer
|
n,k=map(int,input().split())
p=list(map(int, input().split()))
for i in range(n):
p[i]=(1+p[i])/2
cs=[]
sum=0
for i in range(n):
sum+=p[i]
cs.append(sum)
ans=0
for i in range(n-k+1):
ans=max(ans,cs[i+k-1]-cs[i-1])
print('{:.8f}'.format(ans))
|
p02946
|
s735089230
|
Accepted
|
a,b=map(int, input().split())
for i in range(b-a+1,b+a):
print(i)
|
p03146
|
s461428695
|
Wrong Answer
|
s = int(input())
a = [s]
while True:
if s % 2 == 0:
s = s // 2
else:
s = 3 * s + 1
if s in a:
print(s)
break
a.append(s)
|
p02847
|
s509462682
|
Wrong Answer
|
day = input()
if day == "SUN":
print(7)
elif day == "MUN":
print(6)
elif day == "TUE":
print(5)
elif day == "WED":
print(4)
elif day == "THU":
print(3)
elif day == "FRI":
print(2)
elif day == "SAT":
print(1)
|
p02747
|
s470630604
|
Wrong Answer
|
S = input()
result = ["Yes" if (len(S) > 1) and (S[-2] == "h") and (S[-1] == "i") else "No"]
p = list(map(print, result))
|
p03836
|
s899277162
|
Accepted
|
x,y,u,v=map(int,input().split())
p=u-x
q=v-y
S="U"*q+"R"*p+"D"*q
S+="L"*(p+1)+"U"*(q+1)+"R"*(p+1)+"D"+"R"+"D"*(q+1)+"L"*(p+1)+"U"
print(S)
|
p03778
|
s066354631
|
Accepted
|
w, a, b = map(int, input().split())
if a < b:
if b <= a + w:
print(0)
else:
print(b - (a + w))
elif a > b:
if a <= b + w:
print(0)
else:
print(a - (b + w))
else:
print(0)
|
p02957
|
s389785312
|
Wrong Answer
|
a,b=map(int,input().split())
print((a+b)/2)
|
p02994
|
s925570506
|
Accepted
|
N,L=map(int,input().split())
RES = 0
res = 100
mid = 0
List = []
for i in range(N):
mid = L+i
List.append(mid)
if abs(mid)<abs(res):
res = mid
for i in range(N):
if res == List[i]:
pass
else:
RES += List[i]
print(RES)
|
p03076
|
s679378989
|
Accepted
|
def main():
K = [int(input()) for _ in range(5)]
ans = []
A = [0]
for k in K:
a = k % 10
if a == 0:
ans.append(k)
else:
ans.append(k + (10 - a))
A.append(10 - a)
print(sum(ans) - max(A))
if __name__ == "__main__":
main()
|
p03862
|
s098860459
|
Accepted
|
n, x = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(1, n):
s = a[i] + a[i-1]
if s > x:
ans += s - x
if a[i] >= s - x:
a[i] -= s - x
else:
a[i] = 0
print(ans)
|
p02916
|
s213415975
|
Wrong Answer
|
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=sum(b)
for i in range(n-1):
k=a[i]
if a[i+1]==k+1:
ans+=c[i]
else:
ans+=0
print(ans)
|
p03495
|
s092210123
|
Accepted
|
from collections import Counter
n, k = map(int, input().split())
L = list(map(int, input().split()))
cnt = Counter(L)
if len(cnt.keys()) <= k:
print(0)
else:
rewrite_groups = len(cnt.keys()) - k
print(sum(sorted(cnt.values())[:rewrite_groups]))
|
p02879
|
s383346727
|
Accepted
|
a, b = map(int, input().split())
if a < 10 and b < 10:
print(a * b)
else:
print('-1')
|
p03386
|
s463253433
|
Wrong Answer
|
A,B,K = map(int, input().split())
for i in range(A,A+K):
print(i)
for i in range(B-K+1,B+1):
print(i)
|
p03387
|
s268345540
|
Accepted
|
import sys
a=list(map(int,input().split()))
a.sort()
l0=a[0]-a[2]
l1=a[1]-a[2]
l2=0
c=0
while(c<1000):
if l2==l1 and l2==l0:
print(c)
break
elif l1==l0:
l1+=1
l0+=1
elif (l1-l0)%2==0:
l0+=2
else:
l0+=1
l2+=1
c+=1
|
p03795
|
s410913854
|
Wrong Answer
|
n= int(input())
print(n*800-n%15*200)
|
p04029
|
s746613191
|
Accepted
|
n = input()
m = 0
for i in range(int(n)):
m+=i+1
print(int(m))
|
p03672
|
s527029008
|
Accepted
|
s=input()
for i in range(2,len(s)+1,2):
if s[:(len(s)-i)//2]==s[(len(s)-i)//2:len(s)-i]:
print(len(s)-i)
exit()
if s[0]==s[1]:
print(2)
|
p03481
|
s181471198
|
Accepted
|
X, Y = map(int, input().split())
a = X
cnt = 0
while a <= Y:
a *= 2
cnt += 1
print(cnt)
|
p02699
|
s710462351
|
Accepted
|
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
S, W = map(int, input().split())
answer = ""
if S <= W:
answer = "unsafe"
else:
answer = "safe"
print(answer)
if __name__ == "__main__":
main()
|
p03485
|
s860357046
|
Accepted
|
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))
|
p02820
|
s513988530
|
Wrong Answer
|
n,k = map(int,input().split())
r,s,p = map(int,input().split())
st = input()
for i in range(len(st)-k):
if st[i] == st[i + k]:
st = st[:i + k]+ 'no' + st[i + k + 1:]
win = r*st.count('s') + s*st.count('p') + p*st.count('r')
print(win)
|
p03073
|
s447605950
|
Accepted
|
import sys
rr = lambda: sys.stdin.readline().rstrip()
s = list(rr())
cnt = 0
for i in range(len(s)-1):
si = s[i]
si1 = s[i+1]
if si == si1:
if si == '0':
s[i+1] = '1'
else:
s[i+1] = '0'
cnt += 1
print(cnt)
|
p03035
|
s121045776
|
Accepted
|
a, b = map(int,input().split())
if a > 12:
print(b)
elif a > 5:
print(int(b/2))
else:
print(0)
|
p02771
|
s048661630
|
Accepted
|
print "Yes" if len(set(raw_input().split()))==2 else "No"
|
p02811
|
s059741580
|
Accepted
|
K,X=map(int,input().split())
if 500*K >= X:
print("Yes")
else:
print("No")
|
p03435
|
s547584690
|
Accepted
|
c = [0]*3
for i in range(3):
c[i] = list(map(int,input().split()))
a = [0]*3
b = [0]*3
a[0] = 0
for j in range(3):
b[j] = c[0][j] - a[0]
a[1] = c[1][0] - b[0]
a[2] = c[2][0] - b[0]
count = 0
for i in range(3):
for j in range(3):
if c[i][j] == a[i] + b[j]:
count += 1
if count == 9:
print('Yes')
else:
print('No')
|
p03478
|
s108053010
|
Wrong Answer
|
N, A, B = map(int,input().split())
ans = 0
for n in range(N):
sums = sum(list(map(int,list(str(n)))))
if A <= sums and sums <= B:
ans += sums
print(ans)
|
p03814
|
s003648638
|
Accepted
|
s = input()
n = len(s)
first, last = 0,0
for i in range(n):
b,f = i+1, n-i
if s[-1-i] == 'A':
first = f
if s[i] == 'Z':
last = b
# print(first, last)
print(last - first+1)
|
p02647
|
s267161017
|
Wrong Answer
|
import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
light = A.copy()
def shine(n,j):
inf = math.ceil(max(j - n - 0.5,1)) - 1
sup = math.floor(min(j + n + 0.5,N))
for k in range(inf,sup):
tmp[k] += 1
lim = min(50,K)
while lim > 0:
tmp = [0] * N
for i in range(0,N):
shine(light[i],i + 1)
light = tmp
lim -= 1
print(light)
|
p02621
|
s413152885
|
Wrong Answer
|
a = int(input())
print(a*(a**2)*(a**3))
|
p03719
|
s506430592
|
Accepted
|
a, b, c = map(int, input().split())
if c >= a and c <= b:
print('Yes')
else:
print('No')
|
p02880
|
s272733076
|
Accepted
|
import sys
n = int(input())
for i in range(1,10):
mod,ret = divmod(n,i)
if ret == 0 and mod <= 9:
print('Yes')
sys.exit()
print('No')
|
p02958
|
s165379176
|
Accepted
|
n = int(input())
p = list(map(int, input().split()))
c = list(range(1,n+1))
print('NO' if sum([i!=j for i,j in zip(p,c)]) > 2 else 'YES')
|
p02791
|
s794785554
|
Accepted
|
n=int(input())
p=[]*n
p=list(map(int,input().split()))
cnt=0
com=p[0]
for i in range(n):
if com>=p[i]:
cnt+=1
com=min(com,p[i])
print(cnt)
|
p02691
|
s574624754
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
l = {}
r = {}
for i in range(n):
p = i+a[i]
q = i-a[i]
if p < n:
if p in l:
l[p] = l[p]+1
else:
l[p] = 1
if q > 0:
if q in r:
r[q] = r[q]+1
else:
r[q] = 1
ans = 0
for i in l:
if i in r:
ans+= l[i]*r[i]
print(ans)
|
p02694
|
s801509069
|
Wrong Answer
|
import math
X =int(input())
deposit = 100
year = 0
while deposit<X:
deposit = math.floor(deposit +deposit*0.01)
#print(deposit)
year+=1
print (year)
|
p02982
|
s264557331
|
Wrong Answer
|
N, D = map(int, input().split())
zahyo = [0]*N
for i in range(N):
zahyo[i] = list(map(int, input().split()))
count = 0
for i in range(N):
for j in range(i+1, N):
V = 0
for k in range(D):
V += (zahyo[i][k]-zahyo[j][k])**2
if isinstance(V, int):
count += 1
print(count)
|
p03380
|
s326929680
|
Accepted
|
#02:04
n = int(input())
a = list(map(int,input().split()))
b = max(a)
c = []
h = b/2
for i in range(n):
c.append([abs(a[i]-h),a[i]])
d = min(c)[1]
print(b,d)
|
p02996
|
s986261995
|
Accepted
|
n = int(input())
data = [list(map(int, input().strip().split())) for _ in range(n)]
data = sorted(data, key=lambda d: d[1])
work_time = 0
impossible = False
for a, b in data:
deadline = b
work_time += a
if work_time > b:
impossible = True
break
if impossible:
print('No')
else:
print('Yes')
|
p02729
|
s757670282
|
Accepted
|
n,m = map(int,input().split())
ans = 0
if(n >= 2):
ans += n*(n-1)//2
if(m >= 2):
ans += m*(m-1)//2
print(ans)
|
p03011
|
s554034773
|
Wrong Answer
|
ab , bc , ca = map(int , input(). split())
print(min(ab , ca) + bc)
|
p02823
|
s460233121
|
Accepted
|
N,A,B=map(int,input().split())
if (A-B)%2==0:
ans=int((B-A)//2)
else:
ans=int(min(A-1,N-B)+1+(B-A-1)//2)
print(ans)
|
p02642
|
s877772561
|
Wrong Answer
|
import numpy as np
import collections
n = int(input())
aa = np.array(list(map(int,input().split())))
c = collections.Counter(aa)
a=np.unique(aa)
amax=max(a)+1
ah=[0]*amax
for i in a:
if c[i]>=2 and ah[i]==0:
ah[i]=2
continue
for j in range(i,amax,i):
ah[j]+=1
an=0
for i in a:
if ah[i]==1:
an+=1
print(an)
|
p02678
|
s847829581
|
Accepted
|
from collections import deque
N,M,*AB=map(int,open(0).read().split())
to=[[] for _ in range(N)]
for a,b in zip(*[iter(AB)]*2):
to[a-1].append(b-1)
to[b-1].append(a-1)
q=deque([0])
r=[None]*N
while q:
x=q.popleft()
for i in to[x]:
if r[i] is None:
q.append(i)
r[i]=x+1
print("Yes",*r[1:],sep="\n")
|
p03434
|
s693001851
|
Accepted
|
# -*- coding: utf-8 -*-
N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
Alice = 0
Bob = 0
for x in range(0, len(a), 2):
Alice += a[x]
for x in range(1, len(a), 2):
Bob += a[x]
print(Alice - Bob)
|
p02847
|
s184850520
|
Wrong Answer
|
w = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
S = input().strip()
for i, d in enumerate(w):
if d == S:
print(-i % 7)
|
p02787
|
s184662393
|
Accepted
|
import sys
H, N = map(int, input().split())
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
dp = [float('inf') for _ in range(H + max(AB)[0] + 1)]
dp[0] = 0
for h in range(H + max(AB)[0] + 1):
for n in range(N):
if h - AB[n][0] >= 0:
dp[h] = min(dp[h - AB[n][0]] + AB[n][1], dp[h])
print(min(dp[H:]))
|
p03767
|
s746771135
|
Accepted
|
N = int(input(' '))
A = input().split(' ')
A = [int(A[i]) for i in range(3*N)]
A = sorted(A, reverse=True)
STG = 0
for i in range(2*N):
if not i%2==0:
STG += A[i]
print(STG)
|
p02790
|
s587286020
|
Accepted
|
a,b=map(int,input().split())
c = a*str(b)
d = b*str(a)
if c < d :
print(str(c))
else :
print(str(d))
|
p02602
|
s467727567
|
Accepted
|
from collections import deque
n, k = map(int, input().split())
a = list(map(int, input().split()))
queue = deque()
for i in range(n):
if i <= k - 1:
queue.append(a[i])
elif i >= k:
x = queue.popleft()
if x < a[i]:
print("Yes")
else:
print("No")
queue.append(a[i])
|
p03433
|
s130775555
|
Accepted
|
if int(input())%500<=int(input()):
print("Yes")
else:
print("No")
|
p02780
|
s059551621
|
Accepted
|
def main():
N,K = map(int, input().split())
p = list(map(int, input().split()))
temp = 0
for k in range(K):
temp += calc_e(p[k])
res = temp
for n in range(N-K):
temp -= calc_e(p[n])
temp += calc_e(p[n+K])
if(temp > res): res = temp
print(res)
def calc_e(pi):
return(sum(range(1,pi+1))/pi)
if __name__ == "__main__":
main()
|
p03261
|
s608324793
|
Wrong Answer
|
N = int(input())
W=[]
ss=True
for i in range (N):
W.append(input())
for t in range (N-1):
if W[t-1][-1]==W[t][0]:
ss=True
else:
ss=False
if len(W)!=len(set(W)):
ss=False
if ss==False:
print("No")
else:
print("Yes")
|
p03252
|
s723233033
|
Accepted
|
import collections
s = input()
t = input()
s_cnt = collections.Counter(s)
t_cnt = collections.Counter(t)
a = s_cnt.most_common()
b = t_cnt.most_common()
ans = True
for i in range(len(a)):
if a[i][1] != b[i][1]:
ans = False
break
print('Yes' if ans else 'No')
|
p03437
|
s249781442
|
Accepted
|
x, y = map(int, input().split())
if x % y == 0:
print(-1)
else:
cnt = 1
while True:
if (x * cnt) % y != 0:
print(x * cnt)
exit()
cnt += 1
|
p02601
|
s521138335
|
Accepted
|
A, B, C=map(int,input().split())
K=int(input())
ab=int(A/B)
if ab==0:
x=0
else:
x=int(len(bin(ab))-2)
B1=B*(2**x)
bc=int(B1/C)
if bc==0:
y=0
else:
y=int(len(bin(bc))-2)
if x+y<=K:
print("Yes")
else:
print("No")
|
p03815
|
s535731603
|
Accepted
|
x = int(input())
q, r = divmod(x, 11)
if r == 0:
print(q*2)
elif r <= 6:
print(q*2 + 1)
else:
print(q*2 + 2)
|
p02987
|
s506444192
|
Wrong Answer
|
import sys
a1=sys.stdin.readline()
a2=list(a1)
b=[x for x in a2]
b.sort()
if len(a2)==4 and b[0]==b[1] and b[2]==b[3] and b[1]!=b[2]:
print("Yes")
else:
print("No")
|
p03075
|
s997961415
|
Wrong Answer
|
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
A = [a,b,c,d,e]
wa = 0
for i in range(4):
if A[-1-i]-A[-2-i]>k:
wa += 1
print(":("*(wa>=0) or "Yay!")
|
p03416
|
s745844885
|
Accepted
|
a, b = map(int, input().split())
count = 0
for i in range(a, b + 1):
x = str(i)
y = x[::-1]
if x == y:
count += 1
print(count)
|
p03035
|
s992774480
|
Accepted
|
a,b = map(int,input().split())
if a <= 5:
print(0)
elif 6 <= a <= 12:
print(int(b/2))
else:
print(b)
|
p04033
|
s372494024
|
Accepted
|
#
import sys
from copy import deepcopy
input=sys.stdin.readline
def main():
a,b=map(int,input().split())
if a*b<=0:
print("Zero")
elif a>0:
print("Positive")
else:
pm=(b-a+1)
if pm%2==0:
print("Positive")
else:
print("Negative")
if __name__=="__main__":
main()
|
p03086
|
s715996870
|
Accepted
|
S = input()
ans = 0
cnt = 0
for i in S:
if i in ("A","C","G","T"):
cnt += 1
else:
ans = max(ans,cnt)
cnt = 0
ans = max(ans,cnt)
print(ans)
|
p02608
|
s701046214
|
Wrong Answer
|
N = int(input())
ans = [0] * 10000
for x in range(1, 1000):
for y in range(1, 1000):
for z in range(1, 1000):
f = x**2 + y**2 + z**2 + x*y + y*z + z*x
if f < 10000:
ans[f-1] = ans[f-1] + 1
if f > N:
break
for i in range(N):
print(ans[i])
|
p02732
|
s245188918
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
d = [0]*n
for i in a:
d[i-1] += 1
s = 0
for i in range(n):
s += int(d[i]*(d[i]-1)/2)
for i in range(n):
print(s-(d[a[i]-1]-1))
|
p03485
|
s485738198
|
Wrong Answer
|
print(round(sum(list(map(int,input().split())))/2))
|
p03433
|
s227454187
|
Accepted
|
n = int(input())
a = int(input())
while 500 <= n:
n = n- 500
if n <= a:
print("Yes")
else:
print("No")
|
p02881
|
s587602647
|
Accepted
|
import numpy as np
n = int(input())
s = np.sqrt(n)
for i in range(int(s)):
if n % (int(s)-i) == 0:
print(int(s)-i-1 + n//(int(s)-i)-1)
break
|
p03827
|
s883026860
|
Accepted
|
N=int(input())
S=input()
SS=S.replace("I","1,").replace("D","-1,").split(",")
cnt=0
ans=0
for i in range(N):
cnt+=int(SS[i])
ans=max(ans,cnt)
print(ans)
|
p02791
|
s980278642
|
Accepted
|
n = int(input())
p = list(map(int, input().split()))
ans = 1
mn = p[0]
for i in range(1, n):
if p[i] <= mn:
ans += 1
mn = min(mn, p[i])
print(ans)
|
p03804
|
s785286909
|
Accepted
|
N,M=map(int,input().split())
A=[input() for _ in range(N)]
B=[input() for _ in range(M)]
for i in range(N-M+1):
for j in range(len(A[i])-len(B[0])+1):
if B[0][0]==A[i][j]:
flag=True
p=i
for k in range(M):
if not B[k]==A[p][j:j+len(B[k])]:
flag=False
break
p+=1
if flag:
print('Yes')
exit()
print('No')
|
p03035
|
s721224238
|
Accepted
|
n, k = map(int, input().split())
if n<6:
print("0")
elif n < 13:
print(k//2)
else:
print(k)
|
p03433
|
s279981105
|
Accepted
|
N = int(input())
A = int(input())
N2= N % 500;
if N2 <= A:
print('Yes')
else:
print('No')
|
p03417
|
s374848967
|
Wrong Answer
|
N, M = map(int, input().split())
if N < 3 or M < 3:
print(0)
else:
print((M-2) * (N-2))
|
p03250
|
s469489511
|
Accepted
|
nums = list(map(int, input().split()))
nums.sort()
print(nums[2] * 10 + nums[1] + nums[0])
|
p02946
|
s692625261
|
Accepted
|
k,x = map(int, input().split())
L = []
for i in range(x-(k-1),x+k):
L.append(i)
print(*L)
|
p03163
|
s053698307
|
Accepted
|
N,W = list(map(int,input().split()))
w = [0]*N
v = [0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
dp = [[0]*(W+1) for i in range(N)]
dp[0][w[0]] = v[0]
for i in range(1,N):
for s in range(W+1):
if s-w[i] >= 0:
dp[i][s] = max(dp[i-1][s], dp[i-1][s-w[i]]+v[i])
else:
dp[i][s] = dp[i-1][s]
print(max(dp[N-1]))
|
p03474
|
s576875419
|
Accepted
|
a,b=map(int,input().split())
s=input()
print("Yes"if s.count("-")==1 and s[a]=="-" else "No")
|
p02818
|
s135121195
|
Wrong Answer
|
a, b, k = map(int, input().split())
if k <= a:
print(a-k,b)
else:
b=b-(k-a)
print(0,b)
|
p03693
|
s680553317
|
Accepted
|
print(['NO','YES'][int(''.join(list(input().split())))%4==0])
|
p02747
|
s099599504
|
Accepted
|
s = input()
ans = "No"
kouho=["hi","hihi","hihihi","hihihihihi","hihihihi"]
if s in kouho:
ans="Yes"
print(ans)
|
p02658
|
s259576252
|
Accepted
|
N = int(input())
org = input().split()
for i in range(len(org)):
org[i] = int(org[i])
A = sorted(org)
answer = A[0]
overl = False
for i in range(N-1):
answer *= A[i+1]
if answer > 10**18:
overl = True
break
if overl:
print("-1")
else:
print(answer)
|
p03986
|
s121084474
|
Accepted
|
from collections import deque
X = input()
stack = deque([X[0]])
for i in range(1, len(X)):
if X[i] == 'S':
stack.appendleft(X[i])
if X[i] == 'T':
if stack:
check = stack.popleft()
if check == 'T':
stack.appendleft(check)
stack.appendleft(X[i])
else:
stack.appendleft(X[i])
print(len(stack))
|
p03943
|
s973385030
|
Accepted
|
a, b, c = map(int, input().split())
if a + b == c or a + c ==b or b + c == a:
print("Yes")
else:
print("No")
|
p03220
|
s407164374
|
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():
n=INT()
t,a=INTM()
hs=LIST()
ct=0
ans=100000000000
for i,h in enumerate(hs):
temp=t-h*0.006
#print(temp)
if abs(a-ans)>=abs(a-temp):
ans=temp
ct=i
print(ct+1)
if __name__ == '__main__':
do()
|
p03745
|
s305101091
|
Accepted
|
#AGC 013 A - Sorted Arrays
#増加⇔減少に転じる際、Ai+1 - Aiは必ず符号反転することを利用
N = int(input())
A = list(map(int,input().split()))
count = 1
sign = 0
for i in range(N-1):
if sign == 0:
sign = A[i+1]-A[i]
elif sign*(A[i+1]-A[i]) < 0:
count += 1
sign = 0
print(count)
|
p03264
|
s528315966
|
Wrong Answer
|
K=int(input())
if K%2==0:
print(K//2*K//2)
else:
print((K//2+1)*K//2)
|
p03377
|
s567520129
|
Wrong Answer
|
a, b, x = list(map(int, input().split()))
if a <= x:
if x - a < b:
print('Yes')
exit()
print('No')
|
p02595
|
s810489288
|
Wrong Answer
|
import math
n,d = map(int,input().split())
c = 0
for i in range(n):
x,y = map(int,input().split())
D = math.sqrt((x*x)+(y*y))
if(int(D)<=d):
c+=1
print(c)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.