結果

問題 No.1289 RNG and OR
ユーザー Kiri8128
提出日時 2020-11-14 02:46:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 375 ms / 2,000 ms
コード長 2,114 bytes
コンパイル時間 237 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 106,112 KB
最終ジャッジ日時 2024-07-22 22:40:04
合計ジャッジ時間 2,729 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

def or_convolution(A, B):
n = max(len(A), len(B))
X = [0] * (1 << (n - 1).bit_length())
for i, a in enumerate(A):
for j, b in enumerate(B):
X[i|j] += a * b
return X
def and_convolution(A, B):
n = max(len(A), len(B))
X = [0] * (1 << (n - 1).bit_length())
for i, a in enumerate(A):
for j, b in enumerate(B):
X[i&j] += a * b
return X
def zeta_bit(L0): #
k = (len(L0) - 1).bit_length()
n = 1 << k
L = L0[:] + [0] * (n - len(L0))
for i in range(k):
for j in range(n):
if j >> i & 1:
L[j] += L[j^(1<<i)]
return L
def mobius_bit(L0): # zeta_bit
k = (len(L0) - 1).bit_length()
n = 1 << k
L = L0[:] + [0] * (n - len(L0))
for i in range(k):
for j in range(n)[::-1]:
if j >> i & 1:
L[j] -= L[j^(1<<i)]
return L
def zeta_bit_inv(L0): #
k = (len(L0) - 1).bit_length()
n = 1 << k
L = L0[:] + [0] * (n - len(L0))
for i in range(k):
for j in range(n)[::-1]:
if j >> i & 1:
L[j^(1<<i)] += L[j]
return L
def mobius_bit_inv(L0): # zeta_bit_inv
k = (len(L0) - 1).bit_length()
n = 1 << k
L = L0[:] + [0] * (n - len(L0))
for i in range(k):
for j in range(n):
if j >> i & 1:
L[j^(1<<i)] -= L[j]
return L
def popcount_parity(x):
x ^= x >> 1
x ^= x >> 2
x ^= x >> 4
x ^= x >> 8
x ^= x >> 16
return x & 1
def r(a):
for i in range(1, 10001):
if i and a * i % P <= 10000:
return str(a*i%P) + "/" + str(i)
if i and -a * i % P <= 10000:
return str(-(-a*i%P)) + "/" + str(i)
return a
P = 998244353
N = int(input())
A = [int(a) for a in input().split()]
S = sum(A)
iS = pow(S, P - 2, P)
A = [a * iS % P for a in A]
B = zeta_bit(A)
ans = 0
for i, b in enumerate(B[:-1]):
if popcount_parity(i):
ans += pow(B[-1] - b, P - 2, P)
else:
ans -= pow(B[-1] - b, P - 2, P)
print(ans * (-1) ** N % P)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0