ioXDR is a master in logic circuits. One day he comes up with a special logic gate.
It requires 3 input bits a,b,c. It would then make c=c xor (a and b) and remain a and b unchanged, where and means bitwise and and xor means bitwise exclusive or.
ioXDR has a boolean function f(x1,x2,…,xm), where xi∈{0,1} and f(x1,x2,…xm)∈{0,1}.
He wants to design a circuit and could simulate the boolean function.
He has m input bits, and 1 output bit, and some extra bits. The number of extra bits and the initial value of extra bits could be determined freely. The initial value of output bit could also be set freely.
**This problem is judged by SPJ, so any valid answer could be accepted**
m≤8
1815: RXD and logic gates
时间限制: 2 Sec 内存限制: 128 MB提交: 2 解决: 0
[提交][状态][讨论版][命题人:]
题目描述
输入描述
There are several test cases, please keep reading until EOF.
For each test case, the first line consists of an integer m, corresponding to the number of input bits.
For the next 2m lines, there is a string with the length of m, which only consists of 01, and an integer ∈{0,1}, which describes the boolean function.
There are 50 test cases.
For each test case, the first line consists of an integer m, corresponding to the number of input bits.
For the next 2m lines, there is a string with the length of m, which only consists of 01, and an integer ∈{0,1}, which describes the boolean function.
There are 50 test cases.
输出描述
**It is very crucial, please read this part carefully**
For each test case, the first line you need to output an 0,1 integer, which means the initial value of the output bit.
The next line you need to output an integer t, which means the number of the extra bits.
The next t lines, in each line you have to output an 01 integer to describe the initial value of extra bits.
**The input bits are labeled as 1 ~ m, the output bit is labeled as m + 1, the extra bits are labeled as m + 2 ~ m + t + 1**
The next line you need to ouput an integer n, which means the number of logic gates.
The next n lines, in each line you have to give us 3 **different** integers 1≤a,b,c≤m+t+1, which means one logic gate.
**The simulator would simulate from top to bottom**
You have to guarantee that n,t≤800
For each test case, the first line you need to output an 0,1 integer, which means the initial value of the output bit.
The next line you need to output an integer t, which means the number of the extra bits.
The next t lines, in each line you have to output an 01 integer to describe the initial value of extra bits.
**The input bits are labeled as 1 ~ m, the output bit is labeled as m + 1, the extra bits are labeled as m + 2 ~ m + t + 1**
The next line you need to ouput an integer n, which means the number of logic gates.
The next n lines, in each line you have to give us 3 **different** integers 1≤a,b,c≤m+t+1, which means one logic gate.
**The simulator would simulate from top to bottom**
You have to guarantee that n,t≤800
样例输入
1
0 1
1 0
样例输出
1
1
1
1
1 3 2提示
标程有bug，等待处理
来源
-
Anything about this OnlineJudge, Please Contact Administrator. Click add QQ
OJ system based on HUSTOJ Project , UI based on Twitter Bootstrap
Copyright 2016 ACM算法攻关部
cnt: 47980
关于网站改版