problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03351 | s842324829 | Accepted | a, b, c, d = map(int, input().split())
print("Yes" if abs(a-c) <= d or (abs(a-b) <= d and abs(c-b) <= d) else "No")
|
p02766 | s058498155 | Wrong Answer | a,b=map(int,input().split())
cnt=0
while a>0:
a//=b
cnt+=1
|
p02665 | s342389698 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = []
limit = 0
present = 1
total = 0
for i in range(n+1):
limit += a[i]
for i in range(n+1):
limit -= a[i]
b.append(limit)
for i in range(n+1):
if present > a[i]:
total += present
present = min((present-a[i])*2, b[i])
elif present == a[i] and i == n:
total += present
else:
total = -1
break;
print(total) |
p03495 | s101188313 | Accepted | from collections import Counter
def main():
n, k = map(int, input().split())
As = map(int, input().split())
ans = 0
for num, count in Counter(As).most_common()[::-1][:-k]:
ans += count
print(ans)
if __name__ == "__main__":
main()
|
p02899 | s083254001 | Accepted | n = int(input())
a = list(map(int, input().split()))
r = [0] * n
for i, j in enumerate(a):
r[j - 1] = i + 1
print(*r)
|
p03137 | s830530515 | Accepted | n, m = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
d = []
for i in range(1, m):
d.append(x[i]-x[i-1])
d.sort()
d.reverse()
print(sum(d)-sum(d[:n-1]))
|
p03624 | s772935694 | Accepted | s = list(input())
s = list(set(s))
for i in range(ord("a"),ord("z")+1):
if s.count(chr(i)) != 1:
print(chr(i))
exit()
print("None") |
p02572 | s658082614 | Accepted | N = int(input())
data = input().split()
data = [int(s) for s in data]
num = 0
ans = 0
sum = sum(data)
for i in range(N) :
num += data[i]
ans += (sum - num) * data[i]
print(ans % 1000000007) |
p02547 | s823633845 | Accepted | n = int(input())
a = []
res = False
for i in range(n):
x, y = map(int, input().split())
a.append(x == y)
if i >= 2 and a[-1] and a[-2] and a[-3]:
res = True
print('Yes' if res else 'No')
|
p02993 | s675631421 | Wrong Answer | s=input()
n=''
result='Good'
for i in s:
if s==n:
result='Bad'
break
n=i
print(result) |
p03962 | s738824087 | Wrong Answer | a,b,c = map(int,input().split())
n=1
if a!=b:
n+=1
if a!=c or b!=c:
n+=1
print(n) |
p03073 | s375347327 | Wrong Answer | s = str(input())
print(s)
count =0
for xi in range(len(s)):
if xi%2 ==0:t="0"
if xi%2 ==1:t="1"
if s[xi]==t:
count+=1
# print(count)
print(min(count,len(s)-count))
|
p03469 | s814922203 | Accepted | s=input()
print("2018"+s[4:]) |
p02838 | s258604676 | Accepted | import numpy as np #numpyの練習がてら
n = int(input())
tmp = list(map(int,input().split()))
mod = 10**9 + 7
a = np.array(tmp,np.int64)
ans = 0
for i in range(60 + 1):
b = (a >> i) & 1 #すべてのaについて2**n乗目のビットが1か否か
iti = np.count_nonzero(b) #すべてのaのうち2**n乗目が1であるものの個数
zero = n - iti #同様に0であるものの個数
ans += (iti * zero) * pow(2,i,mod) % mod#片方1で片方0なら1なので1の個数×0の個数
ans %= mod
print(ans)
|
p03625 | s900798308 | Wrong Answer | from collections import Counter
n = int(input())
a_ls = list(map(int, input().split()))
c = Counter(a_ls)
edges_ls = [0] * 2
for value, count in c.items():
if count >= 2:
edges_ls.append(value)
edges_ls.sort()
ans = edges_ls[-1] * edges_ls[-2]
print(ans)
|
p02775 | s490510461 | Wrong Answer | a = input()
cnt = 0
sakki5 = False
sakki6 = False
for s in a:
if int(s) < 6:
cnt += int(s)
sakki6 = False
if int(s) == 5:
sakki5 = True
else:
cnt += 11 - int(s)
if sakki6:
cnt -= 2
if sakki5:
cnt -= 1
sakki6 = True
sakki5 = False
print(cnt) |
p02718 | s066241722 | Accepted | n, m = map(int, input().split())
a_list = list(map(int, input().split()))
a_list = sorted(a_list)
cnt = 0
for i in range(n):
if a_list[i] >= sum(a_list)/(4*m):
cnt += 1
if cnt >= m:
print('Yes')
else:
print('No') |
p03264 | s524235697 | Wrong Answer | N=int(input())
if N%2==0:
print((N/2)**2)
else:
print((N//2)*(N-(N//2))) |
p02660 | s937690302 | Wrong Answer | import sys
from math import sqrt
def log(s):
# print("| " + str(s), file=sys.stderr)
pass
def output(x):
print(x, flush=True)
def input_ints():
return list(map(int, input().split()))
def main():
n = int(input())
r = 0
i = 2
while i <= n:
if n % i == 0:
r += 1
n //= i
if r == 0 and i > sqrt(n):
r = 1
break
i += 1
print(r)
main()
|
p02684 | s126123694 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
A = [a - 1 for a in A]
D = 60
MAX_N = 200005
to = [[0] * MAX_N for _ in range(D)]
for i, a in enumerate(A):
to[0][i] = a
for i in range(D - 1):
for j in range(N):
to[i + 1][j] = to[i][to[i][j]]
v = 0
for i in range(D - 1, -1, -1):
l = 1 << i
if l <= K:
v = to[i][v]
K -= l
print(v + 1) |
p03785 | s107381479 | Accepted | import collections
N,C,K=map(int,input().split())
T=[int(input()) for i in range(N)]
T.sort()
count=1
cus=0
pre=T[0]
for t in T:
if C>cus and pre+K>=t:
cus+=1
else:
cus=1
pre=t
count+=1
print(count)
|
p02606 | s184840461 | Accepted | l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
if i%d==0:
ans+=1
print(ans) |
p03219 | s302723436 | Wrong Answer | a, b = (int(i) for i in input().split())
print(a+b/2) |
p03607 | s614768575 | Accepted | n = int(input())
A = [int(input()) for _ in range(n)]
S = set()
for a in A:
if a in S:
S.remove(a)
else:
S.add(a)
print(len(S))
|
p03286 | s362300009 | Wrong Answer | n=int(input())
L=[]
cnt=0
while(n!=0):
cnt+=1
a=n%(2**cnt)
b=(1 if a>0 else 0)
L.append(b)
n=n-(((-2)**(cnt-1))*b)
L=list(map(str,L))[::-1]
print("".join(L)) |
p03419 | s745417694 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,m = iim()
if n == 1:
print(m-2)
elif m == 1:
print(n-2)
else:
print((n-2)*(m-2)) |
p03657 | s923788567 | Accepted | A,B = map (int,input().split())
if A%3 == 0 or B%3==0 or (A+B)%3 == 0:
print('Possible')
else:
print('Impossible')
|
p03262 | s099347487 | Accepted | from math import gcd
N, X = map(int, input().split())
xs = sorted(map(int, input().split()))
ds = [xs[i] - X for i in range(N)]
ans = abs(ds[0])
for d in ds:
ans = gcd(abs(d), ans)
print(ans) |
p02988 | s645910287 | Wrong Answer | n=int(input())
p=list(map(int,input().split()))
ans=0
for i in range(n-2):
l=[p[i],p[i+1],p[i+2]]
if p[i+1]==min(l):
ans+=1
print(ans) |
p02584 | s106769801 | Accepted | X, K, D = [int(x) for x in input().split()]
X = abs(X)
fl = X // D
cl = fl + 1
if fl > K:
ans = X - K * D
elif K % 2 == fl % 2:
ans = X - fl * D
else:
ans = cl * D - X
print(ans) |
p03106 | s612889853 | Accepted | a, b, k = map(int, input().split())
flag, divisor, common_divisors = 0, 1, list()
while flag != -1:
if a % divisor == 0 and b % divisor == 0:
common_divisors.append(divisor)
if divisor >= min(a, b):
flag = -1
divisor += 1
print(sorted(common_divisors, reverse=True)[k-1]) |
p03319 | s460236910 | Wrong Answer | import sys
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(N // (K-1)) |
p02779 | s609441346 | Accepted | import sys
import numpy as np
n = input()
a = input().split()
a_n = np.array(a)
if (len(a) == np.unique(a_n).size):
print("YES")
else:
print("NO") |
p03131 | s911456925 | Accepted | k, toayen, fromayen = map(int, input().split())
if fromayen <= toayen + 2 or k <= toayen:
print(k + 1)
exit()
k -= (toayen - 1)
bs = toayen
bs += (fromayen - toayen) * (k//2)
k %= 2
print(bs + 1 if k else bs) |
p03680 | s912319475 | Wrong Answer | n = int(input())
a = [int(input()) for _ in range(n)]
lis = ["0"]*n
bot = a[0]
lis[0] == "1"
cnt = 1
while True:
if bot == 2:
print(cnt)
break
elif lis[bot-1] == "1":
print(-1)
break
else:
cnt += 1
bot = a[bot-1]
lis[bot-1] = "1" |
p03208 | s409385553 | Wrong Answer | import sys
N,K = map(int,input().split())
L = []
for i in range(N):
L.append(int(input()))
L.sort()
for i in range(N-K+1):
if L[i:i+K] == [L[i] for _ in range(K)]:
print(0)
sys.exit(0)
print(L[K-1]-L[0])
|
p03351 | s270525453 | Accepted | a,b,c,x = map(int, input().split())
if abs(c-a) <= x or (abs(c-b) <= x and abs(b-a) <= x):
print('Yes')
else:
print('No') |
p03385 | s292102550 | Accepted | S = input()
if (S[0] != S[1]) and (S[1] != S[2]) and (S[0] != S[2]):
print('Yes')
else:
print('No')
|
p02695 | s852946472 | Wrong Answer | import itertools
n,m,q=map(int,input().split())
lis=[i for i in range(1,m+1)]
lis=list(itertools.combinations_with_replacement(lis,n))
box=[0 for j in range(len(lis))]
print(lis)
for i in range(q):
que=list(map(int,input().split()))
for j in range(len(lis)):
if lis[j][que[1]-1]-lis[j][que[0]-1]==que[2]:
box[j]+=que[3]
print(max(box)) |
p03274 | s918819249 | Wrong Answer | n,k,*x=map(int,open(0).read().split())
if x[0]>=0:
ans=x[k-1]
elif x[-1]<=0:
ans=abs(x[~(k-1)])
else:
ans=10**10
for i in range(n-k):
l=x[i]
r=x[i+k-1]
if l<=0<=r:
ll=abs(l)
rr=abs(r)
tmp=min(ll+2*rr,2*ll+rr)
ans=min(ans,tmp)
print(ans)
|
p03838 | s164720244 | Wrong Answer | x,y = map(int,input().split())
X = abs(x)
Y = abs(y)
ans = 0
if X > Y:
if y > x:
ans = min((y - x),abs(y - x) + 1)
else:
ans = abs(y - x) + 1
if y > 0: # 符号再変換
ans += 1
elif Y > X:
if y > x:
ans = min((y - x),abs(y - x) + 1)
else:
ans = abs(y - x) + 1
if x < 0: # 符号再変換
ans += 1
elif X == Y:
if x == y:
ans = 0
else:
ans = 1
print(ans)
|
p02681 | s403376892 | Accepted |
s = input()
t = input()
if t[:-1] == s:
print("Yes")
else:
print("No") |
p02922 | s443604772 | Wrong Answer | a,b=map(int,input().split())
i,count=1,a
while count<b:
count+=a
i+=1
print(i) |
p02657 | s316335198 | Accepted | a,b=map(int, input().split())
print(a*b) |
p03264 | s804881914 | Wrong Answer | K = int(input())
if K % 2 == 0:
print(K * K % 4)
else:
print(int(((K-1)**2)/4+(K-1)/2)) |
p02912 | s603335253 | Accepted | from heapq import *
N,M = map(int,input().split())
A = list(map(lambda x:-int(x),input().split()))
heapify(A)
for m in range(M):
heappush(A,int(heappop(A)/2))
print(-sum(A)) |
p02784 | s690403035 | Accepted | h, n = map(int, input().split())
a = list(map(int, input().split()))
if (h <= sum(a)):
print("Yes")
else:
print("No")
|
p02730 | s143312258 | Accepted | #!/user/bin/env python3
# -*- conding: utf-8 -*-
def main():
S = input()
N = len(S)
flag = 'No'
s1 = S[:int((N-1)/2)]
s2 = S[int((N+3)/2)-1:]
if S == S[::-1]:
if s1 == s1[::-1]:
if s2 == s2[::-1]:
flag = 'Yes'
print(flag)
if __name__ == '__main__':
main() |
p02862 | s510831391 | Wrong Answer | mod=10**9+7
x,y=map(int,input().split())
if (x+y)%3!=0:
print(0)
exit()
if x*2>y or y*2>x:
print(0)
exit()
z=(x+y)//3
x-=z
y-=z
n=x+y
r=x
lst=[0]+[1]
for i in range(2,n+10):
lst.append((lst[-1]*i)%mod)
xxx=lst[n]
xxx*=pow(lst[n-r],10**9+5,mod)
xxx%=mod
xxx*=pow(lst[r],10**9+5,mod)
xxx%=mod
print(xxx) |
p02748 | s252244381 | Wrong Answer | A, B, M = map(int, input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
X = 0
Y = 0
C = 0
Min = min(a) + min(b)
for _ in range(M):
x, y, c = map(int, input().split())
if c >= C:
X = x - 1
Y = y - 1
C = c
res = (a[X] + b[Y]) - C
if Min < res:
print(Min)
exit()
print(res) |
p03486 | s164763475 | Accepted | s = input()
t = input()
# print(s)
# print(t)
s_list = list(s)
t_list = list(t)
# print(s_list)
# print(t_list)
s_list_sorted = sorted(s_list)
t_list_sorted = sorted(t_list, reverse=True)
# print(s_list_sorted)
# print(t_list_sorted)
s_sorted = ''.join(s_list_sorted)
t_sorted = ''.join(t_list_sorted)
# print(s_sorted)
# print(t_sorted)
if s_sorted < t_sorted:
print("Yes")
else:
print("No") |
p03625 | s888150906 | Accepted | n = int(input())
A = list(map(int, input().split()))
d = {0:4}
for a in A:
d[a] = d.get(a, 0)+1
longest = 0
for i in d:
if d[i]>=2:
longest = max(longest, i)
d[longest]-=2
longest_2nd = 0
for i in d:
if d[i]>=2:
longest_2nd = max(longest_2nd, i)
print(longest*longest_2nd) |
p03059 | s666910299 | Accepted | a, b, t = map(int, input().split())
x = int(t / a)
print(b * x)
|
p03854 | s164215996 | Wrong Answer | s = input()
while len(s) >= 5:
if len(s) >= 5 and s[-5:] == 'dream':
s = s[:-5]
elif len(s) >= 7 and s[-7:] == 'dreamer':
s = s[:-7]
elif len(s) >= 5 and s[-5:] == 'erase':
s = s[:-5]
elif len(s) >= 6 and s[-6:] == 'eraser':
s = s[:-6]
else:
break
if len(s) == 0:
print('YES')
else:
print('No')
|
p03449 | s075206756 | Accepted | # coding: utf-8
import numpy as np
N = int(input())
A = []
for _ in range(2):
A.append(list(map(int, input().split())))
dp = [[0] * N] * 2
dp = np.array(dp)
dp[0][0] = A[0][0]
dp[1][0] = A[0][0] + A[1][0]
for i in range(1, N):
dp[0][i] = dp[0][i-1] + A[0][i]
dp[1][i] = max(dp[0][i], dp[1][i-1]) + A[1][i]
print(dp[1][N-1]) |
p02787 | s193635987 | Accepted | H,N = map(int,input().split())
magics = [list(map(int,input().split())) for _ in range(N)]
max_A = max(a for a,b in magics)
INF = 10**10
DP = [INF]*(H+max_A)
DP[0] = 0
for i in range(1,H+max_A):
DP[i] = min(DP[i-a] + b for a,b in magics)
ans = min(DP[H:])
print(ans)
|
p02790 | s129989646 | Wrong Answer | a, b = map(int,input().split())
if a >= b:
print('b'*a)
else:
print('a'*b) |
p03136 | s502532751 | Wrong Answer | n = int(input())
l = input().split(" ")
for i in range(len(l)):
l[i] = int(l[i])
l.sort()
sum = 0
for i in range(1, n):
sum += l[i]
if sum > l[0]:
print("Yes")
else:
print("No")
|
p03711 | s671297222 | Accepted | if __name__ == "__main__":
xy = tuple(map(int, input().split()))
g1 = (1, 3, 5, 7, 8, 10, 12)
g2 = (4, 6, 9, 11)
if(len(set(xy) & set(g1)) == 2):
print("Yes")
elif(len(set(xy) & set(g2)) == 2):
print("Yes")
else:
print("No")
|
p04019 | s221464510 | Accepted | S = input()
d = {'N': 0, 'W': 0, 'S': 0, 'E': 0}
prev = 'null'
for s_i in S:
d[s_i] = 1
if sum(d.values()) == 4:
break
y = False
x = False
if (d['N'] and d['S']) or not(d['N'] or d['S']):
y = True
if (d['W'] and d['E']) or not(d['W'] or d['E']):
x = True
print('Yes' if y and x else 'No') |
p02747 | s241838293 | Accepted | s = input()
hi = [s[i:i+2] for i in range(0, len(s), 2)]
a = 0
for i in range(len(hi)):
if hi[i] != 'hi':
a += 1
break
if a == 1:
print('No')
else:
print('Yes') |
p03387 | s761887712 | Wrong Answer | import sys
a,b,c = map(int, input().split())
if a == b and b == c:
count=0
print(count)
sys.exit()
ls = [a,b,c]
ls.sort(reverse=True)
count = 0
print(ls)
print(ls[0])
if (ls[1]-ls[2])%2 != 0:
ls[2] = ls[2]+1
ls[0] = ls[0]+1
count +=1
while ls[1] - ls[2] >= 2:
ls[2] += 2
count += 1
if ls[1] - ls[2] == 1:
ls[2] += 1
count +=1
dif = ls[0] - ls[1]
count = count + dif
print(count)
|
p03773 | s122121876 | Wrong Answer | A, B = map(int, input().split())
sum = A+B
if sum <= 24:
print(sum)
else:
while sum > 24:
sum -= 24
print(sum) |
p02702 | s916230075 | Accepted | s=input()
d=[0]*2019
dp=0
d[0]+=1
l=len(s)
r=1
for i in range(l):
dp+=int(s[l-1-i])*r
dp%=2019
r*=10
r%=2019
d[dp]+=1
res=0
for a in d:
res+=a*(a-1)//2
print(res) |
p02583 | s986898185 | Wrong Answer | N=int(input())
count=0
L=list(map(int,input().split()))
for i in range(N):
for j in range(i,N):
for k in range(j,N):
if L[i]<L[j]+L[k] and L[k]<L[j]+L[i] and L[j]<L[i]+L[k]:
count+=1
print(count)
|
p02583 | s773569728 | Accepted | N = int(input())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
for j in range(i,len(arr),1):
for k in range(j,len(arr),1):
if arr[i] == arr[j] or arr[i] == arr[k] or arr[j] == arr[k]:
continue
if arr[k] < arr[i]+arr[j] and arr[i] < arr[j]+arr[k] and arr[j] < arr[i]+arr[k]:
ans += 1
print(ans)
|
p03478 | s516554186 | Accepted | N,A,B = map(int,input().split())
def check_num(n):
s = str(n)
array = list(map(int,s))
return sum(array)
list_1 = [i for i in range(1,N+1)]
list_2 = []
for _ in list_1:
if A<=check_num(_)<=B:
list_2.append(_)
else:
pass
print(sum(list_2))
|
p02647 | s201127454 | Wrong Answer | import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
n, k = rm()
a = rl()
k = min(k, 40)
if n <= k:
for _ in range(n):
print(n, end=' ')
exit()
for _ in range(k):
li = [0] * n
for i in range(n):
s = max(i - a[i], 0)
e = min(i + a[i], n-1)
for m in range(s, e+1):
li[m] += 1
for v in a:
print(v, end=' ')
|
p02983 | s212998833 | Accepted | l,r=map(int,input().split())
mod=2019
ans=2018
if r-l+1>=2019 or r%mod<l%mod:
ans=0
else:
for i in range(l%mod,r%mod):
for j in range(i+1,r%mod+1):
temp=(i*j)%mod
ans=min(ans,temp)
print(ans)
|
p02761 | s653624006 | Accepted | N, M = map(int, input().split())
sc = [tuple(map(int, input().split())) for _ in range(M)]
matches = []
for i in range(0, 1000):
if len(str(i)) == N:
temp = True
for s, c in sc:
if str(i)[s - 1] != str(c):
temp = False
if temp: matches.append(i)
print(-1) if len(matches) == 0 else print(min(matches)) |
p04044 | s669830517 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,l=map(int, input().split())
l=[input() for i in range(n)]
l.sort()
print(''.join(l))
resolve() |
p03711 | s300203462 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def main():
g1 = [1,3,5,7,8,10,12]
g2 = [4,6,9,11]
g3 = [2]
d = {}
for x in g1: d[x] = 1
for x in g2: d[x] = 2
for x in g3: d[x] = 3
x, y = map(int, input().split())
if d[x] == d[y]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p03774 | s868925012 | Wrong Answer | n,m=map(int,input().split())
a=[list(map(int,input().split())) for a in range(n)]
c=[list(map(int,input().split())) for b in range(m)]
dist=0
minnum=0
for indi,i in enumerate(a):
dist=0
min=10*16
minnum=0
for indj,j in enumerate(c):
dist+=abs(i[0]-j[0])
dist+=abs(i[1]-j[1])
if min>dist:
min=dist
minnum=indj
dist=0
print(minnum+1)
|
p03206 | s321514176 | Wrong Answer | D = int(input())
print("Christmas", "Eve"*(25-D))
|
p03449 | s723819425 | Wrong Answer | n = int(input())
a = []
for i in range(2):
a.append(list(map(int, input().split(" "))))
print(a)
ans_l = []
for i in range(n):
ans = 0
f = False
for j in range(n):
if j == 0:
ans += a[0][0]
elif f:
ans += a[1][j]
else:
ans += a[0][j]
if i == j:
ans += a[1][j]
f = True
ans_l.append(ans)
print(max(ans_l))
|
p02754 | s250368083 | Accepted | n, a, b = map(int, input().split())
ans = n // (a + b) * a + min(n % (a + b), a)
print(ans)
|
p04034 | s768652228 | Wrong Answer | import numpy as np
n,m = [int(i)for i in input().split()]
l = [[int(i)-1 for i in input().split()] for _ in range(m)]
line = np.array([1 for _ in range(n)])
is_red = np.zeros(n,dtype = np.int32)
is_red[0] = 1
for x,y in l:
line[x] -= 1 if line[x] > 0 else 0
line[y] += 1
is_red[y] = 1 if is_red[x] == 1 else is_red[y]
ans = np.count_nonzero(is_red[line > 0])
print(ans)
|
p03779 | s229286946 | Wrong Answer | x = int(input())
#h, w = list(map(int, input().split()))
#((n+1)*n)//2 >= x
# (n+1)*n = 2*x
n = 1
a = ((n+1)*n)//2
while a < x:
a = ((n+1)*n)//2
n += 1
print(n)
|
p02714 | s843807696 | Wrong Answer | import collections
n=int(input())
s=input()
c = collections.Counter(s)
ans_count = c['R'] * c['G'] * c['B']
for i in range(1, (n-1)//2):
for j in range(n):
if j+(2*i) >= n:
break
if s[j] != s[j+i] and s[j+i] != s[j+(2*i)] and s[j] != s[j+(2*i)]:
ans_count -= 1
print(ans_count)
|
p03351 | s673020783 | Accepted |
def main():
a, b, c, d = map(int, input().split())
if abs(a - c) <= d or (abs(a - b) <= d and abs(b - c) <= d):
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
p02598 | s710264186 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
high=max(A)
low=0
while high-low>1:
cnt=0
now=(low+high)//2
for a in A:
cnt+=max((a-1)//now,0)
if cnt>k:
break
if cnt>k:
low=now
else:
high=now
print(cnt,low,high)
print(high) |
p02631 | s573915219 | Accepted | from functools import reduce
N = int(input())
A = [int(i) for i in input().split()]
B = reduce(lambda x,y: x^y, A)
print(" ".join(map(str, [A[i]^B for i in range(N)]))) |
p03627 | s348978751 | Accepted | import collections
N = int(input())
A = list(map(int, input().split()))
CA = collections.Counter(A)
max1 = 0
max2 = 0
for item in CA.items():
if item[1] >= 2 and item[0] > max1:
if item[1] >= 4:
max1 = item[0]
max2 = item[0]
else:
max2 = max1
max1 = item[0]
elif item[1] >= 2 and item[0] > max2:
max2 = item[0]
print(max1*max2)
|
p02598 | s022316050 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
def f(x):
return sum((a+x-1)//x - 1 for a in A)
l = 0
r = 10**9+1
while r - l > 1:
mid = (l + r) // 2
if f(mid) <= K:
r = mid
else:
l = mid
print(r) |
p04033 | s211469672 | Wrong Answer | a = list(map(int,input().split()))
if a[0] == 0 or a[1] == 0:
print("Zero")
elif a[0] == abs(a[0]) and a[1] == abs(a[1]):
print("Positive")
elif a[0] != abs(a[0]) and a[1] != abs(a[1]):
print("Negative") |
p02726 | s756878181 | Accepted | n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n):
for j in range(i + 1, n + 1):
ans[min(j - i, abs(i - x) + abs(j - y) + 1)] += 1
print('\n'.join(map(str, ans[1:])))
|
p03220 | s029458404 | Accepted | n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
kion=[]
for i in range(len(h)):
kion.append(t-h[i]*0.006)
#print(kion)
j=0
x=10000000000000000000000
for i in range(len(kion)):
if abs(a-kion[i])<x:
j=i+1
x=abs(a-kion[i])
print(j) |
p02859 | s919787310 | Accepted | import sys
def solve(inp):
r = int(inp.readline())
return r * r
def main():
result = solve(sys.stdin)
if result:
print(result)
if __name__ == '__main__':
main()
|
p02613 | s615791900 | Accepted | n = int(input())
s = [input() for i in range(n)]
for k in ['AC', 'WA', 'TLE', 'RE']:
print(k, 'x', s.count(k)) |
p03543 | s526018388 | Wrong Answer | N = input()
cnt = 1
for i in range(len(N)-1):
if N[i] == N[i+1]:
cnt += 1
else:
cnt = 0
if cnt == 3:
print("Yes")
exit()
print("No")
|
p02972 | s099266618 | Accepted | # とっかかりを掴むために、全探索で実験してみる
n = int(input())
A = list(map(int, input().split()))
boxes = [None]*(n+1)
for i in range(n, 0, -1):
coef = 1
tmp = 0
while i*(coef+1) <= n:
coef += 1
tmp += boxes[i*coef]
boxes[i] = A[i-1] ^ (tmp % 2)
ans = []
for idx, v in enumerate(boxes):
if v == 1:
ans.append(idx)
print(len(ans))
if len(ans) > 0:
print(*ans)
|
p02607 | s762348271 | Accepted | def main():
no = int(input())
maths = map(int,input().split())
count = 0
for index,math in enumerate(maths):
if index % 2==0 and math %2==1:
count+=1
print(count)
if __name__ == "__main__":
main() |
p02618 | s536460749 | Accepted | D=int(input())
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
T=[]
result=-(D*(D+1)//2)*sum(C)
last=[0 for i in range(26)]
#初期解の算出
for i in range(D):
change=[S[i][j]+(i-last[j]+1)*(D-last[j])*C[j] for j in range(26)]
score=max(change)
t=change.index(score)
T.append(t+1)
print(t+1)
last[t]=i+1
result+=score |
p03448 | s533809100 | Wrong Answer | A, B, C, X = [int(input()) for i in range(4)]
print(sum(500*a + 100*b + 50*c == X for a in range(A+1) for b in range(B+2) for c in range(C+1))) |
p03730 | s332745058 | Wrong Answer | A, B, C = map(int, input().split())
s = (A - C) // B
for i in range(s, 101):
if (B * i + C) % A == 0:
print('Yes')
break
if i == 100:
print('No')
|
p03971 | s989397480 | Wrong Answer | N, A, B = map(int,input().split())
S = input()
a_counter = 0
b_counter = 0
while S != "":
s = S[0]
if s == "a" and a_counter + b_counter <=A+B:
a_counter += 1
print("Yes")
elif s == "b" and b_counter <= B and a_counter + b_counter <=A+B:
b_counter += 1
print("Yes")
else:
print("No")
S = S[1:] |
p02548 | s728415595 | Wrong Answer | N=int(input())
#A,B,C>0 C=N-A*B
count=0
for A in range(1,N):
for B in range(1,N):
print(A,B,N-A*B)
if N-(A*B)>0:
count+=1
print(count) |
p02578 | s834773214 | Accepted | N = input()
A = map(int, input().split())
current = 0
ans = 0
for a in A:
ans += current - min(current, a)
current = max(current, a)
print(ans) |
p02802 | s704358786 | Accepted | N,M=map(int,input().split())
wa=[0]*N
pen=[0]*N
ac=[0]*N
for x in range(M):
P,S=input().split()
if S=="WA" and ac[int(P)-1]==0:
wa[int(P)-1] += 1
elif S=="AC" and ac[int(P)-1]==0:
ac[int(P)-1] += 1
pen[int(P)-1] = wa[int(P)-1]
print(f"{sum(ac)} {sum(pen)}") |
p03011 | s887815091 | Accepted | P, Q, R = map(int, input().split())
print(min(P+Q, Q+R, R+P)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.