No.3177 output only nand problem
タグ : / 解いたユーザー数 159
作問者 :
Cafe1942
/ テスター :
tsunamayo123
kk2a
sclara
Problem Statement
This problem is output-only. No input is given.
The NAND operation does not satisfy the associative law in general. Specifically, for numbers $A,B,C$ satisfying $A,B,C\in\{0,1\}$, $( A \barwedge B ) \barwedge C$ and $A \barwedge ( B \barwedge C )$ do not necessarily coincide.
Now, output $1$ triple of $A,B,C\in\{0,1\}$ such that $( A \barwedge B ) \barwedge C \neq A \barwedge ( B \barwedge C )$.
What is NAND?
It is a binary operation defined for $X,Y\in\{0,1\}$, written as $X \barwedge Y$. Concretely, the operation is $0\barwedge0=1,0\barwedge1=1,1\barwedge0=1,1\barwedge1=0$.Input
No input is given in this problem.Output
Output $A,B,C\in\{0,1\}$ satisfying the condition in the problem statement, in this order, separated by spaces.
Sample Output
An example of output that does not satisfy the condition in the problem statement is given below.0 1 0
This answer is incorrect, because
$( 0 \barwedge 1 ) \barwedge 0 = 1 \barwedge 0 = 1$, and
$0 \barwedge ( 1 \barwedge 0 ) = 0 \barwedge 1 = 1$.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。