QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #875357 | #9980. Boolean Function Reconstruction | ucup-team5008# | WA | 0ms | 3712kb | C++20 | 1.2kb | 2025-01-29 16:36:55 | 2025-01-29 16:36:55 |
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: 3712kb
input:
7 2 0001 2 0111 2 1111 3 00010111 1 10 2 0101 5 00000000000000000000000000000001
output:
Yes (F|(a&b)) Yes (a|(T&b)) Yes (T|(T&b)) Yes ((F|(a&b))|((a|(T&b))&c)) No Yes (a|(a&b)) Yes ((((F|(F&b))|((F|(F&b))&c))|(((F|(F&b))|((F|(F&b))&c))&d))|((((F|(F&b))|((F|(F&b))&c))|(((F|(F&b))|((F|(a&b))&c))&d))&e))
result:
wrong answer 30 operations, you can't use more than 26 operations (test case 7)