problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03611
|
s334986091
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
a.sort()
s = [0]*(a[-1]+1)
for i in range(n):
s[a[i]] += 1
ans = 0
for i in range(2,a[-1]):
ans = max(ans, s[i] + s[i-1] + s[i+1])
print(ans)
|
p03219
|
s619194283
|
Accepted
|
x, y = map(int, input().split())
ans = x + y // 2
print(ans)
|
p02554
|
s657534991
|
Accepted
|
def main():
N = int(input())
mod = 10 ** 9 + 7
return (pow(10, N, mod) - pow(9, N, mod) - pow(9, N, mod) + pow(8, N, mod)) % mod
print(main())
|
p02584
|
s467854156
|
Accepted
|
X,K,D=map(int,input().split())
if X<0:
X*=-1
if X-K*D>0:
print(X-K*D)
else:
p=X-(X//D)*D
K-=X//D
q=abs(p-D)
if K%2==0:
print(p)
else:
print(q)
|
p02777
|
s674086905
|
Wrong Answer
|
s,t=input().split()
a,b=map(int,input().split())
u=input()
if s==u:
print(a-1,b)
elif s==t:
print(a,b-1)
|
p03471
|
s407232113
|
Wrong Answer
|
otoshidama = list(map(int,input().split()))
flg = True
for i in range(otoshidama[0]):
yukichi =i
for n in range(otoshidama[0]-yukichi):
higuchi = n
noguchi = otoshidama[0] - yukichi - higuchi
if 10000*yukichi+5000*higuchi+1000*noguchi==otoshidama[1]:
print("{} {} {}".format(yukichi,higuchi,noguchi))
flg = False
if flg:
print("-1 -1 -1")
|
p02675
|
s667550764
|
Wrong Answer
|
a=list(input())
b =len(a)
if a[b-1]==2 or a[b-1]==4 or a[b-1]==5 or a[b-1]==7 or a[b-1]==9 : #abが２で割り切れたら、Evenと入力
print('hon')
elif a[b-1]==0 or a[b-1]==1 or a[b-1]==6 or a[b-1]==8 :
print('pon')
else : #それ以外なら,Oddと入力
print('bon')
|
p03323
|
s610351550
|
Wrong Answer
|
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
a,b = map(int,input().split())
if a>9 or b >9:
print(":(")
else:
print("Yay!")
|
p02552
|
s795414655
|
Accepted
|
if int(input()):
print(0)
else:
print(1)
|
p03696
|
s107310990
|
Accepted
|
n=int(input())
s=list(input())
ins=0
app=0
for i in range(n):
if s[i]=='(':
app += 1
else:
if app>0:
app -= 1
else:
ins += 1
inL=['(']*ins
app=[')']*app
ans=inL+s+app
print(''.join(ans))
|
p02546
|
s570743833
|
Wrong Answer
|
s = input()
if s[len(s) - 1] == 's':
print(s[:len(s) - 1] + 'es')
else:
print(s + 's')
|
p02660
|
s441477000
|
Accepted
|
n = int(input())
c = 0
for p in range(2, int(n**0.5)+1): #nが合成数
e = 0
while n%p == 0:
n //= p
e += 1
i = 1
while e >= i:
e -= i
c += 1
i += 1
if n != 1: #nが素数 or nがn^0.5より大きい素数を因数に持つ合成数
c += 1
print(c)
|
p02946
|
s828078100
|
Wrong Answer
|
k, x = map(int, input().split())
a = x-k+1
b = x+k-1
print(i for i in range(a, b+1))
|
p02725
|
s455940908
|
Wrong Answer
|
k, n = map(int, input().split())
ls = list(map(int, input().split()))
distance_list = []
i = 0
while i < n:
if i == 0:
distance_list.append(ls[i])
i += 1
continue
distance_list.append(ls[i] - ls[i-1])
i += 1
distance_list.append(k - ls[n-1])
distance_list.remove(max(distance_list))
if 0 not in distance_list:
distance_list.remove(max(distance_list))
print(sum(distance_list))
|
p03163
|
s204602657
|
Accepted
|
N, W = map(int, input().split())
w_list = []
v_list = []
for i in range(N):
w, v = map(int, input().split())
w_list.append(w)
v_list.append(v)
dp = [[0 for i in range(W+1)] for i in range(N)]
for i in range(N):
w = w_list[i]
v = v_list[i]
for j in range(W+1):
if j-w >= 0:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-w]+v)
else:
dp[i][j] = dp[i-1][j]
print(dp[N-1][W])
|
p03076
|
s632618041
|
Accepted
|
import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
food = []
for _ in range(5):
food.append(inint())
all = sum(food)
loss = []
for f in food:
loss_t = 200
for i in range(0,131, 10):
if 0 <= i-f < loss_t:
loss_t = abs(f-i)
loss.append(loss_t)
print(all+sum(loss)-max(loss))
|
p03286
|
s307200931
|
Accepted
|
N = int(input())
ans = ''
for _ in range(1000):
r = N % 2
if r < 0:
r += 2
N = (N-r)//(-2)
ans = str(r) + ans
print(int(ans))
|
p03799
|
s744662327
|
Accepted
|
N,M=map(int,input().split())
ans=0
if 2*N<=M:
ans=N+(M-2*N)//4
else:
b=M//2
ans=b
print(ans)
|
p02689
|
s347583300
|
Accepted
|
n, m = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
lst = [True]*n
for _ in range(m):
a, b = [int(i) for i in input().split()]
if h[a-1] > h[b-1]:
lst[b-1] = False
elif h[a-1] < h[b-1]:
lst[a-1] = False
elif h[a-1] == h[b-1]:
lst[a-1] = False
lst[b-1] = False
ans = 0
for i in lst:
if i:
ans += 1
print(ans)
|
p02663
|
s965956734
|
Accepted
|
H1,M1,H2,M2,K=map(int,input().split())
HM1=H1*60+M1
HM2=H2*60+M2
print(max(HM2-HM1-K,0))
|
p03796
|
s794677614
|
Accepted
|
N = int(input())
p = 1
for i in range(N):
p = (p*(i+1))%(10**9+7)
print(p)
|
p03632
|
s277679054
|
Accepted
|
A, B, C, D = map(int, input().split())
d = min(B,D) - max(A,C)
if d < 0:
print(0)
else:
print(d)
|
p03681
|
s718719605
|
Accepted
|
n, m = map(int, input().split())
ans = 1
if abs(n - m) > 1:
print(0)
exit()
for i in range(1, n + 1):
ans = ans*i%(10**9 + 7)
for i in range(1, m + 1):
ans = ans*i%(10**9 + 7)
if (n + m)%2 == 0:
ans = ans*2%(10**9 + 7)
print(ans)
|
p03773
|
s894717506
|
Accepted
|
A,B=map(int,input().split())
if ((A+B)<24):
print (A+B)
else:
print ((A+B)-24)
|
p02607
|
s312616567
|
Accepted
|
N = int(input())
a = list(map(int,input().split()))
cnt=0
for i in range(N):
if (i+1)%2==1 and a[i]%2==1:
cnt+=1
print(cnt)
|
p03324
|
s571295545
|
Accepted
|
d, n = map(int,input().split())
print( (n+1)*100**d if n%100==0 else n*100**d)
|
p03317
|
s417922913
|
Wrong Answer
|
N,K=map(int,input().split())
a=list(map(int,input().split()))
index=a.index(1)
l=index
r=index
cnt=0
while l!=0:
l=max(0,l-K+1)
cnt+=1
while r!=N-1:
r=min(N-1,r+K-1)
cnt+=1
print(cnt)
|
p02832
|
s796306845
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
if 1 not in a:
print(-1)
exit()
now = 1
ans = 0
for i in a:
if i != now:
ans += 1
else:
now += 1
print(ans)
|
p03821
|
s699208856
|
Accepted
|
n=int(input())
a=[]
b=[]
for i in range(n):
aa,bb=map(int,input().split())
a.append(aa)
b.append(bb)
ans=0
for ii in range(n):
i=n-ii-1
aa=a[i]
bb=b[i]
ama=(bb-(aa+ans)%bb)%bb
ans+=ama
print(ans)
|
p03220
|
s417407048
|
Accepted
|
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
diff = [0] * n
for i in range(n):
diff[i] = abs(a - (t - (h[i] * 0.006)))
print(diff.index(min(diff)) + 1)
|
p03971
|
s801471568
|
Accepted
|
n,a,b=map(int, input().split())
s=input()
for i in range(n):
if (a>0 or b>0) and s[i]=='a':
print('Yes')
if a>0 and b>=0:
a-=1
else:
b-=1
elif b>0 and s[i]=='b':
print('Yes')
b-=1
else:
print('No')
|
p03062
|
s653190262
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
MINUS = 0
B = []
for i in A:
if i < 0:
MINUS += 1
else:
B.append(i)
if min(A) > 0:
print(sum(A))
exit(0)
ans = 0
if MINUS % 2 == 0:
for a in A:
ans += abs(a)
else:
minB = max(A)
for a in A:
ai = abs(a)
if ai < minB:
minB = ai
ans += ai
ans -= minB
print(ans)
|
p03723
|
s736128546
|
Wrong Answer
|
A, B, C = map(int, input().split())
cnt = 0
flag_cnt=0
while(1):
A_tmp = A
B_tmp = B
C_tmp = C
A = (B_tmp+C_tmp)/2
B = (A_tmp+C_tmp)/2
C = (A_tmp+C_tmp)/2
cnt += 1
if A%2!=0 or B%2!=0 or C%2!=0:
break
if A_tmp==A and B_tmp==B and C_tmp==C:
flag_cnt+=1
if flag_cnt==2:
cnt = -1
break
print(cnt)
|
p03241
|
s838222322
|
Accepted
|
import sys,math,collections,itertools
input = sys.stdin.readline
N,M=list(map(int,input().split()))
mn = M//N
ml = M%N
if ml == 0:
print(mn)
exit()
ans = 0
for i in range(mn+1,0,-1):
if i < ans:
break
tmp = math.gcd(i,M-i*(N-1))
ans = max(ans,tmp)
print(ans)
|
p03605
|
s734014911
|
Wrong Answer
|
n = input()
nlist =list(n)
if 9 in nlist:
print("Yes")
else:
print("No")
|
p02572
|
s961218802
|
Accepted
|
N = int(input())
A = [int(s) for s in input().split()]
MOD = 10**9 + 7
sums = [A[0]]
for a in A[1:]:
sums.append((a + sums[-1]) % MOD )
alls = 0
for i in range(1, len(A)):
# print(A[i], sums[i-1])
alls += A[i] * sums[i-1]
alls %= MOD
print(alls)
|
p02957
|
s699388394
|
Accepted
|
import math
a,b=map(int,input().split())
if (a+b)%2==0:
print(math.floor(abs((a-b)/2)+min(a,b)))
else:
print("IMPOSSIBLE")
|
p02754
|
s190861194
|
Accepted
|
N, A, B = map(int, input().split())
if A > (N % (A + B)):
print((N // (A + B)) * A + N % (A + B))
else:
print((N // (A + B)) * A + A)
|
p02640
|
s619117174
|
Accepted
|
X, Y = map(int, input().split())
flag = False
for tsuru in range(X+1):
kame = X - tsuru
if kame*4 + tsuru*2 == Y:
flag = True
break
if flag:
print('Yes')
else:
print('No')
|
p03767
|
s933527384
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
a.sort()
print(sum(a[n:n+n]))
|
p04033
|
s593682982
|
Wrong Answer
|
a,b=(map(int,input().split()))
if 0<a<=b:
print('Positive')
elif a<=0<=b:
print('0')
elif a<=b<0:
x=b-a+1
if x%2==0:
print('Positive')
else:
print('Negative')
|
p02982
|
s635558337
|
Accepted
|
import math
def main():
n ,d = map(int,input().split())
arr = [ ]
for _ in range(n):
arr.append(list(map(int,input().split())))
ans = 0
for i in range(n):
for j in range(i+1,n):
cnt = 0
for k in range(d):
cnt += (arr[i][k]-arr[j][k])*(arr[i][k]-arr[j][k])
if math.sqrt(cnt)==int(math.sqrt(cnt)):
ans+=1
print(ans)
return
main()
|
p02630
|
s461254283
|
Accepted
|
import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def main():
N=ii()
A = list(mi())
counter = [0]*(10**5+5)
for a in A:
counter[a] += 1
ans = sum(A)
Q=ii()
for q in range(Q):
B,C=mi()
ans -= B * counter[B]
ans += C * counter[B]
counter[C] += counter[B]
counter[B] = 0
print(ans)
if __name__ == "__main__":
main()
|
p03471
|
s598068418
|
Accepted
|
def ans(N, Y):
for m in range(N + 1):
for g in range(N + 1 - m):
s = N - m - g
sum = m * 10000 + g * 5000 + s * 1000
if sum == Y:
return m, g, s
return -1, -1, -1
def read():
N, Y = [int(a) for a in input().split(' ')]
return N, Y
def write(a):
print(a[0], a[1], a[2])
if __name__ == '__main__':
N, Y = read()
write(ans(N, Y))
|
p03836
|
s382523408
|
Accepted
|
sx,sy,tx,ty=map(int,input().split())
ans=""
for i in range(ty-sy):ans+="U"
for i in range(tx-sx):ans+="R"
for i in range(ty-sy):ans+="D"
for i in range(tx-sx):ans+="L"
ans+="L"
for i in range(ty-sy+1):ans+="U"
for i in range(tx-sx+1):ans+="R"
ans+="D"
ans+="R"
for i in range(ty-sy+1):ans+="D"
for i in range(tx-sx+1):ans+="L"
ans+="U"
print(ans)
|
p03944
|
s701597558
|
Accepted
|
w, h, n = map(int, input().split())
W = [0, w]
H = [0, h]
for _ in range(n):
x, y, a = map(int, input().split())
if a == 1 and W[0] < x:
W[0] = x
elif a == 2 and W[1] > x:
W[1] = x
elif a == 3 and H[0] < y:
H[0] = y
elif a == 4 and H[1] > y:
H[1] = y
if W[1]-W[0] < 0 or (H[1]-H[0]) < 0:
print(0)
else:
print((W[1]-W[0]) * (H[1]-H[0]))
|
p03106
|
s055185210
|
Accepted
|
A,B,K = map(int,input().split())
ans_lst = []
for i in range(1,min(A,B)+1):
if A%i==0 and B%i==0:
ans_lst += [i]
ans_lst.reverse()
print(ans_lst[K-1])
|
p02640
|
s355649409
|
Wrong Answer
|
values = input().split()
print(values)
num_animals = int(values[0])
num_legs = int(values[1])
max_possible_legs = num_animals*4
min_possible_legs = num_animals*2
if num_legs%2 != 0:
print ("No")
elif (num_legs <= max_possible_legs) and (num_legs >= min_possible_legs):
print("Yes")
else:
print("No")
|
p02629
|
s509387544
|
Accepted
|
N = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
output = ""
while N>0:
N -= 1
output += alp[N%26]
N = N//26
print(output[::-1])
|
p02659
|
s356867934
|
Accepted
|
A, B = input().split()
A = int(A)
C = int(B[0])*100 + int(B[2])*10 + int(B[3])
print(A*C//100)
|
p04012
|
s878901183
|
Accepted
|
w=input()
for i in w:
if w.count(i)%2!=0:
print("No")
exit()
print("Yes")
|
p02783
|
s654569065
|
Accepted
|
h, a = map(int, input().split())
print(h // a if h % a == 0 else h // a + 1)
|
p02730
|
s611569790
|
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()
n = len(s)
ans = 'Yes'
if s != s[::-1]:
ans = 'No'
x = math.floor(n/2)
y = math.ceil(n/2)
a = s[0:x]
b = s[y:]
if a != a[::-1] or b != b[::-1]:
ans = 'No'
print(ans)
|
p02982
|
s836780269
|
Wrong Answer
|
n, d = map(int, input().split())
distances = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(i + 1, n):
diff_total = 0
for k in range(d):
diff = abs(distances[i][k] - distances[j][k])
diff_total = diff * diff
flag = False
for k in range(diff_total + 1):
if (k ** 2) == diff_total:
flag = True
if flag:
ans += 1
print(ans)
|
p02783
|
s584710988
|
Accepted
|
import math
def solve(h, a):
return math.ceil(h / a)
def main():
h, a = map(int, input().split())
ans = solve(h, a)
print(ans)
main()
|
p03592
|
s517405366
|
Wrong Answer
|
# B fLIP
n,m,k=map(int,input().split())
for h in range(n):
for w in range(m):
black=m*h+n*w-2*h*w
if black==k:
print('Yes')
exit()
print('No')
|
p02683
|
s440934195
|
Accepted
|
n, m, x = map(int, input().split())
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append(tmp[1:])
min_cost = -1
for i in range(2**n):
cost = 0
skills = [0] * m
for j in range(n):
if (i >> j) & 1:
cost += c[j]
skills = [skills[k] + a[j][k] for k in range(m)]
if min(skills) >= x and (cost < min_cost or min_cost == -1):
min_cost = cost
print(min_cost)
|
p02957
|
s112277173
|
Wrong Answer
|
N,M=map(int,input().split())
if (N+M)%2==0:
print((N+M)/2)
else:
print("IMPOSSIBLE")
|
p02829
|
s404307522
|
Wrong Answer
|
A=int(input())
B=int(input())
if 1 not in [A,B]:
print(1)
if 2 not in [A,B]:
print(2)
else:
print(3)
|
p02911
|
s362071870
|
Wrong Answer
|
n,k,q=[int(i) for i in input().split()]
a=[]
for i in range(q):
a.append(int(input()))
point=[k-q]*n
for i in a:
point[i-1]+=1
for i in point:
if i>0:
print("YES")
else:
print("NO")
|
p02708
|
s229448052
|
Wrong Answer
|
import itertools
N,K = [int(s) for s in input().split(" ") ]
l = list(range(0,N+1))
num = 0
for i in list(range(K, len(l)+1)):
num += len(list(itertools.combinations(l, i)) )
print(num)
|
p03001
|
s441543463
|
Wrong Answer
|
a,b,c,d=map(int,input().split())
x=1
if a/2==c and b%2 or b/2==d and a%2:
x=0
s=str((a*b)/2)+" "+str(x)
print(s)
|
p03817
|
s134721450
|
Wrong Answer
|
x = int(input())
a = x//11
b = x%11
if b > 6:
print(2*a+2)
else:
print(2*a+1)
|
p03071
|
s265317189
|
Accepted
|
a,b=map(int,input().split());c=[a,b,a-1,b-1];c.sort();print(sum(c[-2:]))
|
p02778
|
s515686789
|
Wrong Answer
|
from sys import stdin
def get_result(data):
return 'x' * len(data[0])
if __name__ == '__main__':
data = list(map(str, stdin.readline().split(' ')))
# result = get_result(data)
print('x' * len(data[0]))
|
p03252
|
s908634213
|
Accepted
|
S=input()
T=input()
slist,sdic=[],{}
tlist,tdic=[],{}
for i in range(len(S)):
if not S[i] in sdic:
sdic[S[i]]=len(sdic)+1
slist.append(sdic[S[i]])
if not T[i] in tdic:
tdic[T[i]]=len(tdic)+1
tlist.append(tdic[T[i]])
#print(slist)
#print(tlist)
if slist==tlist:
print("Yes")
else:
print("No")
|
p03795
|
s840095666
|
Accepted
|
N = int(input())
dis = int(N / 15)
print(N * 800 - dis * 200)
|
p02910
|
s876496941
|
Accepted
|
# =map(int,input().split())
S=input()
count=0
for i in range(len(S)):
if i % 2== 0:#奇数の時
if S[i]=="R" or S[i]=="U" or S[i]=="D":
count+=0
else:
count+=1
else:
if S[i]=="L" or S[i]=="U" or S[i]=="D":
count+=0
else:
count+=1
if count==0:
print("Yes")
else:
print("No")
|
p02627
|
s872432488
|
Accepted
|
if input().isupper():
print('A')
else:
print('a')
|
p02693
|
s441873016
|
Accepted
|
def main(k, a, b):
for i in range(a, b + 1):
if i % k == 0:
print("OK")
return
print("NG")
if __name__ == "__main__":
k = int(input())
a, b = map(int, input().split())
main(k, a, b)
|
p02755
|
s784302938
|
Wrong Answer
|
a,b = map(int,input().split())
ans_min = min(int(a*12.5),int(b*10))
ans_max = max(int(a*12.5),int(b*10))
for i in range(ans_min,ans_max+1):
if a == int(i*0.08) and b == int(i*0.1):
print(i)
exit()
print(-1)
|
p03163
|
s841716904
|
Wrong Answer
|
N, W = map(int, input().split())
WV = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * (W+1) for i in range(N+1)]
for i in range(1,N+1):
w, v = WV[i-1]
for j in range(1, W+1):
if j-w < 0:
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i][j-1], dp[i-1][j-w]+v)
ret = 0
for i in dp:
ret = max(ret, i[-1])
print(ret)
|
p02995
|
s634797370
|
Wrong Answer
|
import math
a,b,c,d = map(int,input().split())
a -= 1
a_b = c * d // math.gcd(c, d)
print(a_b)
ans_a = a - (a // c + a // d - a // a_b)
ans_b = b - (b // c + b // d - b // a_b)
print(int(ans_b-ans_a))
|
p03605
|
s634639483
|
Accepted
|
N = input()
print("Yes" if N[0] == "9" or N[1] == "9" else "No")
|
p02897
|
s940210051
|
Accepted
|
N=int(input())
if N%2==0:
print((N//2)/N)
else:
print((N//2+1)/N)
|
p03069
|
s087652360
|
Wrong Answer
|
n=int(input())
s=input()
from itertools import groupby
gr=groupby(s)
c=[]
for k,g in gr:
c.append((k,len(list(g))))
b,w=0,0
b=s.count("#")
if s[-1]=="#":
b-=1
f=False
for k,v in c:
if f:
if k==".":
w+=v
f=False
else:
if k=="#":
f=True
print(min(b,w))
|
p03448
|
s337111105
|
Accepted
|
a = int(input())
b = int(input())
c = int(input())
x = int(input())
cnt=0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if (i*500)+(j*100)+(k*50)==x:
cnt+=1
print(cnt)
|
p04034
|
s910667815
|
Accepted
|
n, m = map(int, input().split())
A = [1] * (n + 1)
red = [False] * (n + 1)
red[1] = True
for i in range(1, m + 1):
x, y = map(int, input().split())
if red[x]:
red[y] = True
A[x] -= 1
A[y] += 1
if A[x] == 0:
red[x] = False
print(len([red[i] for i in range(1, n + 1) if red[i]]))
|
p03427
|
s744960843
|
Wrong Answer
|
N=input()
l=len(N)-1
h=int(N[0])-1
print(h+9*l)
|
p02994
|
s639351776
|
Accepted
|
n,l=map(int,input().split())
a=list(range(l,l+n,1))
x=sum(a)
if(0 in a):
a.remove(0)
print(sum(a))
elif(x<0):
a.remove(max(a))
print(sum(a))
elif(x>0):
a.remove(min(a))
print(sum(a))
|
p03543
|
s702995467
|
Accepted
|
a=[*input()];print('NYoe s'[len(set(a[:3]))==1 or len(set(a[1:]))==1::2])
|
p03814
|
s428496228
|
Accepted
|
S=input()
S=S[S.find('A'):S.rfind('Z')+1]
print(len(S))
|
p02583
|
s281675417
|
Accepted
|
# -*- coding: utf-8 -*-
n = int(input())
l = list(map(int,input().split()))
l.sort()
ans = 0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
a = l[i]
b = l[j]
c = l[k]
if a == b or b == c or c == a:
continue
if a + b > c:
ans += 1
print(ans)
|
p03745
|
s884758366
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
cnt = 1
b = [0] + a
c = [(i-j)//abs(i-j) for i, j in zip(a, b) if i != j]
del c[0]
if c:
mae=c[0]
d=iter(c)
for x in d:
if x != mae:
cnt += 1
try:
mae = d.__next__()
except StopIteration:
break
print(cnt)
|
p02778
|
s710188811
|
Accepted
|
w = input()
wo = "x" * len(w)
print(wo)
|
p03611
|
s824734734
|
Wrong Answer
|
import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
c = Counter(A)
ans = 0
for i in range(min(A)+1, max(A)):
ans = max(ans, c[i-1]+c[i]+c[i+1])
print(ans)
if __name__ == '__main__':
main()
|
p02724
|
s090268332
|
Wrong Answer
|
en=int(input())
res = en/500*1000+(en%500)/5*5
print(res)
|
p02582
|
s942233715
|
Accepted
|
tenki = str(input())
count = 0
tenki_list = []
for n in tenki:
if n == 'R':
count +=1
else:
count = 0
tenki_list.append(count)
print(max(tenki_list))
|
p02993
|
s506048606
|
Accepted
|
s = input()
bad = 0
for i in range(1, len(s)):
if s[i] == s[i-1]:
bad = 1
break
if bad:
print('Bad')
else:
print('Good')
|
p02922
|
s998853342
|
Accepted
|
a,b=map(int,input().split())
ans=0
while a*ans-(ans-1)<b:
ans+=1
print(ans)
|
p03556
|
s033180128
|
Accepted
|
N = int(input())
print(int(N ** 0.5)**2)
|
p02682
|
s152027732
|
Accepted
|
a, b, c, k = list(map(int, input().split()))
if k <= a:
ans = k
elif k <= a+b:
ans = a
else:
ans = a - (k - a - b)
print(ans)
|
p03698
|
s795228084
|
Accepted
|
import sys
S = str(input())
if len(S) < 2 or len(S) > 27:
sys.exit()
if not S.islower():
sys.exit()
result = 'yes'
for I in range(len(S)):
if S.count(S[I]) > 1:
result = 'no'
print(result)
|
p03208
|
s658050122
|
Accepted
|
n, k = map(int, input().split())
ans = 10**9
h = [int(input()) for _ in range(n)]
h.sort()
for i in range(n):
if i + k - 1 >= n:
break
ans = min(h[i + k - 1] - h[i], ans)
print(ans)
|
p03062
|
s590755273
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
s = 0
b = [abs(x) for x in a]
c = 0
for x in a:
if x < 0:
c += 1
if c % 2 == 0:
s = sum(b)
else:
s = sum(b) - 2 * min(b)
print(s)
|
p03797
|
s536582805
|
Wrong Answer
|
n, m = map(int, input().split())
if 2*n >= m:
ans = m//2
else:
ans = n - (2*n - m)//4 -1
print(ans)
|
p02787
|
s333597203
|
Wrong Answer
|
H, N = [int(i) for i in input().split()]
A=[]; B=[]
for _ in range(N):
a, b = [int(i) for i in input().split()]
A.append(a); B.append(b)
# A : value B : weight
INF = 10**9
dp = [[INF for _ in range(20010)] for _ in range(N+10)]
for i in range(N): dp[i][0] = 0
for i in range(N):
for w in range(H+10000):
dp[i+1][w] = min(dp[i+1][w], dp[i][w])
if w >= A[i]: dp[i+1][w] = min(dp[i+1][w], dp[i+1][w-A[i]]+B[i])
print(dp[N][H])
|
p02987
|
s964996242
|
Wrong Answer
|
import sys
word = input()
if len(word) != 4:
print('No')
sys.exit()
if not word.isupper() or not word.isalpha() :
print('No')
sys.exit()
word_cnt = {}
for s in word:
if s in word_cnt.keys():
if word_cnt[s] != 1:
print('No')
sys.exit()
word_cnt[s] += 1
else:
word_cnt[s] = 1
print('Yes')
|
p03220
|
s574380639
|
Wrong Answer
|
n = int(input())
t, a = map(int,input().split())
h = list(map(int, (input().split())))
min = abs(a - (t - h[0]*0.006))
ans = 1
for i in range(1, n):
if (min > abs(a - (t - h[i]*0.006))):
min = a - (t - h[i]*0.006)
ans = i+1
print(ans)
|
p02701
|
s945715475
|
Wrong Answer
|
n = int(input())
s = [input() for i in range(n)]
ss = sorted(s)
test = ss[0]
count = 1
for i in range(n):
if test != s[i]:
test = s[i]
count += 1
print(count)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.