QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#373428 | #5547. Short Function | ohwphil | WA | 6ms | 9688kb | Python3 | 777b | 2024-04-01 16:52:54 | 2024-04-01 16:52:55 |
Judging History
answer
import sys
MOD=119<<23|1
input=sys.stdin.readline
n,k=map(int,input().split())
*nums,=map(int,input().split())
cum_prod=[1]*(2*n+1)
for i in range(2*n):
cum_prod[i+1]=(cum_prod[i]*nums[i%n])%MOD
def get_qr(p):
global n
# q는 mod MOD-1, r
bq=1//n
br=1%n
accq=1//n
accr=1%n
while p:
if p&1:
bq=(bq*accq*n+br*accq+bq*accr)%(MOD-1)
br=(br*accr)%n
accq=(accq**2*n+2*accq*accr)%(MOD-1)
accr**=2
accr%=n
p>>=1
#print(bq,br,accq,accr)
return (bq,br)
#print(get_qr(5))
cycle,out=get_qr(k)
ans=[pow(cum_prod[n],cycle,MOD)]*n
#print(cum_prod)
for i in range(n):
ans[i]*=cum_prod[i+out]*pow(cum_prod[i],-1,MOD)
ans[i]%=MOD
print(*ans)
詳細信息
Test #1:
score: 0
Wrong Answer
time: 6ms
memory: 9688kb
input:
5 2 1 2 3 4 5
output:
1 2 3 4 5
result:
wrong answer 1st numbers differ - expected: '24', found: '1'