QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #678831 | #9526. Subsequence Counting | ucup-team132# | WA | 0ms | 3952kb | C++20 | 3.2kb | 2024-10-26 16:14:50 | 2024-10-26 16:14:51 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3952kb
input:
4 2 17 27 3 1 10 3 6 1 10 3 1 1
output:
id=1, pid=1, -27/3 after div 0 4 Poly=4 way = 0 after mul 1 3 Poly=12 4 id=1, pid=2, -17/3 set bit 1 0, by 4 3 0 1 after div 1 3 Poly=4 way = 0 after mul 2 2 Poly=8 8 id=2, pid=1, -27/10 after div 0 4 Poly=2 2 way = 2 after mul 1 3 Poly=6 8 2 id=2, pid=2, -17/10 set bit 2 0, by 2 3 0 1 set bit...
result:
wrong answer 1st lines differ - expected: '76', found: 'id=1, pid=1, -27/3'