problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02691 | s258584808 | Accepted | from collections import defaultdict as dfd
n = int(input())
a = [int(i) for i in input().split()]
d = dfd(int)
ans = 0
for i, a_i in enumerate(a, 1):
ans += d[i - a_i]
d[i + a_i] += 1
print(ans)
|
p04005 | s474372974 | Wrong Answer | A,B,C = map(int,input().split())
if A%2==0 or B%2==0 or C%2==0:
print(0)
else:
cmin = B*C
cmin = min(cmin,A*C)
Cmin = min(cmin,B*A)
print(cmin) |
p03487 | s340591359 | Accepted | import collections
N = int(input())
a = [int(i) for i in input().split()]
c = collections.Counter(a)
s = 0
for k,v in c.items():
if v - k >= 0:
s += v - k
else:
s += v
print(s) |
p02712 | s403963191 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
if 0 == i % 3 or 0 == i % 5:
pass
else:
ans += i
print(ans) |
p03433 | s244547890 | Accepted | a=int(input())
b=int(input())
a%=500
if a<=b:
print("Yes")
else:
print("No") |
p02959 | s829014446 | Accepted | n = int(input())
alst = list(map(int, input().split()))
blst = list(map(int, input().split()))
ans = 0
car = 0
for i in range(n):
plus = min(blst[i] + car, alst[i])
ans += plus
if plus == alst[i]:
car = blst[i] + car - alst[i]
car = min(car, blst[i])
else:
car = 0
ans += min(car, alst[-1])
print(ans) |
p03607 | s659331956 | Accepted | #!/usr/bin/env python3
n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
cnt = 1
ans = 0
for i in range(n-1):
if a[i] == a[i+1]:
cnt += 1
else:
if cnt %2: ans+= 1
cnt = 1
print(ans+cnt%2)
|
p03160 | s648126716 | Accepted | n = int(input())
height = list(map(int,input().split()))
cost = []
for i in range(n):
if i == 0:
cost.append(0)
elif i == 1:
cost.append(abs(height[i]-height[0]))
else:
a = cost[-1] + abs(height[i]-height[i-1])
b = cost[-2] + abs(height[i]-height[i-2])
cost.append(min([a,b]))
print(cost[-1])
|
p03035 | s435476777 | Accepted | a,p = map(int,input().split())
if a >= 13 :
print(p)
elif a >= 6 :
print(p//2)
else :
print(0) |
p02802 | s859477274 | Accepted | n, m = map(int, input().split())
AC = [0] * n
WA = [0] * n
w = 0
for i in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'AC' and AC[p] == 0:
AC[p] += 1
w += WA[p]
elif s == 'WA' and AC[p] == 0:
WA[p] += 1
print(sum(AC), w) |
p02744 | s856693169 | Accepted | N=int(input())
l=["a"]
a=ord("a")
for i in range(N-1):
la=[]
for j in l:
b=ord(max(j))
for k in range(a,b+2):
la.append(j+chr(k))
l=la
for i in l:
print(i) |
p03657 | s500726163 | Accepted | A, B = map(int, input().split())
print("Possible" if A%3==0 or B%3==0 or (A+B)%3==0 else "Impossible") |
p02699 | s202370710 | Wrong Answer | S, W = input().split()
if int(S)<=int(W)*2:
print("unsafe")
else:
print("safe") |
p02578 | s175377029 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(0, N - 1):
ans += max(0, A[i+1] - A[i])
print(ans)
|
p02711 | s704369721 | Accepted | def main():
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
N = input().strip()
if '7' in N:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02994 | s810701984 | Wrong Answer | n,l = map(int, input().split())
L = [0]*n
#l+i-1
for i in range(n):
L[i] += l+i
if(l < 0 and n + l < 0):
print(sum(L) - L[n-1])
elif(l <= 0 and n + l >= 0):
print(sum(L))
else:
print(sum(L) - L[0]) |
p02952 | s911207238 | Wrong Answer | n = input()
d = len(n)
s = 0
for i in range(1, d):
s += 9 * 10 ** (i - 1) if i % 2 else 0
s += int(n) - 10 ** (d - 1) if d % 2 else int(0)
print(s) |
p03487 | s478551880 | Wrong Answer | n = int(input())
a = sorted(list(map(int, input().split())))
b = set(a)
count = 0
z = 0
for i in b:
if i <= 10**5:
j = a.count(i)
if j < i:
count += j
z += j
else:
k = j - i
count += k
z += j
else:
f = len(a) - z
count += f
break
print(count) |
p02911 | s140639033 | Accepted | import collections
N, K, Q = map(int, input().split())
A = [int(input()) - 1 for i in range(Q)]
A_count = collections.Counter(A)
A_sum = sum(A_count.values())
for i in range(N):
if K - (A_sum - A_count[i]) <= 0:
print('No')
else:
print('Yes')
|
p03317 | s298387184 | Accepted | n,k = map(int, input().split())
a = list(map(int, input().split()))
if (n==k):
print(1)
else:
print(1+(n-k-1)//(k-1)+1) |
p02554 | s926613510 | Wrong Answer | mod = 10**9+7
n = int(input())
ans = int((n*(n-1)* 10**(n-2))) % mod
print(ans) |
p02700 | s790503331 | Accepted | import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
A, B, C, D = map(int, read().split())
taka = (A + D-1) // D
ao = (C+B-1) // B
if taka >= ao:
print("Yes")
else:
print("No")
|
p02639 | s894855048 | Wrong Answer | lst = [int(s) for s in input().split()]
print(str(lst.index(0))) |
p02881 | s352101606 | Accepted | n=int(input())
r=n**(1/2)
w=0
for i in range(1,int(r)+1):
if n%i==0:
w=i
x,y=w,n//w
if x!=1 and y!=1:
print(x+y-2)
else:
print(max(x,y)-1) |
p02572 | s450373735 | Wrong Answer | input_num = int(input())
input_list = list(map(int, input().split()))
sum = 0
for i in range(input_num):
for j in range(input_num - i - 1):
print(input_list[i], input_list[input_num -1-j])
sum += input_list[i] * input_list[input_num -1 - j]
print(sum % 1000000007)
|
p03331 | s391537778 | Wrong Answer | n = int(input())
min_k = 10000000000
for i in range(1,n//2):
sum_k = 0
a = str(i)
b = str(n-i)
for j in a:
sum_k += int(j)
for j in b:
sum_k += int(j)
min_k = min(min_k,sum_k)
print(min_k) |
p02912 | s890918136 | Accepted | import heapq
n,m = map(int,input().split())
a = list(map(int,input().split()))
a = list(map(lambda x: -x, a))
heapq.heapify(a)
#print(a)
for i in range(m):
x = heapq.heappop(a)
x = (-x)//2
heapq.heappush(a,-x)
print(-sum(a))
|
p02909 | s084026631 | Accepted | S = input()
if S == "Sunny":
print("Cloudy")
elif S =="Cloudy":
print("Rainy")
else:
print("Sunny") |
p03037 | s492788493 | Wrong Answer | N, M=map(int, input().split())
a=0
b=N-1
for i in range(M):
L,R=map(int, input().split())
a=max(a,L)
b=min(b,R)
print(b-a+1) |
p03041 | s828713617 | Accepted | N,K = map(int,input().split())
S = list(input())
for i in range(N):
if(i+1 == K):
S[i] = chr(ord(S[i]) + 32)
print(''.join(S)) |
p03329 | s172005276 | Wrong Answer | n = int(input())
price = {1}
for i in range(1, 100):
tmp = 6**i
if tmp > 10**5:
break
price.add(tmp)
for i in range(1, 100):
tmp = 9**i
if tmp > 10**5:
break
price.add(tmp)
price = list(price)
price.sort(reverse=True)
INF = 1 << 60
dp = [INF] * 2 * 10**5
dp[1] = 1
for i in range(1, n + 1):
for p in price:
dp[i + p] = min(dp[i] + 1, dp[i + p])
print(dp[n]) |
p03137 | s974837680 | Accepted | n, m = map(int, input(). split())
x = list(map(int, input(). split()))
x.sort()
l = [x[i+1]-x[i] for i in range(m-1)]
l.sort()
L = l[:-(n-1)]
if n == 1:
print(sum(l))
else:
print(sum(L))
|
p02577 | s047180045 | Wrong Answer | N = list(input())
sum_N = 0
for i in range(len(N)):
sum_N += int(N[i])
if sum_N%9 == 0:
print('yes')
else:
print('no') |
p02694 | s814128098 | Wrong Answer | import math
X = int(input())
price = 100
count = 0
while price<=X:
price = int(price*1.01)
count += 1
print(count) |
p03657 | s557857639 | Accepted | A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A+B) % 3 == 0:
print("Possible")
else:
print("Impossible")
|
p03206 | s531458675 | Accepted | print('Christmas'+' Eve'*(25-int(input()))) |
p02797 | s932448010 | Accepted | n,k,s=map(int,input().split())
for i in range(k):
print(s,end=" ")
for i in range(k,n):
if s==10**9:
print(s-1,end=" ")
else:
print(s+1,end=" ") |
p03448 | s643729542 | Accepted | a = int(input())
b = int(input())
c = int(input())
x = int(input())
c_nums = set(50 * i for i in range(c + 1))
res = 0
for i in range(a + 1):
for j in range(b + 1):
tmp = x - 500 * i - 100 * j
if tmp in c_nums:
res += 1
print(res)
|
p02727 | s932811870 | Accepted | # -*- coding: utf-8 -*-
X, Y, A, B, C = map(int, input().split())
p_list = list(map(int, input().split()))
p_list.sort(reverse=True)
q_list = list(map(int, input().split()))
q_list.sort(reverse=True)
r_list = list(map(int, input().split()))
red_list = p_list[:X]
green_list = q_list[:Y]
min_num = min(red_list[-1], green_list[-1])
white_list = [i for i in r_list if i > min_num]
ans_list = red_list + green_list + white_list
ans_list.sort(reverse=True)
ans_list = ans_list[:X + Y]
print(sum(ans_list)) |
p03160 | s217306878 | Accepted | N = int(input())
H = [int(i) for i in input().split()]
dp = [float("inf")] * N
dp[0], dp[1] = 0, abs(H[1]-H[0])
for i in range(2, N):
dp[i] = min(dp[i], dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
print(dp[N-1]) |
p02982 | s946878182 | Wrong Answer | import numpy as np
N, D = [int(i) for i in input().split()]
X = np.zeros((N,D))
for i in range(N):
X[i] = [int(i) for i in input().split()]
count_dummy=0
for i in range(N):
for j in range(i+1,N):
dist = (np.sum((X[i] - X[j])**2))**0.5
if dist.is_integer():
count_dummy+=1
count_dummy |
p03555 | s600390596 | Accepted | s1 = input()
s2 = input()
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
print('YES')
else:
print('NO') |
p03038 | s999798933 | Accepted | n, m = map(int,input().split())
nums = [[int(i),1] for i in input().split()]
for i in range(m):
b,c = map(int,input().split())
nums.append([c,b])
nums.sort(reverse=True)
sum = 0
for i in nums:
if i[1] > n:
sum += i[0]*n
break
else:
sum += i[0]*i[1]
n -= i[1]
print(sum)
|
p03338 | s422866200 | Accepted | n=int(input())
s=input()
count=0
for i in range(n):
str_1=s[0:i-1]
str_2=s[i-1:n]
if count<len(set(str_1)&set(str_2)):
count=len(set(str_1)&set(str_2))
print(count) |
p02923 | s934530685 | Wrong Answer | N = int(input())
H = list(map(int,input().split()))
ans = 0
tmp = 0
for n in range(N-1):
l = H[n]
r = H[n+1]
if l >= r:
tmp += 1
else:
tmp = 0
ans = max(ans,tmp)
ans = max(ans,tmp)
print(ans)
|
p02577 | s889990199 | Wrong Answer | N = int(input())
if N % 9 == 0:
print('yes')
else:
print('no') |
p03417 | s878223416 | Accepted |
def main():
N, M = map(int, input().split())
if N >= 2 and M >= 2:
ans = (N-2)*(M-2)
else:
if N == M:
ans = 1
else:
ans = max(N, M) - 2
print(ans)
main()
|
p03860 | s297887531 | Wrong Answer | li = input().split()
print('AtCoder,li[2][0],Contest')
|
p02657 | s965535711 | Wrong Answer | # スペース区切りの整数の入力
N, *d = map(int, open(0).read().split())
if N > 0:
A = 1
for O in d:
A = A * O
print(O)
if A > 10 ** 18:
A = -1
break
else:
A = 0
print(A) |
p03611 | s374135883 | Accepted | N = int(input())
A = list(map(int,input().split()))
X = [0 for i in range(10**5+10)]
for i in A:
X[i-1] += 1
X[i] += 1
X[i+1] += 1
ans = max(X)
print(ans) |
p03962 | s810274082 | Accepted | a,b,c=map(int,input().split())
ans=3
if a==b:
ans-=1
if b==c:
ans-=1
elif a==c:
ans-=1
if b==a:
ans-=1
elif c==b:
ans-=1
if a==c:
ans-=1
print(ans)
|
p02899 | s833341793 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
B = [None for _ in range(N)]
sB = [None for _ in range(N)]
for i in range(N):
for j in range(1,N+1):
if A[i] == j:
B[i] = j
sB[i] = str(B[i])
ans = ' '.join(str(a) for a in sB)
print(ans) |
p03137 | s629537811 | Accepted | #n=int(input())
n,m=map(int,input().split())
xl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
cuml=[]
if n>=m:
print(0)
else:
xl.sort()
rng=xl[m-1]-xl[0]
ans=rng
for i in range(1,m):
cuml.append(xl[i]-xl[i-1])
cuml.sort()
for i in range(n-1):
ans-=cuml[m-2-i]
print(ans) |
p02570 | s081611248 | Accepted | D,T,S=map(int,input().split())
if T >= D/S:
print("Yes")
else:
print("No")
|
p03814 | s976766850 | Accepted | s=input()
fdl=s.find("A")
fdr=s.rfind("Z")
print((fdr-fdl)+1) |
p03607 | s879211221 | Accepted | N = int(input())
A = [int(input()) for i in range(N)]
dicta = {}
for i in A:
if i not in dicta:
dicta[i] = 1
else:
dicta[i] += 1
ans = 0
for v in dicta.values():
if v%2 == 1:
ans += 1
print(ans) |
p03673 | s644180358 | Wrong Answer | n=int(input())
a=list(input().split())
if n > 3:
ans=''
ans += ' '.join(a[::-2])
ans += ' ' + ' '.join(a[::2])
print(ans)
else:
ans=[]
for i in range(n):
ans.append(a[i])
ans.reverse()
print(' '.join(ans)) |
p02613 | s411411898 | Wrong Answer | n = int(input())
s = [input() for _ in range(n)]
ac, wa, tle, re = 0, 0, 0, 0
for i in range(n):
if "AC" in s[i]:
ac += 1
elif "WA" in s[i]:
wa += 1
elif "TLE" in s[i]:
tle += 1
elif "RE" in s[i]:
re += 1
print("AC × ",ac)
print("WA × ",wa)
print("TLE × ",tle)
print("RE × ",re) |
p03037 | s255607341 | Wrong Answer | n, m = map(int, input().split())
cnt = 0
l_max= 0
r_min = float('inf')
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
print(r_min - l_max + 1)
|
p02880 | s456954744 | Accepted | import sys
N=int(input())
for i in range(1,10):
for j in range(1,10):
if N == i*j:
print('Yes')
sys.exit()
print('No') |
p03206 | s702986960 | Accepted | # A - Christmas Eve Eve Eve /
D = int(input())
if D == 25:
print('Christmas')
elif D == 24:
print('Christmas Eve')
elif D == 23:
print('Christmas Eve Eve')
elif D == 22:
print('Christmas Eve Eve Eve')
else:
print('')
|
p03289 | s291375611 | Accepted | s = list(input())
if s[0] == 'A':
if 'C'in s[2:len(s) - 1]:
s.remove('A')
s.remove('C')
s = ''.join(s)
if s.islower() == True:
print('AC')
else:
print('WA')
else:
print('WA')
else:
print('WA') |
p02987 | s770258877 | Wrong Answer |
S = input()
s = sorted(S)
if [s[0]==s[1] and s[2]==s[3]] and [s[1] != s[2]]:
print("Yes")
else:
print("No") |
p02742 | s726354421 | Accepted | import math
h,w = map(int,input().split())
#
if h==1 or w==1:
print(1)
else:
print((h*w+1)//2)
|
p02555 | s015235258 | Accepted | n=input()
z=[0]*(n+1)
z[0]=1
for i in xrange(1,n+1):
for j in xrange(i-3+1):
z[i]=(z[i]+z[j])%(pow(10,9)+7)
print z[-1] |
p02829 | s853658477 | Accepted | A = int(input())
B = int(input())
X = [1, 2, 3]
X.remove(A)
X.remove(B)
print(X[0])
|
p02859 | s608726453 | Wrong Answer | r = int(input())
print(r**r) |
p03281 | s245389968 | Wrong Answer | N = int(input())
counter = 0
ans = 0
for i in range(1,N+1):
for j in range(1, N+1):
if i % j == 0:
counter += 1
if counter == 8:
ans += 1
counter = 0
print(ans)
|
p02642 | s862529057 | Accepted | def main():
n = int(input())
a = list(map(int, input().split()))
a.sort()
tf = [0] * (a[-1] + 1)
for ea in a:
tf[ea] = 1
for i1 in range(n - 1):
if a[i1] == a[i1 + 1]:
tf[a[i1]] = 0
for i2 in range(2, a[-1]//a[i1] + 1):
tf[a[i1] * i2] = 0
r = sum(tf)
print(r)
if __name__ == '__main__':
main()
|
p03481 | s750965276 | Accepted | x,y = map(int,input().split())
ans = 1
while x <= y:
x = x*2
ans += 1
print(ans-1)
|
p03162 | s060541166 | Accepted | n = int(input())
abc = []
for i in range(n):
abc.append(list(map(int,input().split())))
dp = [[0]*3 for i 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):
for j in range(3):
for k in [1,2]:#j以外を選ぶ
dp[i][j] = max(dp[i][j],\
dp[i-1][(j+k)%3] +abc[i][j])
print(max(dp[-1]))
|
p02682 | s531313851 | Accepted | A,B,C,K = map(int,input().split())
ans = 0
if A >= K:
ans = 1*K
else:
ans += 1*A
K = K - A
if B >= K:
ans += 0*K
else:
ans += 0*B
K = K - B
ans += (-1)*K
print(ans) |
p03062 | s082781059 | Accepted | import numpy as np
def main():
n = int(input())
a = list(map(int, input().split()))
A = np.array(a)
B = np.where(A < 0, A * -1, A)
cnt = np.count_nonzero(A < 0)
#print(B)
s = B.sum()
if cnt % 2 == 0:
print(s)
else:
m = np.amin(B)
print(s - m * 2)
if __name__ == "__main__":
main()
|
p03254 | s182977025 | Accepted |
N, x = map(int, input().split())
A = [int(i) for i in input().split()]
A.sort()
ans = []
for i in A:
x -= i
#print(ans, x)
if x >= 0:
ans.append(i)
else:
break
if x > 0:
print(len(ans)-1)
else:
print(len(ans)) |
p02730 | s804124393 | Accepted | import sys
s = input()
for i in range(len(s)//2):
if s[i] != s[len(s) - i - 1]:
print("No")
sys.exit(0)
for i in range((len(s) - 1)//4):
if s[i] != s[(len(s) - 1)//2 - i - 1]:
print("No")
sys.exit(0)
print("Yes") |
p02833 | s519541644 | Accepted | N=int(input())
if int(N)%2==1:
print(0)
exit()
ans=0
N//=2
for i in range(1,1000):
ans+=N//(5**i)
if N<5**i:
print(ans)
exit()
|
p02731 | s914444999 | Accepted | from sys import stdin
input = stdin.readline
def main():
L = int(input())
print((L/3)**3)
if(__name__ == '__main__'):
main()
|
p03076 | s654384965 | Accepted | # nabc123_b.py
# 調理時間%10=0 をとった後、調理時間%10 が大きい順にとって行く
dishes = [int(input()) for i in range(5)]
lest_time = 0
ans = 0
for dish in dishes:
if dish%10==0:
ans += (dish)
else:
ans += (dish+10-dish%10)
if lest_time < 10-dish%10 and dish%10!=0:
lest_time = 10-dish%10
print(ans-lest_time)
|
p03665 | s770415053 | Accepted | N,P = map(int,input().split())
A = list(map(int, input().split()))
for i in A:
if i % 2 == 1:
print(2**(N-1))
exit()
print(2 ** N if P == 0 else 0) |
p02848 | s672191091 | Wrong Answer | N = int(input())
S = input()
ans = ''
Z_s = 'Z'
for i in range(len(S)):
ord_s = ord(S[i]) + N
if ord_s > ord(Z_s):
ord_s -= ord('Z') - ord('A')
ans += chr(ord_s)
print(ans) |
p03331 | s659480253 | Accepted | N = int(input())
s = [(i+1, N-i-1) for i in range((N-1) // 2 + 1)]
ss = [sum(list(map(int,list(str(v[0])[::1])))) + sum(list(map(int,list(str(v[1])[::1])))) for v in s]
print(min(ss)) |
p02989 | s265205194 | Wrong Answer | n = int(input())
d = list(map(int,input().split()))
d.sort
i = int(len(d)/2)
if d[i] == d[i-1]:
print(0)
else:
print(d[i]) |
p02882 | s472075702 | Wrong Answer | import math
import sys
a, b, x = map(int, input().split())
up, down = 0, b
a_dec = 2*x / (a * b)
print(a_dec)
if a_dec > a:
up = 2 * x/(a**2) - b
up = b - up
c = (a**2+up**2)**(1/2)
sys.exit(0)
c = (a_dec**2+b**2)**(1/2)
print(math.degrees(math.asin(b/c)))
|
p02786 | s483297974 | Accepted | import numpy as np
H = int(input())
count = 0
ans = 0
while True:
H = np.floor(H/2)
count += 1
if H == 0:
print(2 ** count - 1)
break |
p03645 | s836302246 | Wrong Answer | n, m = map(int, input().split())
A, B = [], []
ans = 'IMPOSSIBLE'
for i in range(m):
a, b = map(int, input().split())
A.append(a)
B.append(b)
now = 1
result = n in B
if result == False:
print(ans)
exit()
else:
be = B.index(n)
before = A[be]
for i in range(m):
if B[i] == before:
if A[i] == now:
ans = 'POSSIBLE'
break
print(ans) |
p03438 | s907332006 | Accepted | def main():
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
cnt = 0
for i in range(n):
if a[i] < b[i]:
cnt += (b[i]-a[i])//2
else:
cnt += b[i]-a[i]
if cnt >= 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
p02789 | s301887130 | Accepted | a,b = map(int,input().split())
print("Yes" if a==b else "No") |
p02790 | s340582608 | Wrong Answer | a, b = map(int, input().split())
myans = ''
if a > b:
for i in range(a):
myans += str(b)
elif b <= a:
for i in range(b):
myans += str(a)
print(myans) |
p03557 | s971489280 | Wrong Answer | import bisect
N = int(input())
*A, = map(int, input().split())
*B, = map(int, input().split())
*C, = map(int, input().split())
A.sort()
B.sort()
C.sort()
A_B = [0]*N
B_C = [0]*N
for i in range(N):
count = 0
index = bisect.bisect_right(A,B[i])
A_B[i] = index
for i in range(N):
count = 0
index = bisect.bisect_left(C,B[i])
B_C[i] = len(C)-index
sum = 0
for i in range(N):
sum = sum + B_C[i]*A_B[i]
print(sum) |
p02820 | s778321058 | Accepted | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
rsp = [set() for i in range(3)]
ans = 0
for i in range(N):
if T[i] == 'r' and i - K not in rsp[0]:
ans += P
rsp[0].add(i)
elif T[i] == 's' and i - K not in rsp[1]:
ans += R
rsp[1].add(i)
elif T[i] == 'p' and i - K not in rsp[2]:
ans += S
rsp[2].add(i)
print(ans)
|
p02724 | s750255137 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))
def main():
X = int(input())
luck = (X // 500) * 1000 + (X % 500) // 5 * 5
print(luck)
if __name__ == '__main__':
main() |
p02612 | s957234318 | Accepted | N = int(input())
p= N%1000
if p==0:
print(0)
else:
print(1000-p)
|
p03011 | s819245601 | Wrong Answer | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
l = LI()
print(l[0]+l[1]) |
p03387 | s414333147 | Wrong Answer | ABC = [int(i) for i in input().split()]
m = sorted(ABC)
count = 0
if m[2]%2 == 0:
m[2] += 1
m[0] += 1
count += 1
n = m[1] - m[0]
l = m[2] - m[1]
print(n//2 + l + count) |
p02719 | s845034777 | Accepted | N, K = map(int, input().split())
if N > K:
N -= (N//K)*K
ans = N if N <= abs(N-K) else abs(N-K)
print(ans)
# flag = True
# while flag:
# if N > K:
# N = abs(N-K)
# else:
# ans = N if N <= N -K else N-K
# flag = False |
p03799 | s614036395 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = map(int, input().split())
res = 0
if 2 * n <= m:
res += n
m -= n * 2
res += m // 4
else:
res += m // 2
print(res)
if __name__ == '__main__':
resolve()
|
p03250 | s846016934 | Wrong Answer | l=list(map(str,input().split()))
a=int(l[0]+l[1])+int(l[2])
b=int(l[0])+int(l[1]+l[2])
print(max(a,b)) |
p03475 | s267125204 | Accepted | import sys
readline = sys.stdin.readline
N = int(readline())
CSF = [list(map(int, readline().split())) for _ in range(N-1)]
for i in range(N):
time = 0
for c, s, f in CSF[i:N-1]:
if time < s:
time = s
else:
time = (time+f-1)//f*f
time += c
print(time)
|
p03693 | s241509687 | Accepted | r,g,b = [c for c in input().split()]
print("YES" if int(r+g+b) % 4 == 0 else "NO") |
p03785 | s152921378 | Accepted | import sys
input = sys.stdin.readline
N, C, K = map(int, input().split())
T = [int(input()) for _ in range(N)]
T.sort()
ans = 0
i = 0
while i<N:
lim = T[i]+K
ans += 1
cnt = 0
while i<N and cnt<C and T[i]<=lim:
i += 1
cnt += 1
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.