POJ 3295 Tautology(构造法)

题目网址：http://poj.org/problem?id=3295

题目：

Tautology

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13231		Accepted: 5050

Description

WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbols obeying the following rules:

• p, q, r, s, and t are WFFs
• if w is a WFF, Nw is a WFF
• if w and x are WFFs, Kwx, Awx, Cwx, and Ewx are WFFs.

The meaning of a WFF is defined as follows:

• p, q, r, s, and t are logical variables that may take on the value 0 (false) or 1 (true).
• K, A, N, C, E mean and, or, not, implies, and equals as defined in the truth table below.

Definitions of K, A, N, C, and E

w  x	Kwx	Awx	Nw	Cwx	Ewx
1  1	1	1	0	1	1
1  0	0	1	0	0	0
0  1	0	1	1	1	0
0  0	0	0	1	1	1

A tautology is a WFF that has value 1 (true) regardless of the values of its variables. For example, ApNp is a tautology because it is true regardless of the value of p. On the other hand, ApNq is not, because it has the value 0 for p=0, q=1.

You must determine whether or not a WFF is a tautology.

Input

Input consists of several test cases. Each test case is a single line containing a WFF with no more than 100 symbols. A line containing 0 follows the last case.

Output

For each test case, output a line containing tautology or not as appropriate.

Sample Input

ApNp
ApNq
0

Sample Output

tautology
not

思路：
枚举 p, q, r, s, t的所有情况，共2^5种情况，对于每种情况都对给定的字符串进行操作，只要有一种情况是假的，结果就是假的，反之则是永真。
字符串长度不会超过100，所以最坏的情况是2^5*100 肯定不会超时。

对字符串的处理：从字符串尾部进行判断，如果是p,q,r,s,t就压入栈，如果是逻辑符号，就取栈顶元素运算。

代码：

 #include <cstdio>
 #include <stack>
 #include <cstring>
 using namespace std;
 char str[];
 int p,q,r,s,t;
 int solve(){
     stack<int>num;
     int len=strlen(str);
     for (int i=len-; i>=; i--) {
         if(str[i]>'a' && str[i]<'z'){
             if(str[i]=='p') num.push(p);
             if(str[i]=='q') num.push(q);
             if(str[i]=='r') num.push(r);
             if(str[i]=='s') num.push(s);
             if(str[i]=='t') num.push(t);
         }else{
             int a=num.top();num.pop();
             if(str[i]=='N') num.push(!a);
             else{
                 int b=num.top();num.pop();
                 if(str[i]=='K') num.push(a&b);
                 if(str[i]=='A') num.push(a|b);
                 if(str[i]=='C') num.push((!a)|b);
                 if(str[i]=='E') num.push(a==b?:);
             }
         }
     }
     return num.top();
 }
 int main() {
     while (gets(str)!=NULL && str[]!='') {
         int flag=;
         for (p=; p< ; p++) {
             for (q=; q<; q++) {
                 for (r=; r<; r++) {
                     for (s=; s<; s++) {
                         for (t=; t<; t++) {
                             if(solve()==){
                                 flag=;
                                 break;
                             }
                         }
                     }
                 }
             }
         }
         if(flag)    printf("not\n");
         else printf("tautology\n");
     }
     return ;
 }