MeetCode
De Morgan Apply
C
C++
Computer Mathematics
CSS
DSA
HTML
Java
JavaScript
NodeJS
PHP
Programming Interview
Python
ReactJS
SQL
Run
Submit
Dark
Problem Statement
Solutions
Submissions
De Morgan Apply
Easy
Computer Mathematics
Boolean Algebra & Logic
21 views
Explanation
Complexity
Problem Statement
Given X and Y (0/1), compute NOT(X AND Y) and (NOT X) OR (NOT Y) and verify equality.
Input Format
Two bits X Y.
Output Format
Two bits.
Example
Input
1 0
Output
1 1
Constraints
X,Y in {0,1}
Input / Output Format
Input Format
Two bits X Y.
Output Format
Two bits.
Constraints
X,Y in {0,1}
Examples
Input:
1 0
Output:
1 1
Example Solution (Public)
Computer Mathematics
Compute both sides and output them. They must match.
Official Solution Code
Wrap
Copy
Compute both sides and output them. They must match.
Please
login
to submit solutions.
Editor
C
C++
Computer Mathematics
CSS
DSA
HTML
Java
JavaScript
NodeJS
PHP
Programming Interview
Python
ReactJS
SQL
Test Cases
Output
Submission Result
Input
1 0
Expected Output
1 1
Compile Output
Error
Output
Please
login
to submit solutions.