input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
n = int(eval(input()))
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
tmp = 0
for p in range(2**n):
profit = 0
for j in range(n):
if((p >> j) & 1):
profit += (value[j] - cost[j])
if profit > tmp:
tmp = profit
print(tmp)
|
n = int(eval(input()))
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
tmp = 0
for i in range(len(value)):
profit = value[i] - cost[i]
if profit > 0:
tmp += profit
print(tmp)
|
p03060
|
N = int(eval(input()))
V = list(map(int,input().split()))
C = list(map(int,input().split()))
res = []
for i in range(1 << N):
X = Y = 0
for j in range(N):
if ((i >> j) & 1):
X += V[j]
Y += C[j]
res.append(X-Y)
print((max(res)))
|
def ans():
N = int(eval(input()))
V = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = 0
for i in range(N):
if V[i] > C[i]:
ans += V[i] - C[i]
print(ans)
ans()
|
p03060
|
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(1 << n):
tmp = 0
for j in range(n):
if(i >> j & 1):
tmp += v[j] - c[j]
ans = max(ans, tmp)
print(ans)
|
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(n):
if v[i] - c[i] > 0:
ans += v[i] - c[i]
print(ans)
|
p03060
|
def main():
N = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
maxi = 0
for i in range(2 ** N):
binary = list(map(int, format(i, 'b').zfill(N)))
ans = 0
for j, k in enumerate(binary):
if k == 1:
ans += V[j] - C[j]
if ans > maxi:
maxi = ans
print(maxi)
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
K = [V[i] - C[i] for i in range(N)]
ans = 0
for k in K:
if k > 0:
ans += k
print(ans)
if __name__ == "__main__":
main()
|
p03060
|
N = int(eval(input()))
V = [int(n) for n in input().split()]
C = [int(n) for n in input().split()]
B = []
for i in range(N):
B.append(V[i] - C[i])
#print(B)
max_profit = 0
for i in range(2**N):
profit = 0
for j in range(N):
if i & (1 << j):
profit += B[j]
max_profit = max(max_profit, profit)
print(max_profit)
|
N = int(eval(input()))
V = [int(n) for n in input().split()]
C = [int(n) for n in input().split()]
profit = 0
for i in range(N):
if V[i] - C[i] >= 0:
profit += V[i] - C[i]
print(profit)
|
p03060
|
n=int(eval(input()))
v=list(map(int, input().split()))
c=list(map(int, input().split()))
ans=0
for i in range(2 ** n):
total = 0
for j in range(n):
if ((i >> j) & 1):
total+=v[j]-c[j]
ans=max(ans,total)
print(ans)
|
n=int(eval(input()))
v=list(map(int, input().split()))
c=list(map(int, input().split()))
ans=0
for i in range(n):
if (v[i]>c[i]):
ans+=v[i]-c[i]
print(ans)
|
p03060
|
n = int(eval(input()))
v = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
ans += max(v[i]-c[i],0)
print(ans)
|
n = int(eval(input()))
v = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
if v[i]-c[i] >0:
ans += v[i]-c[i]
print(ans)
|
p03060
|
N = int(eval(input()))
v_list = list(map(int, input().split()))
c_list = list(map(int, input().split()))
max_diff = -10000000
for selection in range(1 << N):
v_tmp = 0
c_tmp = 0
for idx in range(N):
if (selection >> idx) & 1:
v_tmp += v_list[idx]
c_tmp += c_list[idx]
max_diff = max(max_diff, v_tmp - c_tmp)
print(max_diff)
|
from itertools import combinations
N = int(eval(input()))
v_list = list(map(int, input().split()))
c_list = list(map(int, input().split()))
max_diff = -10000000
for n_selection in range(0, N+1):
v_selected = list(combinations(v_list, n_selection))
c_selected = list(combinations(c_list, n_selection))
if n_selection == 0:
max_diff = max(max_diff, 0)
for i in range(len(v_selected)):
X = sum(v_selected[i])
Y = sum(c_selected[i])
max_diff = max(max_diff, X - Y)
print(max_diff)
|
p03060
|
n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(2 ** n):
b = [0] * n
for j in range(n):
if i >> j & 1:
b[j] = 1
X = sum([v for i, v in enumerate(V) if b[i] == 1])
Y = sum([c for i, c in enumerate(C) if b[i] == 1])
ans = max(ans, X - Y)
print(ans)
|
n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for v, c in zip(V, C):
if v > c:
ans += v - c
print(ans)
|
p03060
|
n = int(eval(input()))
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
ret = 0
for state in range((1 << n) - 1):
values = costs = 0
for shift in range(n):
if (state >> shift) & 1 == 1:
values += value[shift]
costs += cost[shift]
ret = max(ret, values - costs)
print(ret)
|
n = int(eval(input()))
value = list(map(int, input().split()))
cost = list(map(int, input().split()))
ret = 0
for state in range((1 << n)):
values = costs = 0
for shift in range(n):
if (state >> shift) & 1 == 1:
values += value[shift]
costs += cost[shift]
ret = max(ret, values - costs)
print(ret)
|
p03060
|
n = int(eval(input()))
v = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(2**n):
x = []
y = []
for j in range(n):
if (i>>j) & 1:
x.append(v[n - j - 1])
y.append(c[n - j - 1])
ans = max(ans,sum(x) - sum(y))
print(ans)
|
n = int(eval(input()))
v = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
# for i in range(2**n):
# x = []
# y = []
# for j in range(n):
# if (i>>j) & 1:
# x.append(v[n - j - 1])
# y.append(c[n - j - 1])
# ans = max(ans,sum(x) - sum(y))
for i in range(n):
if v[i] > c[i]:
ans += v[i] - c[i]
print(ans)
|
p03060
|
import itertools
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
a = itertools.combinations(list(range(n)), i)
for j in a:
x, y = 0, 0
for k in j:
x += v[k]
y += c[k]
ans = max(ans, x-y)
print(ans)
|
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
vc = []
for i, j in zip(v, c):
vc.append(i-j)
vc = sorted(vc, reverse=True)
ans = 0
for i in vc:
if i <= 0:
break
ans += i
print(ans)
|
p03060
|
N = int(eval(input()))
xy = [input().split() for i in range(N)]
calculate_yen = lambda xyi: int(xyi[0]) if xyi[1] == 'JPY' else float(xyi[0]) * 380000.0
total = sum(map(calculate_yen, xy))
print(total)
|
N = int(eval(input()))
xy = [input().split() for i in range(N)]
calculate_yen = lambda xyi: int(xyi[0]) if xyi[1] == 'JPY' else float(xyi[0]) * 380000.0
calculate_total_yen = lambda xy : sum(map(calculate_yen, xy))
total = calculate_total_yen(xy)
print(total)
|
p03110
|
n = int(eval(input()))
res = 0
for i in range(n):
x, u = input().split()
x = float(x)
if u == 'JPY':
res += x
else:
res += (380000 * x)
print(res)
|
res=0
for i in range(int(eval(input()))):
x,u=input().split()
x=float(x)
res+=x if u>'C'else 380000*x
print(res)
|
p03110
|
n = int(eval(input()))
ans = 0
for i in range(n):
x,u = input().split()
x = float(x)
ans += x if u=='JPY' else x*380000
print(ans)
|
n = int(eval(input()))
ans = 0
for i in range(n):
x,u = input().split()
x = float(x)
if u=='JPY':
ans += x
else:
ans += x* 380000
print(ans)
|
p03110
|
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(eval(input()))
answer = 0
for _ in range(N):
x,u = input().split()
if u == "JPY":
money = float(x)
else:
money = float(x)*380000.0
answer += money
print(answer)
|
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(eval(input()))
answer = 0
for _ in range(N):
x,u = input().split()
if u == "JPY":
money = int(x)
else:
money = float(x)*380000.0
answer += money
print(answer)
|
p03110
|
print((sum(0x5CC60**("B"in i)*float(i[:-4])for i in open(0).readlines()[1:])))
|
n=int(eval(input()))
ans=0
for i in range(n):
a,b=input().split()
if b=="JPY":
ans+=int(a)
else:
ans+=float(a)*380000.0
print(ans)
|
p03110
|
N = int(eval(input()))
ans = 0
for _ in range(N):
x, u = input().split()
if u == 'JPY':
ans += float(x)
elif u == 'BTC':
ans += float(x) * 380000.0
print(ans)
|
N = int(eval(input()))
ans = 0.0
for _ in range(N):
x, u = input().split()
if u == 'JPY':
ans += float(x)
elif u == 'BTC':
ans += float(x) * 380000.0
print(ans)
|
p03110
|
n = int(eval(input()))
a = []
b = []
for i in range(n):
x,u = list(map(str,input().split()))
if u == "JPY":
a.append(int(x))
elif u == "BTC":
b.append(float(x))
print((sum(a)+sum(b)*380000.0))
|
n = int(eval(input()))
l = []
m = []
a = 0
b = 0
for i in range(n):
x,u = list(map(str,input().split()))
l.append(float(x))
m.append(u)
for i in range(n):
if m[i] == "JPY":
a += l[i]
elif m[i] == "BTC":
b += l[i]
print((a+b*380000))
|
p03110
|
N=int(eval(input()))
X=[]
U=[]
ans=0
for i in range(N):
A,B=input().split()
X.append(float(A))
U.append(B)
for i in range(N):
if U[i]=="JPY":
ans+=X[i]
elif U[i]=="BTC":
ans+=(X[i]*380000.0)
print(ans)
|
N=int(eval(input()))
ans=0
for i in range (N):
A,B=input().split()
if B=="JPY":
ans+=float(A)
elif B=="BTC":
ans+=float(A)*380000.0
print(ans)
|
p03110
|
N = int(eval(input()))
sum=0
for i in range(N):
x, u = list(map(str, input().split()))
if u == "JPY":
sum+=int(x)
else:
sum+=float(x)*380000
print(sum)
|
N = int(eval(input()))
sum=0
for i in range(N):
x, u = input().split()
if u == "JPY":
sum+=int(x)
else:
sum+=float(x)*380000
print(sum)
|
p03110
|
print((sum(float(s[:-4])*[380000,1][s[-4]>'C']for s in open(0).readlines()[1:])))
|
print((sum(float(s[:-4])*(s[-4]>'C'or 380000)for s in open(0).readlines()[1:])))
|
p03110
|
print((sum(380000**('B'in s)*float(s[:-4])for s in open(0).readlines()[1:])))
|
print((sum(38e4**('B'in s)*float(s[:-4])for s in open(0).readlines()[1:])))
|
p03110
|
N = int(eval(input()))
JPY = 0
BTC = 0
for _ in range(N):
a = list(input().split())
if a[1] == 'JPY': JPY += int(a[0])
else: BTC += float(a[0])
print((float(JPY + BTC*380000.0)))
|
n = int(eval(input()))
money = [input().split() for _ in range(n)]
print((sum([float(x)*{"JPY":1, "BTC":380000}[u] for x,u in money])))
|
p03110
|
def ans():
N = int(eval(input()))
btc = 380000
cnt = 0
for _ in range(N):
x, y = input().split()
if(y == "JPY"):
cnt += int(x)
else:
cnt += btc*float(x)
print(cnt)
ans()
|
N = int(eval(input()))
btc = 380000
money = 0
for _ in range(N):
x, y = input().split()
if(y == "BTC"):
money += float(x)*btc
else:
money += int(x)
print(money)
|
p03110
|
num = int(eval(input()))
sum = 0
while num > 0:
a,b = input().split(" ")
if b == "JPY":
sum += int(a)
else:
c = float(a) * 380000
sum += c
num -= 1
print(sum)
|
N = int(eval(input()))
ans = 0
for i in range(N):
x, u = input().split()
if u == "BTC":
ans += float(x)*380000
else:
ans += int(x)
print(ans)
|
p03110
|
import sys
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def pbit(aa,L):
for a in aa:print(format(a,"b").zfill(L))
print()
def main():
n=II()
aa=[[int(c) for c in SI()] for _ in range(n-1)]
#p2D(aa)
# 人iが勝てる相手をbitで管理する
win=[0]*n
for i,row in enumerate(aa,1):
for j,a in enumerate(row):
if a:win[i]|=1<<j
else:win[j]|=1<<i
#pbit(win,n)
# dpl[i]...[j,i]の範囲で優勝できるjをbitで
# dpr[i]...[i,j]の範囲で優勝できるjをbitで
dpl=[1<<i for i in range(n)]
dpr=[1<<i for i in range(n)]
for d in range(1,n):
for i in range(n):
j=i+d
if j<n and dpl[j] & dpr[i+1] & win[i]:dpl[j]|=1<<i
j=i-d
if j>=0 and dpl[i-1] & dpr[j] & win[i]:dpr[j]|=1<<i
#pbit(dpl,n)
#pbit(dpr,n)
#print(format(dpl[n-1]&dpr[0],"b").zfill(n))
print(bin(dpl[n-1]&dpr[0]).count("1"))
main()
|
import sys
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def pbit(aa,L):
for a in aa:print(format(a,"b").zfill(L))
print()
def main():
n=II()
aa=[[int(c) for c in SI()] for _ in range(n-1)]
#p2D(aa)
# 人iが勝てる相手をbitで管理する
win=[0]*n
for i,row in enumerate(aa,1):
for j,a in enumerate(row):
if a:win[i]|=1<<j
else:win[j]|=1<<i
#pbit(win,n)
# dpl[i]...[j,i]の範囲で優勝できるjをbitで
# dpr[i]...[i,j]の範囲で優勝できるjをbitで
dpl=[1<<i for i in range(n)]
dpr=[1<<i for i in range(n)]
for d in range(1,n):
for i in range(n-d):
j=i+d
if dpl[j] & dpr[i+1] & win[i]:dpl[j]|=1<<i
for i in range(d,n):
j=i-d
if dpl[i-1] & dpr[j] & win[i]:dpr[j]|=1<<i
#pbit(dpl,n)
#pbit(dpr,n)
#print(format(dpl[n-1]&dpr[0],"b").zfill(n))
print(bin(dpl[n-1]&dpr[0]).count("1"))
main()
|
p03028
|
print((input().replace('1','-').replace('9','1').replace('-','9')))
|
print((1110-int(eval(input()))))
|
p03242
|
N=input()
for i in range(3):
if i < 2:
if N[i] == "1":
print("9",end="")
else:
print("1",end="")
else:
if N[i] == "1":
print("9")
else:
print("1")
|
print((input().translate(str.maketrans({"1":"9","9":"1"}))))
|
p03242
|
N=int(eval(input()))
print((1110-N))
|
print((1110-int(eval(input()))))
|
p03242
|
print((input().translate(str.maketrans({'1':'9','9':'1'}))))
|
print((1110-int(eval(input()))))
|
p03242
|
print((input().replace('1','a').replace('9','1').replace('a','9')))
|
print((1110-int(eval(input()))))
|
p03242
|
n = int(eval(input()))
lst = []
res = []
while n > 0:
lst.append(n%10)
n //= 10
lst.reverse()
for i in lst:
if i == 1:
res.append(9)
elif i == 9:
res.append(1)
else:
res.append(i)
S = ""
for j in res:
S += str(j)
print(S)
|
N = list(str(eval(input())))
if N[0] == '9':
N[0] = '1'
else :
N[0] = '9'
if N[1]=='9':
N[1] = '1'
else:
N[1] = '9'
if N[2] == '9':
N[2] = '1'
else:
N[2] = '9'
print((N[0]+N[1]+N[2]))
|
p03242
|
n=int(eval(input()))
print((1110-n))
|
print((1110-int(eval(input()))))
|
p03242
|
import sys
# 関数 solve は，もちろん，問題に応じて書き換える
def solve(a):
return 1110-a
# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
line = sys.stdin.readline().rstrip()
return int(line)
def main():
n = readQuestion()
answer = solve(n)
print(answer)
if __name__ == '__main__':
main()
|
a=int(eval(input()))
print((1110-a))
|
p03242
|
n = str(eval(input()))
print((n.replace('1', 'a').replace('9', '1').replace('a', '9')))
|
n = str(eval(input()))
nn = []
for i in n:
if i == '1':
nn.append('9')
else:
nn.append('1')
print((''.join(nn)))
|
p03242
|
print((input().rstrip().replace("1","a").replace("9","1").replace("a","9")))
|
print((1110-int(eval(input()))))
|
p03242
|
x = list(map(int, input().split()))
for i in range(0, len(x)):
if (x[i] == 0):
print((i + 1))
break
|
x = list(map(int, input().split()))
print((x.index(0) + 1))
|
p02639
|
a,b,c,d,e=list(map(int,input().split()))
if a==0:
print((1))
elif b==0:
print((2))
elif c==0:
print((3))
elif d==0:
print((4))
elif e==0:
print((5))
|
s=list(map(int,input().split()))
a=sum(s)
print((15-a))
|
p02639
|
A = list(map(int, input().split()))
key = 0
for i,a in enumerate(A):
if a == 0:
key = i+1
break
print(key)
|
print((15 - sum(list(map(int, input().split())))))
|
p02639
|
x = list(map(int,input().split()))
for i in range(5):
if x[i] == 0:
print((i+1))
|
x = list(map(int,input().split()))
for i in range(0, 5):
if x[i] != 0:
pass
else:
print((i+1))
|
p02639
|
print((list(input().split()).index("0")+1))
|
n = list(map(int, input().split()))
print((n.index(0)+1))
|
p02639
|
l = input().split()
print((l.index('0')+1))
|
x = list(map(int, input().split()))
print((x.index(0) + 1))
|
p02639
|
a, b, c, d, e = list(map(int, input().split()))
if a == 0:
print((1))
elif b == 0:
print((2))
elif c == 0:
print((3))
elif d == 0:
print((4))
else:
print((5))
|
a = list(map(int, input().split()))
print((a.index(0)+1))
|
p02639
|
import sys
input = sys.stdin.readline
a = list(map(int, input().rstrip().split(' ')))
for i in range(len(a)):
if a[i] == 0:
print((i+1))
break
|
import sys
input = sys.stdin.readline
a = list(map(int, input().split(' ')))
for i in range(len(a)):
if a[i] == 0:
print((i+1))
break
|
p02639
|
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
x = list(map(int, input().split()))
print((x.index(0)+1))
if __name__ == "__main__":
main()
|
print((list(map(int,input().split())).index(0)+1))
|
p02639
|
print((input().split().index("0")+1))
|
#!/usr/bin/env python3
print((15 - sum(map(int, input().split()))))
|
p02639
|
def LI():return list(map(int,input().split()))
def MI():return list(map(int,open(0).read().split()))
def I():return int(eval(input()))
def yes():print("Yes")
def no():print("No")
from collections import deque, Counter
from heapq import heappop, heappush
INF=float("inf")
# import math
# pi=math.pi
# import numpy as np
x=LI()
ans=x.index(0)
print((ans+1))
|
x=list(map(int,input().split()))
print((x.index(0)+1))
|
p02639
|
a, b, c, d, e = list(map(int, input().split()))
if a == 0:
print((1))
elif b == 0:
print((2))
elif c == 0:
print((3))
elif d == 0:
print((4))
else:
print((5))
|
arr = list(map(int, input().split()))
print((arr.index(0)+1))
|
p02639
|
import sys
ans = []
a = list(map(int,input().split()))
for i in range(5):
if a[i] == 0:
ans.append(i+1)
for i in ans:
print(i)
|
x = list(map(int,input().split()))
for i in range(5):
if x[i] == 0:
print((i+1))
|
p02639
|
x1, x2, x3, x4, x5 = list(map(int, input().split()))
if x1 ==0:
print((1))
if x2 ==0:
print((2))
if x3 ==0:
print((3))
if x4 ==0:
print((4))
if x5 ==0:
print((5))
|
x = list(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i + 1))
|
p02639
|
s = list(map(int, input().split()))
b = s.index(0)
print((b + 1))
|
n = list(map(int, input().split()))
s = n.index(0)
print((s + 1))
|
p02639
|
A=[int(_) for _ in input().split()]
B=sum(A)
S=15-B
print(S)
|
A=[int(_) for _ in input().split()]
print((15-sum(A)))
|
p02639
|
x = list(map(int, input().split()))
for i in range(len(x)):
if x[i] is 0:
print((i+1))
|
x = list(map(int, input().split()))
for i in range(len(x)):
if x[i] == 0:
print((i+1))
|
p02639
|
a = list(map(int, input().split()))
print((a.index(0)+1))
|
a = list(map(int, input().split()))
for i in range(5):
if a[i] == 0:
print((i+1))
|
p02639
|
def main():
A = [False]*5
B = [int(i) for i in input().split()]
for b in B:
if b == 0:
continue
A[b-1] = True
for i, a in enumerate(A):
if not a:
print((i+1))
if __name__ == '__main__':
main()
|
def main():
A = [int(i) for i in input().split()]
B = [False]*5
for a in A:
if a == 0:
continue
B[a-1] = True
for i, b in enumerate(B):
if not b:
print((i+1))
break
if __name__ == '__main__':
main()
|
p02639
|
l=list(map(int,input().split()))
for i in range(5):
if l[i]==0:
print((i+1))
break
|
l=list(map(int,input().split()))
for i in range(5):
if l[i]!=i+1:
print((i+1))
|
p02639
|
l = list(map(int, input().split()))
print((l.index(0) + 1))
|
print((input().split().index("0") + 1))
|
p02639
|
import sys
from collections import deque
from itertools import *
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
x = LS()
for i,xx in enumerate(x):
if xx == '0':
print((i+1))
exit()
|
#!/usr/bin/env pypy3acc submit
import sys
from collections import deque
from itertools import *
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
x = LS()
for i,xx in enumerate(x):
if xx == '0':
print((i+1))
exit()
|
p02639
|
#!/usr/bin/env pypy3 submit
import sys
from collections import deque
from itertools import *
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
x = LS()
for i,xx in enumerate(x):
if xx == '0':
print((i+1))
exit()
|
#!/usr/bin/env PyPy3 submit
import sys
from collections import deque
from itertools import *
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
x = LS()
for i,xx in enumerate(x):
if xx == '0':
print((i+1))
exit()
|
p02639
|
x = tuple(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i+1))
|
x = list(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i+1))
|
p02639
|
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
A = list(map(int, input().split()))
a = A.index(0)
print((a+1))
|
print((list(map(int, input().split())).index(0)+1))
|
p02639
|
import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(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)
mod = 10**9+7
x1 = l()
for i in range(5):
if i+1 != x1[i]:
print((i+1))
|
A = list(map(int,input().split()))
print((A.index(0)+1))
|
p02639
|
X = [*list(map(int, input().split()))]
for i in range(len(X)):
if X[i] == 0: print((i+1))
|
print((15 - sum([*list(map(int, input().split()))])))
|
p02639
|
x = list(map(int, input().split()))
print((list(set(range(1, 5 + 1)) - set(x))[0]))
|
x = list(map(int, input().split()))
print((sum(range(1, 5 + 1)) - sum(x)))
|
p02639
|
X_s = list(map(int, input().split()))
for i in range(len(X_s)):
num = X_s[i]
if (num == 0):
print((i + 1))
|
X_s = list(map(int, input().split()))
for i in range(len(X_s)):
num = X_s[i]
if (num == 0):
print((i + 1))
break
|
p02639
|
def main():
*x, = list(map(int, input().split()))
print((x.index(0) + 1))
if __name__ == '__main__':
main()
# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
# while abs(ok - ng) > 1:
# mid = (ok + ng) // 2
# if func(mid):
# ok = mid
# else:
# ng = mid
# return ok
|
def main():
for i, x in enumerate(map(int, input().split()), start=1):
if x == 0:
print(i)
return
if __name__ == '__main__':
main()
|
p02639
|
nums = list(input().split())
for i, j in enumerate(nums):
if j == '0':
print((i+1))
break
|
nums = list(input().split())
for i, j in enumerate(nums):
if j == '0':
print((i+1))
|
p02639
|
n = list(input().split())
for i in range(len(n)):
if n[i] == "0":
print((int(i)+1))
|
n = list(input().split())
print((n.index("0")+1))
|
p02639
|
x=list(map(int,input().split()))
print((x.index(0)+1))
|
print((input().find('0')//2+1))
|
p02639
|
l = list(map(int,input().split()))
xr = 0
for i in range(1,6):
xr ^= i
for i in l:
xr ^= i
print(xr)
|
l = list(map(int,input().split()))
xr = 0
for i in range(5):
xr ^= (i+1)
xr ^= l[i]
print(xr)
|
p02639
|
l = list(map(int,input().split()))
xr = 0
for i in range(5):
xr ^= (i+1)
xr ^= l[i]
print(xr)
|
l = list(map(int,input().split()))
xr = 0
for i in range(5):
xr ^= (i+1)^l[i]
print(xr)
|
p02639
|
x = [int(i) for i in input().split()]
for i in range(5):
if x[i] == 0:
print((i+1))
break
|
x = [int(i) for i in input().split()]
print((x.index(0)+1))
|
p02639
|
pos = 0
for n in map(int, input().split()):
pos += 1
if n == 0:
break
print(pos)
|
print((sum(range(6)) - sum(list(map(int, input().split())))))
|
p02639
|
print((list(map(int, input().split())).index(0) + 1))
|
print((int(input().split().index("0"))+1))
|
p02639
|
a=sum(map(int, input().split()))
print((15-a))
|
print((15-sum(map(int, input().split()))))
|
p02639
|
x = list(map(int, input().split()))
xi = 0
for i in x:
xi += 1
if i == 0:
print(xi)
|
x = list(map(int, input().split()))
ans = 15
for _ in range(len(x)):
ans -= x[_]
print(ans)
|
p02639
|
a, b, c, d, e = list(map(int,input().split()))
if a == 0:
print((1))
elif b == 0:
print((2))
elif c == 0:
print((3))
elif d == 0:
print((4))
elif e == 0:
print((5))
|
x=list(map(int,input().split()))
for i in range(5):
if x[i]==0:
print((i+1))
|
p02639
|
books1= list(map(int, input().split()))
i=0
while(i<len(books1)):
if(books1[i]==0):
print((i+1))
break
i+=1
|
books1= list(map(int, input().split()))
i=0
while(i<len(books1)):
if(books1[i]==0):
break
i+=1
print((i+1))
|
p02639
|
X = [int(i) for i in input().split()]
print((X.index(0) + 1))
|
print((15-sum([int(i) for i in input().split()])))
|
p02639
|
a = list(map(int, input().split()))
b = a.index(0)
print((b+1))
|
x = list(map(int, input().split()))
print((x.index(0)+1))
|
p02639
|
m =list(map(int, input().split()))
for i in range(5):
if m[i] == 0:
print((i + 1))
|
m =list(map(int, input().split()))
for i in range(len(m)):
if m[i] == 0:
print((i + 1))
|
p02639
|
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
m=n//2
if a[m] == a[m-1] :print((0));exit()
print((a[m]-a[m-1]))
|
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
m=n//2
print((a[m]-a[m-1]))
|
p02989
|
N = int(eval(input()))
K = list(map(int, input().split()))
K.sort()
num = len(K)//2
result = K[num] - K[num-1]
print(result)
|
n=int(eval(input()));d=sorted(map(int,input().split()));print((d[n//2]-d[n//2-1]))
|
p02989
|
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
num = N // 2
arc = 0
for _ in range(N):
arc_first = D.pop()
arc += 1
if arc == num:
break
abc_last = D.pop()
if abc_last == arc_first:
# 同じ数にできない
ans = 0
else:
ans = arc_first - abc_last
print(ans)
|
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
num = N // 2
ans = D[num] - D[num-1]
print(ans)
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
same = N / 2
d.sort()
distribution = [0] * d[len(d) - 1]
total = 0
for di in d:
num = d.count(di)
distribution[di - 1] = num
total = 0
totals = [0] * d[len(d) - 1]
num = 0
for i in range(len(distribution)):
total += distribution[i]
totals[i] = total
if totals[i] == same:
num += 1
elif num >= 1:
break
print(num)
|
N = int(eval(input()))
d = list(map(int, input().split()))
same = N / 2
# d.sort()
# distribution = [0] * d[len(d) - 1]
# total = 0
# for di in d:
# num = d.count(di)
# distribution[di - 1] = num
table = {}
for di in d:
table[di] = 1 if table.get(di) is None else table.get(di) + 1
table = sorted(table.items())
total = 0
start = 0
end = 0
for difficulty, num in table:
total += num
if start == 0 and total == same:
start = difficulty
elif start != 0:
end = difficulty
break
# print(table, start, end)
answer = end - start
print(answer)
|
p02989
|
n=int(eval(input()))
v=[int(i) for i in input().split()]
v=sorted(v)
j=int((n/2))
k=int((n/2)-1)
if v[j]!=v[k]:
print((v[j]-v[k]))
else:
print("0")
|
n = int(eval(input()))
d = list(map(int,input().split(' ')))
d.sort()
middle = int(len(d)/2)
print((d[middle] - d[middle-1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
same = N // 2
count = 0
for i in range(2, 10 ** 5 + 1):
count += d.count(i - 1)
if count == same:
ans += 1
print(ans)
|
N = int(eval(input()))
d = sorted(list(map(int, input().split())))
half = d[N // 2 - 1]
nxt = d[N // 2]
if nxt == half:
print((0))
else:
print((nxt - (half + 1) + 1))
|
p02989
|
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
var = 0
y = d[N//2] - d[(N//2)-1]
k = d[(N//2)-1]
for j in range(y):
k = k+1
m = len([i for i in d if i < k])
if m*2 == N:
var = var + 1
print(var)
|
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
y = d[N//2] - d[(N//2)-1]
print(y)
|
p02989
|
n = int(eval(input()))
d_list = [int(i) for i in input().rstrip().split(' ')]
cnt = 0
for i in range(1, max(d_list)+1):
cnt_low = 0
cnt_high = 0
for d in d_list:
if i >= d:
cnt_high += 1
else:
cnt_low += 1
if cnt_high == cnt_low:
cnt += 1
print(cnt)
|
n = int(eval(input()))
d_list = [int(i) for i in input().rstrip().split(' ')]
d_list.sort()
a = int(n/2) -1
b = int(n/2)
if d_list[a] == d_list[b]:
print((0))
else:
print((d_list[b] - d_list[a]))
|
p02989
|
n=int(eval(input()))//2
d=sorted(list(map(int,input().split())))
print((d[n]-d[n-1]))
|
n=int(eval(input()))//2
d=sorted(map(int,input().split()))
print((d[n]-d[n-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
d.sort()
k = d[int(n/2)]
while k > d[int(n/2)-1]:
k -= 1
ans += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n//2] - d[n//2 - 1]))
|
p02989
|
import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def exit():
import sys
sys.exit(0)
def perm_sub(li, used):
if len(li) == len(used):
return [deque()]
k = []
for i in range(len(li)):
if i in used:
continue
used.add(i)
sub_list = perm_sub(li, used)
for sub in sub_list:
sub.appendleft(li[i])
k.extend(sub_list)
used.discard(i)
return k
def perm_li(li):
return perm_sub(li, set())
def perm_n(n):
return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
return sep.join([str(e) for e in li])
def li2n(li):
n, base = 0, 1
for i in range(len(li)-1, -1, -1):
n += li[i] * base
base *= 10
return n
def sli2ili(li):
return [int(s) for s in li]
def prime_list(n):
li = [i for i in range(2, n+1)]
for i in range(len(li)):
if li[i] >= int(math.sqrt(n)):
break
if li[i] == -1:
continue
for j in range(i+1, len(li)):
if li[j] % li[i] == 0:
li[j] = -1
return [n for n in li if n != -1]
def gcd(a, b):
a, b = max(a, b), min(a, b)
while True:
r = a % b
if r == 0: return b
a, b = b, r
def lcm(a, b):
return int(a * b / gcd(a,b))
def all_subset(li):
s = []
n = len(li)
for bit in range(0, (1<<(n+1))):
ss = set()
for i in range(0, n):
if (bit & (1 << i)):
ss.add(li[i])
s.append(ss)
return s
def factorial(n):
if n == 1:
return 1
return n * factorial(n-1)
def mCn(m, n):
def factorial_ntimes(m, n):
r = 1
while n:
r *= m
m -= 1
n -= 1
return r
return int(factorial_ntimes(m, n) / factorial(n))
n = load()
d = load_list()
l = 1
r = int(math.pow(10, 5))
def check(k):
abc = []
arc = []
for e in d:
if e >= k:
arc.append(e)
else:
abc.append(e)
if len(arc) > len(abc):
return 1
elif len(abc) > len(arc):
return -1
else:
return 0
ans1 = -1
while l < r:
mid = int((l + r) / 2)
c = check(mid)
if c == 0:
ans1 = mid
break
elif c == 1:
l = mid + 1
elif c == -1:
r = mid - 1
if ans1 == -1:
print((0))
exit()
tmp = ans1
cnt = 1
while True:
if check(tmp - 1) == 0:
cnt += 1
tmp -= 1
else:
break
tmp = ans1
while True:
if check(tmp + 1) == 0:
cnt += 1
tmp += 1
else:
break
print(cnt)
|
import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def exit():
import sys
sys.exit(0)
def perm_sub(li, used):
if len(li) == len(used):
return [deque()]
k = []
for i in range(len(li)):
if i in used:
continue
used.add(i)
sub_list = perm_sub(li, used)
for sub in sub_list:
sub.appendleft(li[i])
k.extend(sub_list)
used.discard(i)
return k
def perm_li(li):
return perm_sub(li, set())
def perm_n(n):
return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
return sep.join([str(e) for e in li])
def li2n(li):
n, base = 0, 1
for i in range(len(li)-1, -1, -1):
n += li[i] * base
base *= 10
return n
def sli2ili(li):
return [int(s) for s in li]
def prime_list(n):
li = [i for i in range(2, n+1)]
for i in range(len(li)):
if li[i] >= int(math.sqrt(n)):
break
if li[i] == -1:
continue
for j in range(i+1, len(li)):
if li[j] % li[i] == 0:
li[j] = -1
return [n for n in li if n != -1]
def gcd(a, b):
a, b = max(a, b), min(a, b)
while True:
r = a % b
if r == 0: return b
a, b = b, r
def lcm(a, b):
return int(a * b / gcd(a,b))
def all_subset(li):
s = []
n = len(li)
for bit in range(0, (1<<(n+1))):
ss = set()
for i in range(0, n):
if (bit & (1 << i)):
ss.add(li[i])
s.append(ss)
return s
def factorial(n):
if n == 1:
return 1
return n * factorial(n-1)
def mCn(m, n):
def factorial_ntimes(m, n):
r = 1
while n:
r *= m
m -= 1
n -= 1
return r
return int(factorial_ntimes(m, n) / factorial(n))
n = load()
d = load_list()
l = 1
r = int(math.pow(10, 5))
def check(k):
abc = []
arc = []
for e in d:
if e >= k:
arc.append(e)
else:
abc.append(e)
if len(arc) > len(abc):
return 1
elif len(abc) > len(arc):
return -1
else:
return 0
ans1 = -1
while l < r:
mid = int((l + r) / 2)
c = check(mid)
if c == 0:
ans1 = mid
break
elif c == 1:
l = mid + 1
elif c == -1:
r = mid - 1
if ans1 == -1:
print((0))
exit()
tmp = ans1
cnt = 1
l = ans1
r = int(math.pow(10, 5))
ans2 = ans1
while l <= r:
mid = int((l + r) / 2)
c1 = check(mid)
c2 = check(mid+1)
if c1 != 0:
r = mid -1
elif c1 == 0 and c2 == 0:
l = mid + 1
elif c1 == 0 and c2 != 0:
ans2 = mid
break
l = 1
r = ans1
ans3 = ans1
while l <= r:
mid = int((l + r) / 2)
c1 = check(mid)
c2 = check(mid-1)
if c1 != 0:
l = mid + 1
elif c1 == 0 and c2 == 0:
r = mid - 1
elif c1 == 0 and c2 != 0:
ans3 = mid
break
cnt += (ans2 - ans1)
cnt += (ans1 - ans3)
print(cnt)
|
p02989
|
def resolve():
n=int(eval(input()))
l=list(map(int, input().split()))
l.sort()
print((l[n//2]-l[n//2-1]))
resolve()
|
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=list(map(int,input().split()))
l.sort()
num=n//2
print((l[num]-l[num-1]))
resolve()
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(min(d), max(d)+1):
d_list = [x for x in d if i <= x]
if len(d_list) == N // 2:
ans += 1
print(ans)
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[N//2]-d[N//2-1]))
|
p02989
|
n=int(eval(input()))
d=list(map(int,input().split()))
d=sorted(d)
ans=0
for i in range(1,d[-1]+1):
cnt=0
for j in range(n):
if i>d[j]:
cnt+=1
else:
break
if n-cnt==cnt:
ans+=1
print(ans)
|
import bisect
n=int(eval(input()))
d=list(map(int,input().split()))
d=sorted(d)
ans=0
for i in range(1,d[-1]+1):
if bisect.bisect_left(d,i)==n-bisect.bisect_left(d,i):
ans+=1
print(ans)
|
p02989
|
# ABC132C - Divide the Problems
from statistics import median_high, median_low
def main():
n = int(eval(input()))
D = sorted(map(int, input().rstrip().split()))
h, l = median_high(D), median_low(D)
print((h - l))
if __name__ == "__main__":
main()
|
# ABC132C - Divide the Problems
def main():
n = int(eval(input()))
D = sorted(map(int, input().rstrip().split()))
h, l = D[n // 2], D[n // 2 - 1]
print((h - l))
if __name__ == "__main__":
main()
|
p02989
|
N=int(eval(input()))
temp=input().split()
d=[int(temp[i]) for i in range(N)]
dd=[]
for i in range(int(N/2)+1):
dd.append(min(d))
d.remove(min(d))
a=dd[int(N/2-1)]
b=dd[int(N/2)]
print((int(b-a)))
|
N=int(eval(input()))
temp=input().split()
d=[int(temp[i]) for i in range(N)]
d.sort()
a=d[int(N/2-1)]
b=d[int(N/2)]
print((int(b-a)))
|
p02989
|
N=int(eval(input()))
temp=input().split()
d=[int(temp[i]) for i in range(N)]
d.sort()
print((d[int(N/2)]-d[int(N/2-1)]))
|
n=int(eval(input()))
d=list(map(int, input().split()))
d.sort()
print((int(d[int(n/2)]-d[int(n/2-1)])))
|
p02989
|
N = int(eval(input()))
D = [int(x) for x in input().split()]
D.sort()
M = N//2
x,y = D[M-1:M+1]
answer = y - x
print(answer)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,*D = list(map(int,read().split()))
n = N//2
D.sort()
answer = D[n] - D[n-1]
print(answer)
|
p02989
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.