枚举

Tautology

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  POJ 3295

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、K、A、N、C、E共10个字母组成的逻辑表达式，
其中p、q、r、s、t的值为1（true）或0（false），即逻辑变量；
K、A、N、C、E为逻辑运算符，
K --> and:  x && y
A --> or:  x || y
N --> not :  !x
C --> implies :  (!x)||y
E --> equals :  x==y
问这个逻辑表达式是否为永真式。
PS:输入格式保证是合法的
 
解题思路：
p, q, r, s, t不同的取值组合共32种情况，枚举不同取值组合代入逻辑表达式WFF进行计算。
如果对于所有的取值组合，WFF值都为 true, 则结果为 tautology，否则为 not。 
  
WFF的计算方法：
从字符串WFF的末尾开始依次向前读取字符。
构造一个栈stack，当遇到逻辑变量 p, q, r, s ,t 则将其当前的值压栈；
遇到 N 则取栈顶元素进行非运算，运算结果的值压栈；
遇到K, A, C, E则从栈顶中弹出两个元素进行相应的运算，将结果的值压栈。 
由于输入是合法的，当字符串WFF扫描结束时，栈stack中只剩一个值，该值就是逻辑表达式WFF的值。

因为题目中的变量只有五个，总情况一共有2^5种，数不是很大，直接枚举

AC代码

#include<iostream>  
#include<cmath>  
#include<algorithm>  
#include<string>
#include<cstring>
#include<cstdlib>
#define MAX 500
#include<stack>
#include<cstdio>
#define M 99999999
using namespace std;  
char s[120];
int pp,qq,rr,ss,tt,tmp;
void whivar(char p)
{
	switch(p)
	{
		case 'p': tmp=pp;
		case 'q': tmp=qq;
		case 'r': tmp=rr;
		case 's': tmp=ss;
		case 't': tmp=tt;
	}
}
int main()
{
	int length=0,flag;
	stack<int> rlt;
	char c;
	while(scanf("%s",s) && s[0]!='0')
	{
		length=strlen(s); rlt.empty();
		for(pp=0;pp<=1;pp++)//枚举每个变量的值，每个只有1和0两种情况
		{
			for(qq=0;qq<=1;qq++)
			{
				for(rr=0;rr<=1;rr++)
				{
					for(ss=0;ss<=1;ss++)
					{
						for(tt=0;tt<=1;tt++)
						{
							for(int i=length-1;i>=0;i--)//进行运算
							{
								if(s[i]=='p' || s[i]=='q' || s[i]=='r' || s[i]=='s' || s[i]=='t')
								{
									switch(s[i])
									{
										case 'p': rlt.push(pp); break;
										case 'q': rlt.push(qq); break;
										case 'r': rlt.push(rr); break;
										case 's': rlt.push(ss); break;
										case 't': rlt.push(tt); break;
									}
								}
								else if(s[i]=='N')
								{
									char temp;
									temp=rlt.top();
									rlt.pop();
									rlt.push(!temp);
								}
								else
								{
									int a,b;
									a=rlt.top(); rlt.pop();
									b=rlt.top(); rlt.pop();
									switch(s[i])
									{
										case 'K': rlt.push(a&&b); break;
										case 'A': rlt.push(a||b); break;
										case 'C': rlt.push((!a)||b); break;
										case 'E': rlt.push(a==b); break;
									}
								}
								
							}
							flag=rlt.top();
							if(flag==0)
								break;
						}
						if(flag==0)	
							break;
					}
					if(flag==0)
						break;
				}
				if(flag==0)
					break;
			}
			if(flag==0)
				break;
		}
		if(flag==1)
		{
			cout<<"tautology"<<endl;
		}
		else cout<<"not"<<endl;
		rlt.pop();
		
	}
	return 0;
	
}