problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02854
|
s337153785
|
Wrong Answer
|
n = int(input())
l = list(map(int,input().split()))
from itertools import accumulate
tot=sum(l)
ans=10**9+7
for i in list(accumulate(l)):
ans=min(ans, abs(tot-(i*2)))
for i in list(accumulate(l[::-1])):
ans=min(ans, abs(tot--(i*2)))
print(ans)
|
p03254
|
s087299352
|
Accepted
|
n,x=map(int,input().split())
a=sorted(list(map(int,input().split())))
tmp=x
ans=0
for i in a[:-1]:
tmp=tmp-i
if tmp>=0:
ans+=1
if tmp==a[-1]:
ans+=1
print(ans)
|
p02802
|
s935965414
|
Accepted
|
n, m = map(int, input().split())
pss = [input().split() for _ in range(m)]
import array; ### print(array.typecodes) ###
wacounts = array.array("l", [0] * (n+1))
acflags = array.array("b", [0] * (n+1))
for pi, si in pss:
pi = int(pi)
if acflags[pi] == 0:
if si == "WA": wacounts[pi] += 1
if si == "AC": acflags[pi] = 1
### print(pi, si, wacounts, acflags) ###
print(acflags.count(1), end=" ")
print(sum(x*y for x,y in zip(wacounts, acflags)))
|
p02699
|
s130993311
|
Accepted
|
A,B=map(int,input().split())
if A <= B:
print("unsafe")
else:
print("safe")
|
p03719
|
s160181108
|
Accepted
|
A,B,C = map(int,input().split())
print('Yes' if A <= C <= B else 'No')
|
p03803
|
s266868411
|
Accepted
|
A, B = map(int,input().split())
if A == B :
print("Draw")
elif A == 1 and B != 1:
print("Alice")
elif A != 1 and B == 1:
print("Bob")
elif A > B :
print("Alice")
else :
print("Bob")
|
p03416
|
s497411567
|
Accepted
|
a, b = map(int, input().split())
count = 0
for i in range(b):
temp = a + i
if temp > b:
break
li = []
ni = temp
for p in range(4):
li.append(ni // (10 ** (4 - p)))
ni = ni % (10 ** (4 - p))
li.append(ni % 10)
if li == li[::-1]:
count += 1
print(count)
|
p03745
|
s692232475
|
Accepted
|
n = int(input())
a = [int(x) for x in input().split()]
flag = 0
cnt = 1
for i in range(n-1):
if a[i] < a[i+1] and flag == 0:
flag = 1
elif a[i] > a[i+1] and flag == 0:
flag = 2
elif flag == 1 and a[i] > a[i+1]:
cnt += 1
flag = 0
elif flag == 2 and a[i] < a[i+1]:
cnt += 1
flag = 0
print(cnt)
|
p02911
|
s613295769
|
Accepted
|
N ,K , Q = map(int,input().split())
Life = [0]*N
for i in range(Q):
a = int(input())
Life[a-1] += 1
for i in range(N):
if Life[i] <= Q-K:
print("No")
else:
print("Yes")
|
p03673
|
s837875630
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
left = 0
right = n-1
for i in range(n):
x = a.pop()
if i % 2 == 0:
b[left] = x
left += 1
else:
b[right] = x
right -= 1
print(*b)
|
p02768
|
s530147524
|
Accepted
|
def cmd(n, r, D):
r = min(r, n-r)
upper = 1
lower = 1
counter = 1
while counter <= r:
upper = (upper * (n - counter +1)) % D
lower = (lower * counter) % D
counter = counter + 1
return (upper * pow(lower, D - 2, D)) % D
D = 10 ** 9 + 7
n, a, b = map(int, input().split())
N = pow(2, n, D)
P = cmd(n, a, D)
Q = cmd(n, b, D)
Ans = (N - 1 - P - Q) % D
print(Ans)
|
p03150
|
s737727905
|
Wrong Answer
|
s=input()
print('YES' if (len(s)>=7 and s[:3]=='key' and s[-4:]=='ence') or s[:7]=='keyence' or s[-7:]=='keyence' else 'NO')
|
p02576
|
s934722563
|
Accepted
|
N, X, T = map(int,input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X+1)*T)
|
p02570
|
s363096799
|
Accepted
|
d , t , s = map(int,input().split())
if d/s <= t:
print("Yes")
else:
print("No")
|
p03799
|
s328540370
|
Accepted
|
N, M= map(float, input().split())
if N > round(M/2):
print(round(M/2))
else:
c=N+(M-N*2)//4
print(int(c))
|
p03126
|
s027680392
|
Accepted
|
n, m = map(int, input().split())
like = [0] * m
for _ in range(n):
ka = list(map(int , input().split()))
for i in range(1, ka[0]+1):
like[ka[i]-1] += 1
ans = 0
for li in like:
if li == n:
ans += 1
print(ans)
|
p02811
|
s180068553
|
Wrong Answer
|
k,x = input().split(" ")
k = int(k)
x = int(x)
print(k,x)
text = "No"
if k*500>=x:
text = "Yes"
print(text)
|
p02742
|
s615409598
|
Accepted
|
import math
h, w = map(int, input().split())
if h == 1 or w == 1:
print(1)
else:
print(math.ceil(h * w / 2))
|
p02572
|
s284327254
|
Accepted
|
from sys import stdin
from itertools import accumulate
input = stdin.readline
n = int(input())
a = list(map(int,input().split()))
p = [0] + list(accumulate(a))
res = 0
for i in range(n-1,-1,-1):
res += (a[i] * p[i])%(10**9 + 7)
print(res % (10**9 + 7))
|
p03779
|
s935238218
|
Wrong Answer
|
import math
X = int(input())
n = math.floor((math.sqrt(1+8*X) - 1)/2)
ans = X - sum(range(n))
print(ans)
|
p02909
|
s473264378
|
Accepted
|
s = input()
weather = ["Sunny","Cloudy","Rainy"]
a = weather.index(s)
if a == 2:
print("Sunny")
else:
print(weather[a+1])
|
p02556
|
s472017344
|
Wrong Answer
|
N = int(input())
l = [tuple(map(int, input().split())) for i in range(N)]
d=set()
for i, j in zip(range(N),range(1,N)):
d.add(abs(l[i][0]-l[j][0]) + abs(l[i][1]-l[j][1]))
print(max(d))
|
p03455
|
s846953417
|
Wrong Answer
|
# 問題文
# シカのAtCoDeerくんは二つの正整数 a,bを見つけました。
# aとbの積が偶数か奇数か判定してください。
# 制約
# 1 <= a,b <= 10000
# a,bは整数
a, b = map(int, input() .split())
# 積が奇数なら、0dd と偶数なら Even と出力
if (1 <= a <= 10000) & (1 <= b <= 10000):
if a * b % 2 == 0:
print('Even')
else:
print('0dd')
|
p02713
|
s697803351
|
Wrong Answer
|
import math
#import itertools
num = (int)(input())
total = 0
#for i, j, k in itertools.product(list(range(1, num + 1)), list(range(1, num + 1)), list(range(1, num + 1))):
# total += math.gcd(math.gcd(i, j), k)
#print(total)
for i in range(2, num + 1):
for j in range(2, num + 1):
for k in range(2, num + 1):
total += math.gcd(math.gcd(i, j), k)
print(total)
|
p03241
|
s696795144
|
Wrong Answer
|
n, m = map(int, input().split())
cnt = 1
for i in range(int(m ** 0.5) + 1,0,-1):
# print(i,m/i)
if m % i == 0:
if m // i >= n:
cnt = m // i
break
print(m//cnt)
|
p03455
|
s883875702
|
Accepted
|
A,B= input().split(' ')
if int(A)*int(B)%2 == 0:
print("Even")
else:
print("Odd")
|
p02718
|
s564914810
|
Wrong Answer
|
# Nこの商品の中からM個選ぶ
N, M = list(map(int, input().split()))
# 商品iの得票数はA_i
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
if A[M-1] >= 1/(4*M):
print("Yes")
else:
print("No")
|
p03861
|
s068487942
|
Accepted
|
a, b, x = map(int, input().split())
print(b//x - (a-1)//x)
|
p02744
|
s348191345
|
Wrong Answer
|
n = int(input())
q = ["0"]
cnt = 0
while cnt < n - 1:
qt = []
for num in q:
lastnum = num[-1]
for i in range(int(lastnum) + 2):
qt += [num + str(i)]
q = qt.copy()
cnt += 1
alp = "abcdefghijkl"
def show(num):
ret = ""
l = len(num)
for i in range(l):
ret += alp[int(num[i])]
return ret
q.sort()
for num in q:
print(show(num))
|
p03041
|
s946489764
|
Accepted
|
n,k = map(int,input().split())
k -= 1
s = input()
print(s[:k] + s[k].lower() + s[k+1::])
|
p02994
|
s573452702
|
Wrong Answer
|
n,l=map(int,input().split())
a=[l+i for i in range(n)]
print(sum(a)-min(a))
|
p02707
|
s060328022
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
num = [0]*n
for i in a:
num[i-1] += 1
print(*num)
|
p02953
|
s146665570
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
ans='Yes'
a[0]-=1
for i in range(n-1):
if a[i]>a[i+1]:
ans='No'
elif a[i+1]>a[i]:
a[i+1]-=1
print(ans)
|
p03360
|
s415539511
|
Wrong Answer
|
a = list(map(int,input().split()))
k = int(input())
tmp = max(a)
m = 0
for i in range(k):
m = 2*max(a) + m
for i in range(3):
if a[i] == tmp:
a[i] = m
break
print(sum(a))
|
p02767
|
s020991745
|
Accepted
|
# 初期入力
N = int(input())
X = list(map(int, input().split()))
X_max =max(X)
X_min = min(X)
tairyoku =[]
# Pで集会を開く
for P in range(X_min,X_max + 1): #住んでいるところで端から端まで確認
tairyoku.append([(x_j - P)**2 for x_j in X ])
tairyoku_sum = [sum(i) for i in tairyoku ]
# print(tairyoku)
#print(tairyoku_sum)
print(min(tairyoku_sum))
|
p02688
|
s910423964
|
Accepted
|
n, k = map(int, input().split())
sets = set()
for i in range(k):
_ = input()
sets |= set(map(int, input().split()))
m = set(range(1,n+1))
rest = m - sets
print(len(rest))
|
p02639
|
s210042147
|
Wrong Answer
|
n = []
n = input().split()
for i in range(5):
n[i] = int(n[i])
print(n)
for i in range(5):
if n[i] == 0:
print(i+1)
|
p02702
|
s100941103
|
Accepted
|
S = input() [::-1]
ans = 0
mod = 0
ten = 1
count = [0]* 2019
count[0] = 1
for i in range(len(S)):
mod = (mod + int(S[i]) * ten) % 2019
ten = ten*10 % 2019
count[mod] += 1
for c in count:
ans += c*(c-1)//2
print(ans)
|
p02596
|
s048110555
|
Wrong Answer
|
n = int(input())
x = 7
ans = 1
for i in range(n+10):
if x%n==0:
break
ans+=1
x= x*10 + 7
x=x%n
if ans < n:
print(ans)
else:
print(-1)
|
p03814
|
s672988714
|
Accepted
|
def main():
s = input()
for i,c in enumerate(s):
if c == "A":
a_pointer = i+1
break
for i,c in enumerate(s):
if c == "Z":
b_pointer = i+1
continue
print(b_pointer - a_pointer +1)
if __name__ == '__main__':
main()
|
p02838
|
s008739778
|
Accepted
|
import numpy as np
mod=10**9+7
N=int(input())
A=np.array(list(map(int, input().split())))
ans=0
for i in range(60):
b=np.count_nonzero(A>>i&1)
ans+=(2**i)*b*(N-b)
ans%=mod
print(ans)
|
p02953
|
s076008015
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
if N == 1:
print("Yes")
else:
k = 0
for i in range(N -1):
if A[i + 1] < A[i]:
k += (A[i] - A[i +1])
if k <= 1:
print("Yes")
else:
print("No")
|
p03696
|
s988723535
|
Wrong Answer
|
def main():
input()
s = input()
l, r = 0, 0
for si in s[::-1]:
if si == ")":
break
r += 1
for si in s[:-r] if r > 0 else s:
if si == ")":
l += 1
else:
l -= 1
print("(" * l + s + ")" * r)
if __name__ == '__main__':
main()
|
p02708
|
s755831903
|
Accepted
|
N, K = map(int, input().split())
def sumLR(l, r):
return (l+r)*(r-l+1)//2
mod = 10**9 + 7
count = 0
for n in range(K, N+2):
max = sumLR(N-n+1, N)
min = sumLR(0, n-1)
count += max - min + 1
count %= mod
print(count)
|
p02951
|
s298535453
|
Accepted
|
a,b,c = map(int,input().split())
amari = a - b
if amari >= c:
print(0)
elif amari < c:
print(c - amari)
|
p03377
|
s040888994
|
Accepted
|
a,b,x = map(int,input().split())
print("YES" if a<=x and (a+b)>=x else "NO")
|
p03323
|
s179917918
|
Accepted
|
A, B = map(int, input().split())
if A <= 8 and B <= 8:
print("Yay!")
else:
print(":(")
|
p03494
|
s546978925
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
count = 0
while True:
for i,num in enumerate(A):
if num % 2 != 0:
print(count)
exit()
else:
A[i] = num / 2
count += 1
|
p03360
|
s834497327
|
Accepted
|
L = sorted(list(map(int, input().split())))
K = int(input())
print(L[0] + L[1] + L[2]*2**K)
|
p02909
|
s036191346
|
Wrong Answer
|
s = input()
if s == "Sunny":
print("Cloudy")
elif s == "Cloudy":
print( "Rainy")
elif s == " Rainy":
print("Sunny")
|
p02608
|
s563880268
|
Accepted
|
import math
n = int(input())
ans = [0]*n
root = n ** 0.5
for x in range(1, math.floor(root) + 1):
for y in range(1, math.floor(root) + 1):
for z in range(1, math.floor(root) + 1):
result = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if result <= n:
ans[result - 1] += 1
for num in ans:
print(num)
|
p02833
|
s232540695
|
Accepted
|
N = int(input())
ans = 0
g = 10
if N%2 != 0:
print(0)
else:
flag = True
while flag:
i = N//g
if i == 0:
break
ans += i
g *= 5
print(ans)
|
p03109
|
s420500821
|
Accepted
|
if int(input()[5:7]) >= 5:
print("TBD")
else:
print("Heisei")
|
p02624
|
s069928123
|
Wrong Answer
|
import math
n=int(input())
def num_divisors_trial_division(n):
num = 0
for i in range(1, int(math.sqrt(n) + 1e-9) + 1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
ans=1
for i in range(1,n+1):
ans+=i*num_divisors_trial_division(i)
print(ans)
|
p02621
|
s593198169
|
Wrong Answer
|
a = int(input())
print(a + a^2 + a^3)
|
p02623
|
s390804738
|
Accepted
|
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
pointer=0
while pointer<m and bsum+b[pointer]<=k:
bsum+=b[pointer]
pointer+=1
ans=pointer
for i in range(n):
asum+=a[i]
while asum+bsum>k and pointer>=0:
pointer-=1
bsum-=b[pointer]
if asum+bsum>k:
break
ans=max(ans,(i+1)+pointer)
print(ans)
|
p03427
|
s956480529
|
Accepted
|
s=input()
print(max(sum(map(int,list(s))),int(s[0])-1+9*len(s)-9))
|
p04011
|
s508376957
|
Accepted
|
x = [int(input()) for i in range(4)]
print(min(x[0], x[1])*x[2]+max(0, (x[0]-x[1]))*x[3])
|
p02994
|
s915235067
|
Accepted
|
import sys
readline = sys.stdin.readline
def main():
N, L = map(int, readline().rstrip().split())
A = [L+i-1 for i in range(1, N+1)]
A_abs = [abs(a) for a in A]
mi_idx = A_abs.index(min(A_abs))
print(sum(A) - A[mi_idx])
if __name__ == '__main__':
main()
|
p03252
|
s972070106
|
Accepted
|
s = str(input())
t = str(input())
d = {}
for k, v in zip(s, t):
if d.get(k) != None and d.get(k) != v:
print("No")
exit()
d[k] = v
if len(set(d.values())) == len(d):
print("Yes")
else:
print("No")
|
p02747
|
s158932999
|
Accepted
|
s = input()
for i in range(0, len(s), 2):
if s[i:i+2] != 'hi':
print('No')
exit()
print('Yes')
|
p02882
|
s607512395
|
Wrong Answer
|
import math
a,b,x = map(int, input().split())
tan = ((a*a*b - x) * 2) / a**3
print(math.degrees(math.atan(tan)))
|
p02663
|
s240670605
|
Accepted
|
h1,m1,h2,m2,k = map(int,input().split())
start = 60*h1+m1
end = 60*h2+m2
res = (end-start-k)
print(res)
|
p03951
|
s811870317
|
Accepted
|
n=int(input())
s=input()
t=input()
actualfail=0
for i in range(n):
fail=0
for j in range(n-i):
if s[i+j]!=t[j]:
fail=1
break
if fail==0:
actualfail=1
break
if actualfail==1:
print(n+i)
else:
print(2*n)
|
p02862
|
s522577551
|
Wrong Answer
|
import sys
input = lambda: sys.stdin.readline().rstrip()
mod = 1000000007
X,Y = map(int, input().split())
def combination(n, r, mod):
r = min(r, n-r)
numer = 1
denom = 1
for i in range(r):
numer = numer * (n-i) % mod
denom = denom * (r-i) % mod
return numer * pow(denom, mod-2, mod) % mod
m_n = (X+Y) // 3
m = X - m_n
n = Y - m_n
if X+Y % 3 == 0 or m < 0 or n < 0:
print(0)
exit()
print(combination(m_n, m, mod))
|
p03107
|
s332368860
|
Wrong Answer
|
s=list(input())
n=len(s)
a=s.count('1')
b=n-a
print(abs(a-b))
|
p03910
|
s772266785
|
Accepted
|
n = int(input())
a = []
cnt = 0
k = 1
while cnt < n:
cnt += k
a.append(cnt)
k += 1
diff = a[-1] - n
for i in range(1, len(a)+1):
if i == diff:
pass
else:
print(i)
|
p03448
|
s282267679
|
Wrong Answer
|
x500 = int(input())
x100 = int(input())
x50 = int(input())
xxx = int(input())
i = 0
j = 0
k = 0
def judge(i, j, k, xxx):
sum = 500 * i + 100 * j + 50 * k
return sum == xxx and sum <= 2000
count = 0
for i in range(x500):
if judge(i, j, k, xxx):
count += 1
for j in range(x100):
if judge(i, j, k, xxx):
count += 1
for k in range(x50):
if judge(i, j, k, xxx):
count += 1
print(count)
|
p03087
|
s689461124
|
Wrong Answer
|
N, Q = map(int, input().split())
S=input()
count=0
for j in range(Q):
l, r = map(int, input().split())
s=S[l-1:r]
count+=s.count("AC")
print(count)
|
p02646
|
s436839802
|
Accepted
|
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
D = abs(A - B)
S = V - W
if V - W <= 0:
print("NO")
else:
if D / S > T:
print("NO")
else:
print("YES")
|
p03328
|
s746259285
|
Accepted
|
a,b=map(int,input().split())
c=0
for i in range(1,(b-a)+1):
c+=i
print(c-b)
|
p03251
|
s192041538
|
Accepted
|
n, m, x, y = map(int, input().split())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
zx = max(x, max(X)); zy = min(y, min(Y))
print('No War') if zx < zy else print('War')
|
p02862
|
s202962290
|
Accepted
|
p=10**9+7
X, Y=map(int, input().split())
if (X+Y)%3>0:
print(0)
exit()
a=(2*X-Y)//3
b=(2*Y-X)//3
if a*b<0:
print(0)
exit()
ab=a+b
ue=[1]*(ab+1)
for i in range(1, ab+1):
ue[i]=ue[i-1]*i%p
out=ue[-1]*pow(ue[a], p-2, p)%p
out=out*pow(ue[b], p-2, p)%p
print(out)
|
p02842
|
s547616006
|
Accepted
|
import math
n = int(input())
div = math.ceil(n/1.08)
if math.floor(div*1.08)==n:
print(div)
else:
print(':(')
|
p03042
|
s560858414
|
Accepted
|
S = input()
months = [i for i in range(1, 13)]
left = int(S[:2])
right = int(S[2:])
if left in months and right in months:
print('AMBIGUOUS')
elif left in months:
print('MMYY')
elif right in months:
print('YYMM')
else:
print('NA')
|
p04012
|
s704590863
|
Accepted
|
from collections import Counter
s = Counter(input())
print("Yes" if all(n % 2 == 0 for n in s.values()) else "No")
|
p04031
|
s338706407
|
Accepted
|
from statistics import mean
import math
n=int(input())
arr=[int(x) for x in input().split()]
a=math.ceil(mean(arr))
b=math.floor(mean(arr))
s1=0
s2=0
for x in arr:
s1=s1+((x-a)**2)
s2=s2+((x-b)**2)
print(min(s1,s2))
|
p02705
|
s660297411
|
Accepted
|
import math
r=int(input())
print(2*r*math.pi)
|
p02971
|
s920407900
|
Accepted
|
n=int(input())
a=[int(input()) for _ in range(n)]
b=sorted(a,reverse=True)
for i in range(n):
if a[i]==b[0]:
print(b[1])
else:
print(b[0])
|
p02555
|
s032241258
|
Wrong Answer
|
n = int(input())
mod = 10**9+7
x = pow(10,n,mod) - 2*pow(9,n,mod)+ pow(8,n,mod);
print(int(x)%mod)
|
p02833
|
s350861369
|
Wrong Answer
|
#E
N=int(input())
ans=0
if N%2==0:
N/=2
else:
N=0
while N>=1:
N-=N%5
N=int(N/5)
ans+=N
print(ans)
|
p02723
|
s265092492
|
Accepted
|
s = input()
if s[2]==s[3] and s[4]==s[5]:
print("Yes")
else:
print("No")
|
p03472
|
s279920878
|
Wrong Answer
|
import bisect
N, H = map(int, input().split())
ab = [map(int, input().split()) for _ in range(N)]
a, b = [list(i) for i in zip(*ab)]
a.sort()
b.sort()
x = bisect.bisect_left(b, a[-1])
H -= sum(b[x:])
print(N-x+(H+a[-1]-1)//a[-1])
|
p02818
|
s772990968
|
Wrong Answer
|
a, b, k = map(int, input().split())
if k < a:
print(str(k - a) + " " + str(b))
elif a <= k and k < a + b:
print(str(0) + " " + str(b - k + a))
else:
print(str(0) + " " + str(0))
|
p02665
|
s750515260
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
sita_maxi = [0 for i in range(n+1)]
sita_maxi[n] = a[n]
for i in range(n-1, -1, -1):
sita_maxi[i] = sita_maxi[i+1] + a[i]
if a[0] > 1:
print(-1)
exit()
lst = [1]
for i in range(1, n+1):
lst.append(min((lst[i-1]-a[i-1])*2, sita_maxi[i]))
if lst[-1] < a[i]:
print(-1)
exit()
print(sum(lst))
|
p02972
|
s153136804
|
Accepted
|
N = int(input())
As = list(map(int, input().split()))
Bs = [0] * (N+1)
for i in reversed(range(1, N+1)):
parity = sum(Bs[i::i]) % 2
if parity != As[i-1]:
Bs[i] = 1
anss = [i for i in range(1, N+1) if Bs[i]]
print(len(anss))
if anss:
print(' '.join(map(str, anss)))
|
p02583
|
s148814769
|
Wrong Answer
|
n = int(input())
ans = 0
bou = list(map(int,input().split()))
bou.sort(reverse=True)
l_bou = len(bou)
for i in range(l_bou):
for j in range(i+1, l_bou):
for k in range(j+1, l_bou):
if ((bou[i] is not bou[j]) and (bou[j] is not bou[k]) and (bou[i] is not bou[k])):
if (bou[i] < bou[j] + bou[k]):
ans += 1
print(ans)
|
p03338
|
s029552289
|
Accepted
|
n = int(input())
s = input()
ans = 0
for i in range(n):
b = set(s[:i]) & set(s[i:])
ans = max(ans, len(b))
print(ans)
|
p02933
|
s178822448
|
Wrong Answer
|
a = int(input())
s = input()
if a>=3200:
print("red")
if a<3200:
print(s)
|
p03665
|
s685440193
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
N, P = map(int, input().split())
A = list(map(int, input().split()))
pre = [1, 0]
for i, a in enumerate(A):
if a&1:# 奇数
tmp = [sum(pre), sum(pre)]
else:# 偶数
tmp = [pre[0] * 2, pre[1] * 2]
pre = tmp
print(pre[P])
if __name__ == "__main__":
main()
|
p03073
|
s567598281
|
Accepted
|
S=input()
S0=S[::2]
S1=S[1::2]
S01=S0.count('1')
S00=S0.count('0')
S11=S1.count('1')
S10=S1.count('0')
change=min(S00+S11,S10+S01)
print(change)
|
p03282
|
s102696167
|
Accepted
|
s = list(input())
K = int(input())
i = 0
while(s[i]=='1'):
K -= 1
if K == 0:
break
i += 1
print(s[i])
|
p02767
|
s217357649
|
Accepted
|
import math
N=int(input())
X=list(map(int,input().split()))
Prange= range(math.floor(min(X))-1,math.ceil(max(X))+1)
summin=100000000000
for P in Prange:
sum=0
for x in X:
sum+=(P-x)**2
if summin > sum:
summin=sum
print(summin)
|
p04034
|
s469773988
|
Accepted
|
def solve():
N, M = map(int, input().split())
lis = [False]*N
cnt = [1]*N
lis[0] = True
for i in range(M):
x,y = map(int, input().split())
x -= 1
y -= 1
if lis[x]==True:
lis[y]=True
if cnt[x]==1:
lis[x]=False
cnt[x] -= 1
cnt[y] += 1
ans = lis.count(True)
return ans
print(solve())
|
p02546
|
s166919712
|
Accepted
|
s=input()
if s[-1]=="s":
s+="e"
print(s+"s")
|
p03041
|
s560247099
|
Wrong Answer
|
n,k = map(int,input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print(s)
|
p03162
|
s594464036
|
Accepted
|
import numpy as np
n = int(input())
X = np.array([input().split() for _ in range(n)], np.int64)
dp = np.zeros((n + 1, 3), np.int64)
dp[0, 0] = dp[0, 1] = dp[0, 2] = 0
for i in range(n):
for j in range(3):
dp[i + 1, j] = X[i, j] + max(dp[i, k] for k in range(3) if j != k)
print(max(dp[n]))
|
p03264
|
s332139224
|
Accepted
|
K = int(input())
if K%2==0:
print((K//2)**2)
else:
n = K//2
print(n*(n+1))
|
p03555
|
s719935926
|
Wrong Answer
|
a,b=list(input()),list(input())
a.reverse()
print("Yes" if a == b else "No")
|
p02842
|
s990520710
|
Accepted
|
import math
N=int(input())
min = N/1.08
max = (N+1)/1.08
candidate = math.ceil(min)
if candidate >= max:
print(':(')
else:
print(candidate)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.