problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03035 | s820804072 | Wrong Answer | A,B=map(int, input().split())
if A<5:
print(0)
elif A<12:
print(B/2)
else:
print(B)
|
p02779 | s552444054 | Wrong Answer | import collections
N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)
cnt = c.most_common()
for c in cnt:
if (c[1]>1):
print('No')
else:
print('Yes')
break
|
p03472 | s608590035 | Accepted | N, H = map(int, input().split())
#ab = [list(map(int, input().split())) for i in range(N)]
a = []
b = []
for i in range(N):
ai, bi = map(int, input().split())
a.append(ai)
b.append(bi)
a.sort()
b.sort()
from bisect import bisect_left
end = bisect_left(b, max(a))
#H = 500
i = N - 1
cnt = 0
while H > 0 and en... |
p03037 | s217704345 | Accepted | n,m=map(int,input().split())
count=0
s=[0]*(n+1)
L=0
R=10**5
for i in range(m):
l,r=map(int,input().split())
L=max(l,L)
R=min(r,R)
if (R-L+1)>=0:
print(R-L+1)
else:
print(0) |
p03555 | s821783529 | Accepted | c1 = input()
c2 = input()
if (c1[::-1] == c2):
print("YES")
else:
print("NO")
|
p04034 | s269691665 | Accepted | N,M = map(int,input().split())
XY = [list(map(int,input().split())) for i in range(M)]
Q = [1 for i in range(N)]
dp = [0 for i in range(N)] #dp[m][n]
dp[0]=1
for i in range(1,M+1):
x=XY[i-1][0]
y=XY[i-1][1]
if dp[x-1]>=1:
if Q[x-1]==1:
dp[x-1]=0
else:
dp[x-1]=1
dp[y-1]+=1
Q[x-1]-=1
... |
p02970 | s875116436 | Wrong Answer | n,d=map(int,input().split())
x=0
while True:
a=1+d
x+=1
if a>=n:
break
else:
while True:
a=a+d*2+1
x+=1
if a>=n-d:
break
break
print(x) |
p03252 | s320491966 | Accepted | import sys
from collections import Counter
input = sys.stdin.readline
def main():
S = input().rstrip()
T = input().rstrip()
c_S = Counter(S)
c_T = Counter(T)
count_S = list(c_S.values())
count_T = list(c_T.values())
count_S.sort()
count_T.sort()
is_same = True
for s, t in zip... |
p02795 | s537905761 | Wrong Answer | h = int(input())
w = int(input())
k = int(input())
a = (k // (max(h, w) - 1))
print(a + 1) |
p03852 | s227154330 | Accepted | c=input()
b_list=["a","i","u","e","o"]
if c in b_list:
print("vowel")
else:
print("consonant") |
p03262 | s196487979 | Accepted | n,X = map(int,input().split())
Xs = list( map(int,input().split()))
import fractions
gcd = fractions.gcd
ans = abs(Xs[0] -X)
for x in Xs:
ans = gcd(ans,abs(X-x))
print(ans)
|
p03086 | s404648104 | Accepted | import re
S = str(input())
acgt = re.compile(r"[A,C,G,T]*")
s = re.findall(acgt, S)
print(max(map(len,s))) |
p02779 | s068878800 | Accepted | n = int(input())
a = set(map(int, input().split()))
print('YES' if n == len(a) else 'NO') |
p02823 | s688947039 | Wrong Answer | N, A, B = map(int, input().split())
if abs(A-B)%2 == 0:
print(abs(A-B)//2)
else:
if A - 1 <= N - B:
print((A-1) + (B-1)//2)
else:
print((N-B) + (N-A-1)//2)
|
p02909 | s999302588 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
s = input().rstrip()
print("Cloudy" if s == "Sunny" else "Sunny" if s == "Rainy" else "Rainy")
if __name__ == '__main__':
resolve()
|
p02553 | s442410901 | Wrong Answer | a,b,c,d=map(int,input().split())
M=0
if a>0:
if d<0:
M=a*d
else:
M=b*d
if a<=0 and b>0:
if d<=0:
M=a*c
if d>0:
if c<0:
M=max(b*d,a*c)
else:
M=b*d
else:
if c>0:
M=b*c
else:
M=a*c
print(M)
|
p03730 | s598951822 | Accepted | a, b, c = map(int, input().split())
for i in range(1, b+1):
if a*i % b == c:
print('YES')
exit()
print('NO') |
p03815 | s097685133 | Accepted | x = int(input())
cnt = (x // 11) * 2
if x % 11 == 0:
print(cnt)
elif x % 11 <= 6:
print(cnt + 1)
else:
print(cnt + 2) |
p03860 | s034158082 | Wrong Answer | s=str(input())
print('A'+s[0]+'C')
|
p03951 | s692016528 | Accepted | n = int(input())
s = input()
t = input()
c = 0
for i in range(1,n+1):
f = True
for j in range(i):
if s[n-i+j]!=t[j]:
f = False
if f:c=i
print(n*2-c)
|
p03962 | s979166619 | Accepted | print(len(set(input().split()))) |
p02689 | s185063294 | Accepted | import sys
input = sys.stdin.readline
# C - Peaks
def get_index(s):
return int(s) - 1
n, m = map(int, input().split())
h = list(map(int, input().split()))
rivals = [0] * n
for i in range(m):
a, b = map(get_index, input().split())
rivals[a] = max(rivals[a], h[b])
rivals[b] = max(rivals[b], h[a])
ans = 0
for... |
p03495 | s800068142 | 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
E = sorted(D.values(), reverse=True)
c = 0
i = 0
l = len(D)
while l > K:
if (K - l) in D.values():
c += K - c
l -= K - c
else:
c += E[-... |
p02608 | s230169037 | Accepted | import itertools
N = int(input())
tbl = [0]*N
for x in range(1,N):
for y in range(1,N):
for z in range(1,N):
p = x*x + y*y + z*z + x*y + y*z + z*x
if p > N:
break
tbl[p-1] += 1
for i in range(N):
print(tbl[i])
|
p03862 | s366237290 | Accepted | n,x = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(0, n-1):
if a[i] + a[i+1] > x:
ooi = a[i] + a[i+1] - x
if ooi < a[i+1]:
a[i+1] -= ooi
else:
a[i] -= (ooi-a[i+1])
a[i+1] = 0
ans += ooi
print(ans) |
p03438 | s591170891 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ope = sum(b) - sum(a)
var = 0
for i in range(n):
if a[i] >= b[i]:
var += a[i] - b[i]
else:
var += (b[i] - a[i])%2
if (ope-var)%2 == 0 and ope >= var:
print('Yes')
else:
print('No')
|
p03548 | s267638649 | Accepted | x,y,z = map(int,input().split())
long = x-z
f = y+z
ans , b = divmod(long,f)
print(ans)
|
p02693 | s258717207 | Accepted | K=int(input())
A,B=map(int, input().split())
ok=0
for i in range(A, B+1):
if i % K == 0:
print('OK')
ok=1
break
if ok==0:
print('NG') |
p02879 | s729431731 | Wrong Answer | a, b = list(map(int, input().split()))
print(a * b)
|
p02771 | s612615405 | Accepted | A, B, C = [int(_) for _ in input().split()]
if A == B == C:
ans = 'No'
elif A == B or B == C or C == A:
ans = 'Yes'
else:
ans = 'No'
print(ans)
|
p04043 | s107442013 | Accepted | a = list(map(int, input().split()))
if a.count(5) == 2 and a.count(7) == 1:
print('YES')
else:
print('NO') |
p02787 | s261270274 | Accepted | import sys
h, n = map(int, input().split())
# A = [0] * n
# B = [0] * n
# for i in range(n):
# A[i], B[i] = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(n)]
min_hp = h
max_hp = h + max(a for a, b in (AB))
dp = [sys.maxsize] * (max_hp + 1)
dp[0] = 0
for i in range(1, max_hp + 1)... |
p03455 | s274321009 | Accepted | a, b = map(int,input().split())
ans = a * b
if ans % 2 == 1:
print("Odd")
else:
print("Even") |
p02546 | s805231382 | Accepted | S = input()
if S[-1] == 's':
print(S + 'es')
else:
print(S + 's') |
p02861 | s716356016 | Accepted | import numpy as np
N = int(input())
xy = [list(map(int, input().split(" "))) for i in range(N)]
L = 0
for i in range( N ):
for j in range( N ):
a = xy[i][0]-xy[j][0]
b = xy[i][1]-xy[j][1]
l = np.sqrt( a**2 +b**2)
L += l
print(L/N)
|
p03319 | s876961383 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
i = A.index(1)
j = K-1
l = i
r = N - l - 1
ans, e = divmod(l, j)
if e:
ans += 1
r -= K - e - 1
ans += (r+j-1)//j
print(ans) |
p03359 | s099301501 | Accepted | a,b=map(int,input().split())
if a<=b:
print(a)
else:
print(a-1) |
p03163 | s057131034 | Accepted | n, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
w, v = list(map(int, input().split()))
for j in range(W + 1):
if w > j:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j - w] + v, dp[i - 1][j])
print(dp[n]... |
p02657 | s527640715 | Accepted | a,b = map(int, input().split())
print(a*b) |
p03163 | s636180870 | Accepted | N, W = map(int, input().split())
wv = []
for _ in range(N):
wv += list(map(int, input().split()))
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(N):
for w in range(W+1):
if w-wv[2*i] >= 0:
dp[i+1][w] = max(dp[i+1][w], dp[i][w-wv[2*i]]+wv[2*i+1])
dp[i+1][w] = max(dp[i+1][w], dp[i][... |
p02712 | s744756485 | Accepted | n = int(input())
ans = 0
for x in range(n + 1):
if x % 3 == 0 or x % 5 == 0:
pass
else:
ans += x
print(ans) |
p04034 | s614805499 | Accepted | n,m=map(int,input().split())
a=[1]*(n+1)
b=[0]*(n+1)
b[1]=1
for _ in range(m):
x,y=map(int,input().split())
a[x]-=1
a[y]+=1
if b[x]:b[y]=1
if a[x]==0:b[x]=0
print(sum(b)) |
p02958 | s754606949 | Accepted | n = int(input())
p = list(map(int, input().split()))
a = [i for i in range(1, n+1)]
cnt = 0
for j in range(n):
if p[j] != a[j]:
cnt += 1
if cnt <= 2:
print("YES")
else:
print("NO") |
p02796 | s389129179 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter
# 区間スケジューリング
N = int(readline())
m = map(int,read().split())
XL = zip(m,m)
LR = [(x-l,x+l) for x,l in XL]
LR.sort(key = itemgetter(1))
INF = 10 ** 18
prev_R = -INF
cnt... |
p02802 | s481749847 | Accepted | N, M = map(int, input().split())
no = [0] * (N + 1)
ok = 0
x = 0
for i in range(M):
p, s = input().split()
p = int(p)
if s == 'AC' and no[p] != -1:
ok += 1
x += no[p]
no[p] = -1
elif s == 'WA' and no[p] != -1:
no[p] += 1
print(ok, x)
|
p03721 | s628245242 | Wrong Answer | list = []
a_list = []
b_list = []
n,k = map(int,input().split())
for i in range(n):
a,b = map(int,input().split())
a_list.append(a)
b_list.append(b)
for i in range(len(a_list)):
for j in range(b_list[i]):
list.append(a_list[i])
print(list[k-1])
|
p03487 | s794308628 | Accepted | from collections import *
N = int(input())
C = Counter(list(map(int,input().split())))
ans = 0
for k,v in C.items():
if k<v:
ans+=v-k
elif v<k:
ans+=v
print(ans) |
p03627 | s278688510 | Wrong Answer | from collections import Counter
n=int(input())
a=Counter(list(map(int,input().split()))).most_common()
x=[0,0]
for i in range(len(a)):
if (x[1]<=a[i][0] or x[0]<=a[i][0]) and a[i][1]>=2:
if x[0]<x[1]:
x[0]=a[i][0]
else:
x[1]=a[i][0]
print(x[0]*x[1])
|
p02642 | s213477099 | Wrong Answer | n = int(input())
p = list(map(int,input().split()))
p.sort(reverse=True)
count=0
for i in range(len(p)):
for j in reversed(range(i+1,len(p))):
if p[i]%p[j] ==0:
break
if j == len(p)-1:
count +=1
if count >=1:
print(count+1)
else:
print(count) |
p02778 | s593777596 | Accepted | S = input()
l = []
for i in range(len(S)):
l.append('x')
print(''.join(l))
|
p02627 | s566624098 | Wrong Answer | a = input()
if (str.isupper(a)):
print("A")
else:
print(a) |
p02995 | s699210921 | Accepted | from fractions import gcd
a,b,c,d = map(int, input().split())
l = c*d // gcd(c, d)
x = (a-1) - (a-1)// c - (a-1) // d + (a-1) // l
y = b - b // c - b // d + b //l
print(y - x) |
p02797 | s625455078 | Accepted | n,k,s = map(int,input().split())
if s >= 10**9:
ans = [1]*n
else:
ans = [10**9] * n
for i in range(k):
ans[i] = s
print(*ans) |
p02995 | s002482126 | Wrong Answer | from fractions import gcd
def lcm(x, y):
return (x * y) // gcd(x, y)
def solve():
A,B,C,D = map(int, input().split())
c = B//C - A//C
if A % C == 0:
c += 1
d = B//D - A//D
if B % C == 0:
d += 1
r = lcm(C,D)
e = B//r - A//r
ans = (B-A+1) - (c+d-e)
if ans < 0:
... |
p02994 | s447556960 | Accepted | N, L = map(int, input().split())
diff_min = 100 + 200 - 1
apples = list()
remove_apple = 0
for i in range(N):
taste = L + i
apples.append(taste)
if abs(taste) < diff_min:
diff_min = abs(taste)
remove_apple = taste
print(sum(apples) - remove_apple)
|
p04011 | s429244655 | Accepted | def main():
staying_days, first_night, first_cost, latter_cost = [int(input()) for _ in range(4)]
print(min(staying_days, first_night) * first_cost + max(0, staying_days - first_night) * latter_cost)
if __name__ == '__main__':
main()
|
p02730 | s475304072 | Accepted | def isKaibun(str):
result = True
for i in range(len(str)-1//2):
if str[i] != str[-i-1]:
result = False
break
return result
S = input().strip()
#N, M = list(map(int, input().strip().split()))
result = 'No'
N = len(S)
"""
print(S[0:(N-1)//2])
print(isKaibun(S[0:(N-1)//2]))
print(S[(N+3)//2-1::])
pr... |
p02695 | s811513024 | Accepted | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from itertools import combinations_with_replacement
def main():
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(Q)]
result = 0
for C in combinations_with_replacement(range(1, M + 1), N):
tmp = sum([d for... |
p03387 | s323949522 | Accepted | a, b, c = map(int,input().split())
count = 0
#偶奇を一致させる
if a % 2 == b % 2 == c % 2:
count = 0
elif a % 2 == b % 2 != c % 2:
count += 1
a += 1
b += 1
elif b % 2 == c % 2 != a % 2:
count += 1
b += 1
c += 1
elif a % 2 == c % 2 != b % 2:
count += 1
a += 1
c += 1
maxnum = max(a, b, ... |
p03038 | s589306869 | Wrong Answer | n,m=map(int,input().split())
a=list(map(int,input().split()))
for i in range(m):
b,c=map(int,input().split())
a.append(b)
a.append(c)
a=sorted(a)[::-1]
ans=0
for i in range(n):
ans+=a[i]
print(ans) |
p03971 | s453618076 | Accepted | from sys import stdin
from math import ceil, floor
n, a, b = [int(x) for x in stdin.readline().rstrip().split()]
s = list(stdin.readline().rstrip())
c = a + b
d = 0
e = 0
for i in range(n):
if d < c and s[i] == "a":
print("Yes")
d += 1
elif d < c and e < b and s[i] == "b":
print("Yes")
... |
p03760 | s693842782 | Wrong Answer | O = input()
E = input()
x = []
for i,j in zip(O,E):
x.extend(i+j)
print("".join(x)) |
p03087 | s175262355 | Wrong Answer | N, Q = map(int, input().split())
S = input()
lr = [list(map(int, input().split())) for _ in range(Q)]
ans = [0 for _ in range(N+10)]
for i in range(1, N):
if S[i-1:i+1] == "AC":
ans[i] += 1
ans[i] += ans[i-1]
print(ans)
for l, r in lr:
l -= 1
r -= 1
print(ans[r] - ans[l]) |
p03785 | s983412542 | Accepted | n,c,k,*t=map(int,open(0).read().split())
t=sorted(t)
cnt=0
ans=1
x=t[0]
for i in range(n):
cnt+=1
if t[i]-x>k or cnt>c:
x=t[i]
ans+=1
cnt=1
print(ans) |
p03286 | s748199532 | Accepted | import sys
def base_convert(n, b):
if not n: return 0
res = ''
while n:
n, r = divmod(n, b)
if r < 0: n += 1; r -= b
res += str(r)
return int(res[::-1])
n = int(sys.stdin.readline().rstrip())
def main():
print(base_convert(n, -2))
if __name__ == '__main__':
main() |
p03543 | s175031529 | Accepted | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = input().strip()
if N[0] == N[1] == N[2]:
return "Yes"
if N[1] == N[2] == N[3]:
return "Yes"
return "No"
if __name__ == "__main__":
print(main())
|
p03494 | s162710557 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
flag = True
while flag:
ans = []
for i in a:
if i % 2 == 1:
flag = False
else:
ans.append(i/2)
if len(ans) == n:
cnt += 1
a = ans
print(cnt) |
p03565 | s223934440 | Accepted | s=input()
t=input()
l=[]
import sys
if len(t)>len(s):
import sys
print("UNRESTORABLE")
exit()
for i in range(len(s)-len(t)+1):
z=s[:i]
for j in range(i,i+len(t)):
if s[j]!=t[j-i] and s[j]!="?":
break
else:
z+=t[j-i]
else:
z+=s[i+len(t):]
l.append(z.replace("?","a"))
l.sort()
p... |
p04012 | s778471797 | Wrong Answer | w = list(input())
w = sorted(w)
flag = True
for i in range(0,len(w)-1,2):
if w[i]!=w[i+1]:
flag = False
break
if flag:
print('Yes')
else:
print('No') |
p02766 | s274207248 | Accepted | N, K = list(map(int, input().split()))
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
print(len(Base_10_to_n(N,K))) |
p03821 | s740604718 | Wrong Answer | n = int(input())
a,b=[],[]
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
a=list(reversed(a))
b=list(reversed(b))
OK=0
for i in range(n):
A=a[i]+OK
if A<b[i]:
ok=b[i]-A
elif A==b[i]:
continue
else:
ok=-(-A//b[i])*b[i]-A
OK+=ok
print(... |
p03799 | s820285802 | Accepted | # 2020/05/01
# AtCoder Regular Contest 069 - C
# Input
n, m = map(int,input().split())
# c is c
if n >= 2 * m:
ans = int(m / 2)
else:
if n < m:
ans = n + int(max(0, (m - n * 2)) / 4)
else:
ans = int(m / 2)
# Output
print(ans)
|
p02595 | s752750993 | Accepted | n,d = map(int, input().split())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
if (xy[i][0]**2) + (xy[i][1]**2) <= d**2:
ans += 1
print(ans) |
p02759 | s253455746 | Accepted | N = int(input())
print((N + 1)//2) |
p03086 | s830988542 | Accepted | s=input()
ans=0
for i in range(len(s)):
for j in range(i,len(s)+1):
if s[i:j].count("A")+s[i:j].count("T")+s[i:j].count("C")+s[i:j].count("G")==len(s[i:j]):
ans=max(ans,len(s[i:j]))
print(ans) |
p03211 | s231401396 | Accepted | def main():
S = input()
N = len(S)
min_d = 10 ** 9
for i in range(N - 2):
d = abs(int(S[i: i + 3]) - 753)
min_d = min(d, min_d)
print(min_d)
main()
|
p03827 | s784150751 | Wrong Answer | n = int(input())
s = str(input())
x = 0
lst = []
for i in range(len(s)):
if s[i]=='I':
x += 1
else:
x -= 1
lst.append(x)
print(max(lst)) |
p03261 | s079752458 | Accepted | N = int(input())
words = []
ans = "Yes"
for count in range(N):
word = input()
if count == 0:
words.append(word)
next = word[-1]
continue
if next != word[0]:
ans = "No"
if words.count(word) == 1:
ans = "No"
words.append(word)
next = word[-1]
print(ans) |
p03971 | s595204011 | Wrong Answer | N,A,B=map(int,input().split())
S=input()
cnt_a=0
cnt_b=0
for i in range(N):
if cnt_a<A+B:
if S[i]=='a':
cnt_a+=1
print('Yes')
elif S[i]== 'b' and cnt_b<B:
cnt_b+=1
print('Yes')
else:
print('No')
else:
print('No') |
p02555 | s890476791 | Accepted | MOD = 10**9+7
MAXN = 2000
fact = [1]
ifact = [1]
for i in range(MAXN):
fact.append(fact[-1] * (i+1) % MOD)
ifact.append(pow(fact[-1], MOD-2, MOD))
def nCr(n, r):
return fact[n] * ifact[r] * ifact[n-r] % MOD
def nPr(n, r):
return fact[n] * ifact[n-r] % MOD
s = int(input())
n = s//3
ans = 0
for i in ra... |
p02778 | s305861081 | Accepted | s=input()
for i in range(len(s)-1):
print("x",end="")
print("x") |
p02820 | s015407564 | Wrong Answer | n,k=map(int,input().split())
r,s,p=map(int,input().split())
t = input()
d = [0]*2*10**5
for i in range(n):
if t[i] == 'r':
d[i] = p
if t[i] == 's':
d[i] = r
if t[i] == 'p':
d[i] = s
for i in range(n):
if d[i] == d[k+i]:
d[k+i] = 0
print(sum(d)) |
p02760 | s128826339 | Accepted | ary=[list(map(int,input().split()))for p in range(3)]
for i in range(int(input())):
data=int(input())
for j in range(3):
for k in range(3):
if ary[j][k]==data:
ary[j][k]=0
ans="No"
for i in range(3):
if ary[i][0]==ary[i][1]==ary[i][2]==0 or ary[0][i]==ary[1][i]==ary[2][i]==0:
ans="Yes"
i... |
p03160 | s549032438 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [None]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2, n):
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print(dp[n-1])
|
p02838 | s441854871 | Accepted | N=int(input())
M=10**9+7
A=[int(x) for x in input().split()]
ans=p=0
for i in range(60):
one=sum([a>>p&1 for a in A])
zero=N-one
p+=1
ans+=(one*zero)*2**i
ans%=M
#print(one,zero)
print(ans) |
p03131 | s000771863 | Accepted | k, a, b = map(int, input().split())
k += 1
cnt = k - (a + 2)
if b - a > 2 and cnt >= 0:
ans = b + (b - a)*(cnt//2) + cnt%2
else:
ans = k
print(ans) |
p02602 | s448763372 | Accepted | N, K = map(int, input().split())
A_list = list(map(int, input().split()))
for i in range(K, N):
if A_list[i - K] < A_list[i]:
print("Yes")
else:
print("No")
|
p02597 | s219715224 | Accepted | import sys
input = sys.stdin.readline
N=int(input())+2
C="R"+input().strip()+"W"
W=[0]*(N+1)
R=[0]*(N+1)
for i in range(N):
if C[i]=="W":
W[i]=W[i-1]+1
else:
W[i]=W[i-1]
for i in range(N-1,-1,-1):
if C[i]=="R":
R[i]=R[i+1]+1
else:
R[i]=R[i+1]
ANS=1<<30
for i in range... |
p03262 | s421836961 | Wrong Answer | import math
n, x = map(int, input().split())
X = sorted(list(map(int, input().split())))
dis = [0] * (n-1)
xdis = 0
for i in range(n-1):
dis[i] = X[i+1] - X[i]
if X[i] <= x <= X[i+1]:
xdis = min(abs(x-X[i]), abs(X[i+1]-x))
if n == 1:
print(X[0]-x)
reg = xdis
for i in range(n-1):
reg... |
p03804 | s640799788 | 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(N-M+1):
flg = True
for k in range(M):
for l in range(M):
flg = flg & (B[k][l] == A[i+k][j+l])
if flg:
ans = ... |
p02729 | s918269813 | Accepted | i = input().split(" ")
a,b = int(i[0]),int(i[1])
print(int(a*(a-1)/2+b*(b-1)/2)) |
p03860 | s965978574 | Wrong Answer | print("AtCoder A{}C Contest".format(input()[0])) |
p02689 | s671198435 | Accepted | N, M = map(int, input().split())
Hs = input().split()
lis = []
for i in range(N):
lis.append([])
for m in range(M):
A, B = map(int, input().split())
lis[A-1].append(B-1)
lis[B-1].append(A-1)
score = 0
for i in range(N):
break_flag = 0
base_h = int(Hs[i])
#print('base',base_h)
hikaku = lis[i]
#print(... |
p03861 | s032484678 | Accepted | def solve(a, b, x):
def f(n):
if n == -1:
return 0
return n // x + 1
print(f(b) - f(a - 1))
T = list(map(int, input().split()))
solve(T[0], T[1], T[2])
|
p03951 | s471470540 | Accepted | N=int(input())
S=input()
T=input()
dup=0
for d in range(N+1):
# print(d)
flag=True
for i in range(N-d):
if T[i]!=S[d+i]:
# print(T[i],S[d+i])
flag=False
break
if flag:
dup=N-d
break
print(2*N-dup)
|
p03419 | s018573648 | Accepted | n, m = [int(x) for x in input().split()]
print(1 if n == 1 and m == 1 else m - 2 if n == 1 else n - 2 if m == 1 else (n - 2) * (m - 2)) |
p03565 | s234416945 | Accepted | import re
S = input()
T = input()
flag = False
for i in range(len(S) - len(T), -1, -1):
pattern = S[i:i+len(T)].replace('?', '.')
m = re.search(pattern, T)
if m:
# result = re.sub(pattern, T, S)
result = S[:i] + T + S[i+len(T):]
flag = True
break
if flag > 0 :
output =... |
p02624 | s694124987 | Accepted | def main():
N=int(input())
ANS=0
for i in range(1,N+1):
ANS+=i*(N//i*(N//i+1)//2)
print(ANS)
main() |
p03377 | s931888472 | Accepted | a, b, x = map(int, input().split())
if x < a:
print('NO')
elif x-a <= b:
print('YES')
else:
print('NO') |
p02639 | s545071387 | Accepted | a,b,c,d,e=map(int,input().split())
if a==0:
print(1)
elif b==0:
print(2)
elif c==0:
print(3)
elif d==0:
print(4)
else:
print(5) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.