problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02796 | s131460439 | Accepted | n=int(input())
B=[]
for i in range(n):
x,l=map(int,input().split())
B.append([x-l,x+l])
B.sort(key=lambda x:x[1])
max_l=-10**18-5
ans=0
for b in B:
if max_l <= b[0]:
max_l = b[1]
ans+=1
print(ans) |
p03105 | s678294753 | Accepted | a, b, c = map(int, input().split())
print(min(c, b//a)) |
p02933 | s547185132 | Wrong Answer | a = int(input())
if a < 3200:
print('red')
else:
print('pink') |
p03617 | s122054031 | Accepted | Q, H, S, D = map(int, input().split())
N = int(input())
A = min(Q*4, H*2, S)
if N % 2 == 0:
print(min(A*N, D*N//2))
else:
if N == 1:
print(A)
else:
print(min(A*N, D*(N//2)+A))
|
p02684 | s024298454 | Accepted | n, k = map(int,input().split())
a = [int(i) for i in input().split()]
s = []
ord = [-1] * (n+1)
c, l = 1, 0
v = 1
while (ord[v] == -1):
ord[v] = len(s)
s.append(v)
v = a[v-1]
c = len(s) - ord[v]
l = ord[v]
print(s[k] if (k < l) else s[l + (k - l) % c]) |
p04020 | s311662666 | Wrong Answer | N=int(input())
A=[int(input())for i in range(N)]
ans=0
prev=A[0]
for i in range(1,N):
x=min(A[i-1],A[i])
ans+=x
A[i-1]-=x
A[i]-=x
ans+=(A[i-1]//2)
ans+=A[N-1]//2
print(ans) |
p03161 | s313540221 | Wrong Answer |
import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
n,k=get_ints()
h=get_array()
li=[99999]*n
li[0]=0
li[1]=abs(h[1]-h[0])
for i in range(2,n):
l=max(0,i-k)
... |
p03815 | s749682510 | Accepted | x=int(input())
y=19
ans=0
ans+=(x//11)*2
cnt=x%11
if cnt>=7:
ans+=2
elif cnt>=1:
ans+=1
print(ans) |
p02719 | s464967488 | Accepted | import sys
input=sys.stdin.readline
#N = int(input())
#S = input()[:-1]
N,K = map(int,input().split())
#S,T = map(str,input().split())
#A = list(map(int,input().split()))
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
a = N % K
b = min(a,K-... |
p03721 | s516609586 | Wrong Answer | N, K = map(int, input().split())
cnt = [0]*100001
S = set()
for i in range(N):
a, b = map(int, input().split())
cnt[a-1] += b
S.add(a)
ans = 0
for s in S:
ans += cnt[s-1]
if ans >= K:
print(s)
break
|
p02661 | s888434187 | Accepted | N = int(input())
A = []
B = []
for i in range(N):
AB = list(map(int, input().split()))
A.append(AB[0])
B.append(AB[1])
A = sorted(A)
B = sorted(B)
if N % 2 == 0:
min1 = A[N//2-1]
min2 = A[N//2]
max2 = B[-N//2]
max1 = B[-N//2-1]
# print(min1, min2, max1, max2)
ans = ((max2 + max1) / ... |
p03150 | s594891102 | Accepted | # B - KEYENCE String
def is_keyence_string():
for i in range(1, len(key)):
left = key[:i]
right = key[i-len(key):]
if S.startswith(left) and S.endswith(right):
return True
return False
S = input().strip()
key = 'keyence'
if S.startswith(key):
print('YES')
elif S.endswith(key):
print('YES')
elif is_... |
p03730 | s918841966 | Wrong Answer | A, B, C = map(int, input().split())
ans = "No"
for i in range(1, 1000):
a = A*i
if a % B == C:
ans = "Yes"
break
print(ans) |
p03126 | s756715877 | Accepted | def resolve():
'''
code here
'''
N, M = [int(item) for item in input().split()]
As = [[int(item) for item in input().split()] for _ in range(N)]
memo = [0 for _ in range(M+1)]
for k, *items in As:
for item in items:
memo[item] += 1
res = 0
for item in memo:
... |
p02778 | s731802015 | Accepted | new_string = input()
new_string_lentgh = len(new_string)
print(new_string_lentgh * 'x') |
p03720 | s163869109 | Wrong Answer | n, m = map(int, input().split())
ab = [0] * m
for i in range(m):
ab[i] = list(map(int, input().split()))
roads = [0] * n
for a, b in ab:
roads[a-1] += 1
roads[b-1] += 1
print(roads)
|
p02948 | s119362531 | Wrong Answer | N, M = list(map(int,input().split()))
A = []
for i in range(N):
in1, in2 = list(map(int,input().split()))
A.append([in1, in2])
A = sorted(A, key = lambda x: x[1])[::-1]
ans = 0
day = M
for i in range(N):
if A[i][0] <= day:
ans += A[i][1]
day -= 1
print(ans) |
p03607 | s253273007 | Accepted | from collections import defaultdict
n = int(input())
data = defaultdict(int)
for i in range(n):
a = int(input())
data[a] += 1
ans = 0
for v in data.values():
if v % 2 == 1:
ans += 1
print(ans)
|
p02622 | s835364545 | Accepted | In = str(input())
Out = str(input())
cnt = 0
for i in range(len(In)):
if In[i] != Out[i]:
cnt += 1
print(cnt) |
p03699 | s379134646 | Accepted | n = int(input())
s = [int(input()) for _ in range(n)]
ss = sum(s)
ans = ss * min(1, ss % 10)
for i in range(n):
score = ss - s[i]
ans = max(ans, score * min(1, score % 10))
print(ans)
|
p03387 | s742952037 | Wrong Answer | num=list(map(int,input().split()))
x=max(num)
s=sum(num)
t=(3*x-s)
ans=t//2
if t%2!=0:
ans+1
print(ans) |
p03317 | s078947775 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
def solve(N,K,A):
ans = -(-(N-1)//(K-1))
return ans
print(solve(N,K,A)) |
p02675 | s537457502 | Accepted | n = list(input())
# print(n[-1])
if int(n[-1]) == 2 or int(n[-1]) == 4 or int(n[-1]) == 5 or int(n[-1]) == 7 or int(n[-1]) == 9:
print('hon')
elif int(n[-1]) == 0 or int(n[-1]) == 1 or int(n[-1]) == 6 or int(n[-1]) == 8:
print('pon')
else:
print('bon')
|
p03211 | s174549435 | Accepted | s = input()
a = []
for i in range(len(s)-2):
a.append(abs(753 - int(s[i:i+3])))
print(min(a))
|
p02779 | s432921569 | Wrong Answer | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
n = int(input())
A = sorted(readInts()... |
p02899 | s626233949 | Accepted | n=int(input())
a = list(map(int,input().split()))
junban = {}
for i in range(n):
junban[a[i]] = i
a.sort()
for i in range(n):
ans = junban[a[i]] + 1
print(ans) |
p02786 | s205220981 | Accepted | h = int(input())
if h == 0:
print(0)
quit()
i = 0
while True:
if h < 2**i:
print(2**i - 1)
quit()
else:
i += 1
# I love kemofure |
p03778 | s067350578 | Wrong Answer | w, a, b = map(int,input().split())
if abs(b - a- w) >= abs(a - b):
print(abs(a-b))
elif a <= b <= a+w:
print(0)
else:
print(abs(b - a - w)) |
p02621 | s560339552 | Wrong Answer |
a = int(input("\n"))
if a >= 10:
print("Number too big")
elif a < 1:
print("Number too small")
else:
print(a + (a**2) + (a**3)) |
p02578 | s039327170 | Accepted | N = int(input())
A = list(map(int,input().rstrip().split(" ")))
ans = 0
minnow = A[0]
for i in range(1,N):
if(minnow > A[i]):
ans += minnow - A[i]
else:
minnow = A[i]
print(ans)
|
p02817 | s064809042 | Wrong Answer | s,t=input().split()
print(s+t)
|
p03069 | s533303516 | Accepted | n = int(input())
dp = [0, 0]
for c in input():
if c == '.':
dp[1] += 1
else:
dp[1] = min(dp[1], dp[0])
dp[0] += 1
print(min(dp)) |
p02732 | s717550033 | Wrong Answer | N = int(input())
K = list(map(int,input().split()))
A = [0]*N
print(A)
for i in range(N):
A[K[i]-1] += 1
r = 0
for k in range(N):
r += 0.5*(A[k]*(A[k]-1))
An =[]
for j in range(N):
D = A[K[j]-1]-1
An.append(int(r-(0.5*(D+1)*(D))+(0.5*D*(D-1))))
for i in range(len(An)):
print(An[i]) |
p03352 | s725599352 | Accepted | X = int(input())
ans = 1
for b in range(1,101):
for p in range(2,10):
if X >= b**p and b**p > ans:
ans = b**p
print(ans) |
p02900 | s026657580 | Accepted | def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
a, b = map(int, input().split())
common_diviso... |
p02922 | s762307717 | Accepted | a,b=map(int,input().split())
c=1
d=0
while c<b:
d+=1
c=a*d-(d-1)
print(d) |
p03221 | s149978595 | Wrong Answer | n,m = map(int,input().split())
C = [[i, list(map(int,input().split()))] for i in range(m)]
C.sort(key=lambda x:(x[1][0],x[1][1]))
D = {}
rank=1
for i in range(m):
name=C[i][0]
if i>1 and C[i][1][0] != C[i-1][1][0]:
rank = 1
D[name] = str(C[i][1][0]).zfill(6)+str(rank).zfill(6)
rank+=1
for i in r... |
p03377 | s790536824 | Wrong Answer | a,b,x=map(int,input().split())
if(a+b==x):
print("Yes")
elif(a==x):
print("Yes")
else:
print("No") |
p03799 | s943360514 | Wrong Answer | n, m = map(int, input().split())
print((n*2+m)//4) |
p03338 | s670712211 | Accepted | N = int(input())
S = input()
ans = 0
for i in range(N):
a = S[:i]
b = S[i:]
c = set(list(a)) & set(list(b))
ans = max(ans, len(c))
print(ans)
|
p03106 | s634398144 | Accepted | a, b, k = map(int, input().split())
l = []
for i in range(1, 101):
if a % i == 0 and b % i == 0:
l.append(i)
print(l[-k])
|
p02732 | s504600724 | Wrong Answer | n = int(input())
aList = list(map(int, input().split()))
acount = [aList.count(i)-1 for i in aList]
sums = sum(acount)
for i in acount:
print((sums)//2 - i for i in acount)
|
p03485 | s931399789 | Wrong Answer | a,b=map(int,input().split())
if (a+b)%2==0:
print((a+b)/2)
else:
print(int((a+b)//2+1)) |
p02910 | s729896268 | Wrong Answer | S=list(input())
print(S)
for i,j in enumerate(S):
if i%2==0:
if j=="R"or j=="U"or j=="D":
continue
else:
print("No")
break
else:
if j=="L"or j=="U"or j=="D":
continue
else:
print("No")
b... |
p02953 | s573967779 | Accepted | # C - Build Stairs
n = int(input())
h = list(int(x) for x in input().split())
ans = 'Yes'
flg = 0 #下がった状態フラグ
for i in range(1, n):
# 2段以上下がってる場合
if h[i-1]-h[i]>1:
ans = 'No'
break
if h[i-1]-h[i]==1:
if flg==0:
flg = 1
else:
ans = 'No'
bre... |
p02695 | s718750057 | Accepted | from itertools import combinations_with_replacement
def main():
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for A in combinations_with_replacement(range(M), N):
temp = 0
for abcd in ABCD:
if A[abcd[1]-1]+1 == A[abcd... |
p03038 | s028788054 | Accepted | from collections import defaultdict
dic = defaultdict(int)
N,M = map(int,input().split())
A = list(map(int,input().split()))
for x in A:
dic[x] += 1
for i in range(M):
a,b = map(int,input().split())
dic[b] += a
#print(dic)
L =list(dic.keys())
L.sort(reverse = True)
cnt = 0
ans = 0
for i in range(len(L)):
val ... |
p02897 | s276967921 | Wrong Answer | n= int(input())
if n%2==0:print(n/2)
else:print((n//2 +1)/n) |
p03852 | s344059230 | Wrong Answer | if input() in "aiueo".split():
print("vowel")
else:
print("consonant") |
p03475 | s174612992 | Accepted | from math import ceil
n = int(input())
csfl = [tuple(map(int, input().split())) for _ in range(n-1)]
for i in range(n-1):
c,s,f = csfl[i]
t = s+c
for j in range(i+1,n-1):
c,s,f = csfl[j]
if t <= s:
t = s
else:
t = ceil(t/f)*f
t += c
print(t)
pri... |
p02912 | s852174018 | Accepted | import heapq as hq
n,m=input().split()
hq.heapify(a:=[-int(x) for x in input().split()])
for i in range(int(m)):hq.heappush(a,-(v:=-hq.heappop(a)//2))
print(-sum(a)) |
p02661 | s349836942 | Wrong Answer | import heapq as hp
n = int(input())
if n%2 ==0:
m = n//2 + 1
else:
m = (n+1) //2
a,b = [],[]
for i in (0,n):
c = list(map(int, input().split()))
a.append(c[0])
b.append(c[1])
print(a,b)
la = hp.nlargest(m,a)
lb = hp.nlargest(m,b)
if n%2 == 0:
c = la[-1] + la[-2]
d = lb[-1] + lb[-2]
pri... |
p03251 | s916581974 | Wrong Answer | import math
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
Z = math.ceil(max(x))
if X + 1 < Y and min(y) >= Z:
print('No War')
else:
print('War') |
p03417 | s877672001 | Wrong Answer | N, M = map(int, input().split())
a = min(N, M)
b = max(N, M)
if a == 1:
print(max(0, b - 2))
elif a == 2:
print(0)
else:
print((a - 2) * (b - 2))
|
p03673 | s660202048 | Wrong Answer | n=int(input())
a=[int(x) for x in input().rstrip().split()]
odd=[]
even=[]
for i in range(n):
if (i)%2==0:
even.append(a[i])
else:
odd=[a[i]]+odd
print(*(odd+even)) |
p02693 | s013128324 | Accepted | k = int(input())
a,b = map(int, input().split())
if b//k * k >= a:
print('OK')
else:
print('NG') |
p03861 | s735288186 | Wrong Answer | a, b, x = map(int, input().split())
print(b//x-(a-1)//x, 0) |
p02658 | s969868119 | Accepted | if __name__ == "__main__":
n = int(input())
a = [int(x) for x in input().split()]
if 0 in a:
ans = 0
else:
mx = 10 ** 18
ans = 1
for ai in a:
ans *= ai
if mx < ans:
ans = -1
break
print(ans) |
p02572 | s315710073 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
print(A)
for i in range(N):
for j in range(N):
ans += A[i] * A[j]
ans = ans % (10 ^ 9 + 7)
print(ans)
|
p03145 | s010988810 | Accepted | c,a,b=map(int,input().split())
print(c*a//2) |
p03434 | s683145963 | Accepted | N = int(input())
a = [110]
a = list(map(int, input().split()))
a.sort(reverse=True)
Alis = 0
Bob = 0
for j in range(N):
if j % 2 == 0:
Alis += a[j]
else:
Bob += a[j]
print(Alis-Bob) |
p03126 | s523641473 | Accepted | def main():
N, M = map(int, input().split())
ans = [1] * M
for _ in range(N):
A = list(map(lambda x: int(x) - 1, input().split()))[1:]
for a in range(M):
if a not in A:
ans[a] = 0
print(sum(ans))
if __name__ == '__main__':
main()
|
p03433 | s539064555 | Accepted | N = int(input())
A = int(input())
if N % 500 <= A: print('Yes')
else: print('No') |
p02641 | s136819646 | Wrong Answer | # coding: utf-8
# Your code here!
n,m=map(int,input().split())
a=list(map(int,input().split()))
if len(a)==0:
print(n)
else:
a.sort()
if n not in a:
print(n)
else:
cnt=0
for i in range(100):
if i in a:
continue
elif abs(cnt-n)>abs(i-n):
cnt=i
print(cnt)
|
p02642 | s849596581 | Wrong Answer | import math
n=int(input())
a=list(map(int,input().split()))
count=0
isDividable=0
for i in range(n):
isDividable=0
l=a[i]/2
for j in range(n):
if i != j and a[j] <= l and a[i] % a[j] == 0:
isDividable=1
break
if isDividable==0:
count=count+1
print(count) |
p03264 | s545798116 | Accepted | def main():
k = int(input())
#s = input()
#s = input().split()
#a,b = list(map(int,input().split()))
#a = [input() for i in range(n)]
#a = [int(input()) for i in range(n)]
#a = [input().split() for i in range(n)]
#a = [list(map(int,input().split())) for i in range(n)]
ans = 0
count = 0
lis = []
... |
p03059 | s665293486 | Wrong Answer | a, b, t = map(int, input().split())
print(b*((t+0.5)//a)) |
p02732 | s125503816 | Accepted | M=int(input())
N=list(input().split())
check=[0]*M
for i in range(M):
check[int(N[i])-1]+=1
num=0
for i in range(M):
num+=check[i]*(check[i]-1)//2
for i in range(M):
if check[int(N[i])-1]!=2:
print(num-(check[int(N[i])-1]-1))
else:
print(num-1)
|
p03136 | s167772679 | Accepted | #https://atcoder.jp/contests/abc117/tasks/abc117_b
S_list = [input() for i in range(2)]
N = map(int,S_list[0].split())
L_list = list(map(int,S_list[1].split()))
L_max = max(L_list)
L_sum = sum(L_list) - L_max
if L_sum - L_max > 0:
result ="Yes"
else:
result ="No"
print(result)
|
p02702 | s232973768 | Accepted | s = input()[::-1] # 入力文字列を逆順でsに格納
counts = [0] * 2019
counts[0] = 1
num, d = 0, 1
for char in s:
num += int(char) * d
num %= 2019
d *= 10
d%= 2019
counts[num] += 1
ans = 0
for cnt in counts:
ans += cnt * (cnt - 1) // 2
print(ans) # 答えの出力 |
p02988 | s007731237 | Accepted | N = int(input())
A = list(map(int,input().split()))
count = 0
for i in range(1,N-1):
if (A[i+1] > A[i] and A[i] > A[i-1]) or (A[i+1] < A[i] and A[i] < A[i-1]):
count += 1
print(count)
|
p03487 | s989703991 | Accepted | import collections
N = int(input())
a = sorted(list(map(int,input().split())))
c = collections.Counter(a)
cnt = 0
for i in c.most_common():
# print(i)
if i[0]<i[1]:
cnt=cnt+i[1]-i[0]
if i[0]>i[1]:
cnt=cnt+i[1]
print(cnt) |
p02633 | s694688653 | Accepted | x=int(input())
n=1
tgt=1
Ans=0
while tgt>0:
tgt=(360*n)%x
Ans=(360*n)//x
n+=1
print(Ans) |
p02744 | s185819338 | Accepted | def dfs(now, mx):
if len(now) == n:
print(now)
else:
for i in range(1, mx + 2):
mmx = max(mx, i)
dfs(now + al[i], mmx)
n = int(input())
al = ['.', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
dfs('a', 1)
|
p04030 | s961079568 | Accepted | x = input()
li = []
sz = 0
for i in x:
if (i == '0') or (i == '1'):
li.append(i)
sz += 1
else:
if sz > 0:
li.pop()
sz -= 1
for i in li:
print(i, end="")
|
p02881 | s498895748 | Accepted | import math
N = int(input())
ans = 10**12
for i in range(1,10**6+1):
j = math.ceil(N/(i+1))
if (1+i)*j == N:
ans = min(i+j-1,ans)
if i == 10**6 and ans == 10**12:
ans = N-1
break
print(ans) |
p03329 | s653121343 | Accepted | # 貰うDP
n = int(input())
max_n = 110000
dp = [n] * max_n
# 初期化
dp[0] = 0
for i in range(1, n + 1):
pow6, pow9 = 1, 1
while pow6 <= i:
dp[i] = min(dp[i], dp[i - pow6] + 1)
pow6 *= 6
while pow9 <= i:
dp[i] = min(dp[i], dp[i - pow9] + 1)
pow9 *= 9
print(dp[n])
|
p03625 | s293178671 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
a = Counter(a)
a = {key: val for key, val in a.items() if val >= 2}
a = dict(sorted(a.items(), reverse=True))
if len(a) == 0:
print(0)
exit()
side1 = max(a)
a[side1] -= 2
a = {key: val for key, val in a.items() if val >= 2}... |
p03998 | s638708524 | Wrong Answer | A = input ()
B = input ()
C = input ()
X,Y,Z = 0,0,0
P = A
Q = X
while True:
if len(P)==Q:
if P==A:
print ('A')
elif P==B:
print ('B')
else:
print ('C')
break
if P[Q]=='a':
P = A
X += 1
Q = X
elif P[Q]=='b':
P = B
Y += 1
Q = Y
else:
P = C
Z += 1
... |
p03103 | s979556187 | Accepted | n, m = map(int, input().split())
k = [list(map(int, input().split())) for _ in range(n)]
sum = 0
mr = 0
ks = sorted(k)
for i in range(n):
if ks[i][1] < (m-mr):
sum += ks[i][0] * ks[i][1]
mr += ks[i][1]
else:
sum += ks[i][0] * (m - mr)
break
print(sum) |
p03208 | s121204555 | Wrong Answer | n,k=map(int,input().split())
h=[]
ma=10**9
for i in range(n):
a=int(input())
h.append(a)
h.sort()
for i in range(n-k+1):
b=h[i:n-k+i+1]
sa=b[-1]-b[0]
if sa<ma:
ma=sa
print(ma) |
p03943 | s710577494 | Accepted | def main():
a, b, c = [int(v) for v in input().split()]
if a + b == c or b + c == a or c + a == b:
print("Yes")
else:
print("No")
main()
|
p02802 | s790867436 | Wrong Answer | import numpy as np
N,M = map(int,input().split())
P = np.zeros(M, dtype=int)
S = np.zeros(M, dtype=int)
for i in range(M):
p,s = map(str,input().split())
P[i] = int(p)
if s == 'AC':
S[i] = 1
cOK = 0
cNG = 0
aP = np.argsort(P)
P = P[aP]
S = S[aP]
i = 0
while i<M:
Q = list(S[P==P[i]])
if... |
p03043 | s671177880 | Accepted | import math
n,k = map(int,input().split())
ans = 0
if n<= k-1:
for i in range(1,n+1):
ans += 0.5**(math.ceil(math.log2(k/i)))
print(ans*(1/n))
else:
for j in range(1,k):
ans += 0.5**(math.ceil(math.log2(k/j)))
print(ans*(1/n) + ((n-k+1)/n)) |
p03417 | s588733264 | Accepted | n, m = map(int, input().split())
ans = 0
if n > m:
n, m = m, n
if n == 1 and m == 1:
ans = 1
elif n == 1 or m == 1:
ans = max(0, m - 2)
elif n == 2 or m == 2:
ans = 0
else:
ans = (n - 2) * (m - 2)
print(ans)
|
p03693 | s476851430 | Accepted | x, g, b = input().split()
if int(x+g+b)%4 == 0:
print("YES")
else:
print("NO") |
p03962 | s144537060 | Accepted | a,b,c=map(int,input().split())
print(len(set([a,b,c]))) |
p02725 | s472165757 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
KUKAN = [0] * N
for i in range(N):
if i != N - 1:
KUKAN[i] = A[i + 1] - A[i]
else:
KUKAN[N - 1] = K - A[N - 1] + A[0]
print(str(sum(KUKAN) - max(KUKAN))) |
p03286 | s271443064 | Accepted | N = int(input())
if N == 0:
print(0)
else:
ans = ""
while N != 0:
digit = abs(N%(-2))
ans += str(digit)
N -= digit
N //= -2
for i in reversed(range(len(ans))):
print(ans[i],end="") |
p03345 | s890068155 | Accepted | a, b, c, k = map(int, input().split())
if k % 2:
print(b - a)
else:
print(a - b)
|
p02994 | s089364372 | Accepted | N, L = map(int, input().split())
sumA = 0
for i in range(N):
sumA += (L + i)
cur_diff = float('inf')
ans = 0
for i in range(N):
tmp = sumA - (L + i)
diff = abs(sumA - tmp)
if diff < cur_diff:
cur_diff = diff
ans = tmp
print(ans) |
p02820 | s982055494 | Wrong Answer | n,k=map(int,input().split())
s,p,r=map(int,input().split())
t=input()
a=0
for i in range(k):
d=1
for j in range(i,n-k,k):
if t[j]==t[j+k]:
d+=1
else:
a-=(-d//2)*eval(t[j])
d=1
a-=(-d//2)*eval(t[j+k])
print(a)
|
p02553 | s978858426 | Accepted | a,b,c,d=map(int,input().split())
print(max(a*c,b*c,a*d,b*d)) |
p02706 | s571966349 | Wrong Answer | #!/usr/bin/env python3
n, m, *a = map(int, open(0).read().split())
d = n - sum(a)
print(d or "-1"* (d < 0))
|
p03419 | s095063692 | Accepted | n,m=map(int,input().split())
if n==m==1:
print(1)
exit()
elif n==1:
print(m-2)
exit()
elif m==1:
print(n-2)
exit()
else:
print((n-2)*(m-2))
|
p03827 | s340289660 | Accepted | n = int(input())
s = input()
ans = [0]
for i in range(n):
if s[i] == "I":
ans.append(ans[i] + 1)
else:
ans.append(ans[i] - 1)
print(max(ans)) |
p02772 | s348312191 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
count = 0
for ele in A:
if ele % 2 != 0:
A.remove(ele)
for ele in A:
if ele % 3 == 0 or ele % 5 == 0:
count += 1
print("APPROVED" if count == len(A) else "DENIED") |
p02640 | s533505353 | Accepted | x,y = map(int,input().split())
if y>=2*x and y<=4*x and y%2==0:
print("Yes")
else:
print("No") |
p03284 | s647536401 | Wrong Answer | a,b=map(int,input().split())
print(a%b) |
p03419 | s004084152 | Accepted | lst=map(int,input().split())
lst=sorted(lst)
m=lst[0]
n=lst[1]
if m!=1:
ans=m*n-2*(m+n)+4
print(ans)
else:
if n==1:
print(1)
else:
print(n-2) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.