QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #862235 | #9980. Boolean Function Reconstruction | ucup-team121# | WA | 1ms | 3712kb | C++23 | 2.4kb | 2025-01-18 23:12:34 | 2025-01-18 23:12:41 |
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: 100
Accepted
time: 0ms
memory: 3712kb
input:
7 2 0001 2 0111 2 1111 3 00010111 1 10 2 0101 5 00000000000000000000000000000001
output:
Yes (a&b) Yes (a|b) Yes T Yes ((a&(b|c))|(b&c)) No Yes a Yes (a&(b&(c&(d&e))))
result:
ok 7 lines, tightest: 4 out of 14 (7 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3712kb
input:
4 1 00 1 10 1 01 1 11
output:
Yes (a&) No Yes a Yes T
result:
wrong answer invalid expressions 7 (test case 1)