QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #706917 | #9531. Weird Ceiling | vanthoci# | TL | 18ms | 10764kb | Python3 | 376b | 2024-11-03 13:57:17 | 2024-11-03 13:57:17 |
Judging History
answer
import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
n = int(input())
fac = []
for i in range(1, int(n**0.5+1)):
if n % i == 0:
fac.append(i)
if i * i != n: fac.append(n//i)
fac.sort()
ans = 1
for i in range(1, len(fac)):
ans += n//fac[i-1] * (fac[i] - fac[i-1])
print(ans)
详细
Test #1:
score: 100
Accepted
time: 7ms
memory: 10728kb
input:
3 5 451 114514
output:
21 10251 7075858
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 18ms
memory: 10764kb
input:
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101...
output:
1 3 7 9 21 16 43 25 37 36 111 41 157 64 71 65 273 73 343 86 113 144 507 101 201 196 163 134 813 137 931 161 221 324 295 169 1333 400 287 205 1641 218 1807 254 277 576 2163 241 589 301 443 326 2757 298 507 317 533 900 3423 315 3661 1024 439 385 625 386 4423 494 737 437 4971 394 5257 1444 551 590 969 ...
result:
ok 1000 lines
Test #3:
score: -100
Time Limit Exceeded
input:
1000 999999001 999999002 999999003 999999004 999999005 999999006 999999007 999999008 999999009 999999010 999999011 999999012 999999013 999999014 999999015 999999016 999999017 999999018 999999019 999999020 999999021 999999022 999999023 999999024 999999025 999999026 999999027 999999028 999999029 99999...
output:
999998001000999001 4675492974858 22093771399719 1039531946480 546491469021 75399989182 37324430219 225494920523 373593911121 479776346214 428075242211 122888183240 72251882365 33004215752 388297141779 54803541045 999998033000967273 1117647749430 2997883122147 28001063474 320813823861 206612366114726...