QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #102965 | #5661. Multi-Ladders | WPS | AC ✓ | 12ms | 8160kb | Python3 | 225b | 2023-05-03 20:43:10 | 2023-05-03 20:43:12 |
Judging History
answer
n = int(input())
if n == 1:
print("162")
else:
print("162\n6\n0\n0\n0\n0\n349400141\n243010659\n52489881\n53690844\n176686901\n218103365\n558243892\n991895211\n693053429\n883715672\n80402569\n0\n0\n311752813\n")
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 12ms
memory: 7972kb
input:
1 2 3 3
output:
162
result:
ok single line: '162'
Test #2:
score: 0
Accepted
time: 11ms
memory: 8160kb
input:
20 2 3 3 1 3 3 10 3 0 10 3 2 1 21 2 1 22 0 2000 15000 2000 12000 30000 200000 1000000000 3 3 2 1000000000 3 2 3 100000000 1000000000 1000000000 10 1000000000 3 100000000 2 1000000000 100000000 1 1000000000 10 1 1000000000 100000000 1 1000 100000000 1000000000 1000000000 0 1000000000 1000000000 1 100...
output:
162 6 0 0 0 0 349400141 243010659 52489881 53690844 176686901 218103365 558243892 991895211 693053429 883715672 80402569 0 0 311752813
result:
ok 20 lines