problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02917
|
s658477056
|
Wrong Answer
|
import sys
n = int(input())
l = list(map(int,input().split()))
if n==2:
ans = l[0]*2
print(ans)
sys.exit()
ans = 0
lis = []
a,b = l[0],l[1]
if a<=b:
ans +=a
lis.append(a)
else:
ans += b
lis.append(b)
for i in range(n-2):
a,b = l[i],l[i+1]
if a<=b:
ans += a
lis.append(a)
else:
ans += b
lis.append(b)
ans += l[n-2]
print(ans)
|
p02835
|
s423844733
|
Wrong Answer
|
a,b,c = map(int,input().split())
if a+b+c > 22:
print('bust')
else:
print('win')
|
p02697
|
s849187401
|
Wrong Answer
|
import math
N, M = list(map(int,input().split()))
ant = math.floor((N - 2*M)/2)
for i in range(1, M+1):
print(i, N-i+ant)
|
p02708
|
s973452233
|
Accepted
|
import sys
sys.setrecursionlimit(10000000)
def main():
N, K = map(int, input().split())
num = 0
min_sum = sum(range(0, K))
max_sum = sum(range(N + 1 - K ,N + 1))
for i in range(N + 2 - K):
num += max_sum - min_sum + 1
max_sum += N - K - i
min_sum += K + i
D = 10 ** 9 + 7
print(num % D)
if __name__ == '__main__':
main()
|
p02771
|
s116177978
|
Accepted
|
def main():
a, b, c = map(int, input().split())
if a == b and b == c and c == a:
print('No')
elif a != b and b != c and c != a:
print('No')
else:
print('Yes')
if __name__ == "__main__":
main()
|
p03220
|
s235915128
|
Accepted
|
N=int(input())
T, A=map(int, input().split())
H=list(map(int,input().split()))
diffmin=10**9
for i in range(N):
Ti = T-0.006*H[i]
diff = abs(A-Ti)
if diff<diffmin:
diffmin=diff
ans=i+1
print(ans)
|
p02570
|
s148854391
|
Wrong Answer
|
D, T, S = input().split()
ID = float(D)
IT = float(T)
IS = float(S)
M = ID / IS
if M < IS:
print('Yes')
else:
print('No')
|
p04030
|
s142406625
|
Wrong Answer
|
s = list(input())
word = ""
for i in s:
if i != "B":
word += i
else:
if word != "":
word = word.rstrip(word[-1])
print(word)
|
p03239
|
s162904151
|
Accepted
|
a,b=map(int,input().split())
c=[]
for _ in range(a):
c.append(list(map(int,input().split())))
result=[]
for i in range(a):
if c[i][1]<=b:
result.append(c[i][0])
if result==[]:
print('TLE')
exit()
print(min(result))
|
p03077
|
s645558409
|
Wrong Answer
|
info=[]
for _ in range(6):
info.append(int(input()))
ans=4+info[0]//min(info[1:])
print(ans)
|
p02633
|
s183011670
|
Accepted
|
def gcd(a, b):
if a==0:
return b
else:
return gcd(b%a, a)
X = int(input())
LCM = X*360/gcd(360, X)
print(int(LCM/X))
#a, b = map(int, input().split())
#print(gcd(a, b))
|
p02594
|
s085862416
|
Accepted
|
temp = int(input())
if temp >= 30:
print('Yes')
else:
print('No')
|
p02760
|
s728294587
|
Accepted
|
A = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
num = set([])
for _ in range(n):
num.add(int(input()))
def func(a,b,c):
if a in num and b in num and c in num:
return 1
else:
return 0
r =func(*A[0]) or func(*A[1]) or func(*A[2])
c = func(A[0][0],A[1][0],A[2][0]) or func(A[0][1],A[1][1],A[2][1]) or func(A[0][2],A[1][2],A[2][2])
naname = func(A[0][0],A[1][1],A[2][2]) or func(A[2][0],A[1][1], A[0][2])
print('Yes' if r or c or naname else 'No')
|
p03417
|
s922584295
|
Accepted
|
# 角のマスは4回、端のマスは6回（表になる）
# それ以外のマスであればカードを裏返す回数は9回（裏になる）
n, m = map(int, input().split())
if n == 1 and m == 1:
print(1)
elif n == 1 or m == 1:
print(n*m - 2)
else:
print(n*m - 2*((n-1)+(m-1)))
|
p03544
|
s277836567
|
Wrong Answer
|
n=int(input())
l0=2
l1=1
l2=0
for i in range(2,n+1):
l2=l1+l0
l0=l1
l1=l2
print(l2)
|
p02797
|
s321262881
|
Accepted
|
n,k,s =map(int,input().split())
for i in range(k):
print(s,end=" ")
for i in range(n-k):
if s==10**9:
print(s-1,end=" ")
else:
print(s+1,end=" ")
print()
|
p03206
|
s484204877
|
Wrong Answer
|
d=int(input())
print('Christmas'+'Eve'*(25-d))
|
p03434
|
s643221994
|
Accepted
|
n = input()
nums = sorted(list(map(int,input().split())),reverse=True)
print(sum(nums[0::2]) - sum(nums[1::2]))
|
p03067
|
s126866853
|
Accepted
|
a,b,c = map(int, input().split())
print("Yes" if min(a,b) < c and max(a,b) > c else "No")
|
p03221
|
s522720599
|
Accepted
|
import collections
import bisect
n, m = map(int, input().split())#入力
s = [[int(_) for _ in input().split() ] for _ in range(m)]
a = collections.defaultdict(list)#「県」と「市の誕生順」を分けて管理
for x,y in sorted(s):#ソート⇒県の順番に並ぶ
a[x]+=[y]
for x,y in s:
z = bisect.bisect(a[x],y)#二分検索⇒市の誕生順のインデックスが返る
print("%06d%06d"%(x,z))#形式を整えて出力
|
p02971
|
s363722244
|
Accepted
|
N = int(input())
A = []
max1 = 0
max2 = 0
index = 0
for i in range(N):
a = int(input())
A.append(a)
if a > max1:
max2 = max1
max1 = a
index = i
elif a == max1:
max2 = a
elif a > max2:
max2 = a
for i in range(N):
if i == index:
print(max2)
else:
print(max1)
|
p02691
|
s889903577
|
Accepted
|
_,*l=map(int,open(0).read().split());d,a,i={},0,0
for h in l:d[i+h]=d.get(i+h,0)+1;a+=d.get(i-h,0);i+=1
print(a)
|
p03644
|
s363993600
|
Wrong Answer
|
N = int(input())
ans = 1
count = 0
while 2*ans <= N:
ans *= 2
count += 1
print(count)
|
p03127
|
s984871198
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = A[0]
while A[0] != 0:
ans = A[0]
for i in range(1,N):
A[i] -= A[0]
A.sort()
print(ans)
|
p03076
|
s593025350
|
Accepted
|
import sys
dishes = map(int, sys.stdin.read().split())
ans = 0
d = 0
for dish in dishes:
wait_time = 10 - dish % 10
if wait_time == 10:
wait_time = 0
if wait_time > d:
ans += dish + d
d = wait_time
else:
ans += dish + wait_time
print(ans)
|
p03239
|
s221587106
|
Accepted
|
n, T = [int(i) for i in input().split()]
mn = 10000
for i in range(n):
c,t = [int(i) for i in input().split()]
if t <= T:
mn = min(mn, c)
print("TLE" if mn == 10000 else mn)
|
p02730
|
s880048562
|
Wrong Answer
|
s = input()
l = len(s)
sl = s[:(l-1)//2]
sr = s[((l+3)//2 -1):]
def f(s):
l = len(s)
j = False
for i in range(l//2):
if s[i] == s[l-1-i]:
j = True
else :
j = False
return j
if f(s) and f(sl) and f(sr):
print("Yes")
else :
print("No")
|
p02970
|
s620084693
|
Accepted
|
n,d = map(int,input().split())
i = 1
while True:
if i*(2*d+1) >= n:
print(i)
break
i += 1
|
p03852
|
s414238373
|
Accepted
|
# Vicfred
# https://atcoder.jp/contests/abc049/tasks/abc049_a
# simulation
c = input()
vowels = ['a', 'i', 'u', 'e', 'o']
if c in vowels:
print("vowel")
else:
print("consonant")
|
p03760
|
s135075395
|
Wrong Answer
|
o=input()
e=input()
ans=[]
for i in range(2*len(o) -1):
if i%2==0:
ans.append(o[i//2])
else:
ans.append(e[i//2])
print(*ans, sep='')
|
p02697
|
s003840982
|
Wrong Answer
|
def main():
N, M = map( int, input().split())
ANS = []
if N%2 == 1:
n = N//2
for i in range(M):
ANS.append([n-i, n++1+i])
else:
n = N//2
ANS.append([n,n+1])
for i in range(1,M):
ANS.append([n-i, n+2-i])
print( "\n".join( [" ".join( map( str,ans)) for ans in ANS]))
if __name__ == '__main__':
main()
|
p03659
|
s290206572
|
Accepted
|
N=int(input())
a=list(map(int,input().split()))
b=[0]*N
b[0]=a[0]
for i in range(1,N):
b[i]=b[i-1]+a[i]
x=[0]*N
y=[0]*N
z=[0]*N
for j in range(N):
x[j]=b[j]
y[j]=b[-1]-b[j]
z[j]=abs(x[j]-y[j])
print(min(z[:-1]))
|
p03107
|
s205997678
|
Wrong Answer
|
#C
s = list(input())
zero = 0
one = 0
for i in s:
if i == "1":
one += 1
else:
zero += 1
print(min(one,zero))
|
p03625
|
s423229731
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
A=LI()
from collections import defaultdict
dd = defaultdict(int)
for i in range(N):
dd[A[i]]+=1
L=[0,0]
for k,v in dd.items():
if v>=2:
L.append(k)
L.sort()
print(L[-1]*L[-2])
main()
|
p03471
|
s328505750
|
Accepted
|
n,y = list(map(int,input().split()))
y /= 1000
ans = [0,0,0]
# print(y)
for i in range(n+1):
for j in range(0,n+1-i):
a = i*10 + j*5
b = i+j
# print(a,b)
if a + (n-(i+j)) == y:
ans = [i,j,n-(i+j)]
if sum(ans) >0:
print(ans[0],ans[1],ans[2])
else:
print(-1,-1,-1)
|
p02767
|
s994244309
|
Accepted
|
import numpy as np
n = int(input())
xs = list(map(int, input().strip().split()))
mn = min(xs)
mx = max(xs)
xs = np.array(xs)
diffs = np.empty((100, n), dtype=np.int)
for p in range(100):
diffs[p] = xs - (p + 1)
ans = np.min(np.sum(diffs**2, axis=1))
print(ans)
|
p03012
|
s966640357
|
Accepted
|
N = int(input())
W = input().split()
W = [int(w) for w in W]
S = sum(W)
mini = pow(10, 10)
for i in range(N):
mi = abs(S - 2 * sum(W[0:i]))
if mi < mini:
mini = mi
print(mini)
|
p02818
|
s815497019
|
Accepted
|
a, b, k = map(int, input().split(" "))
if k <= a:
print(a-k, b)
elif k <= a + b:
print(0, b + a - k)
else:
print(0, 0)
|
p03836
|
s480525350
|
Accepted
|
sx,sy,tx,ty = map(int, input().split())
x=-sx
y=-sy
sx+=x
sy+=y
tx+=x
ty+=y
tx=abs(tx)
ty=abs(ty)
ans=[]
ans+=['U']*ty
ans+=['R']*tx
ans+=['D']*ty
ans+=['L']*tx
ans+=['L']
ans+=['U']*(ty+1)
ans+=['R']*(tx+1)
ans+=['D']
ans+=['R']
ans+=['D']*(ty+1)
ans+=['L']*(tx+1)
ans+=['U']
print(''.join(ans))
|
p03037
|
s956321786
|
Accepted
|
n, m = map(int, input().split())
L = [0] * m
R = [0] * m
for i in range(m):
L[i], R[i] = map(int, input().split())
print(min(R) - max(L) + 1 if min(R) >= max(L) else 0)
|
p02713
|
s541132821
|
Accepted
|
import math
N = int(input())
ans = 0
s=0
for i in range(1,N+1):
ans += i
for k in range(1,N+1):
for i in range(k+1,N+1):
ans += (math.gcd(k,i)*6)
if(N>2):
for i in range(1,N+1):
for k in range(i+1,N+1):
for j in range(k+1,N+1):
s=math.gcd(k,i)
ans += (math.gcd(s,j)*6)
print(ans)
|
p02778
|
s295399253
|
Accepted
|
number = len(input())
print('x' * number)
|
p03565
|
s064490305
|
Accepted
|
import sys
S = input()
T = input()
s = len(S)
t = len(T)
if s < t:
print('UNRESTORABLE')
sys.exit()
for i in range(s - t, -1, -1):
OK = True
for j in range(t):
if S[i + j] != T[j] and S[i + j] != '?':
OK = False
if OK:
for j in range(t):
SS = S[:i] + T + S[i + j + 1:]
SS = SS.replace('?', 'a')
print(SS)
sys.exit()
print('UNRESTORABLE')
|
p03555
|
s181279440
|
Wrong Answer
|
C=list(open(0).read())
print('YES')if C[:3] == C[-1:-4:-1] else print('NO')
|
p02760
|
s472029674
|
Accepted
|
a=[list(map(int,input().split()))for _ in range(3)]
N = int(input())
for i in range(N):
b=int(input())
for j in range(3):
for k in range(3):
if a[j][k]==b:
a[j][k]=0
ans="No"
for i in range(3):
if a[i][0]==a[i][1]==a[i][2]==0:
ans="Yes"
if a[0][i]==a[1][i]==a[2][i]==0:
ans="Yes"
if a[0][0]==a[1][1]==a[2][2]==0:
ans="Yes"
if a[2][0]==a[1][1]==a[0][2]==0:
ans="Yes"
print(ans)
|
p02747
|
s555795068
|
Wrong Answer
|
for i, s in enumerate(input()):
if i % 2:
if s != "i":
print("No")
break
else:
if s != "h":
print("No")
break
else:
print("Yes")
|
p02766
|
s922650813
|
Wrong Answer
|
N,K = map(int,input().split())
for i in range(1,31):
if K**i <= N < K**(i+1):
print(i+1)
break
|
p02571
|
s990077991
|
Accepted
|
s = input()
t = input()
sl = len(s)
tl = len(t)
ans = tl
for i in range(sl-tl+1):
cnt = 0
for j in range(tl):
if s[i+j] != t[j]:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p03493
|
s212965725
|
Accepted
|
s = input()
print(s.count('1'))
|
p03665
|
s492042314
|
Wrong Answer
|
n,p=map(int,input().split())
a=list(map(int,input().split()))
odd=[0]*n
even=[0]*n
if a[0]%2==0:
even[0]=1
else:
odd[0]=1
even[0] = 1
for i in range(n-1):
if a[i+1]%2==0:
odd[i+1]+=odd[i]+1
even[i+1]+=even[i]+1
else:
odd[i+1]+=even[i]+odd[i]
even[i+1]+=odd[i]+even[i]
if p==0:
print(even[n-1])
else:
print(odd[n-1])
|
p02854
|
s489156690
|
Wrong Answer
|
N = int(input())
A = list(map(int,input().split()))
B = A
B.reverse()
cum1 = [0]*(N)
cum2 = [0]*(N)
now1 = 0
for i in range(N):
now1 += A[i]
cum1[i] = now1
cum2[i] = sum(A)-now1
minimum = 10**9
for i in range(N):
if abs(cum1[i]-cum2[i]) < minimum:
minimum = abs(cum1[i]-cum2[i])
print(minimum)
|
p03437
|
s365422339
|
Accepted
|
x,y = map(int,input().split())
if x%y == 0:
print(-1)
exit()
print(x)
|
p03062
|
s765227289
|
Accepted
|
n = int(input())
a_list = list(map(int,input().split()))
abs_list = []
minus = 0
check = False
for a in a_list:
abs_list.append(abs(a))
if a < 0:
minus += 1
if a == 0:
check = True
if minus % 2 == 0 or check == True:
print(sum(abs_list))
else:
print(sum(abs_list) - 2 * min(abs_list))
|
p02600
|
s228441805
|
Wrong Answer
|
import sys
readline = sys.stdin.readline
def solve():
X = int(readline())
print(10 - X // 200)
|
p03695
|
s752732628
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
A = [a//400 for a in A]
l = len({0,1,2,3,4,5,6,7}&set(A))
S = sum(a>7 for a in A)
print(max(l, 1), l+S)
|
p03317
|
s071831370
|
Accepted
|
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans = 1
n = (N-K)//(K-1)
ans += n
if N-K-n*(K-1) > 0:
ans += 1
print(ans)
|
p03309
|
s161939221
|
Wrong Answer
|
import numpy as np
N = int(input())
A = list(map(int, input().split()))
a = []
ans = 0
for i in range(N):
a.append(A[i]-i-1)
b = int(np.average(a))
ans1=0
ans2=0
for i in range(N):
ans1 += abs(b-1-a[i])
for i in range(N):
ans2 += abs(b-a[i])
print(min(ans1,ans2))
|
p03693
|
s410297323
|
Wrong Answer
|
# -*- coding: utf-8 -*-
r,g,b = list(map(int, input().split()))
print('YES' if 10*(g + b)%4==0 else 'NO')
|
p02753
|
s903325352
|
Accepted
|
S = input().strip()
if (S == 'AAA' or S == 'BBB'):
print('No')
else:
print('Yes')
|
p02702
|
s096809556
|
Accepted
|
from collections import defaultdict
S = tuple(map(int, list(input())))
MOD = 2019
d = defaultdict(int)
d[0] = 1
tmp = 0
for i, s in enumerate(reversed(S)):
tmp = (tmp + s * pow(10, i, MOD)) % MOD
d[tmp] += 1
print(sum(v * (v - 1) // 2 for v in d.values()))
|
p03555
|
s117809709
|
Accepted
|
C= input()
D= input()
if (C[1]==D[1]) and (C[0] == D[2]) and (C[2]==D[0]):
print('YES')
else:
print('NO')
|
p03069
|
s628372036
|
Accepted
|
N=int(input())
S=input()
ans=[]
black=0
white=0
for n in range(N):
if S[n]=='.':
white+=1
else:
black+=1
stones={'b':0,'w':white}
for n in range(N):
if S[n]=='#':
stones['b']+=1
else:
stones['w']-=1
ans.append(stones['b']+stones['w'])
if 'b' in stones:
if stones['b']==N:
print(0)
else:
print(min(min(ans),white,black))
else:
print(min(min(ans),white,black))
|
p02720
|
s928413463
|
Accepted
|
from queue import Queue
k = int(input())
q = Queue()
for i in range(9):
q.put(i + 1)
for i in range(k):
x = q.get()
y = x % 10
if x % 10 != 0:
q.put(10 * x + y - 1)
q.put(10 * x + y)
if x % 10 != 9:
q.put(10 * x + y + 1)
print(x)
|
p02694
|
s730306192
|
Wrong Answer
|
X = int(input())
year = 0
deposit = 100
while deposit < X:
deposit += int(deposit / 100)
year += 1
print(year)
|
p02952
|
s814213650
|
Accepted
|
N = int(input())
ans = 0
for i in range(N):
if len(str(i + 1)) % 2 == 1:
ans += 1
print(ans)
|
p03309
|
s989740376
|
Accepted
|
from numpy import *
N = int(input())
A = array(list(map(int,input().split())))
B = array(sorted([A[n]-(n+1) for n in range(N)]))
print(sum(abs(B-int(median(B)))))
|
p03243
|
s730409523
|
Accepted
|
N = int(input())
Min = 100000
for i in range(1,10):
Dif = i * 111 - N
if min(Min,Dif) == Dif and i * 111 >= N:
ans = i * 111
Min = Dif
print(ans)
|
p02602
|
s862001732
|
Accepted
|
N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(K,N):
if A[i]>A[i-K]:
print("Yes")
else:
print("No")
|
p02688
|
s710834094
|
Accepted
|
n, k =map(int, input().split()) #複数数値入力
d = []
a = []
for i in range(k):
d.append(int(input()))
ai = list(map(int, input().split())) #リスト入力
a.append(ai)
a = sum(a, [])
a = list(set(a))
aset = list(set(a))
result = 0
for i in range(1,n+1):
if i in aset:
continue
else:
result += 1
print(result)
|
p03486
|
s130614221
|
Accepted
|
s = input()
t = input()
sp = sorted(s)
tp = sorted(t, reverse=True)
#print(sp, tp)
print('Yes' if sp < tp else 'No')
|
p03380
|
s269224030
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
b=max(a)
ansmax=-1
ans=-1
for i in range(n):
if min(b-a[i],a[i]) > ansmax and b!=a[i]:
ansmax=min(b-a[i],a[i])
ans=a[i]
print(str(b)+' '+str(ans))
|
p03449
|
s521109464
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
dp=[[0 for i in range(n)] for j in range(2)]
dp[0][0]=a[0]
for i in range(1,n):
dp[0][i]=a[i]+dp[0][i-1]
dp[1][0]=dp[0][0]+b[0]
for i in range(1,n):
dp[1][i]=max(dp[0][i],dp[1][i-1])+b[i]
print(dp[1][n-1])
|
p03062
|
s486290798
|
Accepted
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(input())
a = []
f = True
A = map(int, input().split())
for i in A:
if i < 0:
f ^= 1
a.append(abs(i))
a.sort()
ans = sum(a[1:])
print(ans + (a[0] if f else -a[0]))
|
p03803
|
s974849384
|
Accepted
|
a, b = map(int, input().split())
l = [i for i in range(2, 14)] + [1]
if l.index(a) > l.index(b):
print('Alice')
elif l.index(a) < l.index(b):
print('Bob')
else:
print('Draw')
|
p03723
|
s893761210
|
Wrong Answer
|
def main():
A, B, C = map(int, input().split())
ans = 0
if (2 * A - B - C) == 0 and (2 * B - A - C) == 0 and (2 * C - A - B) == 0:
print(-1)
else:
for i in range(10**9):
if A % 2 == 1 or B % 2 == 1 or C % 2 == 1:
print(ans)
exit()
A, B, C = (B + C)//2, (A + C)//2, (A + B)//2
ans += 1
if __name__ == "__main__":
main()
|
p03127
|
s029802861
|
Wrong Answer
|
N=int(input())
A=sorted(list(map(int,input().split(' '))))
ans = A[0]
for i in A[1:]:
if i%ans>0:
ans = i%ans
print(ans)
|
p02780
|
s709253582
|
Accepted
|
#!/usr/bin/env python3
N, K = [int(str) for str in input().strip().split()]
x = [int(str) for str in input().strip().split()]
sums = [0]
for i in x:
sums.append(sums[-1] + (i + 1) / 2)
ans = 0
for i in range(N - K + 1):
ans = max(sums[i + K] - sums[i], ans)
print(ans)
|
p02683
|
s423594533
|
Wrong Answer
|
n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
ans = 10**6
ok = False
for i in range(2**n):
y = [0]*(m+1)
for j in range(n):
if i & (1 << j):
for k in range(m+1):
y[k] = y[k] + ca[j][k]
if sum(z >= x for z in y[1:]) == m:
ans = min(ans, y[0])
ok = True
if ok:
print(ans)
else:
print(-1)
|
p03971
|
s734824049
|
Accepted
|
N,A,B=list(map(int,input().split()))
S=list(input())
t=0
u=0
for i in range(N):
if S[i]=='a':
if t<A+B:
t=t+1
print("Yes")
else:
print("No")
elif S[i]=='b':
if t<A+B and B>u:
t=t+1
u=u+1
print('Yes')
else:
print('No')
else:
print('No')
|
p02657
|
s816342249
|
Wrong Answer
|
#intの場合
L,R = map(int,input().split())
print(type(L),L,R)
# <class 'int'> 12 34
ans = L*R
print(ans)
|
p03659
|
s026554839
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
sub = sum(a)
s = 0
ans = (10 ** 10) + 100
for i in range(n):
s += a[i]
if (i + 1) < n:
ans = min(ans, abs(sub - (2 * s)))
print(ans)
|
p03814
|
s897870616
|
Wrong Answer
|
data = input()
Anull = True
Znull = True
count=0
zc=0
for i in range(len(data)):
if Anull and data[i]=="A":
Anull = False
count=i
if Znull and data[-1*i] == "Z":
Znull = False
zc=len(data)-i
result = zc - count + 1
print(result)
|
p03386
|
s173291655
|
Accepted
|
A, B, K = map(int, input().split())
li = []
for i in range(A, A+K):
if i <= B:
li.append(i)
for j in range(B-K+1, B+1):
if j >= A:
li.append(j)
li = sorted(list(set(li)))
for a in li:
print(a)
|
p02729
|
s493067532
|
Accepted
|
n, m = [int(x) for x in input().split()]
result = 0
if n > 1:
result += n*(n-1)/2
if m > 1:
result += m*(m-1)/2
print(int(result))
|
p02939
|
s432256572
|
Accepted
|
S = str(input())
former = ''
s = ''
cnt = 0
for i in range(len(S)):
s += S[i]
if s == former:
continue
else:
cnt += 1
former = s
s = ''
print(cnt)
|
p03778
|
s592435419
|
Accepted
|
w,a,b = map(int,input().split())
c = min(a,b)
d = max(a,b)
if c + w >= d:
print(0)
else:
print(d-c-w)
|
p03221
|
s558607291
|
Accepted
|
import bisect
from collections import defaultdict
n,m = map(int,input().split())
p = [list(map(int, input().split())) for _ in range(m)]
a = defaultdict(list)
for x,y in sorted(p):
a[x].append(y)
for x,y in p:
z=bisect.bisect(a[x],y)
print("{0:06d}{1:06d}".format(x,z))
|
p02862
|
s771975918
|
Accepted
|
def com(n,r,mod):
k=min(r,n-r)
C=1
for i in range(1,k+1):
C=(C*(n+1-i)*pow(i,mod-2,mod))%mod
return C
x, y = map(int,input().split())
mod = 10 ** 9 + 7
n = (2 * y - x) // 3 if (2 * y - x) % 3 == 0 else -1
m = (2 * x - y) // 3 if (2 * x - y) % 3 == 0 else -1
if n >= 0 and m >= 0:
print(com(n + m, n, mod))
else:
print(0)
|
p02795
|
s913372605
|
Accepted
|
h = int(input())
w = int(input())
n = int(input())
d = [h,w]
num = 0
for i in range(min(d)):
if max(d) * (i+1) >= n :
num = i + 1
break
print(num)
|
p02983
|
s611646143
|
Accepted
|
import itertools
import math
import fractions
import functools
import copy
l, r = map(int, input().split())
if r - l > 2019:
print(0)
quit()
minimum = 10**10
for i in range(l, r+1):
for j in range(l, r+1):
if(i != j):
minimum = min(minimum, (i*j) % 2019)
print(minimum)
|
p02571
|
s259532759
|
Accepted
|
def main():
s = input()
t = input()
len_s = len(s)
len_t = len(t)
min_count = len_t
for i in range(len_s-len_t+1):
count = len_t
for j in range(len_t):
if s[i+j] == t[j]:
count -= 1
if count < min_count:
min_count = count
return min_count
if __name__ == "__main__":
print(main())
|
p03767
|
s005522901
|
Accepted
|
tms=int(input())
strong_list=list(map(int,input().split()))
strong_list.sort()
ans=sum(strong_list[tms::][::2])
print(ans)
|
p02917
|
s762503314
|
Accepted
|
N = int(input())
B = list(map(int, input().split()))
A = [10**5]*N
for i in range(N-1):
A[i] = min(A[i], B[i])
A[i+1] = min(A[i+1], B[i])
print(sum(A))
|
p03760
|
s729515247
|
Accepted
|
O=input()
E=input()
ans=""
for i in range(len(E)):
ans+=O[i]
ans+=E[i]
if len(O)!=len(E):
ans+=O[-1]
print(ans)
|
p02688
|
s186772107
|
Wrong Answer
|
N, K = [int(x) for x in input().split(" ")]
A = [0 for i in range(N)]
for k in range(K):
d_i = int(input())
holder_list = [int(x) for x in input().split(" ")]
for hi in holder_list:
A[hi-1] += 1
count_non_holder = 0
for a in range(len(A)):
if a == 0:
count_non_holder += 1
print(count_non_holder)
|
p03861
|
s149912499
|
Accepted
|
a,b,x = map(int,input().split())
ans = 0
if a%x==0:
ans = (b-a)//x+1
else:
c = (a//x+1)*x
ans = (b-c)//x+1
print(ans)
|
p02601
|
s197618858
|
Accepted
|
A,B,C=map(int, input().split())
K = int(input())
if A < B < C:
print("Yes")
exit()
for i in range(K):
if A >= B:
B *= 2
continue
if B >=C:
C *= 2
continue
if A < B < C:
print("Yes")
else:
print("No")
|
p02602
|
s517329556
|
Accepted
|
N,K = map(int, input().split())
line = list(map(int, input().split()))
# output = [1 for i in range(N-K+1)]
# print(output)
for i in range(N-K):
if line[i] < line[i+K]:
print('Yes')
else:
print('No')
|
p03043
|
s890499349
|
Wrong Answer
|
n,k = map(int,input().split())
coin = [0]*n
for i in range(min(k-1,n)):
coin[i] += 1
while k > 1:
k /= 2
for i in range(min(int(k),n)):
coin[i] += 1
ans = 0
for i in range(n):
ans += (1/2)**coin[i]
print(ans / n)
|
p02795
|
s158399329
|
Accepted
|
H = int(input())
W = int(input())
N = int(input())
m = max(H, W)
if (N % m == 0):
print(N // m)
else:
print(N // m + 1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.