problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03557 | s417140839 | Accepted | from bisect import bisect_left, bisect_right, bisect
n = int(input())
alis = sorted(list(map(int, input().split())))
blis = list(map(int, input().split()))
clis = sorted(list(map(int, input().split())))
ans = 0
for b in blis:
up = bisect_left(alis, b)
down = n - bisect(clis, b)
ans += up*down
print(ans) |
p02708 | s488307581 | Accepted | #n=int(input())
n,k=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
mod=10**9+7
ans=0
for kval in range(k,n+2):
mx=kval*(2*n-kval+1)//2
mn=kval*(kval-1)//2
add=mx-mn+1
ans=(ans+add) % mod
print(ans)
|
p02683 | s324039981 | Wrong Answer | n,m,x = map(int,input().split())
c = []
a = []
for i in range(n):
l = list(map(int,input().split()))
c.append(l[0])
a.append(l[1:])
result = -1
for i in range(2 ** n):
ct = 0
at = [0] * m
for b in range(1, n + 1):
if i & b > 0:
ct += c[b - 1]
for j in range(0, m):
at[j] += a[b - 1][j]
if result == -1 or ct < result:
r = 1
for ati in at:
if ati < x:
r = 0
if r == 1:
result = ct
print(result) |
p02819 | s593536407 | Accepted | from math import sqrt
from sys import stdin
X = int(stdin.readline().rstrip())
def is_prime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
while i <= sqrt(x):
if x % i == 0:
return False
i = i + 2
return True
while not is_prime(X):
X += 1
print(X) |
p03767 | s907700947 | Wrong Answer | n = int(input())
li = list(map(int,input().split()))
li.sort()
print(sum(li[n+1:2*n+1])) |
p03030 | s911306592 | Accepted | from sys import stdin, setrecursionlimit
from collections import defaultdict
def main():
input = stdin.readline
n = int(input())
dic = defaultdict(list)
for i in range(1, n + 1):
s, p = map(str, input().split())
dic[s].append([int(p), i])
dic[s].sort(reverse=True)
s_dic = sorted(dic.items(), key=lambda x: x[0])
for k, arr in s_dic:
for ai in arr:
print(ai[1])
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
p02791 | s313836175 | Wrong Answer | import numpy as np
from collections import Counter
# 最頻値
def mode(list):
c = Counter(list)
freq_scores = c.most_common()
max_count = freq_scores[0][1]
modes = []
for num in freq_scores:
if num[1] == max_count:
modes.append(num[0])
return(modes)
n = int(input())
p_list = list(map(int, input().split()))
ans = 1
min = p_list[0]
for i in range(n - 1):
if min >= p_list[i + 1]:
ans += 1
min =p_list[i]
print(ans) |
p03592 | s475579496 | Wrong Answer | n, m, k = map(int, input().split())
if k == 0 or k == n * m:
print("Yes")
exit()
for i in range((n + 1) // 2):
for j in range((m + 1) // 2):
if i * j + (n - i) * (m - j) == k:
print("Yes")
exit()
print("No") |
p03103 | s525210136 | Wrong Answer | n,m = map(int, input().split())
pairs = [input().split() for _ in range(n)]
pairs.sort()
ans = 0
k = 0
while m>0:
x = min(m,int(pairs[k][1]))
ans += int(pairs[k][0])*x
m -= x
k += 1
print(ans) |
p03210 | s632862275 | Wrong Answer | n = input()
n = int()
if n == 7:
print("yes")
else:
if n == 5:
print("yes")
else:
if n == 3:
print("yes")
else:
print("no")
|
p03456 | s066000200 | Accepted | a, b = map(str, input().split())
K = int(a+b)
Nobless = 0
for i in range (0, K+1):
if i**2 == K:
Nobless+=1
else:
continue
if Nobless >= 1:
print('Yes')
else:
print('No') |
p02866 | s106055838 | Accepted | n = int(input())
a = list(map(int, input().split()))
c = [0]*(n+1)
for i in a:
c[i] += 1
ans = 1
for i in range(n+1):
if c[-1] == 0:
c.pop()
else:
break
mod = 998244353
for i in range(len(c)-1):
ans *= pow(c[i], c[i+1], mod)
ans %= mod
if a[0] != 0:
ans *= 0
if c[0] != 1:
ans *= 0
print(ans)
|
p02924 | s252494052 | Accepted | N = int(input())
print(N*(N-1)//2) |
p02688 | s648167253 | Accepted | n, k = map(int, input().split())
d = [0] * k
a = [0] * k
sunuke = [0] * n
for i in range(k):
d[i] = int(input())
a[i] = list(map(int, input().strip().split()))
for j in range(len(a[i])):
sunuke[a[i][j]-1] = sunuke[a[i][j]-1] + 1
print(sunuke.count(0))
|
p03778 | s630358728 | Accepted | W, a, b = map(int,input().split())
# N = int(input())
# al = list(map(int,input().split()))
if a <= b:
if b-(a+W) >= 0:
print(b-(a+W))
else:
print(0)
else:
if a - (b+W) >= 0:
print(a - (b+W))
else:
print(0) |
p03379 | s979299405 | Accepted | def solve():
N = int(input())
X = list(map(int, input().split()))
sorted_X = sorted(X)
mid_l = sorted_X[N // 2 - 1]
mid_r = sorted_X[N // 2]
for xi in X:
if xi <= mid_l:
print(mid_r)
else:
print(mid_l)
if __name__ == '__main__':
solve()
|
p02596 | s780789221 | Wrong Answer | K=int(input())
seven=0
m=1
while m!=0:
seven=seven*10+7
m=seven % K
print(seven) |
p02555 | s851682922 | Accepted | S = int(input())
mod = 1000000007
if S < 3:
print(0)
else:
sums = [0,0,0]
vals = [0,0,0]
runningsum = 0
i = 3
while(i<=S):
val = (1+sums[i-3])%mod
vals.append(val)
sums.append((sums[-1]+val)%mod)
i+=1
print(vals[-1])
|
p03071 | s552950102 | Accepted | a,b = map(int, input().split())
ans = 0
ans += max(a,b)
ans += max(max(a,b)-1, min(a,b))
print(ans) |
p03524 | s145135206 | Wrong Answer | import sys
import os
def file_input():
f = open('CODE_FESTIVAL_2017Final/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
S=input()
a=b=c=0
for s in S:
if s=='a':
a+=1
elif s=='b':
b+=1
else:
c+=1
if max(a,b,c)-min(a,b,c)<=1:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
p03494 | s968067394 | Accepted | N = int(input())
A = list(map(int, input().split()))
x = int(0)
y = int(-1)
while x < 1:
for i in range(N):
if A[i]%2 == 1:
x = 1
A[i] =int(A[i]/2)
y = y+1
print(y) |
p03495 | s633925958 | Accepted | from collections import Counter
n,k=map(int,input().split())
a=list(map(int,input().split()))
d=Counter(a).most_common()
ans=0
for i in range(k,len(d)):
ans+=d[i][1]
print(ans) |
p02639 | s745065569 | Wrong Answer | data = [int(x) for x in input().split(" ")]
for i in range(len(data)):
if data[i] == 0: print(i)
|
p03861 | s463602436 | Wrong Answer | a, b, x = map(int, input().split())
if b-a < x or b < x:
print(0)
else:
ans = (b//x+1)-(a//x+1)
print(ans) |
p03495 | s619204643 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
from collections import Counter
A=Counter(A)
ret=N
for i in A.most_common(K):
ret-=i[1]
print(ret) |
p03017 | s200896013 | Accepted | # -*- coding: utf-8 -*-
N, A, B, C, D = map(int, input().split(' '))
A -= 1
B -= 1
C -= 1
D -= 1
S = input()
if S[A:C+1].count('##') or S[B:D+1].count('##'):
print('No')
exit(0)
if C > D:
if not S[B-1: D+2].count('...'):
print('No')
exit(0)
print('Yes')
|
p02624 | s977623270 | Wrong Answer | def s(num):
yakusuu_array = []
for i in range(1,num):
if num % i == 0:
yakusuu_array.append(i)
return len(yakusuu_array)
N = int(input())
count = 0
for i in range(N):
count = (i + 1) * s(i + 1) + count
print(count)
|
p02642 | s059359508 | Accepted | import sys
from collections import Counter
N = int(input())
A = list(map(int, sys.stdin.readline().rsplit()))
A.sort()
B = [0] * (A[-1] + 1)
C = Counter(A)
res = 0
for a in A:
if B[a] == 0 and C[a] == 1:
res += 1
for i in range(a, A[-1] + 1, a):
B[i] += 1
print(res)
|
p03814 | s501743915 | Accepted | S = input()
print(1+S.rfind("Z")-S.find("A")) |
p02612 | s424701491 | Accepted | x = int(input()) % 1000
if x == 0:
print(0)
else:
print(1000 - x) |
p03711 | s087780912 | Accepted | print('YNeos'['2'in input()::2]) |
p02696 | s755225465 | Accepted | A,B,N=map(int,input().split())
ans=-100000
for x in range(A):
#print(A//B,x//B,A*x//B,A*x//B-A*(x//B))
ans=max(ans,(A*x//B)-A*(x//B))
if x==N:break
x=B-1
if x>N:x=N
ans=max(ans,(A*x//B)-A*(x//B))
print(ans) |
p02548 | s554610331 | Accepted | N = int(input())
ans = 0
for i in range(1, N):
for j in range(1, N):
if i * j < N:
ans += 1
else:
break
print(ans) |
p02718 | s366065902 | Accepted | n, m = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
cnt = 0
for i in range(n):
if a[i] >= s / (4 * m):
cnt += 1
if cnt >= m:
print('Yes')
else:
print('No') |
p03624 | s523407062 | Accepted | s=list(input())
a=list("abcdefghijklmnopqrstuvwxyz")
a=[i for i in a if i not in s]
if a:
a.sort()
print(a[0])
else:
print("None")
|
p02775 | s435740149 | Accepted | s = input()[::-1]
size = len(s)
s += "4"
ans = 0
bef = 0
for i in range(size):
v1 = int(s[i])
v2 = int(s[i+1])
if v1+bef>=6 or (v1+bef>=5 and v2>=5):
ans += 10-(v1+bef)
bef = 1
else:
ans += (v1+bef)
bef = 0
ans += bef
print(ans) |
p02775 | s301368453 | Wrong Answer | N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=0
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
|
p03681 | s164037339 | Wrong Answer | N = 10**6
mod = 10**9 + 7
fact = [1]
for i in range(1, N+1):
fact.append(fact[-1]*i%mod)
n, m = map(int, input().split())
ans = 0
if n - m > 1 or m - n > 1:
ams = 0
elif n - m == 0:
ans = 2 * (fact[n])**2
else:
ans = fact[n] * fact[m]
print(ans) |
p03043 | s149914304 | Accepted | n , k = map(int,input().split())
ans = 0
for i in range(1,n+1):
for j in range(10000):
if i*2**j >= k:
ans += (1/n)*(0.5**j)
break
print(ans) |
p02676 | s383356479 | Wrong Answer | K=int(input())
S=str(input())
if K>1 and K<100 and len(S)>1 and len(S)<100:
if len(S)==K or len(S)<K:
print(S)
else:
print(S[:7]+'...')
|
p02897 | s480181273 | Accepted | n = int(input())
if n % 2 == 0:
print(n / 2 / n)
else:
print((n // 2 + 1) / n)
|
p04019 | s742706398 | Wrong Answer | # coding: utf-8
S = list(input())
if ('N' in S and 'S' in S) or ('N' not in S and 'S' not in S) and ('W' in S and 'E' in S) or ('W' not in S and 'E' not in S):
print('Yes')
else:
print('No') |
p03611 | s693064447 | Accepted | import sys
import itertools
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *a = map(int, read().split())
a.sort()
A = [0] * (10**5 + 1)
for i in a:
A[i] += 1
cnt = 0
for i in range(1, 10**5 - 1):
cnt = max(cnt, A[i - 1] + A[i] + A[i + 1])
print(cnt)
|
p02659 | s463688811 | Accepted | a, b = map(str, input().split())
a = int(a)
c, d = map(int, b.split('.'))
b = c * 100 + d
b *= a
print(int(("00" + str(b))[:-2])) |
p02829 | s065357744 | Accepted | if __name__ == "__main__":
ans = 6
a = int(input())
b = int(input())
print(6 // a // b) |
p02848 | s987629719 | Accepted | #!/usr/bin/env python3
n = int(input())
s = list(input())
s = list(map(lambda x: ord(x), s))
for i in range(len(s)):
if s[i] + n > 90:
s[i] = s[i] + n - 90 + 64
else:
s[i] = s[i] + n
s = list(map(lambda x: chr(x), s))
print(''.join(s))
|
p03814 | s071986453 | Wrong Answer | s = input()
a = 0
for i in range(len(s)):
if s[i] == 'A':
if a == 0:
a = i
elif s[i] == 'Z':
z = i
print(z - a + 1)
|
p03815 | s729139452 | Accepted | X = int(input())
ans = (X // (5 + 6)) * 2
X %= 5 + 6
if X == 0:
pass
elif X <= 6:
ans += 1
else:
ans += 2
print(ans)
|
p03069 | s812403822 | Accepted | N,S = open(0).read().split()
N=int(N)
S=[s == "." for s in list(S)]
w = sum([1 if s else 0 for s in S])
b = 0
m = w + b
for s in S:
if s:
w -= 1
else:
b += 1
m = min(m, w + b)
print(m)
|
p03699 | s631033513 | Wrong Answer | n = int(input())
S = [int(input()) for _ in range(n)]
S.sort()
score = sum(S)
while score > 0 and score % 10 == 0:
S = S[1:]
score = sum(S)
print(score) |
p02971 | s800521391 | Accepted | arr = []
for _ in range(int(input())):
arr.append(int(input()))
arr2 = arr.copy()
arr2.sort()
z = arr2[-1]
zz = arr2[-2]
for k in arr:
if k != z:
print(z)
else:
print(zz)
|
p03698 | s183755525 | Accepted | s=str(input())
l=[]
for i in range(len(s)):
l.append(s[i])
if len(set(l))==len(s):
print('yes')
else:
print('no') |
p03624 | s970343263 | Accepted | ALPHABET = "abcdefghijklmnopqrstuvwxyz"
s = input()
for i in range(26):
if s.count(ALPHABET[i]) == 0:
print(ALPHABET[i])
break
else:
print("None")
|
p02899 | s034803435 | Wrong Answer | n = int(input())
an = list(map(int,input().split()))
zyunban = []
t = 1
for x in an:
zyunban.insert(x-1,t)
t += 1
zyunban = list(map(str,zyunban))
print(" ".join(zyunban))
|
p02631 | s205492144 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = [0]
for i in range(N-1):
ans.append(ans[-1]^a[i]^a[i+1])
print(" ".join(map(str,ans))) |
p03761 | s024573683 | Wrong Answer | def cnt(s, b):
ans = []
for i in s:
if i in b:
ans.append(i)
return ans
def intersection(lst1, lst2):
lst3 = [value for value in lst1 if value in lst2]
cnt1 = cnt(lst1, lst3)
cnt2 = cnt(lst2, lst3)
if len(cnt1) > len(cnt2):
return cnt2
else:
return cnt1
def resolve():
n = int(input())
h = []
for i in range(n):
h.append(input())
sec = h[0]
for i in range(1, n):
sec = intersection(sec, h[i])
print("".join(sorted(sec)))
resolve() |
p03239 | s515409726 | Wrong Answer | n, t = map(int, input().split())
ct = []
for i in range(n):
c, time = map(int, input().split())
ct.append([c, time])
min_t = t
cost = 0
cnt = 0
for i in range(n):
if ct[i][1] > t:
cnt += 1
else:
if min_t >= ct[i][1]:
min_t = ct[i][1]
cost = ct[i][0]
if cnt == n:
print('TLE')
else:
print(cost) |
p03910 | s895673773 | Wrong Answer | n = int(input())
k = 1
while True:
if k*(k+1)//2 >= n:
ans = k
break
k += 1
cnt = 0
l = []
i = ans-1
while i > 0:
if cnt <= n - ans*(ans-1)//2:
l.append(i+1)
cnt += 1
else:
l.append(i)
i -= 1
while len(l) > 0:
j = l.pop()
print(j)
|
p03852 | s880698569 | Accepted | str = input()
print("vowel" if str == "a" or str == "i" or str == "u" or str == "e" or str == "o" else "consonant")
|
p02785 | s592614935 | Accepted | n,k=map(int,input().split())
h=sorted(list(map(int,input().split())),reverse=True)
if n<=k:
print("0")
else:
print(sum(h[k:])) |
p03106 | s342340083 | Wrong Answer | a,b,k = map(int,input().split())
count = 0
if b >= a:
count = a
b = a
a = count
ch = 1
for i in range(a,0,-1):
if a % i == 0 and b % i == 0 and k == ch:
print(i)
break
elif a % i == 0 and b % i == 0:
ch += 1 |
p03211 | s339029479 | Accepted | S=input()
print( min(abs(753-int(S[i:i+3]) ) for i in range(len(S)-2) ) ) |
p03543 | s933883530 | Accepted | n = int(input())
arr = list(str(n))
if arr[0] == arr[1] and arr[1] == arr[2]:
print('Yes')
elif arr[1] == arr[2] and arr[2] == arr[3]:
print('Yes')
else:
print('No')
|
p02725 | s040848166 | Wrong Answer | # 隣り合う長さの最大値をKから引く
circ_length, n_house = map(int, input().split())
places = list(map(int, input().split()))
delta_places = []
for i in range(n_house):
d = abs(places[i] - places[i-1])
delta_places.append(d)
result = circ_length - max(delta_places)
print(result)
|
p02621 | s068920245 | Accepted | a=int(input())
print(a+a**2+a**3) |
p02732 | s824335295 | Accepted | N = int(input())
s = list(map(int,input().split()))
M = max(s)
count = [0] * (M+1)
for i in range(1,N):
count[s[i]] += 1
ans = 0
for j in count:
if j == 0:
continue
ans += int(j*(j-1)/2)
print(ans)
for i in range(1,N):
ans += count[s[i-1]]
count[s[i-1]] += 1
count[s[i]] -= 1
ans -= count[s[i]]
print(ans)
|
p02744 | s479659639 | Accepted | # D
N = int(input())
al = [chr(ord('a') + i) for i in range(26)]
def dfs(S, i):
if len(S) == N:
yield ''.join(S)
return
for j in range(i):
for w in dfs(S + [al[j]], i):
yield w
for w in dfs(S + [al[i]], i + 1):
yield w
for w in dfs([], 0):
print(w) |
p02713 | s601476430 | Wrong Answer | from math import gcd
k = int(input())
gcdl = [[0 for i in range(k + 1)]for i in range(k+1)]
for i in range(1, k + 1):
for j in range(1, k + 1):
gcdl[i][j] = gcd(i, j)
s = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
s += gcdl[i][gcdl[j][k]]
print(s)
|
p03774 | s684577851 | Accepted | def calc_dist(pos_a,pos_b):
return abs(pos_a[0] - pos_b[0])+abs(pos_a[1] - pos_b[1])
n,m=map(int,input().split())
a=[]
b=[]
for i in range(n):
a.append(list(map(int,input().split())))
for i in range(m):
b.append(list(map(int,input().split())))
for a_pos in a:
min_d=float("inf")
min_d_i=-1
for i,b_pos in enumerate(b):
d=calc_dist(a_pos,b_pos)
if d < min_d:
min_d=d
min_d_i=i+1
print(min_d_i) |
p03206 | s975236007 | Accepted | def main():
from sys import stdin
r = stdin.readline()[:-1]
#r = stdin.readlines()
print('Christmas'+' Eve'*(25-int(r)))
if __name__ == '__main__':
main()
|
p03645 | s702030481 | Accepted | from sys import stdin
def input():
return stdin.readline().strip()
n, m = map(int, input().split())
edge = [[] for _ in range(n)]
for _ in range(m):
i, j = map(int, input().split())
i -= 1
j -= 1
edge[i].append(j)
edge[j].append(i)
for i in edge[0]:
if n - 1 in edge[i]:
print('POSSIBLE')
exit()
else:
print('IMPOSSIBLE') |
p03359 | s121185867 | Accepted | A, B = map(int,input().split())
if A <= B:
print(A)
else:
print(A-1) |
p02873 | s964288586 | Wrong Answer | s = list(input())
n = len(s)
s.append('<')
mini = 0
maxi = 0
p = 0
for i in range(n):
if s[i] == '<':
mini += 1
else:
maxi += 1
if s[i+1] == '<':
p += (1 + max(mini,maxi)) * max(mini,maxi) // 2
mini = 0
maxi = 0
print(p) |
p03254 | s253209841 | Accepted | N,x = map(int,input().split())
A = list(map(int,input().split()))
A = sorted(A)
cnt = 0
for i in range(N):
if i == N-1 and x > A[i]:
break
if x >= A[i]:
x -= A[i]
cnt += 1
else:
break
print(cnt) |
p02854 | s426019307 | Accepted | n = int(input())
a = list(map(int, input().split()))
first_half = 0
latter_half = sum(a)
min_diff = latter_half
for i in range(n):
first_half += a[i]
latter_half -= a[i]
diff = abs(first_half - latter_half)
min_diff = min(min_diff, diff)
print(min_diff)
|
p02759 | s095111340 | Wrong Answer | n = int(input())
g = n / 2
h = n % 2
print(g + h) |
p03475 | s605136247 | Wrong Answer | N=int(input())
C=[list(map(int,input().split())) for _ in range(N-1)]
for i in range(N-1):
c,s,f=C[i]
ans=s+c
for j in range(i+1,N-1):
nc,ns,nf=C[j]
# print('D',ans,nc,ns,nf)
ans=max(ans,ns)
ans+=nc
print(ans)
print(0) |
p03544 | s310061442 | Accepted | N = int(input())
from collections import defaultdict
d = defaultdict(lambda: -1) #初期値を「-1」にする
d[0] = 2
d[1] = 1
def f(n):
if d[n] == -1:
a = f(n-1) + f(n-2)
d[n] = a
return d[n]
print(f(N)) |
p02681 | s902922014 | Wrong Answer | s = str(input())
t = str(input())
lens = len(s)
lent = len(t)
if lens < 1 or lens > 10 or (lent != lens + 1) or (s not in t):
print('No')
else:
print('Yes') |
p02823 | s951871133 | Accepted | import math
N, A, B= map(int, input().split())
if (A - B) % 2 == 0:
print(abs(A - B) // 2)
else:
t1 = A - 1
t2 = B - 1
t3 = N - A
t4 = N - B
t = min(t1, t2, t3, t4)
res = t + 1 + (abs(A - B) - 1) // 2
print(res) |
p02817 | s538266888 | Wrong Answer | a,b= input().split()
print(a+b) |
p02831 | s715333502 | Accepted | import math
a,b = map(int,input().split())
lcm = a*b//math.gcd(a,b)
print(lcm) |
p02552 | s573761894 | Accepted | a = int(input())
if a == 0:
print(1)
else:
print(0) |
p02785 | s934802117 | Accepted | H, K = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort(reverse=True)
ans = 0
for i in range(K,len(arr)):
ans += arr[i]
print(ans)
|
p03986 | s085182773 | Wrong Answer | X = input().rstrip() + "#"
s0 = X[0]
P = []
cnt = 1
for s in X[1:]:
if s==s0:
cnt += 1
else:
P.append(cnt)
cnt = 1
s0 = s
if X[0] == "T":
P = P[1:]
res = len(X) - 1
for i in range(0,len(P)-1,2):
if P[i] < P[i+1]:
res -= P[i]*2
else:
res -= P[i+1]*2
print(res) |
p02923 | s481854856 | Accepted | n = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = 0
tmp = H[0]
for h in H[1:]:
if h <= tmp:
cnt += 1
ans = max(ans, cnt)
if h > tmp:
cnt = 0
tmp = h
print(ans) |
p03625 | s008037971 | Accepted | n = int(input())
l = list(map(int,input().split()))
l.sort(reverse=True)
a = 0
b = 0
check = -1
for i in range(n-1):
if l[i]==l[i+1]:
if check != i:
if a == 0:
a = l[i]
check = i+1
elif b == 0:
b = l[i]
print(a*b)
|
p02916 | s978461676 | Wrong Answer | n = int(input())
s = 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
for i in range(n):
s += b[i]
for i in range(n-1):
if a[i+1] - a[i] == 1:
s += c[i]
print(s) |
p03329 | s089210476 | Wrong Answer | import math
N = int(input())
i = 0
while N > 0:
n = int(math.log(N, 6))
m = int(math.log(N, 9))
#print(m)
N =min(N-1, abs(N-6**n), abs(N-9**m))
#print(N)
i += 1
print(i)
|
p02641 | s281487713 | Accepted | x,n=map(int,input().split())
l=list(map(int,input().split()))
y=x
while True:
if x not in l:
print(x)
break
if y not in l:
print(y)
break
x-=1
y+=1
|
p03475 | s619705030 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(input())
c = [0]*(n-1)
s = [0]*(n-1)
f = [0]*(n-1)
for i in range(n-1):
c[i], s[i], f[i] = map(int, input().split())
ans = [0]*n
for i in range(n-1):
time = s[i] + c[i]
for j in range(i+1,n-1):
time = max(s[j], time//f[j]*f[j] )+c[j]
ans[i]=time
print(*ans,sep='\n')
|
p02552 | s876753460 | Wrong Answer | print(~int(input())) |
p03162 | s908820564 | Accepted | n = int(input())
abc = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * 3 for _ in range(n)]
dp[0][0] = abc[0][0]
dp[0][1] = abc[0][1]
dp[0][2] = abc[0][2]
for i in range(1, n):
dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + abc[i][0]
dp[i][1] = max(dp[i-1][2], dp[i-1][0]) + abc[i][1]
dp[i][2] = max(dp[i-1][0], dp[i-1][1]) + abc[i][2]
print(max(dp[-1]))
|
p03417 | s896812275 | Accepted | N, M = map(int, input().split())
if N <= 2 or M <= 2:
if N == 1 and M ==1:
ans = 1
elif N == 1 or M == 1:
ans = max(N-2, M-2)
else:
ans = 0
else:
ans = (N-2)*(M-2)
print(ans) |
p03317 | s296899672 | Accepted | import math
n,k=map(int,input().split());input();print([math.ceil((n-k)/(k-1))+1,1][n==k]) |
p02952 | s809956215 | Wrong Answer | n = int(input())
keta = len(str(n))
if n == 1:
print(n)
elif n == 2:
print(n)
elif n == 3:
ans = 9 + n - 99
print(ans)
elif n == 4:
ans = 999 - 99 + 9
print(ans)
elif n == 5:
ans = n - 9999 + 999 - 99 + 9
elif n == 6:
print(90909)
|
p02897 | s552118784 | Accepted | n = int(input())
num = int(n/2)
print((n-num)/n) |
p02678 | s807627612 | Accepted | from collections import deque
n, m = map(int, input().split())
g = [[] for _ in range(n+1)]
for _ in range(m):
a, b = map(int, input().split())
g[a].append([a, b])
g[b].append([b, a])
res = [-1 for _ in range(n+1)]
res[1] = 0
q = deque(g[1])
while q:
q_ = q.popleft()
if res[q_[1]] == -1:
for gi in g[q_[1]]: q.append(gi)
res[q_[1]] = q_[0]
print("Yes")
for i in res[2:]: print(i) |
p03069 | s280394469 | Accepted | N = int(input())
S = "." + input() + "#"
B = [0]*(N+2)
W = [0]*(N+2)
b = 0
for k in range(N+2):
if S[k] == "#":
b += 1
B[k] = b
w = 0
for k in range(N+1,-1,-1):
if S[k] == ".":
w += 1
W[k] = w
ans = 10**10
for k in range(N+1):
ans = min(ans,B[k]+W[k+1])
print(ans)
|
p03778 | s924774564 | Accepted | w, a, b = map(int, input().split())
print(max(a, b) - min(a, b) - w) if abs(a - b) > w else print(0) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.