problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03625 | s956277061 | Accepted | from collections import Counter
N = int(input())
stics = [int(i) for i in input().split()]
c = Counter(stics)
cnt = [k for k, v in c.items() if v >= 2]
if len(cnt) < 2:
print(0)
else :
cnt = sorted(cnt, reverse=True)
if c[cnt[0]] >= 4:
print(cnt[0] * cnt[0])
else :
print(cnt[0] * cnt[1]) |
p02691 | s074696499 | Accepted | import collections
def main():
N = int(input())
A = list(map(int, input().split()))
B = [a+i for i, a in enumerate(A)]
C = [a-i for i, a in enumerate(A)]
c = collections.Counter(C)
ans = 0
for b in B:
ans += c.get(-b, 0)
print(ans)
if __name__ == '__main__':
main() |
p02792 | s892346965 | Wrong Answer | N = int(input())
print((N // 10) ** 2 + N % 5 + 8) |
p03862 | s089659234 | Accepted | import copy
N,x = map(int,input().split())
a = list(map(int,input().split()))
b = copy.deepcopy(a)
ans = 0
if a[0]>x:
ans+=a[0]-x
a[0] = x
for i in range(N-1):
if a[i]+a[i+1]>x:
ans += (a[i]+a[i+1])-x
a[i+1] -= (a[i]+a[i+1])-x
print(ans) |
p02994 | s530787436 | Accepted | n,l=map(int,input().split())
m=[]
k=[]
for i in range(1,n+1):
m.append(l+i-1)
for j in range(len(m)):
k.append(abs(sum(m)-(sum(m)-m[j])))
for d in range(len(k)):
if min(k)==k[d]:
print(sum(m)-m[d]) |
p02660 | s999146810 | Accepted | n = int(input())
ans = 0
i = 2
num = n
while i * i <= n:
cnta = 0
cntb = 0
while num % i == 0:
num //= i
if cnta == cntb:
ans += 1
cnta = 0
cntb += 1
else:
cnta += 1
i += 1
if (ans == 0 and n != 1) or num != 1:
ans += 1
print(ans)
|
p03835 | s057219617 | Accepted | k, s = map(int, input().split())
c = 0
for x in range(min(s, k)+1):
for y in range(min(s-x, k)+1):
if s-x-y <= k:
c += 1
print(c) |
p02732 | s270151928 | Accepted | from collections import Counter
n = int(input())
A = list(map(int,input().split()))
Acount = Counter(A)
total = 0
for key in Acount.keys():
total += Acount[key] * (Acount[key] - 1) // 2
for i in range(n):
tmp = total
tmp -= Acount[A[i]]*(Acount[A[i]]-1) // 2
tmp += (Acount[A[i]]-1)*(Acount[A[i]]-2) // 2
print(tmp) |
p02768 | s016630954 | Accepted | n,a,b = map(int,input().split())
mod = 10**9 + 7
def comb(n:int,k:int,MOD:int):
"""return nCk (mod MOD)
"""
nCk = 1
for i in range(n-k+1, n+1):
nCk *= i
nCk %= MOD
for i in range(1,k+1):
nCk *= pow(i,MOD-2,MOD)
nCk %= MOD
return nCk
all = pow(2,n,mod)-1
comb_a = comb(n,a,mod)
comb_b = comb(n,b,mod)
answer = (all -comb_a -comb_b) % mod
print(answer) |
p02833 | s995923853 | Wrong Answer | N = int(input())
if N%2 == 1 or N == 0:
print(0)
else:
print(N//10) |
p03434 | s420850956 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a.sort()
Alice = list()
Bob = list()
print(a)
for i in range(n):
if i % 2 == 0:
Alice.append(a[i])
else:
Bob.append(a[i])
print(sum(Alice) - sum(Bob))
|
p02785 | s956164833 | Wrong Answer | H,K=map(int,input().split())
H=list(map(int,input().split()))
H.sort()
print(sum(H[0:len(H)-K+1])) |
p02780 | s978561991 | Accepted | import numpy as np
N, K = map(int, input().split())
P = list(map(int, input().split()))
# N, K = 10, 4
# P = [17, 13, 13, 12, 15, 20, 10, 13, 17, 11]
exp = []
for i in range(N):
exp.append((1 + P[i]) / 2)
cum_exp = np.cumsum(exp)
max = cum_exp[K-1]
for i in list(range(K, N)):
val = cum_exp[i] - cum_exp[i - K]
if val > max:
max = val
print(max)
|
p02786 | s330268145 | Accepted | def f(x):
if x == 1:
return 1
return 2 * f(x // 2) + 1
H = int(input())
print(f(H))
|
p03387 | s130702852 | Accepted | from math import ceil
A,B,C=map(int, input().split())
L=sorted([A,B,C])
n1=L[0]
n2=L[1]
n3=L[2]
fir=ceil((n2-n1)/2)
if n1+2*fir!=n2:
sec=1
else:
sec=0
ans=n3+sec-(n1+2*fir)+fir+sec
print(ans)
#print(fir, sec)
#6+1-(4) |
p03041 | s402723931 | Accepted | N, K = map(int, input().split())
s = list(input())
s[K - 1] = s[K - 1].lower()
print(''.join(s)) |
p02777 | s792017335 | Accepted | a,b=map(str,input().split())
a_num,b_num=map(int,input().split())
delete_one=input()
if a==delete_one:
a_num-=1
else:
b_num-=1
print(a_num,b_num)
|
p03437 | s399587308 | Accepted | x,y=map(int,input().split())
print(-(x%y==0) or x) |
p02817 | s735639702 | Accepted | S,T=input().split()
print(T+S) |
p02663 | s267248385 | Wrong Answer | H1,M1,H2,M2,K=map(int, input().split())
M1 += H1*60
M2 += H2*60
out = int((M2-M1-1)/K)
print(out*K) |
p03854 | s323106523 | Wrong Answer | from collections import deque
s = input()
q = deque(list(s))
while q:
if len(q) >= 5:
subs = q.popleft()+q.popleft()+q.popleft()+q.popleft()+q.popleft()
if subs != 'erase' and subs != 'dream':
print('NO')
exit()
if subs == 'erase' and len(q) != 0 and q[0] == 'r':
q.popleft()
else:
print('NO')
exit()
print('YES') |
p03211 | s096236861 | Accepted | s = list(map(int,input()))
ans = 10**12
for i in range(len(s)-2):
x = s[i]*100+s[i+1]*10+s[i+2]
ans = min(ans,abs(x-753))
print(ans) |
p02970 | s855506203 | Accepted | n,d = map(int, input().split())
x = 2*d + 1
print((n+x-1)//x) |
p02603 | s243865490 | Accepted | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
dp = [0] * (N + 1)
dp[0] = 1000
for i in range(1, N + 1):
dp[i] = dp[i - 1]
for j in range(1, i):
dp[i] = max(dp[i], (dp[j] // A[j - 1]) * A[i - 1] + dp[j] % A[j - 1])
print(dp[N])
if __name__ == '__main__':
input = sys.stdin.readline
N = int(input())
*A, = map(int, input().split())
main(N, A)
|
p03145 | s008851426 | Accepted | l = list(map(int,input().split()))
l.remove(max(l))
print(int(l[0]*l[1]/2)) |
p02726 | s557486823 | Accepted | n,x,y=map(int,input().split())
x-=1
y-=1
k=[0]*n
for i in range(n-1):
for j in range(i+1,n):
m=min(j-i,abs(i-x)+1+abs(y-j))
k[m]+=1
for i in range(1,n):print(k[i])
|
p03211 | s909030357 | Accepted | S=input()
ans=10**5
for i in range(len(S)-3+1):
t=S[i:i+3]
ans=min(ans,abs(753-int(t)))
print(ans) |
p03075 | s754526575 | Accepted | a, b, c, d, e, k = [int(input()) for _ in range(6)]
print('Yay!' if e - a <= k else ':(')
|
p03345 | s329372588 | Wrong Answer | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7
A,B,C,K = I()
num = abs(A-B)
if num > 10**18:
print('Unfair')
else:
print(num) |
p03285 | s498702775 | Accepted | n=int(input())
flag=True
for i in range(26):
for j in range(16):
if 4*i+7*j==n:
print("Yes")
flag=False
exit()
if flag:
print("No") |
p03407 | s799106825 | Accepted | a,b,c = map(int,input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p03000 | s693433833 | Accepted | # B - Bounding
N, X = map(int, input().split())
L = [int(l) for l in input().split()]
D = 0
cnt = 1
for i in range(N):
D = D + L[i]
if D <= X:
cnt += 1
print(cnt)
|
p03407 | s428916922 | Wrong Answer | a, b, c = [int(x) for x in input().split()]
if 2 * (a + b) >= c:
print('Yes')
else:
print('No') |
p02596 | s660911510 | Accepted | import sys
K = int(input())
if K%2 == 0 or K%5 == 0:
print(-1)
sys.exit()
dp = 7
ans = 1
while(ans <= 10000000):
if dp % K == 0:
print(ans)
sys.exit()
ans += 1
dp = (dp * 10 + 7) % K |
p02779 | s385866183 | Accepted | def has_duplicates(seq):
return len(seq) != len(set(seq))
n =int(input())
a =list(map(int, input().split()))
flg = has_duplicates(a)
if not flg:
print('YES')
else:
print('NO') |
p03814 | s543148097 | Accepted | s = input()
n = 0
m = 0
for i in range(len(s)):
if s[i] == 'A':
n = i
break
for i in reversed(range(len(s))):
if s[i] == 'Z':
m = i
break
print(m-n+1) |
p02993 | s136434179 | Wrong Answer | s = str(input())
t = set([s[0], s[1], s[2], s[3]])
if len(t)<4:
print('Bad')
else:
print('Good') |
p04029 | s080529094 | Wrong Answer | N = int(input())
ans = N*(N-1)/2
print(int(ans)) |
p02547 | s453116492 | Wrong Answer | N = int(input())
sub_yes = 0
max_yes = 0
for i in range(N):
d1,d2 = map(int,input().split())
if d1 == d2:
sub_yes += 1
if sub_yes > max_yes:
max_yes = sub_yes
else:
if sub_yes > max_yes:
max_yes = sub_yes
sub_yes = 0
if max_yes >= 3:
print("yes")
else:
print("no") |
p03377 | s934569234 | Accepted | # coding: utf-8
A, B, X = map(int, input().split())
# print(A, B, X)
if X - A >= 0 and B >= X - A:
print('YES')
else:
print('NO')
|
p02602 | s525309599 | Wrong Answer | # 初期入力
import sys
input = sys.stdin.readline #文字列では使わない
N,K = map(int, input().split())
A = list(map(int, input().split()))
aa =1
DP =[0]*(N-K+1)
for i in A[:K]:
aa *=i
DP[0] =aa
for i in range(N -K):
DP[i+1] =DP[i]*A[i+K]//A[i]
if DP[i+1] >DP[i]:
print("Yes")
else:
print("No")
print(DP) |
p02691 | s560966362 | Accepted | from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
input = sys.stdin.readline
def inp():
return int(input())
def inpl():
return list(map(int, input().split()))
N = inp()
aa = inpl()
ajs = []
ais = []
for i, a in enumerate(aa):
ajs.append(a - i)
ais.append(-a - i)
cnt = defaultdict(int)
ans = 0
for ai, aj in zip(ais, ajs):
ans += cnt[aj]
cnt[ai] += 1
print(ans)
|
p02860 | s383221356 | Accepted | n=int(input())
s=input()
ans='No'
if n%2==0:
if s[:n//2]==s[n//2:]:
ans='Yes'
print(ans)
|
p02706 | s657261989 | Accepted | a=input().split(' ')
#print(a[0])
b=int(a[0])
d=int(a[1])
c=input().split(' ')
count=0
for i in c:
count+=int(i)
#print(count)
if b-count>=0:
print(b-count)
else:
print(-1) |
p03821 | s791216754 | Wrong Answer | N = int(input())
AB = [list(map(int,input().split())) for _ in range(N)]
AB.reverse()
count = 0
for a,b in AB:
num_a = a + count
if num_a%b != 0 or num_a == 0:
count += (b - (num_a % b))
else:
pass
print(count) |
p02754 | s998037140 | Wrong Answer | s = input()
ss = s.split(" ")
N = int(ss[0])
A = int(ss[1])
B = int(ss[2])
if A == 0:
print(0)
elif B == 0:
print(N)
else:
if N <= ( A + B ) :
print(A)
else:
ans = 0
div = N //( A + B )
mod = N % ( A + B )
ans = div * A
if mod > A :
ans += A
else :
ans += mod
print(ans) |
p03077 | s722213411 | Accepted | n = int(input())
A = [int(input()) for _ in range(5)]
ans = (n - 1) // min(A) + 1 + 4
print(ans) |
p02744 | s436689187 | Accepted | # input
D = int(input())
S = ("a", "b", "c", "d", "e", "f", "g", "h", "i", "j")
# process
def f(x):
if x == 0:
return ["a"]
else:
t = f(x - 1)
r = []
for s in t:
num = len(set(list(s)))
for i in range(num+1):
r.append(s+S[i])
return r
ans = f(D-1)
# output
print(" ".join(map(str, ans)))
|
p03623 | s148456516 | Accepted | x,a,b=map(int,input().split())
print('A' if abs(a-x)<abs(b-x) else 'B')
|
p02911 | s157504393 | Accepted | n,k,q=map(int,input().split())
l=[0]*n
for i in range(q):
a=int(input())
l[a-1]+=1
for i in range(n):
if k-(q-l[i])>0:
print("Yes")
else:
print("No") |
p02683 | s956173778 | Wrong Answer | # ABC 167 C
N,M,X = map(int,input().split())
C =[]
for m in range(N):
C.append([int(i) for i in input().split()])
C.sort(key=lambda x:x[0])
from itertools import combinations
import numpy as np
ans = 10**5 +1
for m in range(1,N+1):
P=list(combinations(C,m))
tmp =np.sum(P,axis=1)
for t in tmp:
if min(t[1:])>=X and ans > t[0]:
ans = t[0]
if min(t[1:])<X:
print(-1)
else:
print(ans)
|
p03804 | s511135323 | Wrong Answer | n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(input())
for i in range(m):
b.append(input())
check = False
for i in range(n):
if b[0]in a[i]:
index=a[i].index(b[0])
check=True
for k in range(m):
if i+k>=n:
check=False
break
if not b[k]in a[i+k] or a[i+k].index(b[k])!=index:
check=False
break
if check:
break
print("Yes" if check else "No") |
p02784 | s807234784 | Accepted | # 2020/01/26
# AtCoder Beginner Contest 153 - A
# Input
h, n = map(int,input().split())
a = list(map(int,input().split()))
# Calc
sum = 0
for i in range(n):
sum = sum + a[i]
if sum >= h:
ans = "Yes"
else:
ans = "No"
# Output
print(ans)
|
p02973 | s386828027 | Accepted | from bisect import bisect_right,bisect_left
n=int(input())
a=[int(input()) for _ in range(n)]
INF=float('INF')
l=[INF]*n
for i in a[::-1]:
l[bisect_right(l,i)]=i
print(bisect_left(l,INF)) |
p03625 | s296186895 | Wrong Answer | n = int(input())
a_L = list(map(int,input().split()))
import collections
L = collections.Counter(a_L)
L = sorted(L.items(),key=lambda x:x[0],reverse=True)
flag = 0
#print(L)
for k,v in L:
#print(k,v)
if v >= 2:
if flag== 0:
tmp = k
flag += 1
elif flag == 1:
print(tmp*k)
#print("ans",tmp,k)
exit()
print(0) |
p03106 | s030531671 | Accepted | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
a, b, k = na()
cnt = 0
ans = 0
for i in range(min(a, b), 0, -1):
if a % i == 0 and b % i == 0:
cnt += 1
if cnt == k:
ans = i
break
print(ans) |
p02661 | s631053880 | Accepted | import numpy as np
i4 = np.int32
nin = np.fromstring(open(0).read(), i4, sep=' ')
N = nin[0]
ab = nin[1:].reshape(-1, 2).T
a = np.sort(ab[0])
b = np.sort(ab[1])
i = N // 2
if N % 2:
print(b[i] - a[i] + 1)
else:
nmin = a[i - 1] + a[i]
nmax = b[i - 1] + b[i]
print(nmax - nmin + 1)
|
p02987 | s609878139 | Accepted | s=list(input())
for ss in s:
if s.count(ss)!=2:
print("No")
exit()
print("Yes")
|
p02838 | s437208394 | Wrong Answer | mod = pow(10,9)+7
N = int(input())
A =map(lambda x:int(bin(int(x))[2:]) ,input().split())
counter = 0
for a in A:
counter += a
A = str(counter)
L = len(A)
tmp = 0
for i in range(L):
tmp += int(A[i])*(N-int(A[i]))*(2**(L-i-1))
print(tmp%mod) |
p03456 | s389638428 | Accepted | import math
a = input("").split(" ")
a = [int(aa) for aa in a]
n = int(str(a[0])+str(a[1]))
r = math.sqrt(n)
if r**2 == int(r)**2:
print("Yes")
else:
print("No") |
p03449 | s383996613 | Wrong Answer | # 初期入力
import sys
input = sys.stdin.readline
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
count =[0]*N
for i in range(N-1):
count[i] =sum(A1[:i+1]) +sum(A2[i:])
print(max(count)) |
p02676 | s103263207 | Wrong Answer | K = int(input())
S = input()
if K > len(S):
print(S)
else:
print(S[:K+1]+'...')
|
p02918 | s776944661 | Accepted | n, k = map(int, input().split())
s = list(map(str, input().split()))[0]
ans = 0
w = 0
for i in range(n-1):
if s[i+1] == s[i]:
ans += 1
else:
w += 1
p = (w // 2) * [2] + (w % 2) * [1]
print(ans + sum(p[:k])) |
p03095 | s101596221 | Accepted | def main():
from collections import Counter
N = int(input())
S_count = Counter(input())
P = 10**9+7
ans = 1
for v in S_count.values():
ans *= v+1
ans %= P
print(ans-1)
main() |
p03994 | s696448802 | Wrong Answer | s = list(input())
k = int(input())
t = list(map(lambda x:ord(x)-ord("a"),s)) #a-zを0-25に正規化
for i in range(len(t)):
diff = 26-t[i] #aになるまでの差
if diff <= k:
t[i]+=diff
k-=diff
else:
continue
t[-1]+=k #k余りを一番最後に足す
#print("s:",s)
#print("t:",t)
u = "".join(list(map(lambda x:chr((x%26+ord("a"))),t)))
print(u) |
p02696 | s946470231 | Accepted | a, b, n = map(int, input().split())
x = min(b-1,n)
print((a*x)//b - a*(x//b)) |
p03109 | s986552375 | Accepted | print("Heisei"if input()<="2019/04/30" else "TBD") |
p04029 | s747949456 | Accepted | N = input()
N = int(N)
x = N
total = 0
while x >=1:
total += x
x = x - 1
else: print(total) |
p03331 | s803242450 | Accepted | N = int(input())
if N == 2:
print(2)
exit()
ans = float('inf')
for i in range(2,N):
A = i
B = N - i
tmp = 0
for k in str(A):
tmp += int(k)
for k in str(B):
tmp += int(k)
ans = min(ans,tmp)
print(ans) |
p02627 | s504193995 | Wrong Answer | n = input()
if n.isupper() == True:
print(n.lower())
elif n.islower() == True:
print(n.upper()) |
p03544 | s589140462 | Accepted | n = int(input())
r1 = 2
r2 = 1
if n == 1:
print(1)
exit()
else:
for _ in range(n-1):
r2 = r1 + r2
r1 = r2 - r1
print(r2)
|
p02917 | s022174087 | Accepted | n = int(input())
b = list(map(int,input().split()))
ans = 0
for i in range(n-2):
ans += min(b[i],b[i+1])
print(b[0] + ans + b[-1]) |
p04045 | s670385838 | Accepted | n,k=map(int,input().split())
d=list(map(int,input().split()))
for i in range(n,n*10+1):
for x in d:
if str(x) in str(i):
break
else:
print(i)
break
|
p03206 | s693254663 | Accepted | d = int(input())
if d == 25:
print('Christmas')
if d == 24:
print('Christmas Eve')
if d == 23:
print('Christmas Eve Eve')
if d == 22:
print('Christmas Eve Eve Eve')
|
p03469 | s229984478 | Accepted | s_17 = list(input())
s_18 = ''
for s in range(len(s_17)):
if (s == 3):
s_18 += '8'
else:
s_18 += s_17[s]
print(s_18) |
p02595 | s236525766 | Wrong Answer | n, d = map(int, input().split())
cnt = 0
for ti in range(n) :
x, y = map(int, input().split())
dist = (x**2 + y**2)**0.5
if(dist >= d):
cnt += 1
print(cnt) |
p02971 | s545061032 | Wrong Answer | import heapq
num = int(input())
a = [int(input()) for i in range(num)]
b = [max(a) for f in range(num)]
if sorted(a)[0] == sorted(a)[1]:
for j in b:
print(j)
else:
b[a.index(max(a))] = sorted(a)[1]
for j in b:
print(j)
|
p03161 | s382492502 | Wrong Answer | import math
from decimal import *
n, k = map(int, input().split())
nos = list(map(int, input().split()))
arr = [int(10e4)+1 for i in range(n)]
arr[0] = 0
if(n>1):
arr[1] = abs(nos[1]-nos[0])
for i in range(2, n):
for x in range(1, min(k, i)+1):
arr[i] = min(arr[i], abs(nos[i-x]-nos[i])+arr[i-x])
print(arr[n-1])
|
p02723 | s057159668 | Accepted | S = input()
if S[2]==S[3] and S[4]==S[5]:
print("Yes")
else:
print("No") |
p03067 | s800438902 | Accepted | a,b,c = map(int,input().split())
if a <= c <= b or (b <= c <= a):
print("Yes")
else:
print("No")
|
p02729 | s336723207 | Wrong Answer | n,m=map(int, input().split())
num1=n*(n-1)*0.5
num2=m*(m-1)*0.5 |
p04005 | s457174124 | Accepted | a = list(map(int, input().split()))
a.sort()
ans = a[0] * a[1]
for i in a:
if i % 2 == 0:
ans = 0
break
print(ans) |
p02880 | s159782458 | Wrong Answer | n = int(input())
for i in range(1,10):
for j in range(1,10):
if(i*j==n):
print("YES")
exit()
print("NO")
|
p02595 | s268419941 | Accepted | n, d = [int(e) for e in input().split()]
count = 0
for i in range(n):
x, y = [int(e) for e in input().split()]
if x * x + y * y <= d * d:
count += 1
print(count) |
p03319 | s927244624 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
min_ind = a.index(min(a))
l = min_ind
r = n - (min_ind + 1)
b, c = divmod(l, k-1)
d, e = divmod(r, k-1)
if c + e >= k-1:
print(math.ceil(l/(k-1)) + math.ceil(r/(k-1)) - 1)
else:
print(math.ceil(l/(k-1)) + math.ceil(r/(k-1))) |
p02783 | s463500418 | Accepted |
import math
H,A=map(int, input().split())
print(int(math.ceil(H/A))) |
p03105 | s337100554 | Accepted | import re
n = input()
m = re.search('(\d+)\s(\d+)\s(\d+)', n)
a = int(m.group(1))
b = int(m.group(2))
c = int(m.group(3))
i = b // a
if c <= i:
print(c)
else:
print(i)
|
p03131 | s801169353 | Wrong Answer | k, a, b = map(int, input().split())
if b - a < 2:
print(k + 1)
elif b - a > 2:
cnt = k - (a - 1)
print((b - a) * cnt // 2 + 1 * cnt % 2 + a) |
p02699 | s305361098 | Accepted | S,W = map(int, input().split())
if W >= S:
print('unsafe')
else:
print('safe') |
p02973 | s301734009 | Accepted | import bisect
N = int(input())
A = [int(input()) for _ in range(N)]
dp = [-1] * N
dp[N-1] = A[0]
ans = 0
for i in range(1, N):
target_index = bisect.bisect_left(dp, A[i])
dp[target_index-1] = A[i]
print(N - dp.count(-1)) |
p03387 | s304463598 | Accepted | a,b,c=map(int,input().split())
d=a+b+c
m=max(a,b,c)
if d%2==0:
if m%2==0:
m=m
else:
m=m+1
else:
if m%2==0:
m=m+1
else:
m=m
s=3*m
ans=s-d
ans//=2
print(ans) |
p02957 | s240029709 | Accepted | A, B = map(int, input().split())
if A % 2 != B % 2:
K = "IMPOSSIBLE"
else:
# B - K = - (A - K)
# 2K = B - A
K = int((B + A) / 2)
print(K)
|
p02778 | s400508547 | Wrong Answer | s=input()
for i in range(len(s)):
s[i]=="x"
print(s) |
p03719 | s904437066 | Wrong Answer | A,B,C = map(int,input().split())
#print(A,B,C)
if (C>=A) and (C<=B):
print("YES")
else:
print("NO")
|
p03131 | s759677673 | Accepted | k,a,b = map(int,input().split())
cokie = 1
if b < a:
cokie += k
print(cokie)
else:
if k < a-1 or b-a < 2:
cokie += k
print(cokie)
else:
cokie += a-1
k -= a-1
b_a = k//2
hit = k%2
cokie += b_a*(b-a) + hit
print(cokie)
|
p03633 | s182708114 | Accepted | def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
arr = [int(input()) for i in range(int(input()))]
ans = 1
for i in arr:
ans = (ans*i)//gcd(ans, i)
print(ans) |
p03555 | s523276336 | Accepted | c1 = input()
c2 = input()
if c1 == c2[::-1]:
print('YES')
else:
print('NO') |
p03799 | s654362931 | Accepted | N,M = map(int,input().split())
if M<2*N:
cnt = M//2
else:
cnt = N
k = M-2*N
cnt += k//4
print(cnt) |
p03555 | s349704861 | Wrong Answer | C=[0,0]
C[0]=list(map(str,input()))
C[1]=list(map(str,input()))
ans="No"
X=C[0][::-1]
if C[1]==X:
ans="Yes"
print(ans) |
p02724 | s329841994 | Accepted | n = int(input())
h = (n // 500)*1000+((n%500)//5)*5
print(h)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.