De Morgan Apply

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

1 0
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

Compute both sides and output them. They must match.
Please login to submit solutions.
Editor
Output

                                        
Please login to submit solutions.