QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #855659 | #9980. Boolean Function Reconstruction | ucup-team1878# | WA | 1ms | 3572kb | C++14 | 1.4kb | 2025-01-13 06:30:55 | 2025-01-13 06:30:56 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3572kb
input:
7 2 0001 2 0111 2 1111 3 00010111 1 10 2 0101 5 00000000000000000000000000000001
output:
Yes (F|(a&b)) Yes (b|(a&T)) Yes (T|(a&T)) Yes ((F|(b&c))|(a&(c|(b&T)))) No Yes (F|(a&T)) Yes ((((F|(d&F))|(c&(F|(d&F))))|(b&((F|(d&F))|(c&(F|(d&F))))))|(a&(((F|(d&F))|(c&(F|(d&F))))|(b&((F|(d&F))|(c&(F|(d&e))))))))
result:
wrong answer 30 operations, you can't use more than 26 operations (test case 7)