node_ids listlengths 4 1.4k | edge_index listlengths 1 2.22k | text listlengths 4 1.4k | source stringlengths 14 427k |
|---|---|---|---|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
28,
13,
4,
13,
2,
13,
13,
0,
18,
13,
2,
1... | [
[
188,
2
],
[
188,
15
],
[
188,
16
],
[
188,
17
],
[
185,
19
],
[
197,
26
],
[
174,
32
],
[
171,
33
],
[
191,
36
],
[
174,
42
],
[
171,
43
],
[
47,
46
],
[
174,
50
... | [
"H, W, A, B = map(int, open(0).read().split())\nMOD = 10**9+7\n \nfactorials = [1] * (H + W + 1)\ninv_factorials = [1] * (H + W + 1)\n \nfor i in range(H + W):\n factorials[i+1] = factorials[i] * (i + 1) % MOD\n\nfor i in range(H + W):\n inv_factorials[i+1] = inv_factorials[i] * pow(i + 1, MOD - 2, MOD) % MOD... | H, W, A, B = map(int, open(0).read().split())
MOD = 10**9+7
factorials = [1] * (H + W + 1)
inv_factorials = [1] * (H + W + 1)
for i in range(H + W):
factorials[i+1] = factorials[i] * (i + 1) % MOD
for i in range(H + W):
inv_factorials[i+1] = inv_factorials[i] * pow(i + 1, MOD - 2, MOD) % MOD
def modcomb(m... |
[
7,
12,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
12,
13,
0,
... | [
[
6,
5
],
[
5,
14
],
[
17,
16
],
[
17,
18
],
[
17,
19
],
[
17,
20
],
[
23,
22
],
[
16,
25
],
[
18,
26
],
[
30,
29
],
[
37,
36
],
[
22,
40
],
[
43,
42
],
[
2... | [
"def main():\n H, W, A, B = (int(i) for i in input().split())\n m = H + W + 3\n MOD = 10**9 + 7\n fac = [0] * m\n finv = [0] * m\n inv = [0] * m\n\n def COMBinitialize(m):\n fac[0] = 1\n finv[0] = 1\n if m > 1:\n fac[1] = 1\n finv[1] = 1\n i... | def main():
H, W, A, B = (int(i) for i in input().split())
m = H + W + 3
MOD = 10**9 + 7
fac = [0] * m
finv = [0] * m
inv = [0] * m
def COMBinitialize(m):
fac[0] = 1
finv[0] = 1
if m > 1:
fac[1] = 1
finv[1] = 1
inv[1] = 1
... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
15,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
41,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
4,
13,
0,
13,
13,
28,
13,
4,
13,
17,
2,
4,
13,
13,
17,
0,
18,
13,
2,
... | [
[
205,
2
],
[
205,
11
],
[
205,
12
],
[
205,
13
],
[
181,
17
],
[
187,
20
],
[
29,
28
],
[
206,
34
],
[
203,
35
],
[
28,
38
],
[
190,
40
],
[
44,
43
],
[
191,
50
... | [
"h,w,a,b = map(int, input().split())\nimport math\nans = 0\nmod = 10**9+7\nl =[i for i in range(1,h+w+2)]\nfor i in range(1,len(l)-1):\n l[i+1] = l[i+1]*l[i]%mod\nl = [1]+ l\ngyakugen = [pow(l[i], mod-2, mod) for i in range(1, len(l))]\ngyakugen = [1] + gyakugen\nfor p in range(1, w-b+1):\n ans += l[(h-a-1+b+... | h,w,a,b = map(int, input().split())
import math
ans = 0
mod = 10**9+7
l =[i for i in range(1,h+w+2)]
for i in range(1,len(l)-1):
l[i+1] = l[i+1]*l[i]%mod
l = [1]+ l
gyakugen = [pow(l[i], mod-2, mod) for i in range(1, len(l))]
gyakugen = [1] + gyakugen
for p in range(1, w-b+1):
ans += l[(h-a-1+b+p-1)]*l[w-(b+p)+... |
[
7,
12,
13,
0,
13,
17,
42,
2,
13,
17,
14,
2,
13,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
2,
13,
13,
13,
0,
13,
17,
29,
13,
23,
13,
23,
13,
23,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
... | [
[
5,
4
],
[
36,
8
],
[
29,
8
],
[
36,
12
],
[
29,
12
],
[
16,
15
],
[
4,
18
],
[
15,
18
],
[
34,
19
],
[
22,
19
],
[
38,
20
],
[
23,
22
],
[
34,
25
],
[
22,... | [
"def modpow(a, n, mod):\n res = 1\n while n > 0:\n if (n & 1):\n res = res * a % mod\n a = a * a % mod\n n >>= 1\n return res\n\nDIV = 10**9 + 7\nh, w, a, b = map(int, input().split())\nans = 0\n#最大h+w!までの元と逆元の階乗テーブルを求めておく\n#逆元をFermatの小定理により計算\n#p-2乗は二分累乗法にて高速に計算可能\ntable = [1 for i in range(h + w ... | def modpow(a, n, mod):
res = 1
while n > 0:
if (n & 1):
res = res * a % mod
a = a * a % mod
n >>= 1
return res
DIV = 10**9 + 7
h, w, a, b = map(int, input().split())
ans = 0
#最大h+w!までの元と逆元の階乗テーブルを求めておく
#逆元をFermatの小定理により計算
#p-2乗は二分累乗法にて高速に計算可能
table = [1 for i in range(h + w + 1)]
inv_table = [1... |
[
7,
0,
13,
2,
39,
17,
2,
2,
17,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
17,
2,
2,
17,
17,
17,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
12,
13,
29,
2,
2,
... | [
[
150,
2
],
[
20,
12
],
[
151,
13
],
[
20,
17
],
[
151,
18
],
[
168,
22
],
[
30,
29
],
[
42,
39
],
[
151,
40
],
[
29,
41
],
[
151,
45
],
[
29,
47
],
[
29,
49
],
... | [
"memo=[0]*(10**6+1)\nmemo[0]=memo[1]=1\nmod=10**9+7\nfor i in range(2,10**6+1):\n memo[i]=(memo[i-1]*i)%mod\ndef comb(n,k,p):\n return (memo[n]*pow(memo[k],p-2,p)*pow(memo[n-k],p-2,p))%mod\nh,w,a,b=map(int,input().split())\nans=0\nfor i in range(h-a):\n ans+=(comb(b+i-1,i,mod)*comb(h-i-1+w-b-1,w-b-1,mod))%mod\n ... | memo=[0]*(10**6+1)
memo[0]=memo[1]=1
mod=10**9+7
for i in range(2,10**6+1):
memo[i]=(memo[i-1]*i)%mod
def comb(n,k,p):
return (memo[n]*pow(memo[k],p-2,p)*pow(memo[n-k],p-2,p))%mod
h,w,a,b=map(int,input().split())
ans=0
for i in range(h-a):
ans+=(comb(b+i-1,i,mod)*comb(h-i-1+w-b-1,w-b-1,mod))%mod
ans%=mod
print(... |
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
17,
4,
18,
13,
13,
2,
17,
17,
12,
13,
0,
13,
17,
0,
13,
4,
13,
2,
13,
13,
13,
28,
13,
4,
13,
13,
0,
13,
2,
13,
13,
0,
13,
13,
0,
... | [
[
209,
4
],
[
206,
11
],
[
215,
18
],
[
33,
32
],
[
36,
35
],
[
69,
39
],
[
71,
40
],
[
71,
41
],
[
44,
43
],
[
35,
46
],
[
71,
46
],
[
49,
48
],
[
69,
50
],
[
... | [
"import sys\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\ndef comb_mod(n, r):\n res = 1\n r = min(n - r, r)\n\n for i in range(r):\n res *= (n - i)\n res %= MOD\n res *= pow((r - i), MOD - 2, MOD)\n\n return res\n\n\ndef... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def comb_mod(n, r):
res = 1
r = min(n - r, r)
for i in range(r):
res *= (n - i)
res %= MOD
res *= pow((r - i), MOD - 2, MOD)
return res
def main():
h, w, a, b =... |
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
18,
18,
13,
13,
13,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
6,
13,
12,
13,
17,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
39,
17,
17,
0,
18,
13,
13,
... | [
[
365,
11
],
[
353,
18
],
[
362,
23
],
[
38,
35
],
[
66,
36
],
[
68,
37
],
[
68,
38
],
[
43,
40
],
[
66,
41
],
[
70,
42
],
[
70,
43
],
[
48,
45
],
[
66,
46
],
[... | [
"import sys\n\nsys.setrecursionlimit(10 ** 7)\ninput = sys.stdin.readline\nf_inf = float('inf')\nmod = 10 ** 9 + 7\n\nclass CmbMod:\n def __init__(self, n, p):\n \"\"\"\n 二項係数nCr(n個の区別できるものからr個のものを選ぶ組み合わせの数)をpで割った余りを求める\n \"\"\"\n self.n = n\n self.p = p\n self.fact = [1... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
class CmbMod:
def __init__(self, n, p):
"""
二項係数nCr(n個の区別できるものからr個のものを選ぶ組み合わせの数)をpで割った余りを求める
"""
self.n = n
self.p = p
self.fact = [1, 1]
self.factinv... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
12,
13,
14,
2,
2,
13,
17,
2,
13,
13,
29,
17,
0,
13,
4,
13,
13,
2,
13,
13,
29,
2,
2,
2,
18,
13,
13,
18,
13,
13,
18,
13,
2,
13,
13,
13,
23,
13,
23,
13,
23,
1... | [
[
270,
2
],
[
270,
11
],
[
270,
12
],
[
270,
13
],
[
53,
19
],
[
53,
22
],
[
51,
23
],
[
28,
27
],
[
53,
30
],
[
51,
32
],
[
53,
33
],
[
51,
40
],
[
27,
43
],
[... | [
"H,W,A,B = map(int, input().split())\n\ndef cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[n] * g2[r] * g2[n-r] % mod\n\nmod = 10**9+7 #出力の制限\nn = 3*10**5\ng1 = [1, 1] # 元テーブル\ng2 = [1, 1] #逆元テーブル\ninverse = [0, 1] #逆元テーブル計算用テーブル\n\nfor i in range( 2, n + 1 ):\n g1.... | H,W,A,B = map(int, input().split())
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
mod = 10**9+7 #出力の制限
n = 3*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i... |
[
7,
12,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
13,
17,
13,
2,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
... | [
[
5,
4
],
[
5,
13
],
[
5,
14
],
[
5,
15
],
[
18,
17
],
[
4,
19
],
[
22,
21
],
[
13,
23
],
[
27,
26
],
[
34,
33
],
[
17,
36
],
[
4,
36
],
[
21,
37
],
[
13,
... | [
"def main():\n\tH, W, A, B = map(int, input().split())\n\tH, W= H-1, W-1\n\tDIV = 10**9+7\n\tsize = H+W+1\n\n\tfact = [0]*size\n\tinverse = [0]*size\n\tinv_cal = [0]*size\n\tfact[:2] = [1, 1]\n\tinverse[:2] = [1, 1]\n\tinv_cal[:2] = [0, 1]\n\n\tfor i in range(2, size):\n\t\tfact[i] = (fact[i-1]*i%DIV)\n\t\tinv_cal[... | def main():
H, W, A, B = map(int, input().split())
H, W= H-1, W-1
DIV = 10**9+7
size = H+W+1
fact = [0]*size
inverse = [0]*size
inv_cal = [0]*size
fact[:2] = [1, 1]
inverse[:2] = [1, 1]
inv_cal[:2] = [0, 1]
for i in range(2, size):
fact[i] = (fact[i-1]*i%DIV)
inv_cal[i] = (-inv_cal[DIV%i]*(DIV//i))%DIV... |
[
7,
12,
13,
14,
2,
2,
13,
17,
2,
13,
13,
29,
17,
0,
13,
4,
13,
13,
2,
13,
13,
29,
2,
2,
2,
18,
13,
13,
18,
13,
13,
18,
13,
2,
13,
13,
13,
23,
13,
23,
13,
23,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
2,
17,
17,... | [
[
40,
6
],
[
40,
9
],
[
38,
10
],
[
15,
14
],
[
40,
17
],
[
38,
19
],
[
40,
20
],
[
38,
27
],
[
14,
30
],
[
40,
30
],
[
38,
34
],
[
14,
35
],
[
40,
35
],
[
... | [
"def cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[n] * g2[r] * g2[n-r] % mod\n\nmod = 10**9+7 #出力の制限\nN = 10**6+3\ng1 = [1, 1] # 元テーブル\ng2 = [1, 1] #逆元テーブル\ninverse = [0, 1] #逆元テーブル計算用テーブル\n\nfor i in range( 2, N + 1 ):\n g1.append( ( g1[-1] * i ) % mod )\n inv... | 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
mod = 10**9+7 #出力の制限
N = 10**6+3
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inv... |
[
7,
15,
0,
13,
18,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
18,
13,
17,
17,
18,
13,
17,
17,
0,
18,
13,
17,
17,
18,
13,
17,
17,
0,
18,
13,
17,
17,
28,
13,
4,
13,
17,
13,
0,
18,
13,
13,
2,
2,
18,
... | [
[
271,
3
],
[
292,
8
],
[
289,
11
],
[
23,
20
],
[
27,
24
],
[
32,
29
],
[
36,
33
],
[
41,
38
],
[
44,
43
],
[
293,
47
],
[
52,
49
],
[
43,
51
],
[
43,
57
],
[
... | [
"from sys import stdin\ninput = stdin.readline\n\nMAX = 510000\nMOD = 10**9 + 7\n\ndef MakeTable():\n fac[0], fac[1] = 1, 1\n finv[0], finv[1] = 1, 1\n inv[1] = 1\n for i in range(2, MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD\n finv[i] = fin... | from sys import stdin
input = stdin.readline
MAX = 510000
MOD = 10**9 + 7
def MakeTable():
fac[0], fac[1] = 1, 1
finv[0], finv[1] = 1, 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] ... |
[
7,
0,
13,
2,
2,
17,
17,
17,
12,
13,
41,
0,
13,
2,
39,
17,
2,
13,
17,
0,
18,
13,
17,
17,
28,
13,
4,
13,
13,
0,
18,
13,
2,
13,
17,
2,
2,
18,
13,
13,
2,
13,
17,
13,
0,
13,
2,
39,
17,
2,
13,
17,
0,
18,
13,
13,
... | [
[
276,
2
],
[
13,
12
],
[
90,
17
],
[
23,
20
],
[
12,
21
],
[
26,
25
],
[
90,
28
],
[
35,
30
],
[
12,
31
],
[
25,
33
],
[
12,
38
],
[
25,
39
],
[
25,
41
],
[
... | [
"MOD = 10 ** 9 + 7\n\n\ndef prepare(n):\n global MOD\n modFacts = [0] * (n + 1)\n modFacts[0] = 1\n for i in range(n):\n modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD\n\n invs = [1] * (n + 1)\n invs[n] = pow(modFacts[n], MOD - 2, MOD)\n for i in range(n, 1, -1):\n invs[i - 1] = ... | MOD = 10 ** 9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs[i] * i) % MO... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
39,
17,
28,
13,
4,
13,
17,
2,
13,
13,
4,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
12,
13,
14,
2,
13,
17,
29,
17,
14,
2,
13... | [
[
243,
2
],
[
243,
11
],
[
243,
12
],
[
243,
13
],
[
249,
15
],
[
237,
18
],
[
225,
21
],
[
26,
25
],
[
244,
30
],
[
220,
31
],
[
226,
34
],
[
226,
39
],
[
25,
41
... | [
"H, W, A, B = map(int, input().split())\nanswer = 0\nmod = 1000000007\nfactorial = [1]\nfor n in range(1, H+W):\n factorial.append(factorial[n-1]*n%mod)\ndef power(x, y):\n if y == 0:\n return 1\n elif y == 1:\n return x % mod\n elif y % 2 == 0:\n return power(x, y//2) ** 2 % mod\n ... | H, W, A, B = map(int, input().split())
answer = 0
mod = 1000000007
factorial = [1]
for n in range(1, H+W):
factorial.append(factorial[n-1]*n%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
else:
a... |
[
7,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
0,
13,
13,
0,
13,
13,
0,
18,
13,
13,
13,
0,
13,
2,
... | [
[
240,
2
],
[
240,
13
],
[
240,
14
],
[
240,
15
],
[
231,
17
],
[
192,
20
],
[
196,
26
],
[
211,
27
],
[
228,
30
],
[
34,
33
],
[
196,
39
],
[
211,
40
],
[
216,
43
... | [
"H, W, A, B = list(map(int, input().split()))\np = 1000000007\n\nfac = [1] * (H + W + 1)\nx = 1\nfor i in range(1, H + W + 1):\n x *= i\n x %= p\n fac[i] = x\n\nifac = [1] * (H + W + 1)\nx = fac[H + W]\nq = p - 2\n\nwhile q > 0:\n if q & 1:\n ifac[H + W] *= x % p\n x *= x % p\n q >>= 1\n\nf... | H, W, A, B = list(map(int, input().split()))
p = 1000000007
fac = [1] * (H + W + 1)
x = 1
for i in range(1, H + W + 1):
x *= i
x %= p
fac[i] = x
ifac = [1] * (H + W + 1)
x = fac[H + W]
q = p - 2
while q > 0:
if q & 1:
ifac[H + W] *= x % p
x *= x % p
q >>= 1
for i in range(H + W - 1, ... |
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
12,
13,
14,
2,
2,
2,
13,
17,
2,
... | [
[
223,
4
],
[
217,
11
],
[
211,
18
],
[
226,
25
],
[
232,
32
],
[
220,
37
],
[
208,
42
],
[
79,
52
],
[
81,
55
],
[
81,
58
],
[
79,
59
],
[
233,
67
],
[
79,
68
],... | [
"import sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nMOD = 10**9+7\nfac = [1, 1]\nf_inv = [1, 1]\ninv = [0, 1]\n\ndef modcmb(n, r, mod):\n if n < 0 or r < 0 or r > n:\n return 0\n\n return fac[n] * f_inv[r] * f_inv[n-r] % mod\n\n\ndef main():\n H,W,A,... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
MOD = 10**9+7
fac = [1, 1]
f_inv = [1, 1]
inv = [0, 1]
def modcmb(n, r, mod):
if n < 0 or r < 0 or r > n:
return 0
return fac[n] * f_inv[r] * f_inv[n-r] % mod
def main():
H,W,A,B = map(int, readline()... |
[
7,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
13,
17,
42,
2,
13,
17,
14,
2,
2,
13,
17,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
... | [
[
4,
3
],
[
3,
12
],
[
315,
14
],
[
315,
16
],
[
315,
17
],
[
315,
18
],
[
318,
20
],
[
30,
29
],
[
70,
33
],
[
61,
33
],
[
49,
33
],
[
70,
38
],
[
61,
38
],
[
... | [
"iH,iW,iA,iB = [int(x) for x in input().split()]\niD = 10**9+7 #法\n\n#初等整数論勉強して解説通りキッチリ実装したった\n\n#二分累乗法 iDを法として\ndef fBiPow(iX,iN,iD):\n iY = 1\n while iN > 0:\n if iN % 2 == 0:\n iX = iX * iX % iD\n iN = iN // 2\n else:\n iY = iX * iY % iD\n iN = iN -... | iH,iW,iA,iB = [int(x) for x in input().split()]
iD = 10**9+7 #法
#初等整数論勉強して解説通りキッチリ実装したった
#二分累乗法 iDを法として
def fBiPow(iX,iN,iD):
iY = 1
while iN > 0:
if iN % 2 == 0:
iX = iX * iX % iD
iN = iN // 2
else:
iY = iX * iY % iD
iN = iN - 1
return iY
#... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
17,
28,
13,
4,
13,
2,
13,
13,
4,
18,
13,
13,
2,
2,
18,
13,
13,
2,
13,
17,
13,
12,
13,
29,
2,
2,
2,
18,
13,
13,
4,
13,
... | [
[
146,
2
],
[
146,
11
],
[
146,
12
],
[
146,
13
],
[
137,
15
],
[
140,
22
],
[
27,
26
],
[
147,
30
],
[
135,
31
],
[
141,
34
],
[
141,
39
],
[
26,
40
],
[
26,
42
... | [
"H,W,A,B = map(int,input().split())\n\nmod = 10**9 + 7\n\nf = [1]\nfor i in range(H+W):\n f.append(f[i]*(i+1)%mod)\n\ndef comb(A,B,mod):\n return f[A] * pow(f[B],mod-2,mod) * pow(f[A-B],mod-2,mod) % mod\n\nres = 0\n\nfor i in range(B,W):\n res += comb(H-A+i-1,i,mod) * comb(A+W-i-2,A-1,mod) % mod\n\nprint(r... | H,W,A,B = map(int,input().split())
mod = 10**9 + 7
f = [1]
for i in range(H+W):
f.append(f[i]*(i+1)%mod)
def comb(A,B,mod):
return f[A] * pow(f[B],mod-2,mod) * pow(f[A-B],mod-2,mod) % mod
res = 0
for i in range(B,W):
res += comb(H-A+i-1,i,mod) * comb(A+W-i-2,A-1,mod) % mod
print(res%mod) |
[
7,
0,
13,
2,
17,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
13,
17,
0,
13,
2,
39,
17,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
0,
18,
13,
13,
... | [
[
210,
2
],
[
192,
9
],
[
207,
16
],
[
211,
21
],
[
198,
24
],
[
211,
29
],
[
33,
32
],
[
211,
37
],
[
43,
40
],
[
208,
41
],
[
32,
42
],
[
208,
46
],
[
32,
48
],... | [
"U = 2*10**6\nMOD = 10**9+7\n \nfact = [1]*(U+1)\nfact_inv = [1]*(U+1)\n \nfor i in range(1,U+1):\n fact[i] = (fact[i-1]*i)%MOD\nfact_inv[U] = pow(fact[U],MOD-2,MOD)\n \nfor i in range(U,0,-1):\n fact_inv[i-1] = (fact_inv[i]*i)%MOD\n \ndef comb(n,k):\n if k < 0 or k > n:\n return 0\n z = fact[n]\n z *= fact... | U = 2*10**6
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U],MOD-2,MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n,k):
if k < 0 or k > n:
return 0
z = fact[n]
z *= fact_inv[k]
z %= MOD
z... |
[
7,
15,
15,
13,
0,
13,
39,
0,
13,
39,
0,
13,
2,
2,
17,
17,
17,
12,
13,
29,
18,
13,
13,
23,
13,
12,
13,
29,
18,
13,
13,
23,
13,
12,
13,
29,
2,
2,
4,
13,
13,
4,
13,
2,
13,
13,
4,
13,
13,
23,
13,
23,
13,
12,
13,
... | [
[
236,
5
],
[
239,
8
],
[
245,
11
],
[
237,
21
],
[
24,
22
],
[
24,
24
],
[
240,
29
],
[
32,
30
],
[
32,
32
],
[
255,
39
],
[
50,
40
],
[
252,
42
],
[
50,
44
],
... | [
"from functools import reduce\nimport math\n\nmemo = []\nmemo_inv = []\nMOD = 10**9+7\n \ndef get_factorial(i):\n return memo[i]\n\ndef get_factorial_inv(i):\n return memo_inv[i]\n\ndef nCr(n, r):\n return get_factorial(n) * get_factorial_inv(n-r) * get_factorial_inv(r)\n\ndef main():\n # 一文字のみを読み込み\... | from functools import reduce
import math
memo = []
memo_inv = []
MOD = 10**9+7
def get_factorial(i):
return memo[i]
def get_factorial_inv(i):
return memo_inv[i]
def nCr(n, r):
return get_factorial(n) * get_factorial_inv(n-r) * get_factorial_inv(r)
def main():
# 一文字のみを読み込み
# s = input().rstr... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
12,
13,
0,
13,
17,
42,
2,
13,
17,
14,
40,
2,
13,
17,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
2,
13,
13,
13,
0,
13,
17,
29,
13,
23,
13,
23,
13,
23... | [
[
205,
2
],
[
205,
11
],
[
205,
12
],
[
205,
13
],
[
208,
15
],
[
21,
20
],
[
54,
24
],
[
47,
24
],
[
54,
29
],
[
47,
29
],
[
34,
33
],
[
20,
36
],
[
33,
36
],
... | [
"h, w, a, b = map(int, input().split())\n\nMOD = 1000000007\n\n\ndef modPow(a, x, p):\n res = 1\n while (x > 0):\n if (x % 2 != 0):\n res = (res * a) % p\n a = (a * a) % p\n x /= 2\n return res\n\n\nfact = [None] * 220000\n\nfor i in range(1, 220000):\n fact[0] = 1\n f... | h, w, a, b = map(int, input().split())
MOD = 1000000007
def modPow(a, x, p):
res = 1
while (x > 0):
if (x % 2 != 0):
res = (res * a) % p
a = (a * a) % p
x /= 2
return res
fact = [None] * 220000
for i in range(1, 220000):
fact[0] = 1
fact[i] = i * fact[i - 1]... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
17,
2,
39,
17,
13,
0,
13,
2,
39,
17,
17,
2,
39,
17,
13,
0,
13,
2,
39,
17,
17,
2,
39,
... | [
[
234,
2
],
[
234,
11
],
[
234,
12
],
[
234,
13
],
[
228,
15
],
[
214,
18
],
[
223,
19
],
[
216,
22
],
[
201,
29
],
[
229,
37
],
[
231,
39
],
[
229,
47
],
[
219,
49... | [
"H,W,A,B = map(int,input().split())\n\nN = H+W+10\nMOD = 10**9+7\n\nfac = [1,1] + [0]*N\nfinv = [1,1] + [0]*N\ninv = [0,1] + [0]*N\nfor i in range(2,N+2):\n fac[i] = fac[i-1] * i % MOD\n inv[i] = -inv[MOD%i] * (MOD // i) % MOD\n finv[i] = finv[i-1] * inv[i] % MOD\n\ndef ncr(n,r):\n if n < r: return 0\n ... | H,W,A,B = map(int,input().split())
N = H+W+10
MOD = 10**9+7
fac = [1,1] + [0]*N
finv = [1,1] + [0]*N
inv = [0,1] + [0]*N
for i in range(2,N+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def ncr(n,r):
if n < r: return 0
if n < 0 or r < 0... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
17,
2,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
12,
13,
41,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,... | [
[
262,
2
],
[
229,
9
],
[
244,
16
],
[
230,
20
],
[
253,
22
],
[
230,
26
],
[
250,
28
],
[
230,
32
],
[
45,
37
],
[
45,
42
],
[
55,
47
],
[
55,
52
],
[
60,
57
],
... | [
"MOD = 10**9 + 7\nMAX = 2*10**5\nfac = [0]*MAX # fac[n]: (n!) mod p\nfinv = [0]*MAX # finv[n]: (n!)^-1 mod p\ninv = [0]*MAX # inv[n]: (n)^-1 mod -p\n\n\ndef comb_init():\n global fac, finv, inv\n fac[0] = fac[1] = 1\n finv[0] = finv[1] = 1\n inv[1] = 1\n for i in range(2, MAX):\n fac[i] =... | MOD = 10**9 + 7
MAX = 2*10**5
fac = [0]*MAX # fac[n]: (n!) mod p
finv = [0]*MAX # finv[n]: (n!)^-1 mod p
inv = [0]*MAX # inv[n]: (n)^-1 mod -p
def comb_init():
global fac, finv, inv
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i-1] * i % MO... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
15,
13,
12,
13,
29,
2,
2,
2,
18,
13,
2,
13,
13,
18,
13,
13,
18,
13,
13,
13,
23,
13,
23,
13,
0,
13,
4,
4,
13,
0,
13,
17,
13,
0,
13,... | [
[
163,
2
],
[
163,
11
],
[
163,
12
],
[
163,
13
],
[
148,
15
],
[
140,
24
],
[
47,
24
],
[
42,
32
],
[
44,
33
],
[
42,
36
],
[
44,
39
],
[
149,
40
],
[
42,
42
],
... | [
"H, W, A, B = map(int, input().split())\n\nm = 10**9 + 7\n\nimport functools\n@functools.lru_cache(maxsize=None)\ndef cr(c, r):\n return fc[c + r] * ic[c] * ic[r] % m\n\nfc = [1] * (H + W)\nfor i in range(2, H+W):\n fc[i] = fc[i - 1] * i % m\nic = [pow(x, m-2, m) for x in fc]\n\nans = 0\nfor c in range(B, W):... | H, W, A, B = map(int, input().split())
m = 10**9 + 7
import functools
@functools.lru_cache(maxsize=None)
def cr(c, r):
return fc[c + r] * ic[c] * ic[r] % m
fc = [1] * (H + W)
for i in range(2, H+W):
fc[i] = fc[i - 1] * i % m
ic = [pow(x, m-2, m) for x in fc]
ans = 0
for c in range(B, W):
ans += cr(c, H ... |
[
7,
6,
13,
17,
12,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
4,
18,
13,
13,
13,
18,
13,
13,
23,
13,
23,
13,
23,
13,
2,
2,
17,
17,
17,
12,
13,
14,
2,
2,
13,
17,
2,
13,
13,
29,
17,
0,
13,
2,
2,
18,
18,
13,
13,
13,
... | [
[
10,
7
],
[
24,
8
],
[
28,
9
],
[
28,
10
],
[
15,
12
],
[
24,
13
],
[
24,
17
],
[
26,
19
],
[
15,
20
],
[
24,
21
],
[
24,
24
],
[
26,
26
],
[
29,
28
],
[
8... | [
"class Combination:\n \"\"\"\n SIZEが10^6程度以下の二項係数を何回も呼び出したいときに使う\n 使い方:\n comb = Combination(SIZE, MOD)\n comb(10, 3) => 120\n \"\"\"\n\n def __init__(self, N, MOD=10 ** 9 + 7):\n self.MOD = MOD\n self.fact, self.inv = self._make_factorial_list(N)\n\n def __call__(self, n, k):\... | class Combination:
"""
SIZEが10^6程度以下の二項係数を何回も呼び出したいときに使う
使い方:
comb = Combination(SIZE, MOD)
comb(10, 3) => 120
"""
def __init__(self, N, MOD=10 ** 9 + 7):
self.MOD = MOD
self.fact, self.inv = self._make_factorial_list(N)
def __call__(self, n, k):
if k < 0 or k >... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,... | [
[
211,
2
],
[
211,
11
],
[
211,
12
],
[
211,
13
],
[
202,
15
],
[
214,
18
],
[
208,
21
],
[
203,
25
],
[
220,
27
],
[
203,
31
],
[
217,
33
],
[
203,
37
],
[
42,
39
... | [
"H, W, A, B = map(int, input().split())\nMAX = 200000\nMOD = 1000000007\nfac = [0]*MAX\nfinv = [0]*MAX\ninv = [0]*MAX\nfac[0] = 1\nfac[1] = 1\nfinv[0] = 1\nfinv[1] = 1\ninv[1] = 1\nfor i in range(2, MAX):\n fac[i] = fac[i-1]*i%MOD\n inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD\n finv[i] = finv[i-1]*inv[i]%MOD \n# sum... | H, W, A, B = map(int, input().split())
MAX = 200000
MOD = 1000000007
fac = [0]*MAX
finv = [0]*MAX
inv = [0]*MAX
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
# sum_{i=B}^{W-1} C_{H-A-... |
[
7,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
13,
17,
42,
2,
13,
17,
14,
2,
13,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
2,
13,
17,
13,
0,
13,
17,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
29,
2,
2,
13,
13,
13,
23,
13... | [
[
252,
2
],
[
12,
11
],
[
43,
15
],
[
36,
15
],
[
43,
19
],
[
36,
19
],
[
23,
22
],
[
11,
25
],
[
22,
25
],
[
41,
26
],
[
29,
26
],
[
45,
27
],
[
30,
29
],
[
... | [
"MOD = 10**9+7\n\ndef modpow(base, pow, mod):\n res = 1\n while pow > 0:\n if pow & 1:\n res = res * base % mod\n base = base**2 % mod\n pow >>= 1\n return res\n\ndef modmul(a, b, mod):\n return a*b % mod\n\ndef solve(h,w,a,b):\n fact = [0]*(h+w+1)\n fact[0] = 1\n fact_inv = [0]*(h+w+1)\n fact... | MOD = 10**9+7
def modpow(base, pow, mod):
res = 1
while pow > 0:
if pow & 1:
res = res * base % mod
base = base**2 % mod
pow >>= 1
return res
def modmul(a, b, mod):
return a*b % mod
def solve(h,w,a,b):
fact = [0]*(h+w+1)
fact[0] = 1
fact_inv = [0]*(h+w+1)
fact_inv[0] = 1
for i in ... |
[
7,
15,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
39,
17,
13,
13,
2,
39,
17,
13,
28,
13,
4,
13,
17,
13,
0,
18,
13,
13,
2,
2,
13,
18,
13,
2,
13,
... | [
[
170,
4
],
[
185,
11
],
[
185,
20
],
[
185,
21
],
[
185,
22
],
[
182,
24
],
[
177,
26
],
[
168,
27
],
[
173,
29
],
[
183,
33
],
[
161,
34
],
[
183,
38
],
[
41,
40
... | [
"import math\nMOD = 10 ** 9 + 7\nH, W, A, B = map(int, input().split())\nmaxf = H + W\n\nf, invf = [1] * maxf, [1] * maxf\n\nfor i in range(1, maxf):\n f[i] = i * f[i - 1] % MOD\ninvf[maxf - 1] = pow(f[maxf - 1], MOD - 2, MOD)\nfor i in range(maxf - 1, 0, -1):\n invf[i - 1] = invf[i] * i % MOD\n\ncomb = lambd... | import math
MOD = 10 ** 9 + 7
H, W, A, B = map(int, input().split())
maxf = H + W
f, invf = [1] * maxf, [1] * maxf
for i in range(1, maxf):
f[i] = i * f[i - 1] % MOD
invf[maxf - 1] = pow(f[maxf - 1], MOD - 2, MOD)
for i in range(maxf - 1, 0, -1):
invf[i - 1] = invf[i] * i % MOD
comb = lambda a, b: f[a + b] *... |
[
7,
6,
13,
12,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
13,
0,
13,
13,
4,
18,
18,
13,
13,
13,
13,
0,
13,
4,
13,
13,
2,
13,
17,
13,
41,
28,
13,
4,
13,
2,
1... | [
[
9,
6
],
[
96,
7
],
[
100,
8
],
[
100,
9
],
[
14,
11
],
[
96,
12
],
[
18,
17
],
[
21,
20
],
[
98,
25
],
[
29,
28
],
[
20,
29
],
[
32,
31
],
[
100,
32
],
[
... | [
"class Factorials:\n # nに十分大きい数を入力\n def __init__(self, n, mod):\n self.mod = mod\n\n # self.fac[i] ≡ i! (factorial:階乗)\n self.fac = [1]\n num = 1\n for i in range(1, n+1):\n num *= i\n num %= mod\n self.fac.append(num)\n\n # self.rec[... | class Factorials:
# nに十分大きい数を入力
def __init__(self, n, mod):
self.mod = mod
# self.fac[i] ≡ i! (factorial:階乗)
self.fac = [1]
num = 1
for i in range(1, n+1):
num *= i
num %= mod
self.fac.append(num)
# self.rec[i] ≡ 1 / i! (recip... |
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
12,
13,
12,
13,
12,
13,
12,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
13,
13,
0,
13,
2,
13,
13,
12,
13,
14,
2,
2,
13,
17,
2,
13,
13,
29,
17,
0,
13,
4,
13,
13,
2,
1... | [
[
225,
4
],
[
20,
19
],
[
27,
26
],
[
214,
28
],
[
27,
29
],
[
27,
30
],
[
27,
31
],
[
34,
33
],
[
26,
35
],
[
29,
36
],
[
76,
42
],
[
74,
45
],
[
76,
46
],
[
... | [
"import sys\ninput = sys.stdin.readline\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n H,W,A,B=MI()\n\n \n N=H+W\n \n def cmb(n, r, mod):\n if (r < 0) or (n < r):\n retur... | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
H,W,A,B=MI()
N=H+W
def cmb(n, r, mod):
if (r < 0) or (n < r):
return 0
r = min(r... |
[
7,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
14,
2,
13,
17,
14,
2,
2,
13,
17,
17,
0,
13,
4,
13,
13,
2,
13,
17,
13,
29,
2,
2,
13,
13,
13,
14,
2,
2,
13,
17,
17,
29,
2,
2,
13,
4,
13,
13,
2,
13,
17,
13,
13,
... | [
[
277,
2
],
[
268,
5
],
[
59,
15
],
[
59,
20
],
[
25,
24
],
[
57,
27
],
[
59,
29
],
[
61,
31
],
[
24,
35
],
[
24,
36
],
[
61,
37
],
[
59,
41
],
[
57,
47
],
[
... | [
"n=200000\nmod=10**9+7\ndef pf(x,y,p):\n if y==0: return 1\n if y%2==0:\n d=pf(x,y//2,p)\n return d*d%p\n if y%2==1:\n return (x*pf(x,y-1,p))%p\nfacl=[1]\nfor i in range(1,n+2):\n facl.append(facl[i-1]*i%mod)\ninvl=[1]*(n+2)\nfor i in range(1,n+2):\n invl[i]=pf(facl[i],mod-2,mod)\ndef comb(x,k):\n if... | n=200000
mod=10**9+7
def pf(x,y,p):
if y==0: return 1
if y%2==0:
d=pf(x,y//2,p)
return d*d%p
if y%2==1:
return (x*pf(x,y-1,p))%p
facl=[1]
for i in range(1,n+2):
facl.append(facl[i-1]*i%mod)
invl=[1]*(n+2)
for i in range(1,n+2):
invl[i]=pf(facl[i],mod-2,mod)
def comb(x,k):
if x<0 or k<0 or x<k: r... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
0,
... | [
[
231,
2
],
[
231,
11
],
[
231,
12
],
[
231,
13
],
[
225,
15
],
[
223,
17
],
[
232,
18
],
[
228,
20
],
[
213,
27
],
[
226,
32
],
[
36,
35
],
[
226,
40
],
[
46,
43
... | [
"h,w,a,b = map(int,input().split())\nn = h+w\nmod = 10**9+7\nfun = [1]*(n+1)\nfor i in range(1,n+1):\n fun[i] = fun[i-1]*i%mod\nrev = [1]*(n+1)\nrev[n] = pow(fun[n],mod-2,mod)\nfor i in range(n-1,0,-1):\n rev[i] = rev[i+1]*(i+1)%mod\ndef nCr(n,r):\n if r > n:\n return 0\n return fun[n]*rev[r]%mod... | h,w,a,b = map(int,input().split())
n = h+w
mod = 10**9+7
fun = [1]*(n+1)
for i in range(1,n+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n+1)
rev[n] = pow(fun[n],mod-2,mod)
for i in range(n-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def nCr(n,r):
if r > n:
return 0
return fun[n]*rev[r]%mod*rev[n-r]%mod
ans ... |
[
7,
0,
13,
4,
18,
4,
13,
13,
17,
0,
13,
4,
13,
18,
13,
17,
0,
13,
4,
13,
18,
13,
17,
0,
13,
4,
13,
18,
13,
17,
0,
13,
4,
13,
18,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
17,
0,
13,
39,
17,
28,
13,
4,
13,
... | [
[
164,
2
],
[
167,
10
],
[
165,
14
],
[
158,
17
],
[
165,
21
],
[
173,
24
],
[
165,
28
],
[
179,
31
],
[
165,
35
],
[
170,
38
],
[
152,
45
],
[
161,
49
],
[
54,
53
... | [
"inp=input().split(\" \")\nH=int(inp[0])\nW=int(inp[1])\nA=int(inp[2])\nB=int(inp[3])\nmod=10**9+7\nfact=[1]\nfact_r=[1]\nfor i in range(1,H+W-1):\n fact.append(i*fact[i-1]%mod)\n fact_r.append(pow(fact[i],10**9+5,mod))\nconst=fact_r[H-A-1]*fact_r[A-1]%mod\nans=sum(fact[H+i-A-1]*fact_r[i]*fact_r[W-i-1]*fact[W... | inp=input().split(" ")
H=int(inp[0])
W=int(inp[1])
A=int(inp[2])
B=int(inp[3])
mod=10**9+7
fact=[1]
fact_r=[1]
for i in range(1,H+W-1):
fact.append(i*fact[i-1]%mod)
fact_r.append(pow(fact[i],10**9+5,mod))
const=fact_r[H-A-1]*fact_r[A-1]%mod
ans=sum(fact[H+i-A-1]*fact_r[i]*fact_r[W-i-1]*fact[W-i-2+A]%mod for i i... |
[
7,
15,
13,
15,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
28,
13,
4,
13,
17,
17,
4,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
4,
18,
13,
13,
2,
13,
2,
2,
18,
13,
2,... | [
[
379,
5
],
[
388,
12
],
[
385,
17
],
[
397,
22
],
[
28,
27
],
[
389,
34
],
[
389,
39
],
[
27,
41
],
[
27,
43
],
[
380,
44
],
[
398,
47
],
[
380,
50
],
[
398,
54
... | [
"import operator as op\nfrom functools import reduce\n\nMOD = (10 ** 9) + 7\n\nfactors = [1, 1]\nfinv = [1, 1]\ninv = [0, 1]\n\nfor i in range(2, 200010):\n factors.append(factors[i - 1] * i % MOD)\n inv.append(MOD - inv[MOD % i] * (MOD // i) % MOD)\n finv.append(finv[i - 1] * inv[i] % MOD)\n\ndef nck(n, k... | import operator as op
from functools import reduce
MOD = (10 ** 9) + 7
factors = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, 200010):
factors.append(factors[i - 1] * i % MOD)
inv.append(MOD - inv[MOD % i] * (MOD // i) % MOD)
finv.append(finv[i - 1] * inv[i] % MOD)
def nck(n, k):
if n < k or ... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
2,
13,
13,
17,
12,
13,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
2,
2,
4,
13,
13,
2,
13,
17,
17,
13,
14,
2,
13,
... | [
[
279,
2
],
[
279,
11
],
[
279,
12
],
[
279,
13
],
[
246,
15
],
[
282,
22
],
[
256,
25
],
[
277,
26
],
[
77,
32
],
[
77,
39
],
[
75,
47
],
[
77,
49
],
[
247,
52
]... | [
"H,W,A,B = map(int, input().split())\nMOD = 10 ** 9 + 7\n\nN = H+W+1\n\ndef power(base, num):\n if num == 0:\n return 1\n elif num % 2==0:\n return power(base, num//2) **2 % MOD\n elif num==1:\n return base % MOD\n else:\n return power(base, num//2) **2 * base % MOD\n\nfact =... | H,W,A,B = map(int, input().split())
MOD = 10 ** 9 + 7
N = H+W+1
def power(base, num):
if num == 0:
return 1
elif num % 2==0:
return power(base, num//2) **2 % MOD
elif num==1:
return base % MOD
else:
return power(base, num//2) **2 * base % MOD
fact = [0 for i in range(N... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
0,
18,
13,
13,
2,
2,
13,
18,
13,
2,
13,
17,
13,
... | [
[
198,
2
],
[
210,
9
],
[
210,
20
],
[
210,
21
],
[
210,
22
],
[
207,
24
],
[
187,
30
],
[
202,
31
],
[
35,
34
],
[
187,
40
],
[
202,
41
],
[
47,
44
],
[
208,
45
... | [
"mod = 10**9 + 7\nh, w, a, b = list(map(int, input().split()))\n\nt_mod = [1] * (h+w-1) \nfor i in range(1, h+w-1):\n t_mod[i] = i * t_mod[i-1] % mod \n\nt_modinv = list(map(lambda v: pow(v, mod-2, mod), t_mod))\n\ndef comb(n, r):\n return t_mod[n] * t_modinv[r] * t_modinv[n-r] % mod\n\nans = comb(h-a-1+b, b)... | mod = 10**9 + 7
h, w, a, b = list(map(int, input().split()))
t_mod = [1] * (h+w-1)
for i in range(1, h+w-1):
t_mod[i] = i * t_mod[i-1] % mod
t_modinv = list(map(lambda v: pow(v, mod-2, mod), t_mod))
def comb(n, r):
return t_mod[n] * t_modinv[r] * t_modinv[n-r] % mod
ans = comb(h-a-1+b, b) * comb(a+w-1-b, ... |
[
7,
0,
13,
2,
2,
17,
17,
17,
6,
13,
12,
13,
0,
18,
13,
13,
2,
13,
13,
23,
13,
23,
13,
12,
13,
29,
4,
13,
18,
13,
13,
23,
13,
0,
13,
13,
12,
13,
29,
8,
4,
13,
13,
13,
4,
13,
2,
18,
13,
13,
18,
13,
13,
4,
13,
... | [
[
630,
2
],
[
16,
13
],
[
20,
14
],
[
22,
15
],
[
22,
17
],
[
631,
18
],
[
20,
20
],
[
22,
22
],
[
32,
29
],
[
32,
32
],
[
35,
34
],
[
24,
35
],
[
63,
42
],
[
... | [
"MOD=10**9+7\nclass ModInt:\n def __init__(self, x):\n self.x = x % MOD\n\n def __str__(self):\n return str(self.x)\n\n __repr__ = __str__\n\n def __add__(self, other):\n return (\n ModInt(self.x + other.x) if isinstance(other, ModInt) else\n ModInt(self.x + ot... | MOD=10**9+7
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(other, ModInt) else
ModInt(self.x + other)
)
... |
[
7,
15,
15,
15,
13,
15,
13,
15,
13,
15,
13,
12,
13,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12... | [
[
22,
21
],
[
244,
27
],
[
31,
31
],
[
35,
34
],
[
256,
40
],
[
44,
44
],
[
48,
47
],
[
316,
53
],
[
57,
57
],
[
61,
60
],
[
322,
66
],
[
70,
70
],
[
270,
72
],
... | [
"#!usr/bin/env python3\nfrom collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS(): return list(map(list, sys.stdin.readline().spli... | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S():... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
17,
0,
13,
2,
39,
17,
2,
13,
17,
0,
13,
2,
39,
17,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
1... | [
[
154,
2
],
[
181,
9
],
[
181,
18
],
[
181,
19
],
[
181,
20
],
[
166,
22
],
[
152,
25
],
[
158,
26
],
[
172,
29
],
[
175,
32
],
[
167,
37
],
[
148,
40
],
[
167,
45
... | [
"mod = 10**9+7\nh, w, a, b = map(int, input().split())\n\nn = h+w-2\n\nans = 0\nfac = [1]*(n+1)\ninv = [1]*(n+1)\n\nfor i in range(1, n+1):\n fac[i] = i*fac[i-1] % mod\n\nfor i in range(1, n+1):\n inv[i] = pow(fac[i], mod-2, mod)\n\ndef func(x, y):\n m = fac[x+y]*inv[x]*inv[y]%mod\n return m\n\nfor x in... | mod = 10**9+7
h, w, a, b = map(int, input().split())
n = h+w-2
ans = 0
fac = [1]*(n+1)
inv = [1]*(n+1)
for i in range(1, n+1):
fac[i] = i*fac[i-1] % mod
for i in range(1, n+1):
inv[i] = pow(fac[i], mod-2, mod)
def func(x, y):
m = fac[x+y]*inv[x]*inv[y]%mod
return m
for x in range(b, w):
ans +=... |
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
15,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
12,
13,
0,
13,
2,
2,
18,
13,
2,
13,
13,
18,
13,
13,
13,
29,
2,
2,
18,
13,
13,
4,
13,
1... | [
[
148,
13
],
[
166,
20
],
[
166,
29
],
[
166,
30
],
[
166,
31
],
[
36,
35
],
[
62,
41
],
[
64,
42
],
[
64,
45
],
[
149,
46
],
[
62,
52
],
[
35,
55
],
[
149,
57
],... | [
"#coding: utf-8\nimport math\nimport heapq\nimport bisect\nimport numpy as np\nfrom collections import Counter, deque\nimport itertools\n#from scipy.misc import comb\n\nMOD = 10**9+7\nH,W,A,B = map(int,input().split())\n\ndef comb(a,b):\n\tp = fac[a-b]*fac[b]%MOD\n\treturn fac[a]*pow(p,MOD-2,MOD)%MOD\n\nfac=[1]\nfo... | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter, deque
import itertools
#from scipy.misc import comb
MOD = 10**9+7
H,W,A,B = map(int,input().split())
def comb(a,b):
p = fac[a-b]*fac[b]%MOD
return fac[a]*pow(p,MOD-2,MOD)%MOD
fac=[1]
for i in range(H+W):
fac.... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
41,
28,
13,
4,
13,
2,
2,
13,
13,
17,
4,
17,
0,
13,
13,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
... | [
[
194,
2
],
[
194,
11
],
[
194,
12
],
[
194,
13
],
[
206,
15
],
[
24,
23
],
[
183,
28
],
[
192,
29
],
[
197,
34
],
[
38,
37
],
[
183,
43
],
[
192,
44
],
[
50,
47
... | [
"H, W, A, B = map(int, input().split())\np = 10 ** 9 + 7\nF = [1 for i in range(H + W + 1)]\nfor i in range(1, H + W + 1):\n F[i] = F[i - 1] * i % p\nFi = [pow(f, p - 2, p) for f in F]\ndef fac(a, b):\n a = F[a + b] * Fi[a] * Fi[b]\n return a % p\nif H - A < B:\n ans = 0\n for h in range(H - A):\n ans += fa... | H, W, A, B = map(int, input().split())
p = 10 ** 9 + 7
F = [1 for i in range(H + W + 1)]
for i in range(1, H + W + 1):
F[i] = F[i - 1] * i % p
Fi = [pow(f, p - 2, p) for f in F]
def fac(a, b):
a = F[a + b] * Fi[a] * Fi[b]
return a % p
if H - A < B:
ans = 0
for h in range(H - A):
ans += fac(h, B - 1) * fac... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
0,
13,
2,
39,
17,
2,
2,
13,
13,
17,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
0,
18,
13,
13,
2,
2... | [
[
199,
2
],
[
199,
11
],
[
199,
12
],
[
199,
13
],
[
187,
15
],
[
193,
22
],
[
197,
28
],
[
191,
29
],
[
202,
32
],
[
197,
38
],
[
191,
39
],
[
43,
42
],
[
197,
48
... | [
"H, W, A, B = map(int, input().split())\nmod = 10**9 + 7\n\nfact = [1] * (H+W+1)\nfact_inv = [1] * (H+W+1)\nfor i in range(1, H+W+1):\n fact[i] = i * fact[i-1] % mod\nfact_inv[H+W] = pow(fact[H+W], mod-2, mod)\nfor i in range(1, H+W+1)[::-1]:\n fact_inv[i-1] = i * fact_inv[i] % mod\ncomb = lambda n, k: fact[n... | H, W, A, B = map(int, input().split())
mod = 10**9 + 7
fact = [1] * (H+W+1)
fact_inv = [1] * (H+W+1)
for i in range(1, H+W+1):
fact[i] = i * fact[i-1] % mod
fact_inv[H+W] = pow(fact[H+W], mod-2, mod)
for i in range(1, H+W+1)[::-1]:
fact_inv[i-1] = i * fact_inv[i] % mod
comb = lambda n, k: fact[n] * fact_inv[k]... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
0,
13,
39,
17,
17,
28,
13,
4,
13,
17,
2,
13,
13,
4,
18,
13,
13,
2,
2,
18,
13,
17,
13,
13,
4,
18,
13,
13,
2... | [
[
201,
2
],
[
201,
11
],
[
201,
12
],
[
201,
13
],
[
204,
15
],
[
207,
18
],
[
195,
23
],
[
198,
28
],
[
34,
33
],
[
184,
38
],
[
190,
39
],
[
208,
42
],
[
208,
47
... | [
"H, W, A, B = map(int, input().split())\n\nMOD = 1000000007\n\nfac = [1, 1]\ninverse = [0, 1]\nifac = [1, 1]\n \nfor i in range(2, H+W):\n fac.append((fac[-1] * i) % MOD)\n inverse.append((-inverse[MOD % i] * (MOD // i)) % MOD)\n ifac.append((ifac[-1] * inverse[i]) % MOD)\n\ndef f(n):\n return fac[B+n+H-A-1] ... | H, W, A, B = map(int, input().split())
MOD = 1000000007
fac = [1, 1]
inverse = [0, 1]
ifac = [1, 1]
for i in range(2, H+W):
fac.append((fac[-1] * i) % MOD)
inverse.append((-inverse[MOD % i] * (MOD // i)) % MOD)
ifac.append((ifac[-1] * inverse[i]) % MOD)
def f(n):
return fac[B+n+H-A-1] * fac[W-B-1-n+A-1] ... |
[
7,
17,
0,
13,
2,
2,
17,
2,
17,
17,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
... | [
[
232,
3
],
[
235,
12
],
[
241,
19
],
[
233,
23
],
[
220,
25
],
[
233,
29
],
[
223,
31
],
[
233,
35
],
[
40,
37
],
[
242,
38
],
[
45,
42
],
[
242,
43
],
[
50,
47
... | [
"# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Sep 23 17:33:45 2019\nABC042D\n@author: maezawa\n\"\"\"\n\nMAX = 5*10**5+1\nMOD = 10**9+7\n\nfac = [0] * MAX\nfinv = [0]*MAX\ninv = [0]*MAX\n\n# テーブルを作る前処理\nfac[0] = 1\nfac[1] = 1\nfinv[0] = 1\nfinv[1] = 1\ninv[1] = 1\nfor i in range(2,MAX):\n fac[i] = fac[i - 1] ... | # -*- coding: utf-8 -*-
"""
Created on Mon Sep 23 17:33:45 2019
ABC042D
@author: maezawa
"""
MAX = 5*10**5+1
MOD = 10**9+7
fac = [0] * MAX
finv = [0]*MAX
inv = [0]*MAX
# テーブルを作る前処理
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
2,
17,
17,
12,
13,
29,
2,
2,
13,
4,
13,
13,
2,
13,
17,
13,
13,
23,
13,
23,
13,
0,
13,
2,
39,
17,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
18,
13,
13,
2,
2,
13,
... | [
[
211,
2
],
[
217,
9
],
[
30,
20
],
[
32,
23
],
[
212,
25
],
[
212,
27
],
[
212,
28
],
[
30,
30
],
[
32,
32
],
[
226,
34
],
[
218,
39
],
[
43,
42
],
[
218,
47
],
... | [
"MOD = 10**9 + 7\nMAX = int(2e5+1)\n\n\ndef div(a, b):\n return a * pow(b, MOD-2, MOD) % MOD\n\n\nFACT = [1] * (MAX+1)\nfor i in range(1, MAX+1):\n FACT[i] = (i * FACT[i-1]) % MOD\nINV = [1] * (MAX+1)\nINV[MAX] = div(1, FACT[MAX])\nfor i in range(MAX, 0, -1):\n INV[i-1] = (INV[i] * i) % MOD\n\n\ndef main()... | MOD = 10**9 + 7
MAX = int(2e5+1)
def div(a, b):
return a * pow(b, MOD-2, MOD) % MOD
FACT = [1] * (MAX+1)
for i in range(1, MAX+1):
FACT[i] = (i * FACT[i-1]) % MOD
INV = [1] * (MAX+1)
INV[MAX] = div(1, FACT[MAX])
for i in range(MAX, 0, -1):
INV[i-1] = (INV[i] * i) % MOD
def main():
H, W, A, B = map... |
[
7,
0,
13,
17,
0,
13,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
12,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
28,
13,
4,
1... | [
[
261,
2
],
[
246,
5
],
[
255,
8
],
[
262,
12
],
[
234,
14
],
[
262,
18
],
[
243,
20
],
[
262,
24
],
[
36,
28
],
[
256,
29
],
[
36,
33
],
[
256,
34
],
[
46,
38
],... | [
"MAX = 510000\nMOD = 1000000007\n\nfac = [0] * MAX\nfinv = [0] * MAX\ninv = [0] * MAX\n\ndef comb_init():\n fac[0] = fac[1] = 1\n finv[0] = finv[1] = 1\n inv[1] = 1\n for i in range(2, MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] =... | MAX = 510000
MOD = 1000000007
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def comb_init():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
6,
13,
17,
12,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
4,
18,
13,
13,
13,
0,
18,
13,
13,
4,
18,
13,
13,
13,
18,
13,
13,
23,
13,
23,
13,
23,
13,
2,
2,
17,
17,
... | [
[
288,
2
],
[
288,
11
],
[
288,
12
],
[
288,
13
],
[
23,
20
],
[
46,
21
],
[
50,
22
],
[
50,
23
],
[
28,
25
],
[
46,
26
],
[
46,
30
],
[
48,
32
],
[
37,
34
],
[... | [
"H,W,A,B = map(int,input().split())\n\n\nclass Combination:\n \"\"\"\n O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる\n n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)\n 使用例：\n comb = Combination(1000000)\n print(comb(5, 3)) # 10\n \"\"\"\n\n def __init__(self, n_max, mod=10 ** 9 + 7):\n self.mo... | H,W,A,B = map(int,input().split())
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10 ** 9 + 7):
self.mod = mod
self.mod... |
[
7,
6,
13,
12,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
39,
17,
0,
18,
13,
13,
39,
17,
28,
13,
4,
13,
17,
2,
18,
13,
13,
17,
4,
18,
18,
13,
13,
13,
2,
2,
18,
18,
13,
13,
17,
4,
13,
13,
2,
18,
... | [
[
9,
6
],
[
82,
7
],
[
84,
8
],
[
84,
9
],
[
14,
11
],
[
82,
12
],
[
86,
13
],
[
86,
14
],
[
19,
16
],
[
82,
17
],
[
25,
22
],
[
82,
23
],
[
29,
28
],
[
6,
... | [
"class combnk_mod(object):\n # pが素数かつaとpが互いに素であるとき\n # フェルマーの小定理より以下が成り立つ.\n # 1 / a = a ** (p - 2) (mod p)\n # これを使って (1 / k!) mod p を計算する.\n def __init__(self, maxn, p):\n self.maxn = maxn\n self.p = p\n self.x = [1] # 分母にあたる数 1 / n! mod p\n self.y = [1] # 分子にあたる数. n! mo... | class combnk_mod(object):
# pが素数かつaとpが互いに素であるとき
# フェルマーの小定理より以下が成り立つ.
# 1 / a = a ** (p - 2) (mod p)
# これを使って (1 / k!) mod p を計算する.
def __init__(self, maxn, p):
self.maxn = maxn
self.p = p
self.x = [1] # 分母にあたる数 1 / n! mod p
self.y = [1] # 分子にあたる数. n! mod p
fo... |
[
7,
15,
13,
0,
13,
4,
13,
2,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
39,
17,
28,
13,
4,
13,
17,
2,
2,
13,
13,
17,
4,
18,
13,
13,
2,
2,
18,
13,
17,
13,
13,
0,
13,
39,
4,
13,
18,
13,
17,... | [
[
162,
4
],
[
183,
11
],
[
183,
20
],
[
183,
21
],
[
183,
22
],
[
153,
24
],
[
29,
28
],
[
166,
34
],
[
184,
35
],
[
154,
39
],
[
154,
44
],
[
28,
46
],
[
163,
47
... | [
"# coding: UTF-8\nimport numpy as np\n\nMOD = int(1e+9+7)\nH, W, A, B = map(int, input().split())\n\nfact = [1]\nfor i in range(1, W+H-1):\n fact.append((fact[-1]*i) % MOD)\n\nifact = [pow(fact[-1], MOD-2, MOD)]\nfor i in reversed(range(1, W+H-1)):\n ifact.append((ifact[-1]*i) % MOD)\nifact.reverse()\n\n\ndef... | # coding: UTF-8
import numpy as np
MOD = int(1e+9+7)
H, W, A, B = map(int, input().split())
fact = [1]
for i in range(1, W+H-1):
fact.append((fact[-1]*i) % MOD)
ifact = [pow(fact[-1], MOD-2, MOD)]
for i in reversed(range(1, W+H-1)):
ifact.append((ifact[-1]*i) % MOD)
ifact.reverse()
def comb(n, r):
retu... |
[
7,
0,
13,
2,
2,
17,
17,
17,
12,
13,
14,
2,
13,
17,
29,
17,
29,
2,
2,
2,
4,
13,
13,
2,
13,
17,
17,
2,
13,
2,
13,
17,
13,
23,
13,
23,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
41,
28,
13,
4,
13,
2,
... | [
[
240,
2
],
[
36,
12
],
[
34,
22
],
[
36,
24
],
[
34,
28
],
[
36,
30
],
[
241,
32
],
[
34,
34
],
[
36,
36
],
[
255,
38
],
[
255,
47
],
[
255,
48
],
[
255,
49
],
... | [
"K = 10 ** 9 + 7\n\ndef pow_K(x, n):\n if n == 0:\n return 1\n else:\n return (pow_K(x, n // 2) ** 2 * x ** (n % 2)) % K\n\nH, W, A, B = map(int, input().split())\n\nfact = [0 for i in range(H+W-1)]\nfact[0] = 1\nfor i in range(H+W-2):\n fact[i + 1] = fact[i] * (i+1) % K\nfact_inv = [0 for i in range(H+W-1... | K = 10 ** 9 + 7
def pow_K(x, n):
if n == 0:
return 1
else:
return (pow_K(x, n // 2) ** 2 * x ** (n % 2)) % K
H, W, A, B = map(int, input().split())
fact = [0 for i in range(H+W-1)]
fact[0] = 1
for i in range(H+W-2):
fact[i + 1] = fact[i] * (i+1) % K
fact_inv = [0 for i in range(H+W-1)]
fact_inv[H+W-2] ... |
[
7,
0,
13,
17,
12,
13,
17,
0,
13,
17,
0,
13,
13,
42,
2,
13,
17,
14,
2,
13,
17,
0,
13,
2,
2,
13,
13,
13,
0,
13,
2,
2,
13,
13,
13,
0,
13,
17,
29,
13,
23,
13,
23,
13,
23,
13,
12,
13,
17,
29,
4,
13,
0,
13,
13,
0... | [
[
411,
2
],
[
9,
8
],
[
12,
11
],
[
41,
12
],
[
43,
15
],
[
36,
15
],
[
43,
19
],
[
36,
19
],
[
23,
22
],
[
8,
25
],
[
22,
25
],
[
11,
26
],
[
29,
26
],
[
4... | [
"MOD = 1000000007\n\n\ndef mod_pow(a, n, mod):\n \"\"\"\n 二分累乗法による a^n (mod m)の実装\n\n :param a: 累乗の底\n :param n: 累乗の指数\n :param mod: 法\n :return: a^n (mod m)\n \"\"\"\n\n result = 1\n a_n = a\n while n > 0:\n if n & 1:\n result = result * a_n % mod\n a_n = a_n ... | MOD = 1000000007
def mod_pow(a, n, mod):
"""
二分累乗法による a^n (mod m)の実装
:param a: 累乗の底
:param n: 累乗の指数
:param mod: 法
:return: a^n (mod m)
"""
result = 1
a_n = a
while n > 0:
if n & 1:
result = result * a_n % mod
a_n = a_n * a_n % mod
n >>= 1
... |
[
7,
0,
13,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
39,
17,
28,
13,
4,
13,
17,
2,
13,
13,
4,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
13,
13,
12,
13,
14,
2,
13,
17,
14,
2,
13,
17,
14,
2,
2,
13,... | [
[
207,
2
],
[
210,
5
],
[
210,
14
],
[
210,
15
],
[
210,
16
],
[
189,
18
],
[
23,
22
],
[
196,
27
],
[
211,
28
],
[
190,
31
],
[
190,
36
],
[
22,
38
],
[
22,
40
]... | [
"mod = 1000000007\nH, W, A, B = map(int, raw_input().split())\n\nfactorial = [1]\nfor n in xrange(1, H+W):\n factorial.append(factorial[n-1]*n%mod)\n\ndef power(x, y):\n if y == 0 : return 1\n elif y == 1 : return x % mod\n elif y % 2 == 0 : return power(x, y/2)**2 % mod\n else :... | mod = 1000000007
H, W, A, B = map(int, raw_input().split())
factorial = [1]
for n in xrange(1, H+W):
factorial.append(factorial[n-1]*n%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
else : return power(x,... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
17,
0,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
17,
17,
0,
13,
13,
0,
13,
13,
4,
18,
13,
13,
13,
4,
18,
13,
13,
4,
13,
13,
2,
13,
17,
13,
12,
13,
29,
2,
2,
2,
2,
18,
13,
... | [
[
164,
2
],
[
155,
9
],
[
176,
13
],
[
173,
17
],
[
21,
20
],
[
170,
26
],
[
20,
27
],
[
200,
29
],
[
165,
30
],
[
156,
33
],
[
201,
35
],
[
171,
35
],
[
174,
35
... | [
"P = 10**9+7\nfac = [1]\nifac = [1]\nff = 1\nfor i in range(1,200001):\n ff *= i\n ff %= P\n fac.append(ff)\n ifac.append(pow(ff, P-2, P))\ndef ncr(n, r): \n return (fac[n] * ifac[r] % P * ifac[n-r] % P);\n\nh,w,a,b = map(int,input().split())\ns = 0\nnC = b-1\nkC = 0\nnD = w-b-1+h-1\nkD = h-1\nfor i in range(h... | P = 10**9+7
fac = [1]
ifac = [1]
ff = 1
for i in range(1,200001):
ff *= i
ff %= P
fac.append(ff)
ifac.append(pow(ff, P-2, P))
def ncr(n, r):
return (fac[n] * ifac[r] % P * ifac[n-r] % P);
h,w,a,b = map(int,input().split())
s = 0
nC = b-1
kC = 0
nD = w-b-1+h-1
kD = h-1
for i in range(h-a):
C = ncr(nC, kC)
... |
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
15,
15,
15,
15,
15,
4,
18,
13,
13,
17,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
13,
4,
... | [
[
91,
90
],
[
103,
102
],
[
109,
108
],
[
134,
110
],
[
117,
116
],
[
395,
122
],
[
116,
124
],
[
102,
125
],
[
108,
128
],
[
100,
132
],
[
134,
134
],
[
141,
140
],
[
... | [
"\n# -*- coding: utf-8 -*-\nimport bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom pprint import pprint\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, com... |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from pprint import pprint
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_r... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
13,
13,
0,
13,
17,
12,
13,
14,
2,
13,
17,
29,
17,
14,
2,
2,
13,
17,
17,
29,
2,
2,
4,
13,
13,
2,
13,
17,
17,
13,
29,
2,
2,
2,
... | [
[
233,
2
],
[
233,
11
],
[
233,
12
],
[
233,
13
],
[
209,
15
],
[
207,
17
],
[
234,
18
],
[
221,
20
],
[
231,
22
],
[
228,
23
],
[
203,
25
],
[
68,
31
],
[
68,
38
... | [
"H, W, A, B = map(int, input().split())\nC = H - A\nD = W - B\np = 1000000007\n\ndef power(a, b): #a^b (mod p)を求める #二分累乗法を使う\n if b == 0:\n return 1\n elif b % 2 == 0:\n return power(a, b//2) ** 2 % p\n else:\n return power(a, b//2) ** 2 * a % p\n\nf = [1] #f[i] = i! % p\nfor i in rang... | H, W, A, B = map(int, input().split())
C = H - A
D = W - B
p = 1000000007
def power(a, b): #a^b (mod p)を求める #二分累乗法を使う
if b == 0:
return 1
elif b % 2 == 0:
return power(a, b//2) ** 2 % p
else:
return power(a, b//2) ** 2 * a % p
f = [1] #f[i] = i! % p
for i in range(H+W):
f.appen... |
[
7,
12,
13,
0,
13,
13,
13,
17,
13,
17,
42,
2,
13,
17,
0,
13,
2,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
13,
13,
0,
13,
13,
13,
13,
0,
13,
13,
13,
13,
29,
2,
2,
13,
13,
13,
23,
13,
23,
13,
12,
13,
14,
2,
2,
13,
1... | [
[
5,
4
],
[
48,
5
],
[
7,
6
],
[
9,
8
],
[
4,
12
],
[
32,
12
],
[
16,
15
],
[
46,
17
],
[
30,
17
],
[
20,
17
],
[
4,
18
],
[
32,
18
],
[
21,
20
],
[
15,
... | [
"def mod_inv(n: int, mod: int)->int:\n b, u, v = mod, 1, 0\n while b > 0:\n t = n // b\n\n n -= t * b\n u -= t * v\n\n n, b = b, n\n u, v = v, u\n\n return (u+mod) % mod\n\n\ndef comb(r: int, c: int, mod: int) -> int:\n if c < 0 or r < c:\n raise Exception('inva... | def mod_inv(n: int, mod: int)->int:
b, u, v = mod, 1, 0
while b > 0:
t = n // b
n -= t * b
u -= t * v
n, b = b, n
u, v = v, u
return (u+mod) % mod
def comb(r: int, c: int, mod: int) -> int:
if c < 0 or r < c:
raise Exception('invalid r={}, c={}'.forma... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
13,
17,
28,
13,
4,
13,
2,
2,
13,
13,
17,
14,
4,
18,
13,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
18,
13,
2,
13,
... | [
[
164,
2
],
[
164,
11
],
[
164,
12
],
[
164,
13
],
[
170,
15
],
[
188,
18
],
[
173,
25
],
[
189,
27
],
[
31,
30
],
[
150,
35
],
[
165,
36
],
[
171,
41
],
[
30,
44
... | [
"H, W, A, B = map(int, input().split())\nh = {}\np = 10**9+7\nq = p - 2\nfor x in range(H+W-1):\n if h.get(x-1):\n a = (x * h[x-1][0]) % p\n else:\n a = 1\n b = pow(a,q,p)\n h[x] = (a,b)\n\ndef C(n, r):\n return h[n][0] * h[r][1] * h[n-r][1]\n\nans = 0\nfor i in range(B, W):\n ans +=... | H, W, A, B = map(int, input().split())
h = {}
p = 10**9+7
q = p - 2
for x in range(H+W-1):
if h.get(x-1):
a = (x * h[x-1][0]) % p
else:
a = 1
b = pow(a,q,p)
h[x] = (a,b)
def C(n, r):
return h[n][0] * h[r][1] * h[n-r][1]
ans = 0
for i in range(B, W):
ans += C(i+H - A - 1, i) * C... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
13,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
28,
13,
4,
13,
17,
2,
13,
13,
0,
18,
13,
13,
2,
2,
18,
13,
2,
... | [
[
249,
2
],
[
249,
11
],
[
249,
12
],
[
249,
13
],
[
237,
15
],
[
216,
22
],
[
250,
27
],
[
220,
28
],
[
33,
30
],
[
217,
31
],
[
38,
35
],
[
217,
36
],
[
41,
40
... | [
"# -*- coding: utf-8 -*-\n\nH,W,A,B = map(int, input().split())\nmod = (10 ** 9 + 7)\n\n# 予め組み合わせ計算に必要な階乗と逆元のテーブルを作っておく\nfactorial = [1] * (H+W)\nfactorial[0] = 1\nfactorial[1] = 1\nfor i in range(2,H+W):\n factorial[i] = factorial[i-1] * i % mod\n\ninverse = [1] * (H+W)\n# フェルマーの小定理から(x! ** mod-2 % mod == x! **... | # -*- coding: utf-8 -*-
H,W,A,B = map(int, input().split())
mod = (10 ** 9 + 7)
# 予め組み合わせ計算に必要な階乗と逆元のテーブルを作っておく
factorial = [1] * (H+W)
factorial[0] = 1
factorial[1] = 1
for i in range(2,H+W):
factorial[i] = factorial[i-1] * i % mod
inverse = [1] * (H+W)
# フェルマーの小定理から(x! ** mod-2 % mod == x! ** -1 % mod)
# powに第... |
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
12,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
4,
13,
17,
17,
0,
13,
2,
39,
17,
2,
4,
13,
2,
2,
13,
13,
13,
2,
2,
13,
13,
13,
17,
28,
13,
4,
13,
17,
... | [
[
235,
4
],
[
14,
13
],
[
236,
20
],
[
14,
22
],
[
14,
23
],
[
14,
24
],
[
27,
26
],
[
34,
33
],
[
13,
42
],
[
23,
43
],
[
22,
44
],
[
23,
47
],
[
22,
48
],
[
... | [
"import sys\ninput = sys.stdin.readline\n\ndef main():\n H, W, A, B = map(int, input().split())\n\n MOD = int(1e9) + 7\n\n kai = [1] * (max(H-A+W, A+W-B) + 1)\n for i in range(1, len(kai)):\n kai[i] = kai[i-1] * i\n kai[i] %= MOD\n \n up = [0] * (W-B)\n down = [0] * (W-B)\n\n t... | import sys
input = sys.stdin.readline
def main():
H, W, A, B = map(int, input().split())
MOD = int(1e9) + 7
kai = [1] * (max(H-A+W, A+W-B) + 1)
for i in range(1, len(kai)):
kai[i] = kai[i-1] * i
kai[i] %= MOD
up = [0] * (W-B)
down = [0] * (W-B)
t1 = H-A-1
for i i... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
17,
28,
13,
4,
13,
2,
4,
13,
13,
17,
0,
18,
13,
2,
13,
17,
2,
2,
18,
13,
13,
2,
13,
17,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
... | [
[
158,
2
],
[
152,
9
],
[
16,
15
],
[
153,
21
],
[
29,
24
],
[
153,
25
],
[
15,
27
],
[
153,
32
],
[
15,
33
],
[
15,
35
],
[
159,
37
],
[
179,
39
],
[
179,
48
],
... | [
"MOD = 10 ** 9 + 7\nfac = [1] * 200005\nfor i in range(len(fac) - 1):\n fac[i + 1] = fac[i] * (i + 1) % MOD\nh, w, a, b = map(int, input().split())\nans = 0\nx, y = b, h - a - 1\nwhile x < w and y >= 0:\n p = w - x - 1\n q = h - y - 1\n ans += (fac[x + y] * pow(fac[x] * fac[y], MOD - 2, MOD) *\n ... | MOD = 10 ** 9 + 7
fac = [1] * 200005
for i in range(len(fac) - 1):
fac[i + 1] = fac[i] * (i + 1) % MOD
h, w, a, b = map(int, input().split())
ans = 0
x, y = b, h - a - 1
while x < w and y >= 0:
p = w - x - 1
q = h - y - 1
ans += (fac[x + y] * pow(fac[x] * fac[y], MOD - 2, MOD) *
fac[p + q] *... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
4,
13,
17,
17,
17,
12,
13,
14,
2,
2,
13,
17,
2,
13,
13,
29,
17,
0,
13,
4,
13,
13,
2,
13,
13,
29,
2,
2,
2,
18,
13,
13,
18,
13,
13,
18,
13,
2,
13,
... | [
[
221,
2
],
[
221,
11
],
[
221,
12
],
[
221,
13
],
[
188,
15
],
[
61,
27
],
[
61,
30
],
[
59,
31
],
[
36,
35
],
[
61,
38
],
[
59,
40
],
[
61,
41
],
[
59,
48
],
... | [
"h,w,a,b=map(int,input().split())\nmod=pow(10,9)+7\n\n# コンビネーション、さらに高速。あらかじめO(N)の計算をすることでのちの計算が早くなる\ndef cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[n] * g2[r] * g2[n-r] % mod\ng1 = [1, 1] \ng2 = [1, 1] \ninverse = [0, 1]\nfor i in range( 2, 200000 + 1 ):\n g1.ap... | h,w,a,b=map(int,input().split())
mod=pow(10,9)+7
# コンビネーション、さらに高速。あらかじめO(N)の計算をすることでのちの計算が早くなる
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, 1]
inverse = [0, 1]
for i in range( 2, 200000 + 1 ):
g1.append( ( g1[-1] * i... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
12,
13,
14,
2,
13,
2,
13,
13,
0,
13,
2,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
2,
13,
... | [
[
236,
2
],
[
236,
15
],
[
236,
16
],
[
236,
17
],
[
212,
19
],
[
85,
29
],
[
83,
31
],
[
85,
32
],
[
35,
34
],
[
83,
36
],
[
85,
37
],
[
40,
39
],
[
43,
42
],
... | [
"H, W, A, B = map(int, open(0).read().split())\nMOD = 10**9+7\n\ndef modcomb(m, n, mod):\n if n > m - n:\n n = m - n\n p = 1\n q = 1\n for i in range(n):\n p = p * (m - i) % mod\n q = q * (i + 1) % mod\n result = p * pow(q, mod - 2, mod) % mod\n return result\n\ntotal = modcom... | H, W, A, B = map(int, open(0).read().split())
MOD = 10**9+7
def modcomb(m, n, mod):
if n > m - n:
n = m - n
p = 1
q = 1
for i in range(n):
p = p * (m - i) % mod
q = q * (i + 1) % mod
result = p * pow(q, mod - 2, mod) % mod
return result
total = modcomb(H + W - 2, W - 1,... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
2,
13,
17,
0,
13,
2,
39,
17,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
13,
... | [
[
241,
2
],
[
241,
11
],
[
241,
12
],
[
241,
13
],
[
220,
15
],
[
233,
17
],
[
242,
18
],
[
205,
20
],
[
229,
27
],
[
221,
32
],
[
202,
35
],
[
221,
40
],
[
190,
43... | [
"h,w,a,b=map(int,input().split())\nN=h+w\nmod=10**9+7\nfac=[1]*(N+2)\ninv=[1]*(N+2)\nt=1\nfor i in range(1,N+2):\n t*=i\n t%=mod\n fac[i]=t\nt=pow(fac[N+1],mod-2,mod)\nfor i in range(N+1,0,-1):\n inv[i]=t\n t*=i\n t%=mod\ndef comb(n,r):\n return fac[n]*inv[n-r]*inv[r]%mod\nc=[0]\nfor i in range... | h,w,a,b=map(int,input().split())
N=h+w
mod=10**9+7
fac=[1]*(N+2)
inv=[1]*(N+2)
t=1
for i in range(1,N+2):
t*=i
t%=mod
fac[i]=t
t=pow(fac[N+1],mod-2,mod)
for i in range(N+1,0,-1):
inv[i]=t
t*=i
t%=mod
def comb(n,r):
return fac[n]*inv[n-r]*inv[r]%mod
c=[0]
for i in range(h-a):
c.append(com... |
[
7,
15,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
12,
13,
14,
2,
13,
17,
29,
17,
14,
2,
13,
17,
29,
2,
13,
13,
14,
2,
2,
13,
17,
17,
29,
2,
2,
4,
13,
13,
2,
13,
17,
17,
13,... | [
[
252,
4
],
[
252,
13
],
[
252,
14
],
[
252,
15
],
[
264,
17
],
[
72,
27
],
[
72,
33
],
[
70,
37
],
[
265,
38
],
[
72,
42
],
[
70,
50
],
[
72,
52
],
[
265,
55
],
... | [
"import math\nH, W, A, B = map(int,input().split())\ne = 10**9 + 7\ndef power(a,b):\n if b == 0:\n return 1\n elif b == 1:\n return a % e\n elif b%2 == 0:\n return power(a,b//2)**2 % e\n else:\n return power(a,b//2)**2*a % e\n \nM = [1]\nfor i in range(1,H+W):\n a = M[i... | import math
H, W, A, B = map(int,input().split())
e = 10**9 + 7
def power(a,b):
if b == 0:
return 1
elif b == 1:
return a % e
elif b%2 == 0:
return power(a,b//2)**2 % e
else:
return power(a,b//2)**2*a % e
M = [1]
for i in range(1,H+W):
a = M[i-1]*i%e
M.append... |
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
12,
4,
13,
13,
2,
13,
17,
13,
23,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
13,
4,
13,
2,
... | [
[
59,
2
],
[
80,
9
],
[
60,
15
],
[
60,
17
],
[
77,
20
],
[
77,
29
],
[
77,
30
],
[
77,
31
],
[
71,
33
],
[
71,
36
],
[
40,
39
],
[
69,
43
],
[
47,
46
],
[
... | [
"M=10**9+7;F=lambda X:pow(X,M-2,M);H,W,A,B=map(int,input().split());Z=C=1\nfor I in range(H-1):Z=C=C*(W+H-B-2-I)*F(I+1)%M\nfor I in range(1,H-A):C=C*(B-1+I)*(H-I)*F(I*(W+H-B-1-I))%M;Z+=C\nprint(Z%M)",
"M=10**9+7",
"M",
"10**9+7",
"10**9",
"10",
"9",
"7",
"F=lambda X:pow(X,M-2,M)",
"F",
"lambda X... | M=10**9+7;F=lambda X:pow(X,M-2,M);H,W,A,B=map(int,input().split());Z=C=1
for I in range(H-1):Z=C=C*(W+H-B-2-I)*F(I+1)%M
for I in range(1,H-A):C=C*(B-1+I)*(H-I)*F(I*(W+H-B-1-I))%M;Z+=C
print(Z%M)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13
] | [
[
27,
2
],
[
30,
8
],
[
27,
28
],
[
30,
31
]
] | [
"N = int(input())\nL = sorted(list(map(int,input().split())))\nprint(sum(i for i in L[::2]))",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = sorted(list(map(int,input().split())))",
"L",
"sorted(list(map(int,input().split())))",
"sorted",
"list(map(int,input().split(... | N = int(input())
L = sorted(list(map(int,input().split())))
print(sum(i for i in L[::2])) |
[
7,
15,
13,
12,
13,
29,
4,
18,
4,
18,
18,
13,
13,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,... | [
[
56,
16
],
[
69,
20
],
[
62,
22
],
[
69,
33
],
[
59,
36
],
[
40,
39
],
[
57,
45
],
[
65,
48
],
[
63,
50
],
[
39,
51
],
[
66,
54
],
[
60,
54
],
[
56,
57
],
[
... | [
"import sys\ndef input():\n return sys.stdin.readline().rstrip()\n\nN=int(input())\nL=sorted(list(map(int,input().split())))\n\nans=0\nfor i in range(0,2*N,2):\n ans+=L[i]\n\nprint(ans)",
"import sys",
"sys",
"def input():\n return sys.stdin.readline().rstrip()",
"input",
"return sys.stdin.readline().r... | import sys
def input():
return sys.stdin.readline().rstrip()
N=int(input())
L=sorted(list(map(int,input().split())))
ans=0
for i in range(0,2*N,2):
ans+=L[i]
print(ans)
|
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
4,
18,
13,
13,
13,
4,
13,
4,
18,
13,
13,
18,
13,
4,
18,
13,
13,
17,
2,
17,
13,
17,
10,
4,
13,
10,
4,
13,
... | [
[
51,
4
],
[
12,
11
],
[
11,
20
],
[
54,
22
],
[
57,
27
],
[
55,
32
],
[
58,
40
],
[
55,
40
],
[
52,
48
],
[
51,
52
],
[
54,
55
],
[
57,
58
]
] | [
"import numpy as np\nn = int(input())\nl = sorted([int(i) for i in input().split()])\nl = np.array(l)\nprint(np.sum(l[np.arange(0,2*n,2)]))",
"import numpy as np",
"numpy",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().sp... | import numpy as np
n = int(input())
l = sorted([int(i) for i in input().split()])
l = np.array(l)
print(np.sum(l[np.arange(0,2*n,2)])) |
[
7,
0,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
4,
13,
13,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
17,
13,
10,
18,
13,
10,
4,
13,
10,
4,
13
] | [
[
49,
2
],
[
46,
6
],
[
40,
20
],
[
24,
23
],
[
47,
29
],
[
43,
32
],
[
47,
34
],
[
23,
35
],
[
44,
38
],
[
41,
38
],
[
40,
41
],
[
43,
44
],
[
46,
47
],
[
... | [
"n = input()\na = sorted(list(map(int, input().split())))\nans = 0\nfor i in range(0, len(a), 2):\n ans += a[i]\nprint(ans)",
"n = input()",
"n",
"input()",
"input",
"a = sorted(list(map(int, input().split())))",
"a",
"sorted(list(map(int, input().split())))",
"sorted",
"list(map(int, input().spl... | n = input()
a = sorted(list(map(int, input().split())))
ans = 0
for i in range(0, len(a), 2):
ans += a[i]
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
4,
13,
10,
18,
13,
10,
4,
13,
10,
... | [
[
53,
2
],
[
47,
8
],
[
48,
21
],
[
25,
24
],
[
56,
27
],
[
31,
30
],
[
54,
36
],
[
50,
39
],
[
48,
41
],
[
30,
42
],
[
51,
45
],
[
57,
45
],
[
47,
48
],
[
... | [
"N=int(input())\nL=list(map(int,input().split()))\nL.sort(reverse=True)\nans=0\nfor i in range(1,2*N,2):\n ans+=L[i]\nprint(ans)\n",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L=list(map(int,input().split()))",
"L",
"list(map(int,input().split()))",
"list",
"map(int,... | N=int(input())
L=list(map(int,input().split()))
L.sort(reverse=True)
ans=0
for i in range(1,2*N,2):
ans+=L[i]
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
17,
13,
14,
2,
2,
13,
17,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
... | [
[
48,
2
],
[
54,
8
],
[
55,
21
],
[
51,
24
],
[
28,
27
],
[
49,
32
],
[
27,
36
],
[
57,
40
],
[
55,
42
],
[
27,
43
],
[
58,
46
],
[
52,
46
],
[
48,
49
],
[
... | [
"n=int(input())\na=list(map(int,input().split()))\na.sort()\nans = 0\nfor i in range(2*n):\n if i%2==0:\n ans += a[i]\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,... | n=int(input())
a=list(map(int,input().split()))
a.sort()
ans = 0
for i in range(2*n):
if i%2==0:
ans += a[i]
print(ans) |
[
7,
15,
13,
13,
15,
15,
15,
15,
15,
15,
15,
15,
15,
15,
15,
12,
13,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,... | [
[
26,
25
],
[
84,
31
],
[
35,
35
],
[
86,
44
],
[
92,
49
],
[
98,
57
],
[
81,
59
],
[
77,
61
],
[
102,
63
],
[
78,
66
],
[
78,
73
],
[
77,
78
],
[
86,
87
],
[
... | [
"import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\nfrom operator import ... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgette... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
4,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
... | [
[
67,
2
],
[
55,
8
],
[
64,
20
],
[
56,
23
],
[
26,
25
],
[
61,
28
],
[
32,
31
],
[
65,
37
],
[
56,
37
],
[
58,
40
],
[
65,
44
],
[
56,
44
],
[
31,
45
],
[
... | [
"a = int(input())\nb = list(map(int, input().split()))\nb = sorted(b, reverse=True)\nc = 0\nfor i in range(1, len(b), 2):\n c += min(b[i], b[i-1])\nprint(c)",
"a = int(input())",
"a",
"int(input())",
"int",
"input()",
"input",
"b = list(map(int, input().split()))",
"b",
"list(map(int, input().s... | a = int(input())
b = list(map(int, input().split()))
b = sorted(b, reverse=True)
c = 0
for i in range(1, len(b), 2):
c += min(b[i], b[i-1])
print(c)
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,... | [
[
66,
4
],
[
63,
11
],
[
67,
15
],
[
60,
17
],
[
67,
26
],
[
61,
30
],
[
69,
33
],
[
37,
36
],
[
64,
42
],
[
72,
45
],
[
61,
49
],
[
36,
50
],
[
61,
52
],
[
... | [
"import sys\ninput=sys.stdin.readline\n\nN = int(input())\nL = list(map(int, input().split()))\n\nL.sort()\nans = 0\nfor i in range(0, 2*N, 2):\n ans += min(L[i],L[i+1])\nprint(ans)",
"import sys",
"sys",
"input=sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"r... | import sys
input=sys.stdin.readline
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(0, 2*N, 2):
ans += min(L[i],L[i+1])
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
17,
13,
39,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
... | [
[
63,
2
],
[
66,
8
],
[
60,
20
],
[
67,
23
],
[
69,
25
],
[
57,
27
],
[
31,
30
],
[
64,
36
],
[
54,
39
],
[
61,
43
],
[
67,
43
],
[
30,
44
],
[
61,
46
],
[
... | [
"n = int(input())\ns = list(map(int, input().split()))\ns = sorted(s)\nc, f = 0, []\nfor i in range(0, 2*n, 2):\n c+=min(s[i], s[i+1])\n # print(min(s[i], s[i+1]))\nprint(c)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"s = list(map(int, input().split()))",
"s",
"lis... | n = int(input())
s = list(map(int, input().split()))
s = sorted(s)
c, f = 0, []
for i in range(0, 2*n, 2):
c+=min(s[i], s[i+1])
# print(min(s[i], s[i+1]))
print(c) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
18,
13,
39,
17,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13
] | [
[
42,
2
],
[
45,
8
],
[
46,
21
],
[
39,
24
],
[
28,
27
],
[
46,
29
],
[
48,
33
],
[
27,
34
],
[
49,
37
],
[
40,
37
],
[
39,
40
],
[
42,
43
],
[
45,
46
],
[
... | [
"N = int(input())\nL = list(map(int, input().split()))\n\nL.sort()\n\nans = 0\nfor x in L[::2]:\n ans += x\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = list(map(int, input().split()))",
"L",
"list(map(int, input().split()))",
"list",
"map(int, input... | N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for x in L[::2]:
ans += x
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
12,
13,
0,
13,
4,
13,
13,
41,
28,
13,
13,
4,
13,
13,
2,
2,
13,
17,
17,
4,
13,
0,
13,
13,
29,
4,
13,
13,
23,
13,
23,
13,
4,
13,
... | [
[
61,
2
],
[
10,
9
],
[
9,
18
],
[
64,
20
],
[
26,
25
],
[
53,
28
],
[
25,
35
],
[
53,
35
],
[
45,
44
],
[
44,
49
],
[
25,
49
],
[
53,
49
],
[
51,
51
],
[
5... | [
"n = int(input())\nli = [int(x) for x in input().split()]\n\ndef skews(n,li):\n \n li = sorted(li)\n li = [l for i,l in enumerate(li) if i%2==0] \n return sum(li)\n\n\nprint(skews(n,li))",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(x) for x in input().split()"... | n = int(input())
li = [int(x) for x in input().split()]
def skews(n,li):
li = sorted(li)
li = [l for i,l in enumerate(li) if i%2==0]
return sum(li)
print(skews(n,li))
|
[
7,
0,
13,
4,
13,
4,
13,
4,
13,
18,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
10,
4,
13
] | [
[
25,
2
],
[
25,
26
]
] | [
"N=input();print(sum(sorted(list(map(int,input().split())))[::2]))",
"N=input()",
"N",
"input()",
"input",
"print(sum(sorted(list(map(int,input().split())))[::2]))",
"print",
"sum(sorted(list(map(int,input().split())))[::2])",
"sum",
"sorted(list(map(int,input().split())))[::2]",
"(list(map(int,... | N=input();print(sum(sorted(list(map(int,input().split())))[::2])) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
... | [
[
54,
2
],
[
66,
8
],
[
57,
11
],
[
58,
24
],
[
60,
27
],
[
31,
30
],
[
67,
35
],
[
55,
35
],
[
63,
39
],
[
58,
43
],
[
30,
44
],
[
58,
46
],
[
30,
48
],
[
... | [
"num = int(input())\nnum *= 2\nSkewers = list(map(int, input().split()))\n \nSkewers.sort()\nval = 0\nfor i in range(0, num-1, 2):\n val += min(Skewers[i], Skewers[i + 1])\n \n \nprint(val)",
"num = int(input())",
"num",
"int(input())",
"int",
"input()",
"input",
"num *= 2",
"num",
"2",
"Skew... | num = int(input())
num *= 2
Skewers = list(map(int, input().split()))
Skewers.sort()
val = 0
for i in range(0, num-1, 2):
val += min(Skewers[i], Skewers[i + 1])
print(val) |
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
15,
15,
15,
15,
15,
15,
13,
14,
4,
18,
13,
13,
17,
0,
18,
13,
13,
4,
13,
17,
17,
4,
18,
13,
13,
17,
0,
13,
4,
13,
17,
0,
13,
2,
1... | [
[
37,
34
],
[
120,
47
],
[
117,
52
],
[
108,
57
],
[
114,
64
],
[
34,
69
],
[
111,
74
],
[
34,
84
],
[
112,
91
],
[
105,
94
],
[
112,
98
],
[
106,
103
],
[
105,
106... | [
"import bisect\nimport heapq\nimport itertools\nimport math\nimport operator\nimport os\nimport re\nimport string\nimport sys\nfrom collections import Counter, deque, defaultdict\nfrom copy import deepcopy\nfrom decimal import Decimal\nfrom fractions import gcd\nfrom functools import lru_cache, reduce\nfrom operato... | import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
17,
13,
14,
2,
2,
13,
17,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
18,
... | [
[
49,
2
],
[
52,
8
],
[
46,
22
],
[
26,
25
],
[
50,
30
],
[
25,
34
],
[
55,
38
],
[
53,
40
],
[
25,
41
],
[
56,
44
],
[
47,
44
],
[
46,
47
],
[
49,
50
],
[
... | [
"n = int(input())\na = sorted(list(map(int, input().split())))\ns = 0\nfor i in range(2 * n):\n if i % 2 == 0:\n s += a[i]\nprint(s)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a = sorted(list(map(int, input().split())))",
"a",
"sorted(list(map(int, input().split()))... | n = int(input())
a = sorted(list(map(int, input().split())))
s = 0
for i in range(2 * n):
if i % 2 == 0:
s += a[i]
print(s) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
18,
13,
39,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] | [
[
31,
2
],
[
37,
8
],
[
34,
20
],
[
38,
24
],
[
35,
29
],
[
31,
32
],
[
34,
35
],
[
37,
38
]
] | [
"N = int(input())\nL = sorted(map(int, input().split()))\n\nans = sum(L[::2])\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = sorted(map(int, input().split()))",
"L",
"sorted(map(int, input().split()))",
"sorted",
"map(int, input().split())",
"map",
... | N = int(input())
L = sorted(map(int, input().split()))
ans = sum(L[::2])
print(ans) |
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
13,
4,
13,
18,
13,
39,
17,
14,
2,
13,
17,
4,
13,
10,
12,
13
] | [
[
5,
4
],
[
11,
10
],
[
10,
26
],
[
37,
34
]
] | [
"# coding: utf-8\ndef main():\n n = int(input())\n l = sorted(map(int, input().split()))\n print(sum(l[::2]))\n\n\nif __name__ == '__main__':\n main()",
"def main():\n n = int(input())\n l = sorted(map(int, input().split()))\n print(sum(l[::2]))",
"main",
"n = int(input())",
"n",
"int... | # coding: utf-8
def main():
n = int(input())
l = sorted(map(int, input().split()))
print(sum(l[::2]))
if __name__ == '__main__':
main() |
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
4,
13,
18,
13,
39,
17,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] | [
[
5,
4
],
[
11,
10
],
[
10,
23
],
[
27,
26
],
[
10,
30
],
[
26,
35
],
[
44,
41
]
] | [
"\ndef main():\n num = int(input())\n data = list(map(int, input().split()))\n data.sort()\n ans = sum(data[::2])\n print(ans)\n\n\n\nif __name__ == '__main__':\n main()",
"def main():\n num = int(input())\n data = list(map(int, input().split()))\n data.sort()\n ans = sum(data[::2])\... |
def main():
num = int(input())
data = list(map(int, input().split()))
data.sort()
ans = sum(data[::2])
print(ans)
if __name__ == '__main__':
main()
|
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
18,
4,
13,
13,
41,
28,
13,
13,
4,
4,
13,
13,
0,
13,
13,
4,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
18,
13,
13,
13,
0,
13,
4,
18,
13,
13,
13,
0,
13,
... | [
[
67,
4
],
[
61,
10
],
[
19,
18
],
[
62,
18
],
[
18,
23
],
[
79,
25
],
[
80,
31
],
[
62,
31
],
[
70,
33
],
[
37,
36
],
[
68,
39
],
[
64,
41
],
[
80,
46
],
[
... | [
"import heapq\n\nN = int(input())\nL = input().split()\nL = [int(a) for a in L]\n\nheapq.heapify(L)\n\nsum = 0\n\nfor i in range(N):\n k1 = heapq.heappop(L)\n k2 = heapq.heappop(L)\n sum += k1\n\nprint(sum)",
"import heapq",
"heapq",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
... | import heapq
N = int(input())
L = input().split()
L = [int(a) for a in L]
heapq.heapify(L)
sum = 0
for i in range(N):
k1 = heapq.heappop(L)
k2 = heapq.heappop(L)
sum += k1
print(sum)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
... | [
[
60,
2
],
[
10,
9
],
[
9,
18
],
[
63,
20
],
[
64,
24
],
[
57,
27
],
[
31,
30
],
[
61,
36
],
[
54,
39
],
[
64,
43
],
[
30,
44
],
[
64,
46
],
[
30,
48
],
[
5... | [
"n = int(input())\nli = [int(x) for x in input().split()]\nli.sort()\nans = 0\nfor i in range(0,2*n,2):\n ans += min(li[i],li[i+1])\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().sp... | n = int(input())
li = [int(x) for x in input().split()]
li.sort()
ans = 0
for i in range(0,2*n,2):
ans += min(li[i],li[i+1])
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
4,
13,
13,
17,
17,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
... | [
[
59,
2
],
[
53,
8
],
[
54,
21
],
[
62,
24
],
[
28,
27
],
[
54,
33
],
[
56,
38
],
[
54,
42
],
[
27,
43
],
[
54,
45
],
[
27,
47
],
[
57,
51
],
[
63,
51
],
[
... | [
"a = int(input())\nb = list(map(int, input().split()))\nb.sort()\nc = 0\nfor i in range(len(b)-1, 0, -2):\n c += min(b[i], b[i-1])\nprint(c)",
"a = int(input())",
"a",
"int(input())",
"int",
"input()",
"input",
"b = list(map(int, input().split()))",
"b",
"list(map(int, input().split()))",
"li... | a = int(input())
b = list(map(int, input().split()))
b.sort()
c = 0
for i in range(len(b)-1, 0, -2):
c += min(b[i], b[i-1])
print(c)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
14,
2,
2,
13,
17,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13
] | [
[
44,
2
],
[
53,
8
],
[
47,
20
],
[
54,
23
],
[
50,
25
],
[
29,
28
],
[
48,
33
],
[
54,
33
],
[
28,
37
],
[
51,
42
],
[
44,
45
],
[
47,
48
],
[
50,
51
],
[
... | [
"n=int(input())\nl=list(map(int,input().split()))\nl=sorted(l)\ns=0\nfor i in range(len(l)):\n if i%2==0:s+=l[i]\nprint(s)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"l=list(map(int,input().split()))",
"l",
"list(map(int,input().split()))",
"list",
"map(int,input().sp... | n=int(input())
l=list(map(int,input().split()))
l=sorted(l)
s=0
for i in range(len(l)):
if i%2==0:s+=l[i]
print(s) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
18,
13,
39,
17,
17,
10,
4,
13,
10,
4,
13
] | [
[
36,
2
],
[
33,
8
],
[
34,
21
],
[
34,
28
],
[
33,
34
],
[
36,
37
]
] | [
"N = int(input())\nL = list(map(int, input().split()))\n\nL.sort()\nprint(sum(L[0::2]))",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = list(map(int, input().split()))",
"L",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
... | N = int(input())
L = list(map(int, input().split()))
L.sort()
print(sum(L[0::2]))
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
39,
17,
4,
13,
4,
13,
13,
10,
4,
13,
10,
18,
13,
10,
4,
13
] | [
[
39,
2
],
[
33,
8
],
[
36,
22
],
[
34,
24
],
[
37,
31
],
[
33,
34
],
[
36,
37
],
[
39,
40
]
] | [
"n=int(input())\nl=sorted(list(map(int, input().split())))\nll=l[::2]\nprint(sum(ll))",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"l=sorted(list(map(int, input().split())))",
"l",
"sorted(list(map(int, input().split())))",
"sorted",
"list(map(int, input().split()))",
... | n=int(input())
l=sorted(list(map(int, input().split())))
ll=l[::2]
print(sum(ll)) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
... | [
[
50,
2
],
[
44,
8
],
[
56,
22
],
[
47,
25
],
[
29,
28
],
[
51,
31
],
[
59,
33
],
[
45,
35
],
[
57,
36
],
[
54,
36
],
[
53,
38
],
[
60,
42
],
[
48,
42
],
[
... | [
"n = int(input())\nli = sorted(list(map(int,input().split())))\n\nk=0\ncount =0\nfor i in range(n):\n count += li[k]\n k += 2\n\nprint(count)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"li = sorted(list(map(int,input().split())))",
"li",
"sorted(list(map(int,inpu... | n = int(input())
li = sorted(list(map(int,input().split())))
k=0
count =0
for i in range(n):
count += li[k]
k += 2
print(count)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
18,
... | [
[
46,
2
],
[
10,
9
],
[
9,
18
],
[
49,
20
],
[
52,
23
],
[
50,
26
],
[
58,
28
],
[
32,
31
],
[
47,
34
],
[
55,
36
],
[
53,
38
],
[
50,
38
],
[
31,
40
],
[
5... | [
"n=int(input())\nli=[int(i) for i in input().split()]\n\nli=sorted(li)\nans=0\nfor i in range(n):\n\tans+=li[i*2]\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
... | n=int(input())
li=[int(i) for i in input().split()]
li=sorted(li)
ans=0
for i in range(n):
ans+=li[i*2]
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
2,
13,
17,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
... | [
[
57,
2
],
[
48,
8
],
[
49,
21
],
[
54,
24
],
[
28,
27
],
[
58,
31
],
[
27,
36
],
[
51,
40
],
[
49,
42
],
[
27,
43
],
[
52,
46
],
[
55,
46
],
[
48,
49
],
[
... | [
"N = int(input())\nL = list(map(int, input().split()))\nL.sort()\nans = 0\nfor i in range(N*2):\n if i % 2 == 0:\n ans += L[i]\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = list(map(int, input().split()))",
"L",
"list(map(int, input().split()))",
... | N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N*2):
if i % 2 == 0:
ans += L[i]
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
... | [
[
52,
2
],
[
49,
8
],
[
58,
22
],
[
26,
25
],
[
53,
31
],
[
55,
34
],
[
50,
38
],
[
25,
39
],
[
50,
41
],
[
25,
43
],
[
56,
47
],
[
59,
47
],
[
49,
50
],
[
... | [
"N = int(input())\nL = list(sorted(map(int, input().split())))\n\nans = 0\nfor i in range(0, 2 * N, 2):\n ans += min(L[i], L[i + 1])\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = list(sorted(map(int, input().split())))",
"L",
"list(sorted(map(int, input(... | N = int(input())
L = list(sorted(map(int, input().split())))
ans = 0
for i in range(0, 2 * N, 2):
ans += min(L[i], L[i + 1])
print(ans)
|
[
7,
0,
13,
2,
4,
13,
4,
13,
17,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
13,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
17,
13,
10,
18,
13,
10,
4,
13,
10,
2,
13,
... | [
[
54,
2
],
[
51,
10
],
[
57,
22
],
[
52,
25
],
[
45,
27
],
[
31,
30
],
[
55,
34
],
[
48,
37
],
[
58,
39
],
[
52,
39
],
[
30,
40
],
[
49,
43
],
[
46,
43
],
[
... | [
"n = int(input())*2\narr = list(map(int, input().split()))\narr = sorted(arr)\nsum = 0\nfor i in range(0,n,2):\n sum += arr[i]\nprint(sum)",
"n = int(input())*2",
"n",
"int(input())*2",
"int(input())",
"int",
"input()",
"input",
"2",
"arr = list(map(int, input().split()))",
"arr",
"list(map(i... | n = int(input())*2
arr = list(map(int, input().split()))
arr = sorted(arr)
sum = 0
for i in range(0,n,2):
sum += arr[i]
print(sum) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
39,
28,
13,
13,
4,
18,
13,
13,
18,
13,
13,
4,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
39,
13
] | [
[
42,
2
],
[
45,
8
],
[
46,
21
],
[
48,
24
],
[
28,
27
],
[
49,
31
],
[
46,
34
],
[
27,
35
],
[
49,
40
],
[
42,
43
],
[
45,
46
],
[
48,
49
]
] | [
"n = int(input())\nL = list(map(int, input().split()))\nL.sort()\narray_L = []\nfor m in [i * 2 for i in range(n)]:\n array_L.append(L[m])\nprint(sum(array_L))\n ",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"L = list(map(int, input().split()))",
"L",
"list(map(int, ... | n = int(input())
L = list(map(int, input().split()))
L.sort()
array_L = []
for m in [i * 2 for i in range(n)]:
array_L.append(L[m])
print(sum(array_L))
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
0,
13,
17,
42,
2,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
... | [
[
50,
2
],
[
47,
8
],
[
48,
21
],
[
53,
24
],
[
59,
27
],
[
60,
31
],
[
57,
31
],
[
48,
34
],
[
62,
36
],
[
48,
38
],
[
60,
39
],
[
57,
39
],
[
56,
41
],
[
... | [
"n = int(input())\nl = list(map(int, input().split() ))\nl.sort()\ncount = 0\ni = 0\nwhile i<len(l):\n\tcount+=l[i]\n\ti+=2\nprint(count)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"l = list(map(int, input().split() ))",
"l",
"list(map(int, input().split() ))",
"list",... | n = int(input())
l = list(map(int, input().split() ))
l.sort()
count = 0
i = 0
while i<len(l):
count+=l[i]
i+=2
print(count) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
17,
13,
17,
0,
13,
18,
13,
13,
4,
13,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10... | [
[
53,
2
],
[
10,
9
],
[
9,
18
],
[
56,
20
],
[
57,
24
],
[
50,
27
],
[
31,
30
],
[
54,
36
],
[
47,
39
],
[
57,
41
],
[
30,
42
],
[
48,
45
],
[
51,
45
],
[
4... | [
"N = int(input())\nL = [int(i) for i in input().split()]\nL.sort()\n\nans = 0\nfor i in range(0, 2 * N, 2):\n ans += L[i]\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
... | N = int(input())
L = [int(i) for i in input().split()]
L.sort()
ans = 0
for i in range(0, 2 * N, 2):
ans += L[i]
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
4,
13,
18,
13,
39,
17,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] | [
[
46,
2
],
[
43,
8
],
[
37,
20
],
[
44,
23
],
[
40,
25
],
[
38,
29
],
[
41,
35
],
[
37,
38
],
[
40,
41
],
[
43,
44
],
[
46,
47
]
] | [
"N = int(input())\nL = list(map(int, input().split()))\n \nL_s = sorted(L)\nA = sum(L_s[0::2])\n \nprint(A)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"L = list(map(int, input().split()))",
"L",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
... | N = int(input())
L = list(map(int, input().split()))
L_s = sorted(L)
A = sum(L_s[0::2])
print(A) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
17,
0,
13,
4,
13,
18,
13,
39,
17,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] | [
[
45,
2
],
[
39,
8
],
[
40,
21
],
[
25,
24
],
[
42,
27
],
[
40,
31
],
[
43,
37
],
[
39,
40
],
[
42,
43
],
[
45,
46
]
] | [
"#AGC001A\nN = int(input())\nLs = list(map(int, input().split()))\n\nLs.sort(reverse=True)\nres = sum(Ls[1::2])\n\nprint(res)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"Ls = list(map(int, input().split()))",
"Ls",
"list(map(int, input().split()))",
"list",
"map(int,... | #AGC001A
N = int(input())
Ls = list(map(int, input().split()))
Ls.sort(reverse=True)
res = sum(Ls[1::2])
print(res) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
41,
28,
13,
4,
13,
2,
17,
13,
2,
2,
13,
17,
17,
4,
18,
13,
13,
4,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13
] | [
[
46,
2
],
[
49,
8
],
[
50,
21
],
[
26,
25
],
[
47,
30
],
[
25,
33
],
[
50,
38
],
[
25,
39
],
[
46,
47
],
[
49,
50
]
] | [
"n = int(input())\nl = list(map(int, input().split()))\nl.sort()\nprint(sum([l[i] for i in range(2*n) if i % 2 == 0]))",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"l = list(map(int, input().split()))",
"l",
"list(map(int, input().split()))",
"list",
"map(int, input().... | n = int(input())
l = list(map(int, input().split()))
l.sort()
print(sum([l[i] for i in range(2*n) if i % 2 == 0])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.