input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import heapq
import sys
from collections import deque
input=sys.stdin.readline
n=int(eval(input()))
a=[int(i) for i in input().split()]
#f=[-i for i in a[:n]]
f=a[:n]
l=[-i for i in a[2*n:]]
heapq.heapify(f)
heapq.heapify(l)
fs=[0]*(n+1)
ls=[0]*(n+1)
fs[0]=sum(f)
ls[n]=-sum(l)
for i in range(n):
... | import heapq
n=int(eval(input()))
a=[int(i) for i in input().split()]
f=a[:n]
l=[-i for i in a[2*n:]]
heapq.heapify(f)
heapq.heapify(l)
fs=[0]*(n+1)
ls=[0]*(n+1)
fs[0]=sum(f)
ls[n]=-sum(l)
for i in range(n):
c=a[n+i]
m=heapq.heappushpop(f,c)
fs[i+1]=fs[i]+c-m
for i in range(n):
c=a[2... | p03716 |
import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
left = A[:N]
lefty = sum(left)
right = [-A[i] for i in range(3*N-1, 2*N-1, -1)]
righty = sum(right)
left_list = [lefty]
right_list = [righty]
heapq.heapify(left)
heapq.heapify(right)
for i in range(N, 2*N):
heapq.heappush(... | import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
# L = heapq.heapify(A[:N])
# R = heapq.heapify(A[2*N:]) この記法ないらしい
# BC125C の累積GCDの直後にやっているので、似たやり方で解いてみる
L = A[:N]
R = [-a for a in A[2*N:]]
L_sum, R_sum = sum(L), sum(R)
heapq.heapify(L)
heapq.heapify(R)
L_acc = [L_sum]
R_acc = [... | p03716 |
import heapq
N = int(eval(input()))
a = list(map(int, input().split()))
m = len(a) // 2
cumsumA = []
prefix = [x for x in a[:N]]
heapq.heapify(prefix)
cumsumA.append(sum(prefix))
for k in range(N, 2*N):
heapq.heappush(prefix, a[k])
heapq.heappop(prefix)
cumsumA.append(sum(prefix))
cumsumB = []
su... | import heapq
N = int(eval(input()))
a = list(map(int, input().split()))
m = len(a) // 2
cumsumA = []
prefix = [x for x in a[:N]]
heapq.heapify(prefix)
cumsumA.append(sum(prefix))
cursum = sum(prefix)
for k in range(N, 2*N):
heapq.heappush(prefix, a[k])
ele = heapq.heappop(prefix)
cursum = cursum + a... | p03716 |
import heapq
def solve(n,a):
res = -float('inf')
for k in range(n,2*n+1):
a1 = a[:k]
a2 = [-a[i] for i in range(k,3*n)]
heapq.heapify(a1)
heapq.heapify(a2)
while len(a1) > n:
heapq.heappop(a1)
while len(a2) > n:
heapq.heapp... | import heapq
def solve(n,a):
a1 = a[:n]
a2 = [-a[i] for i in range(2*n,3*n)]
l = [[0,0] for i in range(n+1)]
heapq.heapify(a1)
heapq.heapify(a2)
l[0][0] = sum(a1)
l[n][1] = sum(a2)
for k in range(n,2*n):
heapq.heappush(a1,a[k])
tmp = heapq.heapp... | p03716 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
from heapq import heapify, heappop, heappush
from copy import deepcopy
N = int(eval(input()))
A = inpl()
before = deepcopy(A[:N])
heapify(before)
middle = A[N:-N]
after = [-a for a in A[-N:]]
heapify(after)
sb = sum(A[:N])
sa =... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
from heapq import heapify, heapreplace
N = int(eval(input()))
A = inpl()
L = A[:N]
M = A[N:2*N]
R = [-a for a in A[2*N:]]
ans = sum(L) + sum(R)
heapify(L)
heapify(R)
i = 0
j = N+1
S = [0]*(N+1)
s = 0
for i, m in enumera... | p03716 |
import sys
import heapq
input=sys.stdin.readline
N=int(eval(input()))
A=tuple(map(int,input().split()))
hq=list(A[:N])
heapq.heapify(hq)
s=[0]*(N+1)
s[0]=sum(hq)
for i in range(N):
x=heapq.heappop(hq)
if x >= A[N+i]:
s[i+1]=s[i]
heapq.heappush(hq,x)
else:
s[i+1]=s[i]+A[N+i]-x
heapq... | import heapq
import bisect
N = int(eval(input()))
a = list(map(int, input().split()))
b = a[:N]
c = a[-N:]
L = [0]*(N+1)
R = [0]*(N+1)
L[0] = sum(b)
heapq.heapify(b)
R[-1] = sum(c)
c = list([-x for x in c])
heapq.heapify(c)
for i in range(N):
k = a[i+N]
x = heapq.heappop(b)
if x ... | p03716 |
# -*- coding: utf-8 -*-
import heapq
class MaxHeap:
def __init__(self, li):
self.heap = [-e for e in li]
heapq.heapify(self.heap)
def push(self, val):
heapq.heappush(self.heap, -val)
def pop(self):
return -heapq.heappop(self.heap)
n = int(eval(input())... | from heapq import heapify, heappop, heappush
class MaxHeap:
def __init__(self, li):
self.hp = []
for e in li:
heappush(self.hp, -e)
def push(self, x):
heappush(self.hp, -x)
def pop(self):
ret = heappop(self.hp)
ret *= -1
return r... | p03716 |
import heapq
n = int(eval(input()))
a = [int(i) for i in input().split()]
k = 0
a_front = []
a_center = []
a_back = []
front_sum = 0
back_sum = 0
for i in a:
k += 1
if k <= n:
a_front += [i]
front_sum += i
elif k <= 2 * n:
a_center += [i]
else:
a_back +... | import heapq
def calc(front_sum, back_sum):
heapq.heapify(a_front)
heapq.heapify(a_back)
front_sums = [front_sum]
back_sums = [back_sum]
for i in range(n):
front_sum += a_center[i] - heapq.heappushpop(a_front, a_center[i])
front_sums += [front_sum]
back_sum += a_ce... | p03716 |
import heapq
def calc(front_sum, back_sum):
heapq.heapify(a_front)
heapq.heapify(a_back)
front_sums = [front_sum]
back_sums = [back_sum]
for i in range(n):
front_sum += a_center[i] - heapq.heappushpop(a_front, a_center[i])
front_sums += [front_sum]
back_sum += a_ce... | import heapq
def calc(front_sum, back_sum):
heapq.heapify(a_front)
heapq.heapify(a_back)
front_sums = [front_sum]
back_sums = [back_sum]
for i in a_center:
front_sum += i - heapq.heappushpop(a_front, i)
front_sums += [front_sum]
a_center.reverse()
for i in a_cente... | p03716 |
import heapq
def calc(front_sum, back_sum):
heapq.heapify(a_front)
heapq.heapify(a_back)
front_sums = [front_sum]
back_sums = [back_sum]
for i in a_center:
front_sum += i - heapq.heappushpop(a_front, i)
front_sums += [front_sum]
a_center.reverse()
for i in a_cente... | import heapq
import sys
input = sys.stdin.readline
def calc(front_sum, back_sum):
heapq.heapify(a_front)
heapq.heapify(a_back)
front_sums = [front_sum]
back_sums = [back_sum]
for i in a_center:
front_sum += i - heapq.heappushpop(a_front, i)
front_sums += [front_sum]
... | p03716 |
import heapq
n = int(eval(input()))
array = [int(i) for i in input().split()]
ans=-1e14
l_array = []
r_array = []
l_sum = [0]*(n+1)
r_sum = [0]*(n+1)
# left-n and right-n numbers
for i in range(n):
heapq.heappush(l_array, array[i])
heapq.heappush(r_array, (-array[3*n-1-i], array[3*n-1-i]))
l_s... | import heapq
n = int(eval(input()))
array = [int(i) for i in input().split()]
ans=-1e14
l_array = []
r_array = []
l_sum = [0]*(n+1)
r_sum = [0]*(n+1)
# left-n and right-n numbers
for i in range(n):
heapq.heappush(l_array, array[i])
heapq.heappush(r_array, (-array[3*n-1-i], array[3*n-1-i]))
l_s... | p03716 |
#!/usr/bin/env python3
import sys
import heapq
from collections import deque
inf = float("inf")
def solve(N: int, a: "List[int]"):
L = a[:N]
R = [-x for x in a[2*N:]]
heapq.heapify(L)
heapq.heapify(R)
M = a[N:2*N]
sumL = [0 for _ in range(N+1)] # sumL[i]: a[0]からa[N-1+i]までの大きい順にN... | #!/usr/bin/env python3
import sys
import heapq
inf = float("inf")
def solve(N: int, a: "List[int]"):
L = a[:N]
R = [-x for x in a[2*N:]]
heapq.heapify(L)
heapq.heapify(R)
M = a[N:2*N]
sumL = [0 for _ in range(N+1)] # sumL[i]: a[0]からa[N-1+i]までの大きい順にN個の和
sumR = [0 for _ in ran... | p03716 |
import heapq
N = int(eval(input()))
A = list(map(int,input().split()))
#前半部分の最適化辞書作成
SUM = sum(A[:N])
firstDic = {N-1:SUM}
que = A[:N]
heapq.heapify(que)
for i in range(N,2*N):
SUM += A[i]
heapq.heappush(que,A[i])
SUM -= heapq.heappop(que)
firstDic[i] = SUM
#後半部分の最適化辞書作成
SUM = sum(A[... | N = int(eval(input()))
A = list(map(int,input().split()))
B = []
for i in range(3*N-1,-1,-1):
B.append(A[i]*-1)
"""
前半をできるだけおおきく、後半をできるだけ小さくする。
前半はpriority queにぶっこんでいって、最小値を除去していく
"""
import heapq
frontSum = sum(A[:N])
frontQue = A[:N]
heapq.heapify(frontQue)
front = [frontSum]
for i in range(N,2*N):
... | p03716 |
# ABC140E
class SegTree:
def __init__(self, init_val, ide_ele, seg_func):
self.segfunc = seg_func
N = len(init_val)
self.num = 2**(N-1).bit_length()
self.ide_ele = ide_ele
self.seg=[self.ide_ele]*2*self.num
for i in range(N):
self.seg[i+self.num-1... | from heapq import *
N, = list(map(int, input().split()))
A = list(map(int, input().split()))
s = sum(A[:N])
rs = [s] + [0] * N
l = []
for i in range(N):
heappush(l, A[i])
for i in range(N, 2*N):
s += A[i]
heappush(l, A[i])
x = heappop(l)
s -= x
rs[i-N+1] = s
l2 = []
s2 = 0
for i ... | p03716 |
# diverta 2019 Programming Contest 2: A – Ball Distribution
n, k = [int(s) for s in input().split()]
if k == 1:
print((0))
else:
print((n - k)) | # diverta 2019 Programming Contest 2: A – Ball Distribution
n, k = list(map(int, input().split()))
print((n - k if k > 1 else 0)) | p03005 |
import sys
from collections import deque # 双方向キュー
from collections import defaultdict # 初期化済み辞書
from heapq import heapify, heappush, heappop, heappushpop # プライオリティキュー
from bisect import bisect_left, bisect_right # 二分探索
#import numpy as np # 1.8.2
#import scipy # 0.13.3
s2nn = lambda s: [int(c) for c in s... | import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss ... | p03005 |
N, K = list(map(int, input().split()))
if K == 1:
print((0))
else:
print((N - K))
| N, K = list(map(int, input().split()))
print((0 if K == 1 else N - K))
| p03005 |
n, k = list(map(int, input().split()))
if k == 1:
print((0))
else:
print((n - k))
| n, k = list(map(int, input().split()))
print((n % k))
| p03005 |
MOD = 10**9 + 7
def main():
N, X = list(map(int, input().split()))
S = list(map(int, input().split()))
S = sorted(S, reverse=True)
dp = [0]*(X+1)
dp[X] = 1
for i in range(N):
new = [0] * (X+1)
for x in range(X+1):
xx = x % S[i]
new[x] += dp[... | from collections import defaultdict as dd
MOD = 10**9 + 7
def main():
N, X = list(map(int, input().split()))
S = list(map(int, input().split()))
S = sorted(S, reverse=True)
dp = dd(int)
dp[X] = 1
for i in range(N):
new = dd(int)
for x in dp:
xx = x % S[... | p03082 |
N,X = list(map(int,input().split()))
S = list(map(int,input().split()))
S.sort()
mod = 10**9+7
dp = [[0]*(N+1) for i in range(X+1)]
for x in range(X+1):
for n in range(N+1):
if n == 0:
dp[x][n] = x
else:
dp[x][n] = (dp[x%S[n-1]][n-1] + (n-1)*dp[x][n-1])%mod
pri... | N,X = list(map(int,input().split()))
S = list(map(int,input().split()))
S.sort()
mod = 10**9+7
dp = [[x]+[0]*N for x in range(X+1)]
for x in range(X+1):
for n in range(1,N+1):
dp[x][n] = (dp[x%S[n-1]][n-1] + (n-1)*dp[x][n-1])%mod
print((dp[X][N])) | p03082 |
N,X = list(map(int,input().split()))
S = list(map(int,input().split()))
S.sort()
mod = 10**9+7
dp = [[x]+[0]*N for x in range(X+1)]
for x in range(X+1):
for n in range(1,N+1):
dp[x][n] = (dp[x%S[n-1]][n-1] + (n-1)*dp[x][n-1])%mod
print((dp[X][N])) | N,X = list(map(int,input().split()))
S = list(map(int,input().split()))
S.sort()
mod = 10**9+7
dp = [[x]+[0]*N for x in range(X+1)]
for n in range(1,N+1):
for x in range(X+1):
dp[x][n] = (dp[x%S[n-1]][n-1] + (n-1)*dp[x][n-1])%mod
print((dp[X][N])) | p03082 |
import sys
# import bisect
# import math
import itertools
# import numpy as np
# import collections
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | import sys
# import bisect
# import math
import itertools
# import numpy as np
# import collections
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | p03082 |
import sys
from collections import defaultdict
def input():
return sys.stdin.readline()[:-1]
MOD = 1e9+7
n, x = list(map(int, input().split()))
s = list(map(int, input().split()))
s.sort(reverse=True)
dp = defaultdict(int)
dp[x] = 1
for i in range(n):
dpp = defaultdict(int)
for j in range(x+1):
dpp[... | import sys
from collections import defaultdict
def input():
return sys.stdin.readline()[:-1]
MOD = 1e9+7
n, x = list(map(int, input().split()))
s = list(map(int, input().split()))
s.sort(reverse=True)
dp = defaultdict(int)
dp[x] = 1
for i in range(n):
ss = s[i]
dpp = defaultdict(int)
for key, value i... | p03082 |
N, X = list(map(int, input().split()))
*S, = list(map(int, input().split()))
MOD = 10**9 + 7
fact = [1]*(X+1)
rfact = [1]*(X+1)
for i in range(X):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
S.sort()
memo = {}
def dfs(i, k):
key = (i, k)
if key in memo:
... | N, X = list(map(int, input().split()))
*V, = list(map(int, input().split()))
MOD = 10**9 + 7
fact = [1]*(X+1)
rfact = [1]*(X+1)
for i in range(X):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
V.sort()
S = [0]*(X+1)
S[X] = 1
for i in range(N-1, -1, -1):
T = [0]*(X... | p03082 |
N, X = list(map(int, input().split()))
*V, = list(map(int, input().split()))
MOD = 10**9 + 7
fact = [1]*(X+1)
rfact = [1]*(X+1)
for i in range(X):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
V.sort()
S = [0]*(X+1)
S[X] = 1
for i in range(N-1, -1, -1):
T = [0]*(X... | N, X = list(map(int, input().split()))
*V, = list(map(int, input().split()))
MOD = 10**9 + 7
V.sort()
S = [0]*(X+1)
S[X] = 1
T = [0]*(X+1)
zeros = [0]*(X+1)
for i in range(N-1, -1, -1):
T[:] = zeros
for k in range(X+1):
S[k] %= MOD
T[k] += S[k] * i % MOD
T[k % V[i]] +=... | p03082 |
mod=10**9+7
N,X=list(map(int,input().split()))
S=[int(i) for i in input().split()]
S.sort(reverse=True)
Factorial=[1]*(N+1)
for i in range(1,N+1):
Factorial[i]=Factorial[i-1]*(i)%mod
def power(x,y):
if y==0:
return 1
elif y==1:
return x%mod
elif y%2==0:
return power(x,y//2)**2%mod
... | mod=10**9+7
N,X=list(map(int,input().split()))
S=[int(i) for i in input().split()]
S.sort(reverse=True)
Factorial=[1]*(N+1)
for i in range(1,N+1):
Factorial[i]=Factorial[i-1]*(i)%mod
def power(x,y):
if y==0:
return 1
elif y==1:
return x%mod
elif y%2==0:
return power(x,y//2)**2%mod
... | p03082 |
import sys
sys.setrecursionlimit(10**9)
MOD = 10**9 + 7
N, X = list(map(int, input().split()))
Ss = list(map(int, input().split()))
Ss.sort(reverse=True)
def dfs(i, xNow):
if (i, xNow) in memo:
return memo[(i, xNow)]
if i == N-1:
ans = xNow % Ss[i]
else:
ans = dfs... | MOD = 10**9 + 7
N, X = list(map(int, input().split()))
Ss = list(map(int, input().split()))
Ss.sort(reverse=True)
minS = Ss[-1]
D = {X: 1}
for i, S in enumerate(Ss[:-1]):
D2 = {}
for x, num in list(D.items()):
D2[x] = (D2.get(x, 0) + num*(N-1-i)) % MOD
D2[x%S] = (D2.get(x%S, 0) +... | p03082 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p03082 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | p03082 |
import sys
input = sys.stdin.readline
mod = 10**9+7
def main():
N, X = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
L = max(A[-1], X)
dp = [[0]*N for _ in range(L+1)]
a = A[0]
for x in range(L+1):
dp[x][0] = x%a
dp1 = [[0]*N for _... | import sys
input = sys.stdin.readline
mod = 10**9+7
def main():
N, X = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
L = max(A[-1], X)
dp = [[0]*N for _ in range(L+1)]
a = A[0]
for x in range(L+1):
dp[x][0] = x%a
dp1 = [0 for _ in ... | p03082 |
N, X = [int(i) for i in input().split()]
sList = [int(i) for i in input().split()]
sList.sort(reverse=True)
mod = 10 ** 9 + 7
dp = [0 for _ in range(X + 1)]
dp[X] = 1
for i, s in enumerate(sList):
new_dp = [0 for _ in range(X + 1)]
for x in range(X + 1):
new_dp[x] += dp[x] * (N - i - 1)
... | from collections import defaultdict as dd
N, X = [int(i) for i in input().split()]
sList = [int(i) for i in input().split()]
sList.sort(reverse=True)
mod = 10 ** 9 + 7
dp = dd(int)
dp[X] = 1
for i, s in enumerate(sList):
new_dp = dd(int)
for x in dp:
new_dp[x] += dp[x] * (N - i - 1)
... | p03082 |
from collections import defaultdict
n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
mod = 10**9+7
rng = 300
fctr = [1]
finv = [1]
for i in range(1,rng):
fctr.append(fctr[-1]*i%mod)
def inv(a):
return pow(a,mod-2,mod)
dp = [{} for i in range(n+1)]
dp[0][x] = ... | from collections import defaultdict
n,x = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
mod = 10**9+7
dp = [defaultdict(int) for i in range(n+1)]
dp[0][x] = 1
for i in range(1,n+1):
for j in list(dp[i-1].keys()):
k = j%a[i-1]
dp[i][j] = (dp[i][j]+dp[i-1][j]*(... | p03082 |
mod = 10**9+7
n, X = list(map(int, input().split()))
s = [int(x) for x in input().split()]
s = sorted(s)
dp = [[0 for _ in range(X+1)] for _ in range(n+1)]
inv = [pow(i, mod-2, mod) for i in range(n+1)]
for i in range(n+1):
if i == 0:
for x in range(X+1):
dp[i][x] = x
else:
... | mod = 10**9+7
n, X = list(map(int, input().split()))
s = [int(x) for x in input().split()]
s = sorted(s)
dp = [[0 for _ in range(X+1)] for _ in range(n+1)]
for i in range(n+1):
if i == 0:
for x in range(X+1):
dp[i][x] = x
else:
for x in range(X+1):
dp[i][x]... | p03082 |
x,y,z=list(map(int,input().split()))
n=[i for i in range(z,x-z,y+z)]
if n[-1]+y+z<=x:
print((len(n)))
else:
print((len(n)-1)) | x,y,z=list(map(int,input().split()));print(((x-z)//(y+z))) | p03548 |
x,y,z = list(map(int, input().split()))
print((int((x-z)/(y+z)))) | x,y,z = list(map(int,input().split()))
print(((x-z)//(y+z))) | p03548 |
# -*- coding utf-8 -*-
x,y,z=list(map(int,input().split()))
print(((x-z)//(y+z)))
| x,y,z=list(map(int,input().split()))
x=x-z
print((x//(y+z)))
| p03548 |
X, Y, Z = (int(x) for x in input().split())
ans = (X-Z)//(Y+Z)
print(ans) | X, Y, Z = list(map(int, input().split()))
print(((X-Z)//(Y+Z)))
| p03548 |
x,y,z = list(map(int,input().split()))
ans = 0
while (y + z) * ans <= (x - z):
ans += 1
# print((y + z) * ans)
# print(ans)
print((ans-1))
|
x,y,z = list(map(int,input().split()))
ans = int((x-z)//(y+z))
print(ans)
| p03548 |
def answer(x: int, y: int, z: int) -> int:
return (x - z) // (y + z)
def main():
x, y, z = list(map(int, input().split()))
print((answer(x, y, z)))
if __name__ == '__main__':
main() | def answer(x: int, y: int, z: int) -> int:
return len(list(range(y + z * 2, x + 1, y + z)))
def main():
x, y, z = list(map(int, input().split()))
print((answer(x, y, z)))
if __name__ == '__main__':
main() | p03548 |
X, Y, Z = list(map( int, input().split()))
m = X - Z
n = Y + Z
print((m//n)) | X, Y, Z = list(map( int, input().split()))
m = X - Z
print((m//(Y+Z)))
| p03548 |
X,Y,Z=list(map(int,input().split()))
for i in range(1,10**9):
width=i*Y+(i+1)*Z
if width>X:
break
print((i-1)) | X,Y,Z=list(map(int,input().split()))
answer=0
width=Y+2*Z
while(width<=X):
answer+=1
width+=Y+Z
print(answer) | p03548 |
x,y,z=list(map(int,input().split()))
w=y+2*z
ans=1
while w<=x-(y+z):
w+=y+z
ans+=1
print(ans) | x,y,z=list(map(int,input().split()))
ans=(x-z)//(y+z)
print(ans) | p03548 |
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
x, y, z = (int(i) for i in sys.stdin.read().split())
n = 0
while True:
total = (n + 1) * z + n * y
if total <= x: n += 1; continue
... | import sys
L, l, d = list(map(int, sys.stdin.readline().split()))
def main():
x = (L - d) // (l + d)
return x
if __name__ == '__main__':
ans = main()
print(ans) | p03548 |
X, Y, Z = list(map(int, input().split()))
print(((X-Z)//(Y+Z))) | x,y,z = list(map(int, input().split()))
x -= z
y += z
print((x//y)) | p03548 |
x,y,z = list(map(int,input().split()))
p = y + z + z
c = 0
while p <= x:
c += 1
p = p + y + z
print(c) | x,y,z = list(map(int,input().split()))
yz = y + z
x -= z
print((x // yz)) | p03548 |
x,y,z=list(map(int,input().split()))
x = x - z
sum = 0
cnt = 0
while sum <= x:
sum += y + z
cnt += 1
print((cnt - 1))
| x,y,z=list(map(int,input().split()))
print(((x-z)//(y+z))) | p03548 |
X,Y,Z=list(map(int,input().split()))
ans=0
K=Z
while(True):
if K+Y+Z>X:
break
K+=Y+Z
ans+=1
print(ans) | X,Y,Z=list(map(int,input().split()))
A=X-Z
ans=A//(Y+Z)
print(ans)
| p03548 |
x, y, z = list(map(int, input().split()))
cnt = 0
x -= z
while x > 0:
if x-y-z >= 0:
x -= y+z
cnt += 1
else:
break
print(cnt) | x,y,z=list(map(int,input().split()))
print(((x-z)//(y+z))) | p03548 |
X, Y, Z = list(map(int, input().split()))
for n in range(10 ** 5, 0, -1):
if X >= n * (Y + Z) + Z:
break
print(n) | X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z))) | p03548 |
X, Y, Z = list(map(int, input().split()))
ans = 1
while ans * (Y + Z) + Z <= X:
ans += 1
print((ans - 1))
| X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z)))
| p03548 |
X, Y, Z = list(map(int, input().split()))
ans = 0
X -= Z
while Y+Z <= X:
X -= Y+Z
ans += 1
print(ans) | X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z))) | p03548 |
#!/usr/bin/env python
def main():
X, Y, Z = list(map(int, input().split(" ")))
max_num = 0
for i in range(100000):
if Y * i + Z * (i + 1) <= X:
max_num = i
else:
break
print(max_num)
if __name__ == '__main__':
main()
| #!/usr/bin/env python
def main():
X, Y, Z = list(map(int, input().split(" ")))
# max_num = 0
# for i in range(100000):
# if Y * i + Z * (i + 1) <= X:
# max_num = i
# else:
# break
# print(max_num)
print((int((X - Z) / (Y + Z))))
if __name__ ... | p03548 |
X,Y,Z = list(map(int,input().split()))
print(((X-Z) // (Y+Z)))
| x,y,z = list(map(int,input().split()))
print(((x-z)//(y+z))) | p03548 |
x, y, z = list(map(int, input().split()))
n = 1
while True:
if y * n + z * (n+1) <= x:
n += 1
else:
print((n-1))
break | x, y, z = list(map(int, input().split()))
s = z
cnt = 0
while True:
s += y + z
if s > x:
break
cnt += 1
print(cnt)
| p03548 |
X, Y, Z = list(map(int, input().split()))
num = 0
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
num = i
print(num)
| X, Y, Z = list(map(int, input().split()))
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
print((i - 1))
| p03548 |
x,y,z=list(map(int,input().split()))
ans=int(0)
x-=z
while x>=y+z:
ans+=1
x-=(y+z)
print(ans) | x,y,z=list(map(int,input().split()))
x-=z
print((int(x/(y+z)))) | p03548 |
X,Y,Z = list(map(int,input().split()))
X -= Y+2*Z
answer = 1
while X >= Y+Z :
X -= Y+Z
answer += 1
print(answer)
| X,Y,Z = list(map(int,input().split()))
answer = 0
X -= Y+2*Z
answer += 1
answer += X//(Y+Z)
print(answer)
| p03548 |
x, y, z = list(map(int, input().split()))
ans = 1
for i in range(x // y):
ans += 1
if y * ans + z * (ans + 1) > x:
print((ans - 1))
exit() | x, y, z = list(map(int, input().split()))
ans = 1
q = x // (y + z)
r = x % (y + z)
if r < z:
print((q - 1))
else:
print(q) | p03548 |
#!/usr/bin/env python
# encoding: utf-8
class Solution:
def __init__(self):
self.count = 0
def shell_sort(self):
array_length = int(input())
array = []
# array = list(map(int, sys.stdin.readlines()))
# array_length = 10
# array = [15, 12, 8, 9, 3, ... | #!/usr/bin/env python
# encoding: utf-8
import sys
class Solution:
def __init__(self):
self.count = 0
def shell_sort(self):
_input = sys.stdin.readlines()
array_length = int(_input[0])
array = list(map(int, _input[1:]))
G = [1]
while True:
... | p02262 |
n = int(input())
A = [int(input()) for _ in range(n)]
cnt = 0
G = [797161,265720,88573,29524,9841,3280,1093,364,121,40,13,4,1]
G = [v for v in G if v <= n]
m = len(G)
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
... | import sys
n = int(input())
A=[int(e)for e in sys.stdin]
cnt = 0
G = [797161,265720,88573,29524,9841,3280,1093,364,121,40,13,4,1]
G = [v for v in G if v <= n]
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
... | p02262 |
import sys
n = int(input())
A=list(map(int,sys.stdin))
cnt = 0
G = [int((3**i-1)/2)for i in range(30,0,-1)]
G = [v for v in G if v <= n]
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
... | import sys
n = int(input())
A=[int(e)for e in sys.stdin]
cnt = 0
G = [int((3**i-1)/2)for i in range(30,0,-1)]
G = [v for v in G if v <= n]
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
... | p02262 |
def shellsort(a):
l = len(a)
intervals = [n for n in (40, 13, 4, 1) if n <= l]
count = 0
for interval in intervals:
for i in range(interval, l):
j = 0
while i-interval*(j+1) >= 0:
n, m = i-interval*j, i-interval*(j+1)
if a[n] < a[m... | def shellsort(a):
l = len(a)
intervals = [n for n in (40, 13, 4, 1) if n <= l]
count = 0
for interval in intervals:
for i in range(interval, l):
v = a[i]
j = i-interval
while j >= 0 and v < a[j]:
a[j+interval] = a[j]
j... | p02262 |
def insertion_sort(a, n, g):
count = 0
for i in range(g, n):
for j in range(i, g-1, -g):
if a[j-g] > a[j]:
a[j-g], a[j] = a[j], a[j-g]
count += 1
return a, count
if __name__ == "__main__":
import sys
n = int(input())
a = list(m... | def insertion_sort(a, n, g):
count = 0
for i in range(g, n):
j = i
while j >= g and a[j-g] > a[j]:
a[j-g], a[j] = a[j], a[j-g]
j -= g
count += 1
return a, count
if __name__ == "__main__":
import sys
n = int(input())
... | p02262 |
def insertion_sort(A, N, gap):
cnt = 0
for i in range(gap, N):
tmp = A[i]
j = i - gap
while j>=0 and A[j] > tmp:
A[j+gap] = A[j]
j = j - gap
cnt = cnt + 1
A[j+gap] = tmp
return cnt
def shell_sort(A, N):
cnt = 0
gaps =... | def insertion_sort(A, N, gap):
global cnt
for i in range(gap, N):
tmp = A[i]
j = i - gap
while j>=0 and A[j] > tmp:
A[j+gap] = A[j]
j = j - gap
cnt += 1
A[j+gap] = tmp
def shell_sort(A, N):
gaps = [int((3**item-1)/2) for item i... | p02262 |
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
n = int(input())
A = [int(input()) for i in range(n)]
cnt = 0
G = []
for i ... | def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
n = int(input())
A = [int(input()) for i in range(n)]
cnt = 0
G = [1]
for i... | p02262 |
import sys
def print_arr(arr):
for i in range(len(arr)):
sys.stdout.write(str(arr[i]))
if i != len(arr) - 1:
sys.stdout.write(' ')
print()
def insertion_sort(arr, n, g):
cnt = 0
for i in range(g, n):
v = arr[i]
j = i - g
while j >= 0 ... | import sys
def print_A(A):
for i in range(len(A)):
sys.stdout.write(str(A[i]))
if i!= len(A) -1:
sys.stdout.write(' ')
print()
def insertionSort(A,n,g):
cnt = 0
for i in range(g,n):
v = A[i]
j = i - g
while (j>=0) and (A[j] > v):
... | p02262 |
import sys
readline = sys.stdin.readline
def insertionSort(A, n, g, cnt):
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt += 1
A[j + g] = v
return cnt
def shellSort(A, n):
cnt = 0
... | import sys
readline = sys.stdin.readline
def insertionSort(A, n, g, cnt):
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt += 1
A[j + g] = v
return cnt
def shellSort(A, n):
cnt = 0
... | p02262 |
def isort(a, n, g):
global cnt
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j -= g
cnt += 1
a[j + g] = v
# input data
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(... | import sys
def isort(a, n, g):
global cnt
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j -= g
cnt += 1
a[j + g] = v
# input data
n = int(sys.stdin.readline())
a = []
for i in range(n):
... | p02262 |
import sys
def isort(a, n, g):
global cnt
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j -= g
cnt += 1
a[j + g] = v
# input data
n = int(sys.stdin.readline())
a = []
for i in range(n):
... | def isort(a, n, g):
global cnt
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j -= g
cnt += 1
a[j + g] = v
# input data
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
... | p02262 |
swap_count = 0
def main():
num = int(eval(input()))
elements = []
for i in range(0, num):
elements.append(int(eval(input())))
# Get intervals
interval = 1
intervals = [interval]
while True:
interval = int_f(interval)
if interval > num:
break
intervals.append(interv... | swap_count = 0
def main():
num = int(eval(input()))
elements = []
for i in range(0, num):
elements.append(int(eval(input())))
# Get intervals
interval = 1
intervals = [interval]
while True:
interval = int_f(interval)
if interval > num:
break
intervals.insert(0, int... | p02262 |
import sys
import math
from collections import deque
def insertion_sort(a, n, g):
ct = 0
for i in range(g,n):
v = a[i]
j = i-g
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
return ct
n = int(input())
... | import sys
import math
def insertion_sort(a, n, g):
ct = 0
for i in range(g,n):
v = a[i]
j = i-g
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
return ct
n = int(input())
a = list(map(int, sys.stdin.re... | p02262 |
import sys
import math
def insertion_sort(a, n, g):
ct = 0
for j in range(0,n-g):
v = a[j+g]
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
return ct
n = int(input())
a = list(map(int, sys.stdin.readlines()))
... | import sys
import math
ct= 0
def insertion_sort(a, n, g):
global ct
for j in range(0,n-g):
v = a[j+g]
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j-g
ct += 1
a[j+g] = v
n = int(input())
a = list(map(int, sys.stdin.readlines()))
b = 7... | p02262 |
def insertion_sort(num_list,gap):
global cnt
for i in range(gap,len(num_list)):
evc = num_list[i]
j = i-gap
while j >= 0 and num_list[j] > evc:
num_list[j+gap] = num_list[j]
j = j-gap
cnt += 1
num_list[j+gap] = evc
def shel... | def insertion_sort(num_list,gap):
global cnt
for i in range(gap,len(num_list)):
swap_num = num_list[i]
j = i-gap
while j >= 0 and num_list[j] > swap_num:
num_list[j+gap] = num_list[j]
j -= gap
cnt += 1
num_list[j+gap] = swap_num
def... | p02262 |
n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt +=1
A[j + g] = v
def shellSort(A, n, m, G):
A1 = A[:]
global cnt
cnt = 0
for ... | n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt +=1
A[j + g] = v
def shellSort(A, n, m, G):
A1 = A[:]
global cnt
cnt = 0
for ... | p02262 |
def insertionSort( nums, n, g ):
cnt = 0
i = g
while i < len( nums ):
v = nums[i]
j = i - g
while 0 <= j and v < nums[j]:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
i += 1
return cnt
def shellSort( nums, n ):
cnt = 0
g = []
val =0
for i in range( 0, n ):
... | def insertionSort( nums, g ):
cnt = 0
i = g
n = len( nums )
while i < n:
v = nums[i]
j = i - g
while 0 <= j and v < nums[j]:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
i += 1
return cnt
def shellSort( nums, n ):
cnt = 0
g = []
val =0
for i in range( 0, n ):
... | p02262 |
def insertionSort( nums, g ):
cnt = 0
i = g
n = len( nums )
while i < n:
v = nums[i]
j = i - g
while 0 <= j and v < nums[j]:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
i += 1
return cnt
def shellSort( nums, n ):
cnt = 0
g = []
val =0
for i in range( 0, n ):
... | import sys
def insertionSort( nums, n, g ):
cnt = 0
i = g
while i < n:
v = nums[i]
j = i - g
while 0 <= j and v < nums[j]:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
i += 1
return cnt
def shellSort( nums, n ):
g = []
val =0
for i in range( n ):
val = 3*val+... | p02262 |
def insertionSort( nums, n, g ):
cnt = 0
for i in range( g, n ):
v = nums[i]
j = i - g
while j >= 0 and nums[j] > v:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
return cnt
def shellSort( nums, n ):... | import sys
def insertionSort( nums, n, g ):
cnt = 0
i = g
while i < n:
v = nums[i]
j = i - g
while 0 <= j and v < nums[j]:
nums[ j+g ] = nums[j]
j -= g
cnt += 1
nums[ j+g ] = v
i += 1
return cnt
def s... | p02262 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
def generate_intervals(n):
if n > 1:
l = math.ceil(math.log(2 * n + 1, 3))
return [(3 ** i - 1) // 2 for i in range(l - 1, 0, -1)]
else:
return [1]
class Sort(object):
def __init__(self, array, num):
... | #!/usr/bin/env python3
def construct_gs(n):
gs = []
g = 1
while g <= n:
gs.append(g)
g = 3 * g + 1
return gs[::-1]
def shell_sort(xs, n):
global cnt
cnt = 0
gs = construct_gs(n)
m = len(gs)
def insertion_sort(g):
global cnt
for i i... | p02262 |
n = int(eval(input()))
A = list()
for i in range(0, n):
A.append(int(eval(input())))
G = [1]
cnt = 0
for l in range(1, 100):
h = 3 * G[l - 1] + 1
if(h > n):
m = l
break
else:
G.append(3*G[l-1] + 1)
for g in reversed(G):
for t in range(g, n):
v = A[t... | n = int(eval(input()))
A = list()
for i in range(0, n):
A.append(int(eval(input())))
G = [1] # G[0]????????¨?????????
cnt = 0
# G[i] = 3*Gi-1 + 1
for i in range(1, 100):
h = 3 * G[i - 1] + 1
if(h > n): # h???n?¶???????????????§??????
m = i
break
else:
G.append(... | p02262 |
cnt = 0
n = int(input())
A = [int(input()) for _ in range(n)]
G = [1] if n < 5 else [1, 4]
while G[-1]*3+1 <= n/5: G.append(G[-1]*3+1)
G.reverse()
def insersionSort(g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j... | cnt = 0
n = int(input())
A = [int(input()) for _ in range(n)]
G = [1] if n < 5 else [1, 4]
while G[-1]*3+1 <= n/3: G.append(G[-1]*3+1)
G.reverse()
def insersionSort(g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j... | p02262 |
N, M, K = list(map(int,input().split()))
MOD = 10**9+7
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
... | N, M, K = list(map(int,input().split()))
MOD = 10**9+7
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, m... | p03039 |
from functools import reduce
from operator import mul
MOD = 1000000007
def combination(n, r):
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1, r + 1)))
return over // under
def main():
N, M, K = [int(i) for i in ... | def mfactorial(n: int, mod: int) -> int:
cache = mfactorial.__cache if hasattr(mfactorial, '__cache') else [1, 1]
n_len = len(cache)
n_new = n - n_len + 1
if n_new > 0:
cache = cache + ([0] * n_new)
for i in range(n_len, n + 1):
cache[i] = cache[i - 1] * i % mod
mfactorial.__cache = ca... | p03039 |
def mfactorial(n: int, mod: int) -> int:
cache = mfactorial.__cache if hasattr(mfactorial, '__cache') else [1, 1]
n_len = len(cache)
n_new = n - n_len + 1
if n_new > 0:
cache = cache + ([0] * n_new)
for i in range(n_len, n + 1):
cache[i] = cache[i - 1] * i % mod
mfactorial.__cache = ca... | def mod_combination(mod: int, n: int, r: int) -> int:
a, b, c = mod_factorials(mod, [n, r, n - r])
return a * pow(b, mod - 2, mod) % mod * pow(c, mod - 2, mod) % mod
def mod_factorials(mod: int, N: [int]) -> [int]:
result = [1] * len(N)
tuples = sorted([(i, n) for i, n in enumerate(N)], key=lambda t: t... | p03039 |
N, M, K = [int(item) for item in input().split()]
MOD = 10**9 + 7
n = 5 * 10**5
fac = [1] + [0] * n
fac_inv = [1] + [0] * n
for i in range(1, n+1):
fac[i] = fac[i-1] * (i) % MOD
# Fermat's little theorem says
# a**(p-1) mod p == 1
# then, a * a**(p-2) mod p == 1
# it means a**(p-2) is i... | N, M, K = [int(item) for item in input().split()]
MOD = 10**9 + 7
n = 2 * 10**5 + 10
fac = [1] + [0] * n
fac_inv = [1] + [0] * n
for i in range(1, n+1):
fac[i] = fac[i-1] * (i) % MOD
# Fermat's little theorem says
# a**(p-1) mod p == 1
# then, a * a**(p-2) mod p == 1
# it means a**(p-2) ... | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def comb(n, k):
ret = 1
for i in range(1, k + 1):
ret = ret * (n - i + 1) % MOD
ret = ret * pow(i, MOD - 2, MOD) % MOD
return ret
ans = 0
for d in range(N):
ans += d * comb(N * M - 2, K - 2) * (N ... | N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def comb(n, k):
ret = 1
for i in range(1, k + 1):
ret = ret * (n - i + 1) % MOD
ret = ret * pow(i, MOD - 2, MOD) % MOD
return ret
ans = 0
for d in range(N):
ans += d * (N - d) * M ** 2
ans %=... | p03039 |
# -*- coding: utf-8 -*-
"""
Created on Sat May 25 21:24:29 2019
@author: Yamazaki Kenichi
"""
N, M, K = list(map(int,input().split()))
mod = 10**9+7
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1... | # -*- coding: utf-8 -*-
"""
Created on Wed May 29 22:49:19 2019
@author: Yamazaki Kenichi
"""
# -*- coding: utf-8 -*-
"""
Created on Sat May 25 21:24:29 2019
@author: Yamazaki Kenichi
"""
N, M, K = list(map(int,input().split()))
mod = 10**9+7
def cmb(n, r, mod):
if (r < 0 or r > n):
... | p03039 |
from math import factorial
n,m,K=list(map(int,input().split()))
ans=0
def comb(n,r):
return factorial(n)//factorial(n-r)//factorial(r)
for i in range(3,n+m+1):
t=0
for j in range(max(1,i-n),i):
if(j>m):
ans+=t*(i-2)
break
k=i-j
if(j==1 or k==1):
... | n,m,k=list(map(int,input().split()))
mod=10**9+7
x=1
y=1
for i in range(1,k-1):
y*=i
y%=mod
for i in range(k-2):
x*=n*m-2-i
x%=mod
x*=pow(y,mod-2,mod)
x%=mod
def f(n,m):
s=0
for i in range(1,n):
s+=i*(n-i)
s%=mod
return s*m*m%mod
print(((f(n,m)+f(m,n))*x%mod... | p03039 |
N, M, K = list(map(int, input().split()))
import math
from operator import mul
from functools import reduce
def combinations_count(n, r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
an... | N, M, K = list(map(int, input().split()))
import math
from operator import mul
from functools import reduce
def combinations_count(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r... | p03039 |
H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
Hd = sum([d * (H - d) * (W ** 2) for d in range(H)])
Wd = sum([d * (W - d) * (H ** 2) for d in range(W)])
# 階乗 & 逆元計算
factorial = [1]
inverse = [1]
for i in range(1, H * W + 2):
factorial.append(factorial[-1] * i % MOD)
inverse.append(po... | H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
factorial = [1, 1] # 元テーブル
inverse = [1, 1] # 逆元テーブル
inverse_from = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, H * W + 1):
factorial.append((factorial[-1] * i) % MOD)
inverse_from.append((-inverse_from[MOD % i] * (MOD // i)) % MOD)
inv... | p03039 |
H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
factorial = [1, 1] # 元テーブル
inverse = [1, 1] # 逆元テーブル
inverse_from = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, H * W + 1):
factorial.append((factorial[-1] * i) % MOD)
inverse_from.append((-inverse_from[MOD % i] * (MOD // i)) % MOD)
inv... | H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
factorial = [1, 1]
inverse = [1, 1]
invere_base = [0, 1]
for i in range(2, H * W + 2):
factorial.append((factorial[-1] * i) % MOD)
invere_base.append((-invere_base[MOD % i] * (MOD // i)) % MOD)
inverse.append((inverse[-1] * invere_base[-1... | p03039 |
n, m, k = list(map(int, input().split()))
MOD = 1000000007
def pow_mod(x, y):
if y == 0: return 1
ans = 1
while y > 1:
if y % 2 != 0:
ans *= x
ans %= MOD
x *= x
x %= MOD
y //= 2
return ans * x % MOD
mod_inv = lambda x: pow_mod(x, MO... | n, m, k = list(map(int, input().split()))
MOD = 1000000007
def pow_mod(x, y):
if y == 0: return 1
ans = 1
while y > 1:
if y % 2 != 0:
ans *= x
ans %= MOD
x *= x
x %= MOD
y //= 2
return ans * x % MOD
mod_inv = lambda x: pow_mod(x, MO... | p03039 |
MOD=10**9+7
UPPERLIMIT=3*10**5
MODMUL=[1, 1]+[0]*(UPPERLIMIT-1)
for i in range(2, UPPERLIMIT+1):
MODMUL[i]=MODMUL[i-1]*i%MOD
MODDIV=[1]*UPPERLIMIT+[pow(MODMUL[-1], MOD-2, MOD)]
for i in range(UPPERLIMIT, 0, -1):
MODDIV[i-1]=MODDIV[i]*i%MOD
def MODCOMB(n, r):
if n<r or n<1:
return 0
else:
ret... | MOD=10**9+7
UPPERLIMIT=3*10**5
MODMUL=[1, 1]+[0]*(UPPERLIMIT-1)
for i in range(2, UPPERLIMIT+1):
MODMUL[i]=MODMUL[i-1]*i%MOD
MODDIV=[1]*UPPERLIMIT+[pow(MODMUL[-1], MOD-2, MOD)]
for i in range(UPPERLIMIT, 0, -1):
MODDIV[i-1]=MODDIV[i]*i%MOD
def MODCOMB(n, r):
if n<r or n<1:
return 0
else:
ret... | p03039 |
import math
N, M, K = list(map(int, input().split()))
sosu = 10 ** 9 + 7
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
dis = M * M * N * N * (N+1) // 2 % sosu
dis = dis - M * M * N * (N+1) * ( 2* N + 1) // 6 % sosu
dis = dis + N * N * M * ... | import math
N, M, K = list(map(int, input().split()))
sosu = 10 ** 9 + 7
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
dis = M * M * N * N * (N+1) // 2 % sosu
dis = dis - M * M * N * (N+1) * ( 2* N + 1) // 6 % sosu
dis = dis + N * N * ... | p03039 |
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, m, k = list(map(int, input().split()))
cmb = combinations_count(n * m - 2, k - 2)
ans = 0
for i in range(1, n):
ans += i * cmb * m * m * (n - i)
ans %= 10 ** 9 + 7
for i in ran... | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, m, k = list(map(int, input().split()))
cmb = combinations_count(n * m - 2, k - 2)
cmb %= 10 ** 9 + 7
ans = 0
for i in range(1, n):
ans += i * cmb * m * m * (n - i)
ans %= 10 ** 9... | p03039 |
LARGE = 10**9 + 7
def p_inv(k, p):
return pow(k, p-2, p)
def nck_mod(n, k, m):
res = 1
for i in range(n, n-k, -1):
res = res * i % m
for i in range(1, k+1):
res = res * p_inv(i, m) % m
return res
def solve(n, m, k):
res_1 = 0
for i in range(n):
... | LARGE = 10**9 + 7
def p_inv(k, p):
return pow(k, p-2, p)
def nck_mod(n, k, m):
res = 1
for i in range(n, n-k, -1):
res = res * i % m
for i in range(1, k+1):
res = res * p_inv(i, m) % m
return res
def solve(n, m, k):
res_1 = 0
r = n * (n - 1) // 2
... | p03039 |
from math import factorial as f
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
def combi(n, r):
return f(n) // f(n - r) // f(r) % mod
res = 0
c = combi(N * M - 2, K - 2)
cn = c * M ** 2 % mod
cm = c * N ** 2 % mod
temp = ((N - 1 + 1) * (N - 1) // 2) * cn % mod
for i in range(1, N):
res +... | from math import factorial as f
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
def combi(n, r):
return f(n) // (f(n - r) * f(r)) % mod
res = 0
c = combi(N * M - 2, K - 2)
for i in range(1, N):
res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod
res %= mod
for i in range(1, M):
re... | p03039 |
from math import factorial as f
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
def combi(n, r):
return f(n) // (f(n - r) * f(r)) % mod
res = 0
c = combi(N * M - 2, K - 2)
for i in range(1, N):
res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod
res %= mod
for i in range(1, M):
re... | import sys
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
for i in range(1, n + 1):
self.f.append(self.f[-1] * i % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for i in range(1, n + 1)[: ... | p03039 |
import math
N,M,k = list(map(int,input().split()))
p = N*M
PP = 1
for i in range(p-k+1,p-1):
PP *= i
P = PP//math.factorial(k-2)
Q = N*(N-1)*(N+1)*M*M//6
R = M*(M-1)*(M+1)*N*N//6
print(((P*(Q+R))%(10**9+7))) | import math
N,M,k = list(map(int,input().split()))
p = N*M
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
... | p03039 |
from collections import deque
from heapq import heappush,heappop
import re
def int_raw():
return int(eval(input()))
def ss_raw():
return input().split()
def ints_raw():
return list(map(int, ss_raw()))
INF = 1<<29
DIV = 10**9+7
def mod_inv(a,mod = DIV):
return pow(a,mod-2,mod)
... | from collections import deque
from heapq import heappush,heappop
import re
def int_raw():
return int(eval(input()))
def ss_raw():
return input().split()
def ints_raw():
return list(map(int, ss_raw()))
INF = 1<<29
DIV = 10**9+7
def mod_inv_prime(a,mod = DIV):
return pow(a,mod-2,mo... | p03039 |
n, m, k = list(map(int, input().split()))
# 二項係数を 10^9+7 で割った余りを求める
# https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a#5-%E4%BA%8C%E9%A0%85%E4%BF%82%E6%95%B0-ncr
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
# https://www.hamayanhamayan.com/entry/2018/06/06/210256
mod = 10**9 + 7
# x ** a をmodで割... | n, m, k = list(map(int, input().split()))
# 二項係数を 10^9+7 で割った余りを求める
# https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a#5-%E4%BA%8C%E9%A0%85%E4%BF%82%E6%95%B0-ncr
# https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
# https://www.hamayanhamayan.com/entry/2018/06/06/210256
mod = 10**9 + 7
# x ** a をmodで割... | p03039 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.