|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||256 MB||0||0||0||0.000%|
Yraglac is currently enrolled in an introductory course on formal logic. One of the assignments for his class is to: given a list of logical formulae, determine which are always true and which are false (contingently or otherwise), given that one may assume the truth of a list of other formulae.
Now, Yraglac is a good student, but he's not confident that his answers are correct. He'd like you to write a program that does the work for him --- sorry, that generates the answers so he can confirm that his own are correct.
Since this is just an introductory course, the only logical connectives that have been covered are implication and negation. Yraglac always forgets the cases in which an implication is false, so he keeps the truth table on hand at all times:
|A||B||A -> B|
The input will contain multiple test cases. Each test case begins with an integer 0 < N < 500, which is the number of logical statements that follow. Each of the following N lines contains a logical statement, which are given in accordance with the following grammar:
Statement: Variable | Negation | (Implication) Variable: a,b,c,d,...,t Implication: Statement->Statement Negation: ~(Statement)
You are to use the above statements as assumptions; that is to say, you may assume that all of these N statements are true.
The next line contains an integer 0 < M < 500, followed by M more lines containing the test formulae.
The input file ends with a line containing zero.
For each test case, output a header of "====" before any further output. Then, for each of the M statements, output either "True" or "False" (without quotes) as appropriate.
2 (a->~(a)) (b->a) 5 a ~(a) b ~(b) c 0
==== False True False True False