input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,*a=list(map(int,open(0).read().split()))
a.sort(reverse=True)
for i in range(1,n):
if a[i]==a[i-1]:
a[i]=0
else:
a[i-1]=0
a.sort()
print((a[-1]*a[-2])) | n,*a=list(map(int,open(0).read().split()))
a.sort()
x,y,i=0,0,0
while i<n:
if a[i-1]==a[i]:
x,y=y,a[i]
i+=1
i+=1
print((x*y)) | p03625 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
a = Counter(A)
sides = [0, 0]
for i in list(a.keys()):
if a[i] >= 4:
sides.append(i)
sides.append(i)
elif a[i] >= 2:
sides.append(i)
sides.sort()
print((sides.pop() * sides.pop())) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
a = Counter(A)
sides = [0, 0]
for i in list(a.keys()):
if a[i] >= 4:
sides.append(i)
sides.append(i)
elif a[i] >= 2:
sides.append(i)
sides.sort(reverse=True)
print((sides[0] * sides[1])) | p03625 |
def C_Make_a_Rectangle(lst):
N = lst[0]
A = lst[1:]
from collections import Counter, deque
c = sorted(list(Counter(A).items()), reverse=True) # リストの要素が何回現れたか
# cの0番要素は値、1番要素は度数
ans = deque([])
for k, v in c:
if v == 1:
continue
elif v == 2 or v == 3:
ans.append(k)
if len(ans) == 2:
break
else:
ans.append(k)
ans.append(k)
break
if len(ans) < 2:
return 0
else:
return ans[0] * ans[1]
n = int(eval(input()))
l = [int(i) for i in input().split()]
x = [n] + l
print((C_Make_a_Rectangle(x))) | def c_make_a_rectangle(N, A):
from collections import Counter
count = Counter(A) # リストの要素が何回現れたか
cond = [] # 同じ長さのものが2個ある棒の長さ
for k, v in list(count.items()):
if v == 1: # 1個しかない棒では長方形を作れない
continue
else:
cond.extend([k] * (v // 2))
if len(cond) <= 1:
return 0 # 長方形を作れない
cond = sorted(cond, reverse=True)
ans = cond[0] * cond[1] # 長いもの2組を使う
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_make_a_rectangle(N, A))) | p03625 |
from collections import Counter as C
_ = eval(input())
a = C([int(x) for x in input().split()])
b = [0] * 2
for k, v in list(a.items()):
if 4 <= v:
b.append(k)
if 2 <= v:
b.append(k)
else:
b.sort()
print((b[-1] * b[-2])) | from collections import Counter as C
_ = eval(input())
a = C([int(x) for x in input().split()])
b = []
for k, v in list(a.items()):
if 4 <= v:
b.append(k)
if 2 <= v:
b.append(k)
else:
if len(b) <= 1:
print((0))
else:
b.sort()
print((b[-1] * b[-2])) | p03625 |
n=int(eval(input()))
b=sorted([int(i) for i in input().split()],reverse=True)
def groupby(a):
a2=[[a[0],1]]
for i in range(1,len(a)):
if a2[-1][0]==a[i]:
a2[-1][1]+=1
else:
a2.append([a[i],1])
return a2
A=groupby(b)
l=len(A)
B=[]
for i in range(l):
A[i][1]=min(A[i][1]//2,2)
if A[i][1]!=0:
B.append(A[i])
l=len(B)
if l==0:
print((0))
elif l==1:
if B[0][1]==1:
print((0))
else:
print((B[0][0]**2))
else:
if B[0][1]==2:
print((B[0][0]**2))
else:
print((B[0][0]*B[1][0]))
| n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
x,y=0,0
def groupby(a):
a2=[[a[0],1]]
for i in range(1,len(a)):
if a2[-1][0]==a[i]:
a2[-1][1]+=1
else:
a2.append([a[i],1])
return a2
b=groupby(a)
l=len(b)
for i in range(l):
if x==0:
if b[i][1]>=4:
x,y=b[i][0],b[i][0]
elif b[i][1]>=2:
x=b[i][0]
elif y==0:
if b[i][1]>=2:
y=b[i][0]
else:
break
print((x*y))
| p03625 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
d = Counter(a)
ans = -1
for k in sorted(d.keys())[::-1]:
if ans == -1 and d[k] >= 4:
print((k*k))
exit()
elif ans == -1 and d[k] >= 2:
ans = k
elif ans != -1 and d[k] >= 2:
print((ans*k))
exit()
print((0)) | from collections import Counter
n = int(eval(input()))
d = Counter(list(map(int, input().split())))
ans = -1
for k in sorted(d.keys())[::-1]:
if ans == -1 and d[k] >= 4:
print((k*k))
exit()
elif ans == -1 and d[k] >= 2:
ans = k
elif ans != -1 and d[k] >= 2:
print((ans*k))
exit()
print((0)) | p03625 |
a, b, c, d = input().split()
print((max(int(a) * int(b), int(c) * int(d)))) | a, b, c, d = list(map(int, input().split())); print((max(a * b, c * d))) | p03826 |
a,b,c,d = list(map(int,input().split()))
print((int(max(a*b,c*d))))
| a,b,c,d = list(map(int,input().split()))
print((max(a*b,c*d))) | p03826 |
a,b,c,d=list(map(int,input().split()))
if a*b >= c*d:
print((a*b))
else:
print((c*d)) | a,b,c,d=list(map(int,input().split()))
print((max(a*b,c*d)))
| p03826 |
A,B,C,D = list(map(int,input().split()))
print((max(A*B,C*D))) | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
A,B,C,D = list(map(int,input().split()))
print((max(A*B,C*D))) | p03826 |
A, B, C, D = list(map(int, input().split()))
area1 = A * B
area2 = C * D
print((area1 if area1 >= area2 else area2)) | A, B, C, D = list(map(int, input().split()))
areas = [A * B, C * D]
print((max(areas))) | p03826 |
a,b,c,d = list(map(int,input().split()))
ans = a*b, c*d
print((max(ans))) | A,B,C,D = list(map(int,input().split()))
if A * B > C * D:
print((A * B))
elif A * B < C * D:
print((C * D))
else:
print((A * B)) | p03826 |
a = list(map(int,input().split()))
x = a[0] * a[1]
y = a[2] * a[3]
if x >= y:
print(x)
else:
print(y) | a = list(map(int,input().split()))
b = a[0] * a[1]
c = a[2] * a[3]
if b > c:
print(b)
else:
print(c) | p03826 |
A, B, C, D = list(map(int, input().split()))
if A*B>C*D:
print((A*B))
else:
print((C*D)) | A, B, C, D = list(map(int, input().split()))
print((max(A*B, C*D))) | p03826 |
A, B, C, D = list(map(int,input().split()))
if A * B == C * D:
print((A * B))
else:
print((max(A * B, C * D))) | a, b, c, d = list(map(int,input().split()))
print((max(a * b, c * d))) | p03826 |
a, b, c, d = list(map(int, input().split()))
s1 = a * b
s2 = c * d
if s1 > s2:
print(s1)
else:
print(s2) | a, b, c, d = list(map(int, input().split()))
print((max(a*b, c*d))) | p03826 |
vertical1, horizontal1, vertical2, horizontal2 = list(map(int, input().split()))
area1 = vertical1 * horizontal1
area2 = vertical2 * horizontal2
if area1 < area2:
print(area2)
else:
print(area1) | A, B, C, D = list(map(int, input().split()))
print((max(A * B, C * D))) | p03826 |
A,B,C,D=list(map(int,input().split()))
if A*B>=C*D:
print((A*B))
else:
print((C*D)) | A,B,C,D = list(map(int,input().split()))
print((max(A*B,C*D)))
| p03826 |
A,B,C,D = list(map(int,input().split()))
X = A*B
Y = C*D
if X >= Y:
print(X)
else:
print(Y)
| A, B, C, D = list(map(int, input().split()))
print((max(A * B, C * D)))
| p03826 |
# -*- coding: utf-8 -*-
a, b, c, d = list(map(int, input().split()))
sq = [a * b, c * d]
if sq[0] > sq[1]:
ans = sq[0]
else:
ans = sq[1]
print(ans) | # -*- coding: utf-8 -*-
a, b, c, d = list(map(int, input().split()))
ans = max(a * b, c * d)
print(ans) | p03826 |
a,b,c,d = list(map(int,input().split()))
if a*b > c*d:
print((a*b))
else:
print((c*d))
| a,b,c,d = list(map(int,input().split()))
if a*b >= c*d:
print((a*b))
else:
print((c*d)) | p03826 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, C, D = list(map(int, readline().split()))
if A * B > C * D:
print((A * B))
else:
print((C * D))
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, C, D = list(map(int, readline().split()))
print((max(A * B, C * D)))
return
if __name__ == '__main__':
main()
| p03826 |
a, b, c, d = list(map(int, input().split()))
print((max(a * b, c * d) if a * b != c * d else a * b)) | a, b, c, d = list(map(int, input().split()))
print((max(a * b, c * d))) | p03826 |
import sys
from itertools import dropwhile
a = []
for v in sys.stdin:
a.append(int(v))
m = max([a.count(v) for v in set(a)])
try:
next(dropwhile(lambda x: True, (print(v) for v in set(a) if a.count(v) == m)))
except StopIteration:
pass
| a = [0] * 101
while True:
try:
a[int(eval(input()))] += 1
except:
break
maxv = max(a)
for i, v in enumerate(a):
if maxv == v:
print(i) | p00028 |
# 0028
array = []
while True:
try:
a = eval(input())
array.append(int(a))
except EOFError:
break
s = set(array)
mx = array.count(max(s, key = array.count))
for a in sorted(s):
if array.count(a) == mx:
print(a) | # 0028
array = []
while True:
try:
a = eval(input())
array.append(int(a))
except EOFError: break
s = set(array)
mx = max(sorted(s, reverse=True), key = array.count)
for a in sorted(s, key = array.count, reverse=True):
print(a)
if a == mx: break | p00028 |
d=[0 for i in range(101)]
while True:
try:
n=eval(input())
d[n]+=1
except:
break
for e in [i for i,e in enumerate(d) if e==max(d)]:
print(e) | d=[0]*101
while True:
try:
n=eval(input())
d[n]+=1
except:
break
tmp=max(d)
for i in range(101):
if d[i]==tmp: print(i) | p00028 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(eval(input()))
i = 1
num = [0] * 13
while True:
cnt = 0
for j in range(1, i+1):
if i % j == 0:
cnt += 1
if cnt >= 12:
i += 1
continue
if num[cnt] == 0:
num[cnt] = i
if num[n] > 0:
ans = num[n]
break
i += 1
print(ans) | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(eval(input()))
i = 1
num = [0] * 13
while True:
cnt = 0
for j in range(1, i+1):
if i % j == 0:
cnt += 1
if cnt > 12:
i += 1
continue
if num[cnt] == 0:
num[cnt] = i
if num[n] > 0:
ans = num[n]
break
i += 1
print(ans) | p01048 |
from collections import Counter
n = int(input())
s = Counter([input() for i in range(n)])
print(*['{} x {}'.format(k, s[k]) for k in ['AC', 'WA', 'TLE', 'RE']], sep='\n')
| n = int(input())
s = [input() for i in range(n)]
print(*['{} x {}'.format(k, s.count(k)) for k in ['AC', 'WA', 'TLE', 'RE']], sep='\n')
| p02613 |
import sys
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())
N = I()
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
t = S()
if t == 'AC':
ac += 1
elif t == 'WA':
wa += 1
elif t == 'TLE':
tle += 1
elif t == 'RE':
re += 1
print(('AC x '+str(ac)))
print(('WA x '+str(wa)))
print(('TLE x '+str(tle)))
print(('RE x '+str(re))) | import sys
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())
N = I()
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(N):
t = S()
if t == 'AC':
ac += 1
elif t == 'WA':
wa += 1
elif t == 'TLE':
tle += 1
elif t == 'RE':
re += 1
print(('AC x {}'.format(ac)))
print(('WA x {}'.format(wa)))
print(('TLE x {}'.format(tle)))
print(('RE x {}'.format(re))) | p02613 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
cnt = [0]*4
for i in range(N):
S = readline().decode().rstrip()
if S == 'AC':
cnt[0] +=1
if S == 'WA':
cnt[1] +=1
if S == 'TLE':
cnt[2] +=1
if S == 'RE':
cnt[3] +=1
print(('AC x '+str(cnt[0])))
print(('WA x '+str(cnt[1])))
print(('TLE x '+str(cnt[2])))
print(('RE x '+str(cnt[3]))) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S = read().decode().rstrip().split()
for s in ['AC','WA','TLE','RE']:
print(("{0} x {1}".format(s,S.count(s)))) | p02613 |
N,M = list(map(int,input().split()))
if N ==1 and M ==1:
print((0))
elif N ==1 and M != 1:
print((int(M*(M-1)/2)))
elif N != 1 and M ==1:
print((int(N*(N-1)/2)))
else:
a = N*(N-1)
b = M*(M-1)
print((int((a+b)/2))) | N,M = list(map(int,input().split()))
a = N*(N-1)
b = M*(M-1)
print((int((a+b)/2))) | p02729 |
a,b = input().split()
a = int(a)
b = int(b)
A = a-1
B = b-1
S = a*A/2
F = b*B/2
if a<1.9 and b<1.9:
print((0))
elif a<1.9 and b>1.9:
print((int(F)))
elif a>1.9 and b<1.9:
print((int(S)))
elif a>1.9 and b>1.9:
print((int(S+F)))
| a,b = input().split()
a = int(a)
b = int(b)
S = a*(a-1)/2
F = b*(b-1)/2
if a<1.9 and b<1.9:
print((0))
elif a<1.9 and b>1.9:
print((int(F)))
elif a>1.9 and b<1.9:
print((int(S)))
elif a>1.9 and b>1.9:
print((int(S+F)))
| p02729 |
import itertools
n, m = list(map(int, input().split()))
nn = []
i = 0
for _ in range(n):
nn.append(i)
i += 2
mm = []
i = 1
for _ in range(m):
mm.append(i)
i += 2
ans = 0
l = nn + mm
for v in itertools.combinations(l, 2):
if (v[0] + v[1]) % 2 == 0:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
print((n*(n-1)//2 + m*(m-1)//2))
| p02729 |
# -*- coding: utf-8 -*-
m, n = list(map(int, input().split(' ')))
print((int(m * (m - 1) / 2 + n * (n - 1) / 2)))
| # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
print((n * (n -1) // 2 + m * (m - 1) // 2)) | p02729 |
a,b=list(map(int,input().split()))
import itertools
a1 = len(list(itertools.combinations(list(range(a)), 2)))
b1 = len(list(itertools.combinations(list(range(b)), 2)))
print((a1+b1)) | a,b=list(map(int,input().split()))
print((a*(a-1)//2+b*(b-1)//2)) | p02729 |
n,m = list(map(int, input().split()))
s = 0
for i in range(n):
s += i
for i in range(m):
s += i
print(s) | n,m = list(map(int, input().split()))
print((n*(n-1)//2 + m*(m-1)//2)) | p02729 |
n, m = list(map(int, input().split()))
a = []
for i in range(1,n+1):
a.append(2*i)
for j in range(1, m+1):
a.append(2*j - 1)
counter = 0
for i in range(len(a)-1):
for j in range(i+1, len(a)):
if (a[i] + a[j]) % 2 == 0:
counter += 1
print(counter) | n, m = list(map(int, input().split()))
ans = n * (n-1) // 2 + m * (m-1) // 2
print(ans) | p02729 |
N, M = list(map(int, input().split()))
if N <= 1: a = 0
else: a = N*(N-1) // 2
if M <= 1: b = 0
else: b = M*(M-1) // 2
print((a+b)) | N, M = list(map(int, input().split()))
# 下の式はN=0,1(M=0,1)の場合も成り立つ
a = N*(N-1) // 2
b = M*(M-1) // 2
print((a+b)) | p02729 |
import itertools
import math
N,M=list(map(int,input().split()))
if N==M==1 or N==M==0:
print((0))
exit()
if N==0:
even=0
odd=math.factorial(M)/(math.factorial(M-2)*2)
print((int(odd+even)))
exit()
if M==0:
odd=0
even=math.factorial(N)/(math.factorial(N-2)*2)
print((int(odd+even)))
exit()
if N==1 or M==1:
even=math.factorial(N)/2
odd=math.factorial(M)/2
print((int(odd+even)))
exit()
even=math.factorial(N)/(math.factorial(N-2)*2)
odd=math.factorial(M)/(math.factorial(M-2)*2)
print((int(odd+even))) | import itertools
import math
N,M=list(map(int,input().split()))
ans = 0
even = 0
odd = 0
if N > 1:
even += math.factorial(N) / (math.factorial(2)*math.factorial(N - 2))
if M > 1:
odd += math.factorial(M) / (math.factorial(2)*math.factorial(M - 2))
ans=even+odd
print((int(ans))) | p02729 |
n,m = list(map(int,input().split()))
print(((n*(n-1)//2) + (m*(m-1)//2))) | #!/usr/bin/env python3
n,m = list(map(int,input().split()))
print(((n*(n-1)//2) + (m*(m-1)//2)))
| p02729 |
import math
n, m = list(map(int, input().split()))
def combinations_count(a, b):
return math.factorial(a+b) // (2 * math.factorial(a+b-2))
print((combinations_count(n, m)-(n*m))) | n, m = list(map(int, input().split()))
print(((n*(n-1)//2)+(m*(m-1)//2))) | p02729 |
N, M = list(map(int, input().split()))
print((M * (M - 1) // 2 + N * (N - 1) // 2))
| N, M = list(map(int, input().split()))
print((N * (N - 1) // 2 + M * (M - 1) // 2))
| p02729 |
N,M=list(map(int,input().split()))
print((int(1/2*N*(N-1)+1/2*M*(M-1)))) | N,M=list(map(int,input().split()))
print((N*(N-1)//2+M*(M-1)//2)) | p02729 |
N,M=list(map(int,input().split()))
if N >= 2 or M >= 2:
print((int(N*(N-1)/2+M*(M-1)/2)))
else:
print((0)) | N,M=list(map(int,input().split()))
print((int(N*(N-1)/2+M*(M-1)/2))) | p02729 |
N, M = list(map(int, input().split()))
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
ans = 0
if N >= 2:
ans += combinations_count(N, 2)
if M >= 2:
ans += combinations_count(M, 2)
print(ans) | N, M = list(map(int, input().split()))
print((N*(N-1)//2 + M*(M-1)//2)) | p02729 |
n,m=list(map(int,input().split()))
if (n>0) and (m>0):
print((int(n*(n-1)/2+m*(m-1)/2)))
else:
print((int(max(n,m)*(max(n,m)-1)/2))) | n,m=list(map(int,input().split()))
print((int(n*(n-1)/2+m*(m-1)/2)))
| p02729 |
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, m = list(map(int, input().split()))
if not 0 <= n <= 100 and 0 <= m <= 100 and 2 <= n + m:
print('Unsupported...')
if n >= 2:
n_comb = combinations_count(n, 2)
else:
n_comb = 0
if m >= 2:
m_comb = combinations_count(m, 2)
else:
m_comb = 0
print((n_comb + m_comb)) | """
A-The Number of Even Pairs
"""
n, m = list(map(int, input().split()))
print(((n * (n-1)) // 2 + (m * (m-1)) // 2))
| p02729 |
from operator import mul
from functools import reduce
N, M=list(map(int, input().split()))
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
if N>=2 and M>=2:
print((combinations_count(N, 2)+combinations_count(M, 2)))
elif N>=2 or M>=2:
print((combinations_count(N, 2)+combinations_count(M, 2)-1))
else:
print((0))
| N, M = list(map(int, input().split()))
print((N * (N - 1) // 2 + M * (M - 1) // 2)) | p02729 |
import math
N,M =list(map(int,input().split()))
if N==1 :
N1=0
elif N==0:
N1=0
else:
N1=(math.factorial(N))//(math.factorial(N-2)*2)
if M==1:
M1=0
elif M ==0:
M1=0
else:
M1=(math.factorial(M))//(math.factorial(M-2)*2)
print((str(N1+M1))) | a,b =list(map(int,input().split()))
sum=a*(a-1)//2+b*(b-1)//2
print(sum)
| p02729 |
N, M = list(map(int,input().split()))
print((N*(N-1)//2+M*(M-1)//2))
| N, M = list(map(int,input().split()))
print(((N*(N-1)+M*(M-1))//2)) | p02729 |
N, M = list(map(int, input().split()))
a = []
b = []
if M == 0:
for i in range(1,(2*N)+1):
if i%2==0 and i>0:
a.append(i)
elif N == 0:
for i in range(1,(2*M)+1):
if i%2==1:
b.append(i)
else:
for i in range(1,(2**N)+1):
if i%2==0 and i>0:
a.append(i)
else:
b.append(i)
c = a[:N] + b[:M]
l = []
num = 1
for i in range(len(c)-1):
for j in range(num,len(c)):
res = c[i] + c[j]
l.append(res)
num+=1
k=[i for i in l if i%2==0]
print((len(k))) | N, M = list(map(int, input().split()))
a = []
b = []
if M == 0:
for i in range(1,(2*N)+1):
if i%2==0 and i>0:
a.append(i)
elif N == 0:
for i in range(1,(2*M)+1):
if i%2==1:
b.append(i)
else:
for i in range(1,501):
if i%2==0 and i>0:
a.append(i)
else:
b.append(i)
c = a[:N] + b[:M]
l = []
num = 1
for i in range(len(c)-1):
for j in range(num,len(c)):
res = c[i] + c[j]
l.append(res)
num+=1
k=[i for i in l if i%2==0]
print((len(k))) | p02729 |
from itertools import combinations
N, M = list(map(int, input().split()))
nlist = []
mlist = []
for i in range(N):
nlist.append(i)
for j in range(M):
mlist.append(j)
if N == 1 and M == 1:
print((0))
exit()
if N == 1:
print((len(list(combinations(mlist,2)))))
exit()
if M == 1:
print((len(list(combinations(nlist,2)))))
exit()
print((len(list(combinations(nlist,2))) + len(list(combinations(mlist,2))))) | N, M = list(map(int, input().split()))
print((N * (N-1) // 2 + M * (M-1) // 2)) | p02729 |
# import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq # priolity-queue
# import time
# import itertools
# import collections # queue
# from operator import itemgetter
# from fractions import Fraction
mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35
def main():
n,m = list(map(int,input().split()))
ans = n*(n-1)//2
ans += m*(m-1)//2
print(ans)
return
if __name__=='__main__':
main()
| n,m = list(map(int,input().split()))
ans = n*(n-1)//2
ans += m*(m-1)//2
print(ans) | p02729 |
i = list(map(int, input().split()))
N = i[0]
M = i[1]
print((((N*(N-1))//2) + ((M*(M-1))//2))) | i = list(map(int, input().split()))
N = i[0]
M = i[1]
guusuu = (N * (N-1)) // 2
kisuu = (M * (M-1)) // 2
print((guusuu + kisuu)) | p02729 |
import math
n,m = list(map(int, input().split()))
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
a = 0
b = 0
if n >=2:
a = combinations_count(n, 2)
if m >= 2:
b = combinations_count(m, 2)
print((a+b)) | n, m = list(map(int, input().split()))
a = n*(n-1)//2
b = m*(m-1)//2
print((a+b)) | p02729 |
n, m = list(map(int, input().split()))
print((m*(m-1)//2 + n*(n-1)//2))
| print((sum([int(i)*(int(i)-1)//2 for i in input().split()])))
| p02729 |
def nCr(n, r):
return (fact(n) / (fact(r)
* fact(n - r)))
# Returns factorial of n
def fact(n):
res = 1
if n == 0:
res == 1
elif n == 1:
res == 1
else:
for i in range(2, n + 1):
res = res * i
return res
inList = list(map(int, input().split()))
N = inList[0]
M = inList[1]
a = nCr(N, 2)
b = nCr(M, 2)
if N == M == 1:
print((0))
else:
print((int(a+b))) | def nCr(n, r):
return (fact(n) / (fact(r)* fact(n - r)))
def fact(n):
res = 1
if n == 0:
res == 1
elif n == 1:
res == 1
else:
for i in range(2, n + 1):
res = res * i
return res
inList = list(map(int, input().split()))
N = inList[0]
M = inList[1]
a = nCr(N, 2)
b = nCr(M, 2)
if N == M == 1:
print((0))
else:
print((int(a+b))) | p02729 |
for e in iter(input,'0 0'):
w,h=list(map(int,e.split()))
M=[[[1,0]*2 for _ in[0]*h]for _ in[0]*w]
for i in range(1,w):
for j in range(1,h):
a,b,c,d=[*M[i-1][j][:2],*M[i][j-1][2:]]
M[i][j]=[d,a+b,b,c+d]
print(((sum(M[w-2][h-1][:2])+sum(M[w-1][h-2][2:]))%10**5))
| def s():
for e in iter(input,'0 0'):
w,h=list(map(int,e.split()))
M=[[[1,0]*2 for _ in[0]*h]for _ in[0]*w]
for i in range(1,w):
for j in range(1,h):
a,b=M[i-1][j][:2]
c,d=M[i][j-1][2:]
M[i][j]=[d,a+b,b,c+d]
print(((sum(M[w-2][h-1][:2])+sum(M[w-1][h-2][2:]))%10**5))
if'__main__'==__name__:s()
| p00470 |
while True:
w, h = list(map(int, input().split()))
if w | h == 0:
break
dp = [[[0] * (w + 1) for _ in range(h + 1)] for _ in range(4)]
#0:u -> u, 1: u -> r, 2: r -> u, 3: r -> r
dp[0][1][0] = dp[3][0][1] = 1
for y in range(h):
for x in range(w):
dp[0][y + 1][x] += dp[0][y][x] + dp[2][y][x]
dp[1][y][x + 1] += dp[0][y][x]
dp[2][y + 1][x] += dp[3][y][x]
dp[3][y][x + 1] += dp[1][y][x] + dp[3][y][x]
print(sum(dp[i][h-1][w-1] for i in range(4)) % 100000) | while True:
w, h = list(map(int, input().split()))
if w | h == 0:
break
dp = [[[0] * (w + 1) for _ in range(h + 1)] for _ in range(4)]
dp[0][1][0] = dp[3][0][1] = 1
for y in range(h):
for x in range(w):
dp[0][y + 1][x] += dp[0][y][x] + dp[2][y][x]
dp[1][y][x + 1] += dp[0][y][x]
dp[2][y + 1][x] += dp[3][y][x]
dp[3][y][x + 1] += dp[1][y][x] + dp[3][y][x]
print(sum(dp[i][h-1][w-1] for i in range(4)) % 100000) | p00470 |
a=65280; b=61680; c=52428; d=43690; e=65535
base = [a, b, c, d, e, 0]
L = {el: 1 for el in base}
for i in range(6):
R = dict(L)
for p in R:
if R[p] < 16:
L[p ^ e] = min(L.get(p ^ e, 16), R[p] + 1)
if R[p]+3 < 16:
for q in R:
if R[p] + R[q] + 3 <= 16:
L[p & q] = min(L.get(p & q, 16), R[p] + R[q] + 3)
L[p ^ q] = min(L.get(p ^ q, 16), R[p] + R[q] + 3)
print(*(L[e & eval(s)] for s in open(0).read().replace("-", "~").replace("*", "&").replace("1", "e").split()[:-1]),sep="\n")
| a=65280; b=61680; c=52428; d=43690; e=65535
L = {el: 1 for el in [a, b, c, d, e, 0]}
for i in range(6):
R = sorted(L.items(), key=lambda x: x[1])
for p, l in R:
if l < 16:
L[p ^ e] = min(L.get(p ^ e, 16), l+1)
if l+3 < 16:
for q, r in R:
if l+r+3 <= 16:
L[p & q] = min(L.get(p & q, 16), l+r+3)
L[p ^ q] = min(L.get(p ^ q, 16), l+r+3)
else: break
else: break
print(*(L[e & eval(s)] for s in open(0).read().replace(*"-~").replace(*"*&").replace(*"1e").split()[:-1]),sep='\n')
| p01105 |
a=65280; b=61680; c=52428; d=43690; e=65535
L = {el: 1 for el in [a, b, c, d, e, 0]}
for i in range(6):
R = sorted(L.items(), key=lambda x: x[1])
for p, l in R:
if l < 16:
L[p ^ e] = min(L.get(p ^ e, 16), l+1)
if l+3 < 16:
for q, r in R:
if l+r+3 <= 16:
L[p & q] = min(L.get(p & q, 16), l+r+3)
L[p ^ q] = min(L.get(p ^ q, 16), l+r+3)
else: break
else: break
print(*(L[e & eval(s)] for s in open(0).read().replace(*"-~").replace(*"*&").replace(*"1e").split()[:-1]),sep='\n')
| a=65280; b=61680; c=52428; d=43690; e=65535
from heapq import heappush, heappop
base = [a, b, c, d, e, 0]
Q = [(1, el) for el in base]
L = {el: 1 for el in base}
H = []
while Q:
l, p = heappop(Q)
if L[p] < l: continue
if l+1 < L.get(p ^ e, 17):
L[p^e] = l+1
if l+1 < 16: heappush(Q, (l+1, p^e))
if l+3 < 16:
for q, r in H:
if l+r+3 <= 16:
if l+r+3 < L.get(p & q, 17):
L[p & q] = l+r+3
if l+r+3 < 16: heappush(Q, (l+r+3, p & q))
if l+r+3 < L.get(p ^ q, 17):
L[p ^ q] = l+r+3
if l+r+3 < 16: heappush(Q, (l+r+3, p ^ q))
else: break
if l < 7: H.append((p, l))
print(*(L[e & eval(s)] for s in open(0).read().replace(*"-~").replace(*"*&").replace(*"1e").split()[:-1]),sep='\n')
| p01105 |
a=65280; b=61680; c=52428; d=43690; e=65535
from heapq import heappush, heappop
base = [a, b, c, d, e, 0]
Q = [(1, el) for el in base]
L = {el: 1 for el in base}
H = []
get = L.get
push = H.append
while Q:
l, p = heappop(Q)
if L[p] < l: continue
if l+1 < get(p ^ e, 17):
L[p ^ e] = l+1
if l+1 < 16: heappush(Q, (l+1, p ^ e))
if l+3 < 16:
for q, r in H:
if l+r+3 <= 16:
if l+r+3 < get(p & q, 17):
L[p & q] = l+r+3
if l+r+3 < 16: heappush(Q, (l+r+3, p & q))
if l+r+3 < get(p ^ q, 17):
L[p ^ q] = l+r+3
if l+r+3 < 16: heappush(Q, (l+r+3, p ^ q))
else: break
if l < 7: push((p, l))
print(*map(L.__getitem__, eval("e&%s"%",e&".join(open(0).read().replace(*"-~").replace(*"*&").replace(*"1e").split()[:-1]))),sep='\n')
| a=65280; b=61680; c=52428; d=43690; e=65535
from heapq import heappush, heappop
Q = [(1, a), (1, b), (1, c), (1, d)]
L = {a: 1, b: 1, c: 1, d: 1, e: 1, e: 1, 0: 1}
H = []
get = L.get
push = H.append
while Q:
l, p = heappop(Q)
if L[p] < l: continue
if l+1 < get(p ^ e, 17):
L[p ^ e] = l+1
l < 15 and heappush(Q, (l+1, p ^ e))
if l < 13:
li = 13-l; l3 = 3+l
for q, r in H:
if r <= li:
k = p & q
if r < get(k, 17)-l3:
L[k] = l3+r
r < li and heappush(Q, (l3+r, k))
k = p ^ q
if r < get(k, 17)-l3:
L[k] = l3+r
r < li and heappush(Q, (l3+r, k))
else: break
if l < 7: push((p, l))
print(*map(L.__getitem__, eval("e&"+",e&".join(open(0).read().replace(*"-~").replace(*"*&").replace(*"1e").split()[:-1]))),sep='\n')
| p01105 |
import sys
input = sys.stdin.readline
from heapq import heappush, heappop
N = int(eval(input()))
A = [int(x) for x in input().split()]
a_to_i = {a:i for i,a in enumerate(A)}
# sparse table を使ってRMQ
# parityの同じところだけを見るようにしておく
U = len(A).bit_length()
sp = [None,A]
for i in range(2,U):
L = 1 << (i-1)
sp.append([x if x < y else y for x,y in zip(sp[-1][:-L], sp[-1][L:])])
def RMQ(x,y):
# x番目から偶数番目だけ見て[x,y]での最小値を返す
d = y - x
if d <= 1:
return A[x]
n = d.bit_length()
return min(sp[n-1][x], sp[n-1][y+2-(1<<(n-1))])
def F(x,y):
# 辞書式で最小の2つ組をとる
# そのあと、今後調べないといけない区間の一覧を返す
x1 = RMQ(x,y-1)
i1 = a_to_i[x1]
x2 = RMQ(i1+1,y)
i2 = a_to_i[x2]
task = ((x,y) for x,y in ((x,i1-1), (i1+1,i2-1), (i2+1,y)) if y > x)
return x1,x2,task
q = [(None,None,((0,N-1),))]
answer = []
while q:
x,y,task = heappop(q)
answer.append(x)
answer.append(y)
for left,right in task:
heappush(q,F(left,right))
print((' '.join(map(str,answer[2:])))) | import sys
input = sys.stdin.readline
from heapq import heappush, heappop
N = int(eval(input()))
A = [int(x) for x in input().split()]
a_to_i = {a:i for i,a in enumerate(A)}
# sparse table を使ってRMQ
# parityの同じところだけを見るようにしておく
U = len(A).bit_length()
sp = [None,A]
for i in range(2,U):
L = 1 << (i-1)
sp.append([x if x < y else y for x,y in zip(sp[-1][:-L], sp[-1][L:])])
def RMQ(x,y):
# x番目から偶数番目だけ見て[x,y]での最小値を返す
d = y - x
if d <= 1:
return A[x]
n = d.bit_length()
arr = sp[n-1]
ax = arr[x]
ay = arr[y+2-(1<<(n-1))]
return ax if ax < ay else ay
def F(x,y):
# 辞書式で最小の2つ組をとる
# そのあと、今後調べないといけない区間の一覧を返す
x1 = RMQ(x,y-1)
i1 = a_to_i[x1]
x2 = RMQ(i1+1,y)
i2 = a_to_i[x2]
task = ((x,y) for x,y in ((x,i1-1), (i1+1,i2-1), (i2+1,y)) if y > x)
return x1,x2,task
q = [(None,None,((0,N-1),))]
answer = []
while q:
x,y,task = heappop(q)
answer.append(x)
answer.append(y)
for left,right in task:
heappush(q,F(left,right))
print((' '.join(map(str,answer[2:])))) | p03641 |
from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
class SegtreeMin():
def __init__(self, n):
self.inf = 10 ** 16
tree_width = 1 << (n - 1).bit_length()
self.tree_width = tree_width
self.tree = [self.inf] * (tree_width * 2 - 1)
def update(self, i, a):
seg_i = self.tree_width - 1 + i
self.tree[seg_i] = a
while seg_i != 0:
seg_i = (seg_i - 1) // 2
self.tree[seg_i] = min(self.tree[seg_i * 2 + 1], self.tree[seg_i * 2 + 2])
def refresh(self):
for seg_i in range(self.tree_width - 2, -1, -1):
self.tree[seg_i] = min(self.tree[seg_i * 2 + 1], self.tree[seg_i * 2 + 2])
# [l,r)の最小値
def min(self, l, r, seg_i=0, segL=0, segR=-1):
if segR == -1: segR = self.tree_width
if r <= segL or segR <= l: return self.inf
if l <= segL and segR <= r: return self.tree[seg_i]
segM = (segL + segR) // 2
ret0 = self.min(l, r, seg_i * 2 + 1, segL, segM)
ret1 = self.min(l, r, seg_i * 2 + 2, segM, segR)
return min(ret0, ret1)
def main():
n = int(input())
pp = LI()
seg_odd = SegtreeMin(n // 2)
seg_even = SegtreeMin(n // 2)
ptoi = [0] + [i for i, p in sorted(enumerate(pp), key=lambda x: x[1])]
seg_odd.tree[seg_odd.tree_width - 1:seg_odd.tree_width - 1 + n // 2] = pp[1::2]
seg_even.tree[seg_even.tree_width - 1:seg_even.tree_width - 1 + n // 2] = pp[::2]
seg_odd.refresh()
seg_even.refresh()
# 区間偶数番目の最小値と[l,r)をヒープに
hp = []
heappush(hp, [seg_even.min(0, n // 2), 0, n])
ans = []
for _ in range(n // 2):
x, l, r = heappop(hp)
if l + 2 == r:
ans += [pp[l], pp[l + 1]]
continue
xi = ptoi[x]
if l % 2:
y = seg_even.min((xi + 1) // 2, (r + 1) // 2)
else:
y = seg_odd.min((xi + 1) // 2, r // 2)
yi = ptoi[y]
if xi - l == 2:
heappush(hp, [pp[l], l, xi])
elif xi - l > 2:
minp = seg_odd.min(l // 2, xi // 2) if l % 2 else seg_even.min(l // 2, (xi+1) // 2)
heappush(hp, [minp, l, xi])
if yi - xi - 1 == 2:
heappush(hp, [pp[xi + 1], xi + 1, yi])
elif yi - xi - 1 > 2:
minp = seg_odd.min((xi + 1) // 2, yi // 2) if (xi + 1) % 2 else seg_even.min((xi + 1) // 2, (yi+1) // 2)
heappush(hp, [minp, xi + 1, yi])
if r - yi - 1 == 2:
heappush(hp, [pp[yi + 1], yi + 1, r])
elif r - yi - 1 > 2:
minp = seg_odd.min((yi + 1) // 2, r // 2) if (yi + 1) % 2 else seg_even.min((yi + 1) // 2, (r+1) // 2)
heappush(hp, [minp, yi + 1, r])
ans += [x, y]
print(*ans)
main()
| from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
# lから1つおきにみたときの最小値を求める特別製
class SparseTable:
def __init__(self, aa):
inf = 10 ** 16
w = len(aa)
h = w.bit_length()
table = [aa] * 2 + [[inf] * w for _ in range(h - 2)]
tablei1 = table[0]
for i in range(2, h):
tablei = table[i]
shift = 1 << (i - 1)
for j in range(w):
rj = j + shift
if rj >= w: break
tablei[j] = min(tablei1[j], tablei1[rj])
tablei1 = tablei
self.table = table
# [l,r)の最小値
def min(self, l, r):
if (r - l) % 2: r += 1
i = (r - l).bit_length() - 1
tablei = self.table[i]
Lmin = tablei[l]
Rmin = tablei[r - (1 << i)]
if Lmin < Rmin: Rmin = Lmin
return Rmin
def main():
n = int(input())
pp = LI()
st = SparseTable(pp)
ptoi = [0] + [i for i, p in sorted(enumerate(pp), key=lambda x: x[1])]
# 区間偶数番目の最小値と[l,r)をヒープに
hp = []
heappush(hp, [st.min(0, n), 0, n])
ans = []
for _ in range(n // 2):
x, l, r = heappop(hp)
if l + 2 == r:
ans += [pp[l], pp[l + 1]]
continue
xi = ptoi[x]
y = st.min(xi + 1, r)
yi = ptoi[y]
if xi > l:
heappush(hp, [st.min(l, xi), l, xi])
if xi + 1 < yi:
heappush(hp, [st.min(xi + 1, yi), xi + 1, yi])
if yi < r - 1:
heappush(hp, [st.min(yi + 1, r), yi + 1, r])
ans += [x, y]
print(*ans)
main()
| p03641 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
class Seg():
def __init__(self, na, default, func):
if isinstance(na, list):
n = len(na)
else:
n = na
i = 1
while 2**i <= n:
i += 1
self.D = default
self.H = i
self.N = 2**i
if isinstance(na, list):
self.A = [default] * (self.N-1) + na + [default] * (self.N-n)
for i in range(self.N-2,-1,-1):
self.A[i] = func(self.A[i*2+1], self.A[i*2+2])
else:
self.A = [default] * (self.N*2-1)
self.F = func
def find(self, i):
return self.A[i + self.N - 1]
def update(self, i, x):
i += self.N - 1
self.A[i] = x
while i > 0:
i = (i-1) // 2
self.A[i] = self.merge(self.A[i*2+1], self.A[i*2+2])
def merge(self, a, b):
return self.F(a, b)
def total(self):
return self.A[0]
def query(self, a, b):
b += 1
def _query(k,l,r):
if r <= a or b <= l:
return self.D
if a <= l and r <= b:
return self.A[k]
m = (l+r)//2
vl = _query(k*2+1,l,m)
vr = _query(k*2+2,m,r)
return self.merge(vl,vr)
return _query(0,0,self.N)
def main():
n = I()
a = LI()
def sf(a,b):
if a < b:
return a
return b
s1 = Seg([c if i%2==0 else inf for c,i in zip(a,list(range(n)))],inf,sf)
s2 = Seg([c if i%2==1 else inf for c,i in zip(a,list(range(n)))],inf,sf)
d = {}
for i in range(n):
d[a[i]] = i
def f(l,r):
if l % 2 == 0:
t = s1.query(l,r)
ti = d[t]
u = s2.query(ti+1,r)
else:
t = s2.query(l,r)
ti = d[t]
u = s1.query(ti+1,r)
ui = d[u]
nl = []
if l < ti:
nl.append((l, ti-1))
if ui - ti > 1:
nl.append((ti+1, ui-1))
if ui < r:
nl.append((ui+1, r))
return ((t,u), nl)
q = []
heapq.heappush(q, f(0,n-1))
r = []
while q:
t,nl = heapq.heappop(q)
r.append(t[0])
r.append(t[1])
for t,u in nl:
heapq.heappush(q, f(t,u))
return ' '.join(map(str,r))
print((main()))
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
class Seg():
def __init__(self, na, default, func):
if isinstance(na, list):
n = len(na)
else:
n = na
i = 1
while 2**i <= n:
i += 1
self.D = default
self.H = i
self.N = 2**i
if isinstance(na, list):
self.A = [default] * (self.N) + na + [default] * (self.N-n)
for i in range(self.N-1,0,-1):
self.A[i] = func(self.A[i*2], self.A[i*2+1])
else:
self.A = [default] * (self.N*2)
self.F = func
def find(self, i):
return self.A[i + self.N]
def update(self, i, x):
i += self.N
self.A[i] = x
while i > 0:
i = (i-1) // 2
self.A[i] = self.merge(self.A[i*2], self.A[i*2+1])
def merge(self, a, b):
return self.F(a, b)
def total(self):
return self.A[0]
def query(self, a, b):
A = self.A
l = a + self.N
r = b + self.N
res = self.D
while l < r:
if l % 2 == 1:
res = self.merge(res, A[l])
l += 1
if r % 2 == 1:
r -= 1
res = self.merge(res, A[r])
l >>= 1
r >>= 1
return res
def main():
n = I()
a = LI()
def sf(a,b):
if a < b:
return a
return b
s1 = Seg([c if i%2==0 else inf for c,i in zip(a,list(range(n)))],inf,sf)
s2 = Seg([c if i%2==1 else inf for c,i in zip(a,list(range(n)))],inf,sf)
d = {}
for i in range(n):
d[a[i]] = i
def f(l,r):
if l % 2 == 0:
t = s1.query(l,r)
ti = d[t]
u = s2.query(ti+1,r)
else:
t = s2.query(l,r)
ti = d[t]
u = s1.query(ti+1,r)
ui = d[u]
nl = []
if l < ti:
nl.append((l, ti))
if ui - ti > 1:
nl.append((ti+1, ui))
if ui < r-1:
nl.append((ui+1, r))
return ((t,u), nl)
q = []
heapq.heappush(q, f(0,n))
r = []
while q:
t,nl = heapq.heappop(q)
r.append(t[0])
r.append(t[1])
for t,u in nl:
heapq.heappush(q, f(t,u))
return ' '.join(map(str,r))
print((main()))
| p03641 |
# AOJ DSL_2_A "Range Minimum Query"
# SegmantTreeの実装
import sys
input = sys.stdin.readline
# 初期化最大値
INF = (1 << 31) - 1
class SegmentTree:
def __init__(self, N):
self.N = 2**(N-1).bit_length()
self.data = [[INF, -1] for _ in range(2*self.N-1)]
# O(N)で初期化
def compose(self, A):
for k, a in enumerate(A):
self.data[k+self.N-1] = [a, k]
first = self.N - 1
while first > 0:
first = (first-1)//2
for k in range(first, 2*first+1):
if self.data[2*k+1][0] < self.data[2*k+2][0]:
self.data[k] = self.data[2*k+1][:]
else:
self.data[k] = self.data[2*k+2][:]
# k番目の値(0-indexed)をaに変更
def update(self, k, a):
self.data[k+self.N-1] = [a, k]
k += self.N - 1
while k > 0:
k = (k-1)//2
if self.data[2*k+1][0] < self.data[2*k+2][0]:
self.data[k] = self.data[2*k+1][:]
else:
self.data[k] = self.data[2*k+2][:]
# [l, r)の最小値取得
# kがNodeの番号、対応する区間が[a, b)
def query_min(self, l, r):
if l+1 == r:
return self.data[l+self.N-1]
L = l + self.N
R = r + self.N
s = [INF, -1]
while L < R:
if R & 1:
R -= 1
if s[0] > self.data[R-1][0]:
s = self.data[R-1]
if L & 1:
if s[0] > self.data[L-1][0]:
s = self.data[L-1]
L += 1
L >>= 1; R >>= 1
return s
import heapq as hp
N = int(eval(input()))
A = list(map(int, input().split()))
def main():
ST1 = SegmentTree(N//2)
ST2 = SegmentTree(N//2)
ST1.compose(A[::2])
ST2.compose(A[1::2])
ans = []
q = []
v, k = ST1.query_min(0, N//2)
dic = {}
dic[v] = (k, 0, N//2, True)
hp.heappush(q, v)
for _ in range(N//2):
valuea = hp.heappop(q)
ka, l, r, is1 = dic[valuea]
ans.append(str(valuea))
if is1:
valueb, kb = ST2.query_min(ka, r)
if ka < kb:
m2, nk2 = ST2.query_min(ka, kb)
hp.heappush(q, m2)
dic[m2] = (nk2, ka, kb+1, False)
if l < ka:
m1, nk1 = ST1.query_min(l, ka)
hp.heappush(q, m1)
dic[m1] = (nk1, l, ka, True)
if kb+1 < r:
m3, nk3 = ST1.query_min(kb+1, r)
hp.heappush(q, m3)
dic[m3] = (nk3, kb+1, r, True)
else:
valueb, kb = ST1.query_min(ka+1, r)
if ka+1 < kb:
m1, nk1 = ST1.query_min(ka+1, kb)
hp.heappush(q, m1)
dic[m1] = (nk1, ka+1, kb, True)
if l < ka:
m2, nk2 = ST2.query_min(l, ka)
hp.heappush(q, m2)
dic[m2] = (nk2, l, ka+1, False)
if kb < r-1:
m3, nk3 = ST2.query_min(kb, r-1)
hp.heappush(q, m3)
dic[m3] = (nk3, kb, r, False)
ans.append(str(valueb))
print((" ".join(ans)))
if __name__ == "__main__":
main() | import sys
input = sys.stdin.readline
# O(NlogN)構築、クエリO(1)のRMQ
# 変更はできない
class SparseTable():
def __init__(self, N, A):
self.N = N
self.logN = N.bit_length()
self.A = A
self.table = [[i for i in range(N)]]
for k in range(self.logN):
tab = []
for i in range(self.N-(1<<(k+1))+1):
ind1 = self.table[-1][i]
ind2 = self.table[-1][i+(1<<k)]
if self.A[ind1] <= self.A[ind2]:
tab.append(ind1)
else:
tab.append(ind2)
self.table.append(tab)
# [l, r)のminの(val, key)
def query_min(self, l, r):
k = (r-l).bit_length()-1
indl = self.table[k][l]
indr = self.table[k][r-(1<<k)]
if self.A[indl] <= self.A[indr]:
return self.A[indl], indl
return self.A[indr], indr
import heapq as hp
N = int(eval(input()))
A = list(map(int, input().split()))
def main():
SP1 = SparseTable((N+1)//2, A[::2])
SP2 = SparseTable(N//2, A[1::2])
ans = []
q = []
v, k = SP1.query_min(0, N//2)
dic = {}
dic[v] = (k, 0, N//2, True)
hp.heappush(q, v)
for _ in range(N//2):
valuea = hp.heappop(q)
ka, l, r, is1 = dic[valuea]
ans.append(str(valuea))
if is1:
valueb, kb = SP2.query_min(ka, r)
if ka < kb:
m2, nk2 = SP2.query_min(ka, kb)
hp.heappush(q, m2)
dic[m2] = (nk2, ka, kb+1, False)
if l < ka:
m1, nk1 = SP1.query_min(l, ka)
hp.heappush(q, m1)
dic[m1] = (nk1, l, ka, True)
if kb+1 < r:
m3, nk3 = SP1.query_min(kb+1, r)
hp.heappush(q, m3)
dic[m3] = (nk3, kb+1, r, True)
else:
valueb, kb = SP1.query_min(ka+1, r)
if ka+1 < kb:
m1, nk1 = SP1.query_min(ka+1, kb)
hp.heappush(q, m1)
dic[m1] = (nk1, ka+1, kb, True)
if l < ka:
m2, nk2 = SP2.query_min(l, ka)
hp.heappush(q, m2)
dic[m2] = (nk2, l, ka+1, False)
if kb < r-1:
m3, nk3 = SP2.query_min(kb, r-1)
hp.heappush(q, m3)
dic[m3] = (nk3, kb, r, False)
ans.append(str(valueb))
print((" ".join(ans)))
if __name__ == "__main__":
main() | p03641 |
import sys
input = sys.stdin.readline
def digit_sum(n, b):
res = 0
while n > 0:
res += n % b
n //= b
return res
def main():
n = int(eval(input()))
s = int(eval(input()))
ans = -1
if n < s:
ans = -1
elif n == s:
ans = n + 1
else:
key = []
start, first = n, 1
for i in range(1, n):
first = digit_sum(n, start)
end = start - n // i // (i + 1)
if start == end+1:
judge = start
break
while end > 1:
if digit_sum(n, end) == i * (start - end) + first:
end -= 1
continue
break
next_start = end
value = digit_sum(n, start)
end = value + (start - end - 1) * i
key.append((start, value, end, i, first))
judge = start
start = next_start
if start == 1:
break
for i in range(2, judge + 1):
sub = digit_sum(n, i)
if sub == s:
ans = i
break
else:
for index, start, end, i, first in reversed(key):
if end < s or s < start:
continue
if (s - start) % i:
continue
ans = index - (s - first) // i
break
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def digit_sum(n, b):
if b == 1:
return n
res = 0
while n > 0:
res += n % b
n //= b
return res
def main():
n = int(eval(input()))
s = int(eval(input()))
ans = -1
if n == s:
ans = n + 1
else:
for b in range(2, int(n**0.5) + 1):
if digit_sum(n, b) == s:
ans = b
break
else:
for p in range(1, int(n**0.5)+1):
b = (n - s) // p + 1
if b >= 2 and digit_sum(n, b) == s:
if ans == -1:
ans = b
else:
ans = min(ans, b)
if b >= 1 and digit_sum(n, b+1) == s:
if ans == -1:
ans = b+1
else:
ans = min(ans, b+1)
print(ans)
if __name__ == "__main__":
main()
| p04016 |
def digit_sum(n, s):
if s > n:
return -1
if s == n:
return n + 1
b = 2
while b**2 < n:
if f(b, n) == s:
return b
b += 1
p = int(n * 0.5)
while p >= 1:
b = (n - s) // p + 1
if b > 1 and f(b, n) == s:
return b
p -= 1
return -1
def f(b, n):
if n < b:
return n
return f(b, n // b) + (n % b)
def solve():
n = int(eval(input()))
s = int(eval(input()))
result = digit_sum(n, s)
print(result)
solve()
| def digit_sum(n, s):
if s > n:
return -1
if s == n:
return n + 1
b = 2
while b**2 < n:
if f(b, n) == s:
return b
b += 1
p = int(n ** 0.5)
while p >= 1:
b = (n - s) // p + 1
if b > 1 and f(b, n) == s:
return b
p -= 1
return -1
def f(b, n):
if n < b:
return n
return f(b, n // b) + (n % b)
def solve():
n = int(eval(input()))
s = int(eval(input()))
result = digit_sum(n, s)
print(result)
solve()
| p04016 |
import math
def f(b,n):
if n<b:
return n
else:
return f(b,n//b)+(n%b)
N=int(eval(input()))
S=int(eval(input()))
if N==S:
print((N+1))
else:
for b in range(2,int(math.sqrt(N))+2):
if f(b,N)==S:
print(b)
exit()
ans=10**13
for p in range(1,int(math.sqrt(N))+2):
if (N-S)%p!=0:
continue
b=(N-S)//p+1
if b<=1:
continue
if f(b,N)==S:
ans=b
if ans==10**13:
print((-1))
else:
print(ans)
| import math
n=int(eval(input()))
s=int(eval(input()))
def f(b,n):
if n<b:
return n
else:
return f(b,n//b)+(n%b)
def abc(N,S):
if N==S:
return N+1
else:
for b in range(2,int(math.sqrt(N))+2):
if f(b,N)==S:
return b
tmp=-1
for p in range(1,int(math.sqrt(N))+2):
if (N-S)%p!=0:
continue
b=(N-S)//p+1
if b<=1:
continue
if f(b,N)==S:
tmp=b
return tmp
ans=abc(n,s)
print(ans) | p04016 |
from math import sqrt, factorial
from sys import setrecursionlimit
setrecursionlimit(100000)
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
S = int(eval(input()))
RN = int(sqrt(N))
RN += ((RN+1)**2 == N)
def func(b, N):
if b == 0:
return -1
tmp = 0
while N:
N, d = divmod(N, b)
tmp += d
return tmp
for b in range(2, RN+1):
tmp = func(b, N)
if tmp == S:
print(b)
break
else:
for x in range(RN, 0, -1):
num = (N-S+x)//x
b = num//x
if func(b, N) == S:
print(b)
break
else:
print((-1)) | from math import sqrt, factorial
from sys import setrecursionlimit
setrecursionlimit(10000000)
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
S = int(eval(input()))
RN = int(sqrt(N)) + 1
RN += ((RN+1)**2 == N)
def func(b, N):
if b <= 1:
return -1
tmp = 0
while N:
N, d = divmod(N, b)
tmp += d
return tmp
for b in range(2, RN+1):
tmp = func(b, N)
if tmp == S:
print(b)
break
else:
for x in range(RN, 0, -1):
b = (N-S+x)//x
if func(b, N) == S:
print(b)
break
else:
if func(S+1, N) == S:
print((S+1))
else:
print((-1)) | p04016 |
from collections import deque
x = int(eval(input()))
q = deque()
q.append((0, 0)) # (t, pos)
while q:
t, pos = q.popleft()
# print(t, pos)
if pos == x:
print(t)
break
else:
q.append((t+1, pos))
q.append((t+1, pos+t+1))
if pos-t >= 1:
q.append((t+1, pos-t-1)) | x = int(eval(input()))
s = 0
for i in range(1, x+1):
s += i
if s >= x:
print(i)
break | p03779 |
Acsum=[]
acsum=0
for i in range(10**5):
acsum+=i
Acsum.append(acsum)
def binarysearch(x):
ng=-1
ok=10**5
while abs(ok-ng)>1:
mid=(ok+ng)//2
if Acsum[mid]>=x:
ok=mid
else:
ng=mid
return ok
n=int(eval(input()))
print((binarysearch(n))) | Acsum=[]
acsum=0
for i in range(5*10**4):
acsum+=i
Acsum.append(acsum)
def binarysearch(x):
ng=-1
ok=5*10**4
while abs(ok-ng)>1:
mid=(ok+ng)//2
if Acsum[mid]>=x:
ok=mid
else:
ng=mid
return ok
n=abs(int(eval(input())))
print((binarysearch(n)))
| p03779 |
x=int(eval(input()))
n=1
while 1/2*(n**2+n)<x:
n+=1
print(n) | x=int(eval(input()))
#n=1
#while 1/2*(n**2+n)<x:
# n+=1
#print(n)
left=0
right=x
while right-left>1:
mid=(left+right)//2
if (mid**2+mid)/2==x:
right=mid
break
if (mid**2+mid)/2<x:
left=mid
else:
right=mid
print(right) | p03779 |
n = int(eval(input()))
x,count = 1,1
while x < n:
x += count
count += 1
print((count if x == n else count-1)) | n = int(eval(input()))
x,count = 1,1
while x <= n:
x += count
count += 1
print((count-1)) | p03779 |
X = int(eval(input()))
dp = {}
dp[0] = 0
for i in range(1,X+1):
dp_ = dp.copy()
for key in list(dp.keys()):
if not key+i in list(dp.keys()): dp_[key+i] = i
else: dp_[key+i] = min(dp_[key+i], i)
#if not key-i in dp.keys(): dp_[key-i] = i
#else: dp_[key-i] = min(dp_[key-i],i)
dp = dp_
ans = dp[X]
print(ans)
| import math
X = int(eval(input()))
n = math.ceil((math.sqrt(1+8*X) - 1)/2)
ans = n
print(ans)
| p03779 |
import sys
input = sys.stdin.readline
def main():
X = int(eval(input()))
x = 0
for i in range(1, X+1):
x += i
if x >= X:
print(i)
return
if __name__ == '__main__':
main()
| import sys
import math
input = sys.stdin.readline
def main():
X = int(eval(input()))
print((math.ceil((-1 + math.sqrt(1+8*X))/2)))
if __name__ == '__main__':
main()
| p03779 |
x = int(eval(input()))
min_dt = 1001001001
min_i = 0
for i in range(1, x+1):
dt = abs(x - (i+1)*i//2)
if dt<min_dt:
min_dt = dt
min_i = i
if min_dt == 0:
print(i)
break
else:
print((min_i+min_dt))
| x = int(eval(input()))
i = 1
while True:
if (i+1)*i//2 >= x:
print(i)
break
i += 1
| p03779 |
import copy
X=int(eval(input()))
ava={0}
ava2={0}
for i in range(1,10**9):
ava=copy.deepcopy(ava2)
#print(i,ava,ava2)
if X not in ava:
for item in ava:
ava2.add(item+i)
ava2.add(item-i)
else:
print((i-1))
break | X=int(eval(input()))
for i in range(10**9):
if (i*(i+1))//2>=X:
print(i)
break | p03779 |
x=int(eval(input()))
num,i=0,0
while num<x:
i+=1
num+=i
print(i) | x=int(eval(input()))
t=0
a=0
while a<x:
t+=1
a+=t
print(t) | p03779 |
n = int(eval(input()))
dx =[0, 1]
l = [0]
i = 0
while(n not in l):
i += 1
l = list(set(l))
for j in range(len(l)):
a = l[0]
l.remove(l[0])
for k in range(2):
l.append(a + dx[k]*i)
print(i)
| import math
n = int(eval(input()))
print((math.ceil((-1+(1+8*n)**(1/2))/2))) | p03779 |
X=int(eval(input()))
#幅
from collections import deque
def dfs_2(start,goal):
q = deque([]) # スタック
q.append([start])
flg = 0
while flg==0:
p = q.popleft() # スタック取りだし（先頭）
jp = len(p)
# if p[-1]-jp == goal or p[-1]+jp == goal:
if p[-1]+jp == goal:
return jp
else:
p0 = [p[-1]]
pp = [p[-1]+jp]
# pm = [p[-1]-jp]
q.append(p+pp)# スタック追加
# q.append(p+pm)
q.append(p+p0)
print((dfs_2(0,X))) | X=int(eval(input()))
s=0
for t in range(X+1):
s+=t
if s>=X:
print(t)
break | p03779 |
import bisect
x = int(eval(input()))
xx = x//2
a = []
s = 0
for i in range(xx):
s += i+1
a.append(s)
#print (s)
r = bisect.bisect_left(a, x)
print((r+1))
| import bisect
x = int(eval(input()))
xx = x//2
a = []
s = 0
for i in range(x+1):
if (i * (i+1))/2 >= x:
print(i)
exit() | p03779 |
int_x = int(eval(input()))
li_dist = list()
for i in range(1, int_x + 1):
if len(li_dist) == 0:
li_dist = [i, -i, 0]
else:
li_dist = [x + y for x in [i, -i, 0] for y in li_dist]
if int_x in li_dist:
print(i)
exit(0)
| x = int(eval(input()))
w = 0
for i in range(1, x + 1):
w += i
if w >= x:
print(i)
exit(0)
| p03779 |
def main():
x = int(eval(input()))
i = 1
p = 0
while True:
if i == (x - p):
print(i)
break
if i + 1 == (x - p):
print((i + 1))
break
else:
p += i
i += 1
if __name__ == '__main__':
main()
| def main():
x = int(eval(input()))
k = int(x ** .5)
i = 0
while True:
p = i * (i + 1) // 2
if p >= x:
print(i)
break
i += 1
if __name__ == '__main__':
main()
| p03779 |
import bisect
x = int(eval(input()))
a = [1]
s = 1
for i in range(2, x+1):
s += i
a.append(s)
if x in a:
print((a.index(x) + 1))
exit()
print((bisect.bisect_right(a, x)+1))
| import bisect
from math import sqrt
x = int(eval(input()))
a = [1]
s = 1
for i in range(2, 2*int(sqrt(x))):
s += i
a.append(s)
if x in a:
print((a.index(x) + 1))
exit()
print((bisect.bisect_right(a, x)+1))
| p03779 |
import bisect
from math import sqrt
x = int(eval(input()))
a = [1]
s = 1
for i in range(2, 2*int(sqrt(x))):
s += i
a.append(s)
if x in a:
print((a.index(x) + 1))
exit()
print((bisect.bisect_right(a, x)+1))
| from math import sqrt
x = int(eval(input()))
t = (-1+sqrt(8*x+1))/2
a = int(t)
if a == t:
print(a)
else:
print((a+1))
| p03779 |
x=int(eval(input()))
import math
print((math.ceil((-1+math.sqrt(1+8*x))/2))) | x=int(eval(input()))
import math
print((math.ceil((-1+math.sqrt(1+8*x))/2)))
#{1,2,3,..n}はΣｋなので 1/2n(n+1)=xを解くとできる
| p03779 |
from math import ceil
x = int(eval(input()))
n = (2 * x + 0.25) ** 0.5 - 0.5
print((ceil(n))) | print((int((2*int(eval(input()))+1/4)**0.5+0.5-10**(-5)))) | p03779 |
def main():
X = int(eval(input()))
cur = 0
p = 0
for _ in range(X):
if cur == p:
cur += 1
p = 1
else:
p += 1
print(cur)
if __name__ == '__main__':
main() | def main():
X = int(eval(input()))
i = 1
while (i*(i+1))//2 < X:
i += 1
print(i)
if __name__ == '__main__':
main() | p03779 |
x = int(eval(input()))
temp = 0
for i in range(x+1):
temp += i
if temp >= x:
print(i)
exit()
| x = int(eval(input()))
for i in range(10**6):
if i*(i+1)//2 >= x:
print(i)
exit()
| p03779 |
def create_koho(X):
koho = [1]
koho_sum = 1
i = 1
while koho_sum < X:
i += 1
koho.append(i)
koho_sum += i
return koho
X = int(eval(input()))
koho = create_koho(X)
nokori = X
ans = 0
for i in reversed(koho):
if nokori >= i:
nokori -= i
ans += 1
print((len(koho)))
| X = int(eval(input()))
i = 1
koho_sum = i
while koho_sum < X:
i += 1
koho_sum += i
print(i)
| p03779 |
# -*- coding: utf-8 -*-
X = int(eval(input()))
sumX = []
sum = 0
for i in range(1,X+1):
sum += i
sumX.append(sum)
# print(sumX)
for i in range(X):
j = X - i
if X > sumX[j-1]:
print((j+1))
exit()
print((1))
| # -*- coding: utf-8 -*-
X = int(eval(input()))
# sumX = []
sum = 0
for i in range(1,X+1):
sum += i
# print("sum=",sum)
if sum >= X:
print(i)
# print("i=", i)
break
| p03779 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
x = int(eval(input()))
i, pos = 0, set([0])
while True:
inner = False
new_pos = set()
for p in pos:
if p + i == x or p - i == x:
inner = True
break
new_pos.add(p)
new_pos.add(p + i)
new_pos.add(p - i)
if inner:
print(i)
break
pos = new_pos
i += 1
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
x = int(eval(input()))
total = 0
for i in range(x + 1):
total += i
if total >= x:
print(i)
break
| p03779 |
X = int(eval(input()))
def jump(s, t):
ns = set()
for n in s:
ns.add(n - t)
ns.add(n)
ns.add(n + t)
return ns
def main():
t = 0
curr = set([0])
while X not in curr:
t += 1
curr = jump(curr, t)
print(t)
if __name__ == '__main__':
main() | X = int(eval(input()))
def main():
t = 0
curr = 0
while curr < X:
t += 1
curr += t
print(t)
if __name__ == '__main__':
main() | p03779 |
n = int(eval(input()))
ls = [e for e in range(n+1)]
if (int((2*n)**(1/2))+1)*(int((2*n)**(1/2)))/2 < n:
print((int((2*n)**(1/2))+1))
else:
print((int((2*n)**(1/2)))) | n = int(eval(input()))
if (int((2*n)**(1/2))+1)*(int((2*n)**(1/2)))/2 < n:
print((int((2*n)**(1/2))+1))
else:
print((int((2*n)**(1/2)))) | p03779 |
import sys
x = int(sys.stdin.readline().rstrip())
def main():
l = 0
r = x + 1
while l + 1 < r:
m = (l + r) // 2
if (1 + m) * m // 2 >= x:
r = m
else:
l = m
return r
if __name__ == '__main__':
ans = main()
print(ans) | import sys
x = int(sys.stdin.readline().rstrip())
def main():
n = int((x * 2) ** 0.5)
res = n if (1 + n) * n // 2 >= x else n + 1
print(res)
if __name__ == '__main__':
main() | p03779 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
from itertools import accumulate
S = [i for i in accumulate(list(range(1, N+1)))]
def is_ok(mid):
if N <= S[mid]:
return True
else:
return False
def binary_search_meguru():
left = -1
right = N
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid):
right = mid
else:
left = mid
return right
ans = binary_search_meguru() + 1
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
from itertools import accumulate
S = [i for i in accumulate(list(range(1, min(N+1, 100000))))]
def is_ok(mid):
if N <= S[mid]:
return True
else:
return False
def binary_search_meguru():
left = -1
right = len(S)
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid):
right = mid
else:
left = mid
return right
ans = binary_search_meguru() + 1
print(ans)
if __name__ == '__main__':
main()
| p03779 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
from itertools import accumulate
S = [i for i in accumulate(list(range(1, min(N+1, 100000))))]
def is_ok(mid):
if N <= S[mid]:
return True
else:
return False
def binary_search_meguru():
left = -1
right = len(S)
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid):
right = mid
else:
left = mid
return right
ans = binary_search_meguru() + 1
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
from itertools import accumulate
S = [i for i in accumulate(list(range(1, min(N+1, 44725))))]
def is_ok(mid):
if N <= S[mid]:
return True
else:
return False
def binary_search_meguru():
left = -1
right = len(S)
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid):
right = mid
else:
left = mid
return right
ans = binary_search_meguru() + 1
print(ans)
if __name__ == '__main__':
main()
| p03779 |
X = int(eval(input()))
ans = 0
for i in range(1,X+1):
if ans + i <= X:
ans += i
else:
print(i)
exit()
if ans == X:
print(i)
exit() | X = int(eval(input()))
ans = 0
for i in range(1,X+1):
ans += i
if X <= ans:
print(i)
exit() | p03779 |
import sys
def solve():
x = int(input())
t = 1
while calc_sum(t) < x:
t += 1
print(t)
def calc_sum(t):
return t * (t + 1) // 2
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()
| import sys
def solve():
x = int(eval(input()))
k = 0
while k * (k + 1) // 2 < x:
k += 1
print(k)
if __name__ == '__main__':
solve() | p03779 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.