QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#380478 | #8565. Basic Blooms | ucup-team1766# | TL | 0ms | 0kb | Python3 | 489b | 2024-04-07 04:36:08 | 2024-04-07 04:36:10 |
answer
from heapq import *
flowers = [0] * 1000000
heap = []
for b in range(2,17):
for d in range(1,b):
heappush(heap, [d, b, d])
for i in range(1,len(flowers)):
v,b,d = heappop(heap)
if v != flowers[i-1]:
flowers[i] = v % 998244353
heappush(heap, [v*b+d, b, d])
for i in range(1,len(flowers)):
flowers[i] = (flowers[i] + flowers[i-1]) % 998244353
t = int(input())
for _ in range(t):
a, b = map(int,input().split())
print(flowers[b]-flowers[a-1])
详细
Test #1:
score: 0
Time Limit Exceeded
input:
3 1 2 1 10 15 2000