QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #481649 | #5547. Short Function | kangkunma | TL | 15ms | 10748kb | Python3 | 245b | 2024-07-17 12:21:06 | 2024-07-17 12:21:07 |
Judging History
answer
n,m=map(int,input().split());l=[*map(int,input().split())];M=998244353;x=pow(2,m)//n%(M-1)
f,fi=[1],[1];r=pow(2,m,n)
for i in range(2*n):f+=[f[-1]*l[i%n]%M];fi+=[pow(f[-1],-1,M)]
t=pow(f[n],x,M)
print(*[t*f[(i+r)]*fi[i]%M for i in range(n)])
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 10688kb
input:
5 2 1 2 3 4 5
output:
24 120 60 40 30
result:
ok 5 number(s): "24 120 60 40 30"
Test #2:
score: 0
Accepted
time: 8ms
memory: 10748kb
input:
8 3 12 5 16 14 10 6 9 2
output:
14515200 14515200 14515200 14515200 14515200 14515200 14515200 14515200
result:
ok 8 numbers
Test #3:
score: 0
Accepted
time: 14ms
memory: 10696kb
input:
6 10 3 7 8 2 9 5
output:
56347321 169041963 833775940 811788154 844769833 639990479
result:
ok 6 numbers
Test #4:
score: 0
Accepted
time: 11ms
memory: 10700kb
input:
2 100 1 2
output:
917380677 917380677
result:
ok 2 number(s): "917380677 917380677"
Test #5:
score: 0
Accepted
time: 11ms
memory: 10716kb
input:
1 1 1
output:
1
result:
ok 1 number(s): "1"
Test #6:
score: -100
Time Limit Exceeded
input:
119 1000000000 179906895 883175111 831258723 617910763 41850684 952649819 667608052 992898634 871657688 261948841 858714230 452797779 698675390 39373823 268148685 762575950 789163136 676908074 134428624 583625412 549545785 415007638 564283552 596519552 575204092 884934270 632550339 21505752 66058955...