mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 09:10:16 +00:00
41 lines
1.0 KiB
Python
41 lines
1.0 KiB
Python
|
"""
|
||
|
An NIMPLY Gate is a logic gate in boolean algebra which results to 0 if
|
||
|
either input 1 is 0, or if input 1 is 1, then it is 0 only if input 2 is 1.
|
||
|
It is false if input 1 implies input 2. It is the negated form of imply
|
||
|
|
||
|
Following is the truth table of an NIMPLY Gate:
|
||
|
------------------------------
|
||
|
| Input 1 | Input 2 | Output |
|
||
|
------------------------------
|
||
|
| 0 | 0 | 0 |
|
||
|
| 0 | 1 | 0 |
|
||
|
| 1 | 0 | 1 |
|
||
|
| 1 | 1 | 0 |
|
||
|
------------------------------
|
||
|
|
||
|
Refer - https://en.wikipedia.org/wiki/NIMPLY_gate
|
||
|
"""
|
||
|
|
||
|
|
||
|
def nimply_gate(input_1: int, input_2: int) -> int:
|
||
|
"""
|
||
|
Calculate NIMPLY of the input values
|
||
|
|
||
|
>>> nimply_gate(0, 0)
|
||
|
0
|
||
|
>>> nimply_gate(0, 1)
|
||
|
0
|
||
|
>>> nimply_gate(1, 0)
|
||
|
1
|
||
|
>>> nimply_gate(1, 1)
|
||
|
0
|
||
|
"""
|
||
|
return int(input_1 == 1 and input_2 == 0)
|
||
|
|
||
|
|
||
|
if __name__ == "__main__":
|
||
|
print(nimply_gate(0, 0))
|
||
|
print(nimply_gate(0, 1))
|
||
|
print(nimply_gate(1, 0))
|
||
|
print(nimply_gate(1, 1))
|