input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
print(("Even" if eval(input().replace(" ","*"))%2==0 else "Odd")) | a,b=list(map(int,input().split()))
if a*b%2==0:
print("Even")
else:
print("Odd") | p03455 |
a,b = list(map(int,input().split()))
if (a * b) % 2 == 1:
print("Odd")
else:
print("Even")
| a,b = list(map(int,input().split()))
if a*b % 2 == 1:
print("Odd")
else:
print("Even") | p03455 |
a,b=list(map(int,input().split()))
if a*b%2:
print('Odd')
else:
print('Even') | a,b=list(map(int,input().split()))
if a*b%2==0:
print('Even')
else:
print('Odd') | p03455 |
a,b = input().split()
if (int(a)*int(b))%2==0:
print("Even")
else:
print("Odd") | a,b = list(map(int,input().split()))
print(("Even" if a*b%2==0 else "Odd")) | p03455 |
a,b = list(map(int,input().split()))
print(("Even" if a*b%2==0 else "Odd")) | a,b=list(map(int,input().split()))
print(("Odd" if a*b%2 else "Even")) | p03455 |
a, b = list(map(int, input().split()))
if a%2 == 0 or b%2 == 0:
print("Even")
else:
print("Odd") | a, b = list(map(int, input().split()))
if (a*b)%2 == 0:
print("Even")
else:
print("Odd") | p03455 |
x, y = list(map(int, input().split()))
if x * y % 2:
print('Odd')
else:
print('Even') |
a, b = list(map(int, input().split()))
if (a*b)%2 == 0:
print("Even")
else:
print("Odd") | p03455 |
a,b=list(map(int,input().split()))
def evenodd(a,b):
if a*b%2==1:
return "Odd"
else:
return"Even"
print((evenodd(a,b))) | a,b=list(map(int,input().split()))
if a*b%2==1:
print('Odd')
else:
print('Even') | p03455 |
a,b = list(map(int, input().split()))
c = a * b
if c % 2 == 0:
print("Even")
else:
print("Odd") | a, b = list(map(int, input().split()))
if (a*b % 2) == 0:
print("Even")
else:
print("Odd") | p03455 |
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = list(map(int, input().split()))
c = a * b
if c % 2 == 0:
print("Even")
else:
print("Odd") | i = list(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
print("Even")
else:
print("Odd") | p03455 |
a,b = list(map(int,input().split()))
if (a*b) % 2 == 0:
print('Even')
else:
print('Odd') | a,b = list(map(int,input().split()))
if a*b%2==0:
print('Even')
else:
print('Odd')
| p03455 |
[a, b] = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd") | a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| p03455 |
a, b = list(map(int, input().split()))
print(("Even" if a * b % 2 == 0 else "Odd"))
| a, b = list(map(int, input().split(' ')))
print(("Even" if a % 2 == 0 or b % 2 == 0 else "Odd"))
| p03455 |
a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
print(('Even' if a*b % 2 == 0 else 'Odd')) | p03455 |
for _ in range(10**7*5):None
a,b=list(map(int,input().split()))
print(('EOvdedn'[a*b%2::2])) | print(('EOvdedn'[eval(input().replace(*' *'))%2::2])) | p03455 |
a, b = list(map(int, input().split()))
if (a*b) % 2:
print("Odd")
else:
print("Even") | x = input().split()
a =int(x[0])
b =int(x[1])
if (a*b) % 2:
print("Odd")
else:
print("Even") | p03455 |
x = input().split()
a =int(x[0])
b =int(x[1])
if (a*b) % 2:
print("Odd")
else:
print("Even") | x = input().split()
y = int(x[0])*int(x[1])
if y % 2:
print("Odd")
else:
print("Even") | p03455 |
x = input().split()
y = int(x[0])*int(x[1])
if y%2 == 1:
print("Odd")
else:
print("Even") | a,b = list(map(int,input().split()))
if a*b%2:
print("Odd")
else:
print("Even") | p03455 |
a,b = list(map(int,input().split()))
if (a*b)%2 != 0:
print("Odd")
else:
print("Even")
| a, b = list(map(int, input().split()))
num = a*b
if num % 2==0:
print("Even")
else:
print("Odd") | p03455 |
a, b = list(map(int, input().split()))
if (a*b)%2:
print("Odd")
else:
print("Even")
| a, b = list(map(int, input().split()))
if (a*b)%2 == 1:
print("Odd")
else:
print("Even")
| p03455 |
a, b = list(map(int, input().split())) # 5 7
if (a*b)%2 == 0:
print('Even')
else:
print('Odd')
| a, b = list(map(int, input().split()))
if a%2==0 or b%2==0:
print("Even")
else:
print("Odd")
| p03455 |
a, b = list(map(int, input().split()))
if a*b%2 == 1:
print("Odd")
else:
print("Even") | a, b = list(map(int, input().split()))
print(('Odd'if a&b&1 else 'Even')) | p03455 |
a, b = list(map(int, input().split()))
a = int(a)
b = int(b)
i = a*b
if i%2 == 0:
print('Even')
else:
print('Odd')
| a, b = list(map(int, input().split()))
i = a * b
if i % 2 ==0:
print('Even')
else:
print('Odd') | p03455 |
# -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print('Even')
else:
print('Odd') | # -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
out = ['Even', 'Odd']
print((out[a * b % 2])) | p03455 |
string = input().split(' ')
first = string[0]
second = string[1]
if int(first)*int(second)%2 == 0:
print("Even")
else:
print("Odd") | s = input().split(" ")
a = int(s[0])
b = int(s[1])
if (a*b)%2 == 0:
print("Even")
else:
print("Odd") | p03455 |
def ketanowa(p):
ans=0
p=str(p)
for i in p:
ans+=int(i)
return ans
def main():
temp=input().split(" ")
n=int(temp[0])
a=int(temp[1])
if n*a%2==0:
print("Even")
else:
print("Odd")
if __name__ == '__main__':
main()
| a,b=input().split()
c=int(a)*int(b)
if c%2==0:
print("Even")
else:
print("Odd") | p03455 |
a,b=list(map(int,input().split()))
if a*b % 2 ==0:
print("Even")
else:
print("Odd")
| a,b=list(map(int,input().split()))
if (a*b)%2==0:
print("Even")
else:
print("Odd") | p03455 |
a,b=list(map(int,input().split()))
if a%2==0 or b%2==0:
print("Even")
else:
print("Odd") | a,b = list(map(int,input().split()))
if a%2==1 and b%2==1:
print("Odd")
else:
print("Even") | p03455 |
a = list(map(int, input().split()))
if(a[0] * a[1] % 2 == 0):
print('Even')
else:
print('Odd') | a,b = list(map(int, input().split()))
if(a * b % 2 == 0):
print('Even')
else:
print('Odd') | p03455 |
a,b = list(map(int,input().split()))
ans = 0
if a*b%2==0:
print('Even')
else:
print('Odd')
| R= list(map(int,input().split()))
if R[0] * R[1] % 2 == 0:
print('Even')
else:
print('Odd') | p03455 |
a,b = [int(s) for s in input().split()]
print((('Even', 'Odd')[(a*b)%2]))
| a,b = list(map(int, input().split()))
if ((a*b) % 2):
print('Odd')
else:
print('Even')
| p03455 |
a, b = list(map(int, input().split()))
if a % 2 == 1 and b % 2 == 1:
print("Odd")
else:
print("Even") | def resolve():
a, b = list(map(int, input().split()))
if a % 2 == 1 and b % 2 == 1:
print("Odd")
else:
print("Even")
resolve() | p03455 |
a, b = list(map(int, input().split()))
sum = a*b
if sum % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int,input().split()))
if (a*b) % 2 == 0:
print("Even")
else:
print("Odd") | p03455 |
a, b = list(map(int, input().split()))
if (a * b % 2) == 0:
print('Even')
else:
print('Odd') | a, b = list(map(int, input().split()))
if (a * b) % 2 == 0:
print('Even')
else:
print('Odd') | p03455 |
a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print('Even')
else:
print('Odd') | a, b = list(map(int, input().split()))
print(('Odd' if a * b % 2 == 1 else 'Even')) | p03455 |
a,b = list(map(int, input().split()))
if a*b % 2 == 0:
print("Even")
else:
print("Odd") | a,b = list(map(int, input().split()))
ans = a * b
if ans % 2 == 0:
print("Even")
else:
print("Odd") | p03455 |
a, b = list(map(int, input().split()))
A=(a*b)%2
if A==0:
print("Even")
else:
print("Odd") | a,b=list(map(int,input().split()))
c=(a*b)%2
if c==1:
print('Odd')
else:
print('Even')
| p03455 |
n = int(eval(input()))
x = [int(x) for x in input().split()]
inf = 10**9+7
a = 1
for i in range(n-1, 0, -1):
a *= i
b = a
key = 0
ans = 0
for i in range(n-1):
key += a//(i+1)
key %= inf
ans += key*(x[i+1]-x[i])
ans %= inf
print(ans) | n = int(eval(input()))
x = [int(x) for x in input().split()]
inf = 10**9+7
a = 1
for i in range(n-1, 0, -1):
a *= i
a %= inf
b = a
key = 0
ans = 0
for i in range(n-1):
key += a*pow((i+1), inf-2, inf)
key %= inf
ans += key*(x[i+1]-x[i])
ans %= inf
print(ans) | p02807 |
# modulo:mod
# inverse x^(-1)
def inv(x):
global mod
return pow(x,mod-2,mod)
# factorial x!
def fact(x):
global mod
res=1
for i in range(2,x+1):
res=res*i%mod
return res
# combination nCr
def combi(n,r):
if r<0 or r>n:
return 0
else:
return ... | # modulo:mod
# inverse x^(-1)
def inv(x):
global mod
return pow(x,mod-2,mod)
# factorial x!
def fact(x):
global mod
res=1
for i in range(2,x+1):
res=res*i%mod
return res
# combination nCr
def combi(n,r):
if r<0 or r>n:
return 0
else:
return ... | p02807 |
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())... | #coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())... | p02807 |
import sys
input = sys.stdin.readline
def inv(x):
return pow(x, MOD-2, MOD)
def C(n, r):
return fact[n]//fact[r]//fact[n-r]
N = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
MOD = 10**9+7
fact = [1]
for i in range(1, N):
fact.append(fact[-1]*i)
for i in range(... | N = int(eval(input()))
x = list(map(int, input().split()))
MOD = 10**9+7
D = x[-1]-x[0]
ans = 0
fact = [1]
for i in range(1, N):
fact.append(fact[-1]*i%MOD)
inv_table = [-1]*N
for i in range(N):
inv_table[i] = pow(i, MOD-2, MOD)
for i in range(N-1):
d = D-(x[i]-x[0])
ans += d*fa... | p02807 |
N = int(eval(input()))
x = list(map(int, input().split()))
MOD = 10**9+7
D = x[-1]-x[0]
ans = 0
fact = [1]
for i in range(1, N):
fact.append(fact[-1]*i%MOD)
inv_table = [-1]*N
for i in range(N):
inv_table[i] = pow(i, MOD-2, MOD)
for i in range(N-1):
d = D-(x[i]-x[0])
ans += d*fa... | import sys
input = sys.stdin.readline
def inv(x):
return pow(x, MOD-2, MOD)
N = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
MOD = 10**9+7
fact = [1]
for i in range(1, N+1):
fact.append(fact[-1]*i%MOD)
inv_table = [-1]*(N+1)
for i in range(N+1):
inv_table[i] = inv(... | p02807 |
class Factorial():
def __init__(self, n, mod):
self.mod = mod
self.factorial = [0 for _ in range(n + 1)]
self.inv = [0 for _ in range(n + 1)]
self.factorial[0] = 1
self.inv[0] = 1
for i in range(n):
self.factorial[i + 1] = self.factorial[i] * (i + ... | class Factorial():
def __init__(self, n, mod):
self.mod = mod
self.factorial = [0 for _ in range(n + 1)]
self.inv = [0 for _ in range(n + 1)]
self.factorial[0] = 1
self.inv[0] = 1
for i in range(n):
self.factorial[i + 1] = self.factorial[i] * (i + ... | p02807 |
import sys
input = sys.stdin.readline
mod = 10**9+7
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
D = [0 for i in range(N)]
for i in range(N-1):
D[i] = X[i+1] - X[i]
import math
n = math.factorial(N-1)
ans = 0
r = 0
for i in r... | import sys
import math
input = sys.stdin.readline
mod = 10**9+7
def main():
N = int(eval(input()))
r1 = [1]
for i in range(N-1):
r1.append(r1[i] * (i+1) % mod)
r2 = [1]
for i in range(N-1):
r2.append(r2[i] * (N-1-i) % mod)
X = list(map(int, input().split()))
... | p02807 |
import sys
import math
input = sys.stdin.readline
mod = 10**9+7
def main():
N = int(eval(input()))
r1 = [1]
for i in range(N-1):
r1.append(r1[i] * (i+1) % mod)
r2 = [1]
for i in range(N-1):
r2.append(r2[i] * (N-1-i) % mod)
X = list(map(int, input().split()))
... | import sys
input = sys.stdin.readline
mod = 10**9+7
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
r1 = [1]
r2 = [1]
for i in range(N-1):
r1.append(r1[i] * (i+1) % mod)
r2.append(r2[i] * (N-1-i) % mod)
r2.reverse()
ans = 0
r ... | p02807 |
import math
n = int(eval(input()))
x = list(map(int, input().split()))
d = [x[i+1] - x[i] for i in range(n - 1)]
def fact(m):
return m * fact(m-1) % 1000000007 if m != 1 else 1
fact_n_1 = math.factorial(n-1)
e = [None] * (n-1)
for i in range(n-1):
if i == 0:
e[i] = fact_n_1
else:
e[i]... | import sys
sys.setrecursionlimit(1000000)
n = int(eval(input()))
x = list(map(int, input().split()))
d = [x[i+1] - x[i] for i in range(n - 1)]
def pow(x, y):
if y == 0:
return 1
ans = 1
while y > 1:
if y % 2 != 0:
ans *= x
ans %= 1000000007
x ... | p02807 |
MOD=10**9+7
N=int(eval(input()))
x=list(map(int, input().split()))
y=[x[i+1]-x[i] for i in range(N-1)]
upp=[1]*(N+1)
for i in range(2, N+1):
upp[i]=upp[i-1]*i
upp[i]%=MOD
N_1=N-1
b=[0]*(N_1)
b[0]=upp[N_1]
tmp=upp[N_1]
for i in range(1, N_1):
a=tmp*pow(i+1, MOD-2, MOD)%MOD
b[i]=(b[i-1]+a)%MO... | MOD=10**9+7
N=int(eval(input()))
x=list(map(int, input().split()))
y=[x[i+1]-x[i] for i in range(N-1)]
upp=1
for i in range(2, N):
upp*=i
upp%=MOD
N_1=N-1
b=[0]*(N_1)
b[0]=upp
tmp=upp
out=b[0]*y[0]%MOD
for i in range(1, N_1):
a=tmp*pow(i+1, MOD-2, MOD)%MOD
b[i]=(b[i-1]+a)%MOD
out+=b[i]*... | p02807 |
# -*- coding: utf-8 -*-
# dwacon6th-prelims/dwacon6th_prelims_b
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s(... | # -*- coding: utf-8 -*-
# dwacon6th-prelims/dwacon6th_prelims_b
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s(... | p02807 |
mod = 10**9 + 7
n = int(eval(input()))
lx = list(map(int, input().split()))
from math import factorial as kj
d = 0
ans = 0
for i in range(1, n):
d = (d * i + kj(i-1)) % mod
ans = (ans * i + (lx[i] - lx[i-1]) * d) % mod
print(ans) | mod = 10**9 + 7
n = int(eval(input()))
lx = list(map(int, input().split()))
d = 0
ans = 0
for i in range(1, n):
f = 1 if i == 1 else f * (i-1) % mod
d = (d * i + f) % mod
ans = (ans * i + (lx[i] - lx[i-1]) * d) % mod
print(ans) | p02807 |
mod = 10**9 + 7
n = int(eval(input()))
l = list(map(int, input().split()))
d = 0
ans = 0
for i in range(1, n):
f = 1 if i == 1 else f * (i-1) % mod
d = d * i + f
ans = (ans * i + (l[i] - l[i-1]) * d) % mod
print(ans) | mod = 10**9 + 7
n = int(eval(input()))
l = list(map(int, input().split()))
d, ans = 0, 0
for i in range(1, n):
f = 1 if i == 1 else f * (i-1) % mod
d = (d * i + f) % mod
ans = (ans * i + (l[i] - l[i-1]) * d) % mod
print(ans) | p02807 |
mod = 10**9 + 7
n = int(eval(input()))
l = list(map(int, input().split()))
d, ans = 0, 0
for i in range(1, n):
f = 1 if i == 1 else f * (i-1) % mod
d = (d * i + f) % mod
ans = (ans * i + (l[i] - l[i-1]) * d) % mod
print(ans) | m = 10**9 + 7
n = int(eval(input()))
l = list(map(int, input().split()))
f = 1
d = 0
A = 0
for i in range(1, n):
d = (d*i + f) % m
A = (A*i + (l[i]-l[i-1])*d) % m
f = f*i % m
print(A) | p02807 |
import sys
sys.setrecursionlimit(10**6)
def mod_inverse(n, mod=10**9+7):
return pow(n, mod-2, mod)
def combination(n, k, mod=10**9+7):
numer = denom = 1
for i in range(k):
numer = (numer * (n-i)) % mod
denom = (denom * (i+1)) % mod
return (numer * mod_inverse(denom, mod)... | from math import factorial
mod = 10**9+7
N = int(eval(input()))
x = [0] + list(map(int, input().split()))
ans = 0
inv = [0] + [pow(i, mod-2, mod) for i in range(1, N)]
for k in range(2, N):
ans = (ans + x[k] * (1 - inv[k])) % mod
for k in range(1, N-1):
ans = (ans - x[k] * (1 - inv[N-k])) % mod
... | p02807 |
'''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
m... | '''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
m... | p02807 |
mod = 10**9+7
N = int(eval(input()))
x = list(map(int,input().split()))
fact = [1]*(N+1)
for i in range(N):
fact[i+1] = (i+1)*fact[i]
fact[i+1] %= mod
inv = [1]*(N+1)
for i in range(N):
inv[i] = pow(i,mod-2,mod)
x1 = []
for m in range(1,N-1):
x1.append(x[m]*m*inv[m+1]%mod)
x2 = []
for n ... | mod = 10**9+7
N = int(eval(input()))
x = list(map(int,input().split()))
ans = 0
for j in range(1,N-1):
ans += x[j]*j*pow(j+1,mod-2,mod)
ans %= mod
for i in range(N-2):
ans += x[i]*(-N+i+2)*pow(N-i-1,mod-2,mod)
ans %= mod
for i in range(N-1):
ans += (x[N-1]-x[i])*pow(N-1-i,mod-2,mod)
... | p02807 |
MOD=10**9+7
N=int(eval(input()))
xlist=list(map(int,input().split()))
inv_table = [0]+[1]
for i in range(2,N+1):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
fact_nm1=1
for i in range(1,N):
fact_nm1*=i
fact_nm1%=MOD
#print(fact_nm1)
answer=0
for i in range(N-1):
for j in range(i+1,N-1):
... | MOD=10**9+7
N=int(eval(input()))
xlist=list(map(int,input().split()))
fact_nm1=1
for i in range(1,N):
fact_nm1*=i
fact_nm1%=MOD
#print(fact_nm1)
answer_bunshi=0
answer_bumbo=1
inv_bunshi=0
inv_bumbo=1
for i in range(1,N):
inv_bunshi=(i*inv_bunshi+inv_bumbo)%MOD
inv_bumbo=(inv_bumbo*i)%MOD
... | p02807 |
n=int(eval(input()));a=list(map(int,input().split()));mod=10**9+7;x=m=1;z=0
for i in range(2,n):x=m=m*i%mod
for i in range(n):z=z+x*(a[i]-a[i-1])%mod;x=x+m*pow(i+1,mod-2,mod)%mod
print((z%mod)) | N,*X=list(map(int,open(0).read().split()));M,g,q,r=10**9+7,1,[1,1],0
for i in range(1,N):r,g=(r+q[-1]*(X[-1]-X[i-1]))%M,g*i%M;q+=[M//(-~i)*-q[M%(-~i)]%M]
print((r*g%M)) | p02807 |
mod = 10**9+7
# N = 15
N = int(eval(input()))
xx = list(map(int, input().split()))
a = 1
for i in range(2,N):
a *= i
# a %= mod
aa = [a]
for i in range(N-2):
aa.append((aa[-1]+a*pow(i+2,mod-2,mod))%mod)
dx = [xx[i]-xx[i-1] for i in range(1,N)]
ans = 0
for a,d in zip(aa,dx):
ans... | mod = 10**9+7
# N = 15
N = int(eval(input()))
xx = list(map(int, input().split()))
a = 1
for i in range(2,N):
a *= i
a %= mod
aa = [a]
for i in range(N-2):
aa.append((aa[-1]+a*pow(i+2,mod-2,mod))%mod)
dx = [xx[i]-xx[i-1] for i in range(1,N)]
ans = 0
for a,d in zip(aa,dx):
ans +... | p02807 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
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_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
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_replacement, produc... | p02807 |
from fractions import Fraction
n=int(eval(input()))
x=list(map(int,input().split()))
ans=0
for i in range(n):
ans=(ans+(x[-1]-x[i])*(Fraction(1,i+1)))%(10**9+7)
for i in range(1,n):
ans=ans*i%(10**9+7)
print(ans)
| import math
n=int(eval(input()))
a=list(map(int,input().split()))
ans=math.factorial(n-1)%(10**9+7)
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
c=0
for i in range(1,n):
c+=(a[-1]-a[i-1])*modinv(i, mod=10**9+7)
print((ans*c%(10**9+7)))
| p02807 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | p02807 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
if N > 2000:
print((0))
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 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用... | N = int(eval(input()))
A = [int(a) for a in 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 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1... | p02807 |
N = int(eval(input()))
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
f = [1]
for i in range(1,N+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = 0
l = [0] + [(((comb(N-1,2+i) * f[N-(3+i)]) % mod) * f[i]) % mod f... | N = int(eval(input()))
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
c = [1]
for i in range(1,N-1):
c.append(c[i-1]+pow(i+1,mod-2,mod))
ans = 0
for i in range(N-1):
ans += (c[i] * (x[i+1] - x[i])) % mod
ans %= mod
for i in range(1,N):
ans *= i
ans %= mod
print(ans) | p02807 |
n = int(eval(input()))
x = list(map(int, input().split()))
r = 10 ** 9 + 7
a = [1]
p = 1
for i in range(1, n - 1):
p *= i
q = p + a[0] * (i + 1)
a = [q] + a
ans = (x[n - 1] - x[n - 2]) * a[0]
ans %= r
k = n - 1
for i in range(2, n):
ans += (x[n - i] - x[n - i - 1]) * a[i - 1] * k
ans... | n = int(eval(input()))
x = list(map(int, input().split()))
r = 10 ** 9 + 7
p = 1
for i in range(1,n):
p *= i
f = x[n - 1]
ans = 0
for i in range(n-1):
ans += (f - x[i]) * p
ans %= r
p = p * (i + 1) // (i + 2)
print(ans) | p02807 |
N = int(eval(input()))
X = list(map(int,input().split()))
S = []
dp = [1]
mod = 10**9+7
for i in range(N):
t = i+1
dp.append(dp[i]*t)
W = []
for i in range(1,N):
y = dp[N-1]//i
y % mod
W.append(y)
ans = 0
for i in range(N-1):
x = X[i]
S.append(X[N-1]-x)
ans = 0
for i in ran... | N = int(eval(input()))
X = list(map(int,input().split()))
S = []
dp = [1]
mod = 10**9+7
for i in range(N):
t = i+1
dp.append(dp[i]*t%mod)
def power(a,b):
if b == 0:
return 1
if b % 2 == 0:
d = power(a,b//2)
return d*d%mod
elif b % 2 == 1:
return a*power... | p02807 |
import sys
input = sys.stdin.readline
from fractions import Fraction
def main():
N = int(eval(input()))
x = [int(i) for i in input().split()]
MOD = 10**9+7
answer = 0
frac = 0
for i in range(N-1):
frac += Fraction(1,i+1)
dist = (x[i+1] - x[i]) % MOD
ans... | import sys
input = sys.stdin.readline
# 1~nまでの逆元(mod m) O(n)
def mod_inv_list(n:int, m:int):
# inv_t[i]: iの法mの下での逆元
inv_t = [0] + [1]
for i in range(2,n):
inv_t += [inv_t[m % i] * (m - m//i) % m]
return inv_t
def main():
N = int(eval(input()))
x = [int(i) for i in input().... | p02807 |
from functools import reduce
# https://atcoder.jp/contests/dwacon6th-prelims/submissions/9425560
# 部分点解法
def main():
from functools import reduce
MOD = 10 ** 9 + 7
n = int(eval(input()))
*x, = list(map(int, input().split()))
fact = [1]
for i in range(1, n + 1):
fact.appe... | from functools import reduce
# 部分点
def main():
from functools import reduce
MOD = 10 ** 9 + 7
n = int(eval(input()))
*x, r = list(map(int, input().split()))
dist_to_r_edge = [r - x_ for x_ in x]
ret = reduce(
lambda a, b: (a + b) % MOD,
(
d * pow(i... | p02807 |
from functools import reduce
# 部分点
def main():
from functools import reduce
MOD = 10 ** 9 + 7
n = int(eval(input()))
*x, r = list(map(int, input().split()))
dist_to_r_edge = [r - x_ for x_ in x]
ret = reduce(
lambda a, b: (a + b) % MOD,
(
d * pow(i... | from functools import reduce
def build_cumsum_invs(ub, mod):
ret = [0]
t = 0
for i in range(1, ub + 1):
t = (t + pow(i, mod - 2, mod)) % mod
ret.append(t)
return ret
def main():
from functools import reduce
MOD = 10 ** 9 + 7
n = int(eval(input()))
*x, =... | p02807 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02807 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in in... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in in... | p02807 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in in... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in in... | p02807 |
import math
import sys
input = sys.stdin.readline
N = int(eval(input()))
x = list(map(int,input().split()))
d = [0]*(N-1)
for i in range(N-1):
d[i] = x[i+1]-x[i]
d[i] %= 10**9+7
kaijou = 1
for i in range(1,N):
kaijou *= i%(10**9+7)
#kaijou = math.factorial(N-1)%(10**9+7)
ans=0
x=0
k=... | import math
import sys
input = sys.stdin.readline
N = int(eval(input()))
x = list(map(int,input().split()))
mod = 10**9+7
d = [0]*(N-1)
for i in range(N-1):
d[i] = x[i+1]-x[i]
d[i] %= mod
kaijou = 1
for i in range(1,N):
kaijou *= i
kaijou %= mod
ans=0
x=0
def pow_r(x, n)... | p02807 |
import math
import sys
input = sys.stdin.readline
N = int(eval(input()))
x = list(map(int,input().split()))
mod = 10**9+7
d = [0]*(N-1)
for i in range(N-1):
d[i] = x[i+1]-x[i]
d[i] %= mod
kaijou = 1
for i in range(1,N):
kaijou *= i
kaijou %= mod #これをしないとkaijouが発散
ans=0
x=0
... | import math
import sys
input = sys.stdin.readline
N = int(eval(input()))
x = list(map(int,input().split()))
mod = 10**9+7
d = [0]*(N-1)
for i in range(N-1):
d[i] = x[i+1]-x[i]
d[i] %= mod
kaijou = 1
for i in range(1,N):
i %= mod
kaijou *= i
kaijou %= mod #これをしないとkaijouが発散
... | p02807 |
import math
n = int(eval(input()))
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
fac = math.factorial(n - 1)
def pow(n, p):
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
... | import math
n = int(eval(input()))
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
fac = math.factorial(n - 1) % mod
def pow(n, p):
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p ... | p02807 |
import sys
from itertools import count, accumulate
from operator import mul
from functools import reduce
lines = sys.stdin.readlines()
positions = [int(i) for i in lines[1].split(' ')]
distances = [ j - i for i, j in zip(positions, positions[1:])]
n = len(distances)
factorials = [1] + list(accumulate(list... | import sys
from itertools import count, accumulate
from operator import mul
from functools import reduce
lines = sys.stdin.readlines()
positions = [int(i) for i in lines[1].split(' ')]
distances = [ j - i for i, j in zip(positions, positions[1:])]
n = len(distances)
factorials = [1] + list(accumulate(list... | p02807 |
import sys
from itertools import count, accumulate
from operator import mul
from functools import reduce
lines = sys.stdin.readlines()
positions = [int(i) for i in lines[1].split(' ')]
distances = [ j - i for i, j in zip(positions, positions[1:])]
n = len(distances)
factorials = [1] + list(accumulate(list... | import sys
from itertools import count, accumulate
from operator import mul
from functools import reduce
lines = sys.stdin.readlines()
positions = [int(i) for i in lines[1].split(' ')]
distances = [ j - i for i, j in zip(positions, positions[1:])]
n = len(distances)
p = pow(10,9) + 7
factorials = [1] +... | p02807 |
# 二項係数を"やるだけ"にしてくれるライブラリ
MAX = 510000
MOD = 1000000007
factrial = [0]*MAX
inverse = [0]*MAX
factrial_inverse = [0]*MAX
# テーブルを作る前処理
def COMinit():
global factrial, inverse, factrial_inverse
factrial[0] = 1
factrial[1] = 1
inverse[1] = 1
factrial_inverse[0] = 1
factrial_inverse[1... | # 二項係数を"やるだけ"にしてくれるライブラリ
MAX = 100005
MOD = 1000000007
factrial = [0]*MAX
inverse = [0]*MAX
factrial_inverse = [0]*MAX
# テーブルを作る前処理
def COMinit():
global factrial, inverse, factrial_inverse
factrial[0] = 1
factrial[1] = 1
inverse[1] = 1
factrial_inverse[0] = 1
factrial_inverse[1... | p02807 |
n = int(eval(input()))
x = list(map(int, input().split()))
d = []
for x1, x2 in zip(x, x[1:]):
d.append(x2 - x1)
mod = 10 ** 9 + 7
base = 1
for i in range(1, n):
base *= i
ans = 0
b = base
for i, di in enumerate(d):
ans += (base * di) % mod
ans %= mod
base += b // (i + 2)
base % ... | n = int(eval(input()))
x = list(map(int, input().split()))
d = []
for x1, x2 in zip(x, x[1:]):
d.append(x2 - x1)
mod = 10 ** 9 + 7
base = 1
P = 10**9 + 7
N = n+2
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
for i in range(1, n):
base *= i
base %= mo... | p02807 |
MOD = 10**9+7
n = int(eval(input()))
F = [1]*(n+1)
for i in range(n):
F[i+1] = F[i]*(i+1) % MOD
X = list(map(int, input().split()))
D = [X[i+1]-X[i] for i in range(n-1)]
T = [1]*n
for i in range(2, n):
T[i] = T[i-1]*i+F[i-1]
T[i] %= MOD
t = 1
for i in range(1, n-1):
t *= (n-i) % MOD
T[n-1-i] *= ... | MOD = 10**9+7
n = int(eval(input()))
F = [1]*(n+1)
for i in range(n):
F[i+1] = F[i]*(i+1)
F[i+1] %= MOD
X = list(map(int, input().split()))
D = [X[i+1]-X[i] for i in range(n-1)]
T = [1]*n
for i in range(2, n):
T[i] = T[i-1]*i+F[i-1]
T[i] %= MOD
t = 1
for i in range(1, n-1):
t *= (n-i)
t %= MO... | p02807 |
N = int(eval(input()))
X = list(map(int,input().split()))
MOD = 10**9+7
MAXN = N+5
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
c = 0
f = ... | N = int(eval(input()))
X = list(map(int,input().split()))
Y = [b-a for a,b in zip(X,X[1:])]
MOD = 10**9+7
MAXN = N+5
fac = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
ans = m = 0
for i,y in enumerate(Y):
... | p02807 |
class PERM_COMB_MOD():
def __init__(self, max_n=510000, mod=10**9+7):
self.fac = [0]*max_n
self.finv = [0]*max_n
self.inv = [0]*max_n
self.fac[0] = self.fac[1] = 1
self.finv[0] = self.finv[1] = 1
self.inv[1] = 1
self.max = max_n
self.mod = mod... | class PERM_COMB_MOD():
def __init__(self, max_n=510000, mod=10**9+7):
self.fac = [0]*max_n
self.finv = [0]*max_n
self.inv = [0]*max_n
self.fac[0] = self.fac[1] = 1
self.finv[0] = self.finv[1] = 1
self.inv[1] = 1
self.max = max_n
self.mod = mod... | p02807 |
#----------------------------------------------------------
P = 10**9 + 7
N = 100001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i... | #----------------------------------------------------------
P = 10**9 + 7
N = 100001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i... | p02807 |
MOD = 10 ** 9 + 7
N = int(eval(input()))
x = list(map(int, input().split()))
x.sort()
kaijo = [1]
for i in range(1, N):
kaijo.append(kaijo[-1] * i)
ans = 0
for i in range(N - 1):
ans = (ans * (i + 1) + (x[-1] - x[i]) * kaijo[i]) % MOD
print(ans) | MOD = 10 ** 9 + 7
N = int(eval(input()))
x = list(map(int, input().split()))
x.sort()
kaijo = [1]
for i in range(1, N):
kaijo.append(kaijo[-1] * i % MOD)
ans = 0
for i in range(N - 1):
ans = (ans * (i + 1) + (x[-1] - x[i]) * kaijo[i]) % MOD
print(ans) | p02807 |
n, *x = list(map(int, open(0).read().split()))
mod = 10 ** 9 + 7
y = []
for i in range(n - 1):
y.append(x[i + 1] - x[i])
fac = [1] * (n + 1)
for i in range(1, n):
fac[i] = fac[i - 1] * i % mod
dp = [0] * n
ans = 0
p = 0
for i in range(n - 1):
p = (p + pow(i + 1, mod - 2, mod))
ans... | n, *x = list(map(int, open(0).read().split()))
mod = 10 ** 9 + 7
fac = [1] * n
for i in range(1, n):
fac[i] = fac[i - 1] * i % mod
ans = 0
p = 0
for i in range(n - 1):
p = (p + pow(i + 1, mod - 2, mod))
ans = (ans + p * (x[i + 1] - x[i])) % mod
print((ans * fac[n - 1] % mod))
| p02807 |
n = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
p = 1
for i in range(1, n):
p *= i
for i in range(n-1):
ans += (x[n-1]-x[i])*p//(i+1)
ans %= 1000000007
print(ans) | n = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
mod = 1000000007
p = 1
for i in range(1, n):
p *= i
p %= mod
for i in range(n-1):
ans += (x[n-1]-x[i])*pow(i+1, mod-2, mod)
ans *= p
ans %= 1000000007
print(ans) | p02807 |
import sys
from fractions import Fraction
from math import factorial
rl = sys.stdin.readline
def solve():
N = int(rl())
x = list(map(int, rl().split()))
MOD = 10 ** 9 + 7
acc = [Fraction(0)] * N
for i in range(1, N):
acc[i] = acc[i - 1] + Fraction(1, i)
ans =... | import sys
from math import factorial
rl = sys.stdin.readline
def mod_div(x, y, mod=10 ** 9 + 7):
return x * pow(y, mod - 2, mod) % mod
def solve():
N = int(rl())
x = list(map(int, rl().split()))
MOD = 10 ** 9 + 7
acc = [0] * N
k = factorial(N - 1)
for i in range(1... | p02807 |
N = int(eval(input()))
Xs = [0] + list(map(int, input().split()))
mod = 10**9 + 7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
NNN = (10**6)
g1 = [1, 1]
inverse = [0, 1]
for i in range( 2, NNN + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mo... | N = int(eval(input()))
Xs = list(map(int, input().split()))
mod = 10**9 + 7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
NNN = (10**6)
g1 = [1, 1]
inverse = [0, 1]
for i in range( 2, NNN + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
mxx... | p02807 |
N = int(eval(input()))
Xs = list(map(int, input().split()))
mod = 10**9 + 7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
NNN = (10**6)
g1 = [1, 1]
inverse = [0, 1]
for i in range( 2, NNN + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
mxx... | N,*X=list(map(int,open(0).read().split()))
M,g,q,r=10**9+7,1,[1,1],0
for i in range(1,N):
r,g=(r+q[-1]*(X[-1]-X[i-1]))%M,g*i%M
q+=[M//(-~i)*-q[M%(-~i)]%M]
print((r*g%M)) | p02807 |
N,*X=list(map(int,open(0).read().split()));M,g,r,h,i=10**9+7,1,0,[1],N;exec("i-=1;h+=[h[-1]*i%M];"*N+"r,g=(r+g*h[N-2-i]*(X[-1]-X[i]))%M,g*-~i%M;i+=1;"*N);print(r) | N,*X=list(map(int,open(0).read().split()));M,g,r,h,i=10**9+7,1,0,[1],N
while i:i-=1;h+=[h[-1]*i%M]
while i<N:r,g=(r+g*h[N-2-i]*(X[-1]-X[i]))%M,g*-~i%M;i+=1
print(r) | p02807 |
n = int(eval(input()))
x = list( map(int, input().split()))
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
#[x,y]
return [w[0],w[1]]
def mod_inv(a,mod):
... | n = int(eval(input()))
x = list( map(int, input().split()))
MOD = 10**9 + 7
def make_mod_inv(l,p): # lまでの逆元を作る
mod_inv = [0, 1] + [0] * (l+3) # inv[n] = n^(-1) mod p, 0! = 1 だけど便宜上inv[0]=0にしてる
for i in range(2, l+5):
mod_inv[i] = -mod_inv[p % i] * (p // i) % p
return mod_inv
mod_inv = ma... | p02807 |
def per(n, r, mod):
if ( r<0 or r>n ):
return 0
r=n-r
return g1[n] * g2[r] % mod
mod = 10**9+7 #出力の制限
N = 10**5+5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[m... | n=int(eval(input()))
x=list(map(int,input().split()))
a=1
B=[1,1]
mod=10**9+7
for i in range(2,n):
a=a*i%mod
B.append(pow(i,mod-2,mod))
d=[0]*(n-1)
for i in range(n-1):
d[i]=x[i+1]-x[i]
D=[d[-1]]
for i in range(n-2):
D.append(D[-1]+d[-2-i])
D=D[::-1]
ans=0
for i in range(n-1):
ans=(ans+D[i]*a... | p02807 |
N = int(eval(input()))
A = list(map(int, input().split()))
mod = int(1e+9 + 7)
p = mod - 2
S = []
while p != 0:
S = [p%2] + S[:]
p //= 2
frac = 1
for i in range(N - 1):
frac *= i+1
frac %= mod
T = 0
for i in range(N - 1):
k = 1
for j in range(len(S)):
if S[j] == 1:
k *= i+1
... | N = int(eval(input()))
A = list(map(int, input().split()))
mod = int(1e+9 + 7)
def inved(a):
x, y, u, v, k, l = 1, 0, 0, 1, a, mod
while l != 0:
x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
k, l = l, k % l
return x
frac = 1
for i in range(N - 1):
frac *= i+1
frac %= mod
T = 0
... | p02807 |
import sys
import bisect
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
odd = a[::2]
even = a[1::2]
odd.sort()
even.sort()
ans = 0
for i, v in enumerate(odd):
ans += bisect.bisect(even... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = [[int(eval(input())), i] for i in range(n)]
a.sort()
ans = 0
for i in range(n):
if i%2 != a[i][1]%2:
ans += 1
print((ans//2))
if __name__ == "__main__":
main()
| p04021 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
B = tuple(sorted(A))
ans = 0
skip_flag = False
for i in range(N):
if skip_flag == False:
idx = A.index(B[i])
if abs(i - idx) % 2 == 0: # あまり０なら操作２だけで所定の位置に動かせる
continue
else:
ans += 1
... | import math
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
idx_A = {}
for i in range(N):
idx_A[A[i]] = i
B = tuple(sorted(A))
"""
ソート後の位置までの距離が奇数だと操作１が一回必要になる
一度の操作１で最大で２個までのソート後の位置までの距離が奇数のものを偶数にずらしてあげられる
ので、正しい位置までの距離が奇数のものの個数をしらべて、最小の操作１の回数を求める
"""
cnt = 0
for i in range... | p04021 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
D = {a:i for i,a in enumerate(sorted(A))}
A = [D[A[i]] for i in range(N)]
odd = [A[i] for i in range(N) if i%2 == 0]
even = [A[i] for i in range(N) if i%2 == 1]
odd.sort()
even.sort()
B = []
for i in range(N):
if i%2 == 0:
... | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
D = {a:i for i,a in enumerate(sorted(A))}
A = [D[A[i]] for i in range(N)]
count = 0
for i in range(N):
if i%2 == 0 and A[i]%2 != 0:
count += 1
print(count) | p04021 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n = int(readline())
a = [int(readline()) for i in range(n)]
k = [ai for i,ai in enumerate(a) if i%2 == 0]
g = [ai for i,ai in enumerate(a) if i%2 == 1]
k.sort()
g.sort()
ans = 0
from bisect import insort
from collections import de... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n = int(readline())
a = [int(readline()) for i in range(n)]
k = [ai for i,ai in enumerate(a) if i%2 == 0]
k = set(k)
a.sort()
ans = 0
for i,ai in enumerate(a):
if ai in k and i%2 == 1:
ans += 1
print(ans) | p04021 |
n = int(eval(input()))
a = [int(eval(input()))for _ in range(n)]
o = a[::2]
e = a[1::2]
o.sort()
e.sort()
l = [0] * n
for i in range(n):
if i % 2 == 0:
l[i] = o[i // 2]
else:
l[i] = e[(i - 1) // 2]
ans = 0
for _ in range(n):
for i in range(n - 1):
if l[i] > l[i + 1]:
ans += 1
... | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
d = [{x: 0 for x in a} for _ in range(2)]
b = sorted(a)
for i in range(n):
if i % 2:
d[0][a[i]] += 1
d[1][b[i]] += 1
t1 = 0
t2 = 0
for v1, v2 in zip(list(d[0].values()), list(d[1].values())):
if v1 > v2:
t1 += ... | p04021 |
#!/usr/bin/env python3
#AGC3 C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | #!/usr/bin/env python3
#AGC3 C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | p04021 |
import sys
from collections import defaultdict
input = sys.stdin.readline
def main():
N = int( eval(input()))
A = [ int( eval(input())) for _ in range(N)]
B = sorted(A)
d = defaultdict( int)
for i in range(N):
d[B[i]] = i
odd = 0
for i in range(N):
if (i+1)%2 == d... | # import sys
from collections import defaultdict
# input = sys.stdin.readline
def main():
N = int( eval(input()))
A = [ int( eval(input())) for _ in range(N)]
B = sorted(A)
d = defaultdict( int)
for i in range(N):
d[B[i]] = i
odd = 0
for i in range(N):
if (i+1)%2 ... | p04021 |
n = int(eval(input()))
nums = [int(eval(input())) for _ in range(n)]
standard = nums[:]
standard.sort()
ans = 0
for i in range(n):
p = nums[i]
x = standard.index(p)
if abs(x - i) % 2 == 1:
ans += 1
print((ans // 2)) | n = int(eval(input()))
nums = [[int(eval(input())), i] for i in range(n)]
nums.sort()
ans = 0
for i in range(n):
if abs (i - nums[i][1]) % 2 == 1:
ans += 1
print((ans // 2)) | p04021 |
from heapq import heappop, heappush
N = int(eval(input()))
idx = {}
A = []
ans = 0
for i in range(N):
a = int(eval(input()))
idx[a] = i%2
heappush(A,a)
for i in range(N):
x = heappop(A)
if idx[x] != i%2:
ans += 1
print((ans//2)) | from heapq import heappop, heappush
N = int(eval(input()))
A = []
memo = {}
count = 0
for i in range(N):
a = int(eval(input()))
if i%2 == 1:
memo[a] = 1
else:
memo[a] = 0
heappush(A,a)
for i in range(N):
x = heappop(A)
if i%2 != memo[x]:
count += 1
print((count//2)) | p04021 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.