Inverting string-based binary number in one line in Python

Question

I want to read two strings on separate lines, each string the same length and containing only 0's and 1's, and determine if the first is the one's complement of the second. How succinctly can this be done in Python3? (Sorry to specify the language, but this is for my son who's studying Python)

A list comprehension seems to work but is quite ugly.

if ['0' if x=='1' else '1' for x in input()] == list(input()): print('yep')

Is there a slicker/shorter way to do this?

Answer 1

Python 3,  51 44 43  41 bytes

-7 thanks to loopy walt's suggestion to use *open.
-1 thanks to xnor's suggestion to replace any(...) with 1in ...
-2 thanks to dingledooper's suggestion of using str.find instead of str.__eq__

0in map(str.find,*open(0))or print('yep')

Try it online!

This is a full program that takes input from stdin until an EOF (which we assume the user provides at the end of the second line) with open(0) and maps across the two strings by splatting (*), calling str.find on each pair of characters in turn. If 0 is in the result (i.e. the characters are equal and so the index of the first in the second is 0 rather than -1 for "not found") then the right-hand clause of the or is not evaluated, and so we don't print.

---

My previous version, with xnor's and dingledooper's suggestions, at \$48\$, is interactive without the EOF faff:

0in map(str.find,input(),input())or print('yep')

---

You could save one more byte by printing to stderr instead of stdout by exiting the program early using exit in place of print.

---

A note to your son - this is not how I'd want someone in my team at work to write code :) - readability counts, a lot.

Answer 2

Python3, 62 bytes

Since the bits at the similar position need to be set in one of the inputs and unset in the other, their bitwise XOR must have all bits set.

x=input()
int(x,2)^~-(1<<len(x))^int(input(),2)or print("yep")

Try it online!

-5 bytes thanks to Arnauld

Updated from my previous answer where I incorrectly assumed that checking bitwise AND = 0 was a sufficient condition.