POJ 3295 ——Tautology 枚举 构造 位运算可优化

Tautology

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9961		Accepted: 3777

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

Source

Waterloo Local Contest, 2006.9.30

解释题意：

K, A, N, C, E题目中代表，且，或，非，C不知道叫什么，但是根据题中给的表如果w为0，x为1就是0，否则就是1，E代表是否相等，相等就是1，p，q，r，s，t是题目中给的元素（离散数学学得不好，不知道叫什么了）

解题思路：

枚举，p，q，r，s，t的两种情况，然后用栈判结果，一旦出现一个false，那么就不会是重言式（永真式）。

自己想了好长时间也没能理解什么叫“构造”，枚举倒是真看出来，一开始我想用递归写这个题，但是递归算法没写出来，暴力也没暴力好，于是就看了看大神的题解，看了两天多才渐渐的明白其中的含义。。。

#include <stdio.h>
#include <string.h>


char str[1010];
char sta[1010];
int top;

int main()
{
    int p,q,r,s,t;
    bool flag = false;
    while(scanf("%s",str),strcmp(str,"0"))
    {
        flag = true;
        int len = strlen(str);
        for(p = 0; p < 2; p++)
        {
            for(q = 0; q < 2; q++)
            {
                for(r = 0; r < 2; r++)
                {
                    for(s = 0; s < 2; s++)
                    {
                        for(t = 0; t < 2; t++)
                        {
                            top = 0;
                            for(int i = len - 1; i >= 0; i--)
                            {
                                if(str[i] == 'p')
                                    sta[top++] = p;
                                else if(str[i] == 'q')
                                    sta[top++] = q;
                                else if(str[i] == 'r')
                                    sta[top++] = r;
                                else if(str[i] == 's')
                                    sta[top++] = s;
                                else if(str[i] == 't')
                                    sta[top++] = t;
                                else if(str[i] == 'K')
                                {
                                    int a = sta[top - 1];
                                    top--;
                                    int b = sta[top - 1];
                                    top--;
                                    sta[top++] = (a && b);
                                }
                                else if(str[i] == 'A')
                                {
                                    int a = sta[top - 1];
                                    top--;
                                    int b = sta[top - 1];
                                    top--;
                                    sta[top++] = (a || b);
                                }
                                else if(str[i] == 'N')
                                {
                                    int a = sta[top - 1];
                                    top--;
                                    sta[top++] = !a;
                                }
                                else if(str[i] == 'C')
                                {
                                    int a = sta[top - 1];
                                    top--;
                                    int b = sta[top - 1];
                                    top--;
                                    if(a==1&&b==0)
                                        sta[top++]=0;
                                    else
                                        sta[top++]=1;

                                }
                                else if(str[i] == 'E')
                                {
                                    int a = sta[top - 1];
                                    top--;
                                    int b = sta[top - 1];
                                    top--;
                                    sta[top++] = a == b ? 1 : 0;
                                }
                            }
                            if(!sta[0])
                            {
                                flag = false;
                                break;
                            }
                        }
                        if(!flag)
                            break;
                    }
                    if(!flag)
                        break;
                }
                if(!flag)
                    break;
            }
            if(!flag)
                break;
        }
     //   printf("top = %d\n",top);
        if(!flag)
            printf("not\n");
        else
            printf("tautology\n");
    }
    return 0;
}

看别人的，终究不是自己的，我根据自己的理解，优化了一下：

pqrst分别都有两种状态，0和1，可以用位运算来优化，11111(B)为31，那么，我们从0开始，循环到31就可以了，从右往左分别是tsrqp，判断p的时候就是i >> 4 & 1或是 1 << 4 & i(我用i来循环)。。。。位运算在我博客找基友3（BFS分类中有介绍）。。。。。

#include <stdio.h>
#include <string.h>


char str[1010];
char sta[1010];
int top;

int main()
{
    bool flag;
    while(scanf("%s",str),strcmp(str,"0"))
    {
        flag = true;
        int len = strlen(str);
        for(int i = 0; i < 32; i++)
        {
            top = 0;
            for(int j = len - 1; j >= 0; j--)
            {
                if(str[j] == 'p')
                    sta[top++] = i >> 4 & 1;
                else if(str[j] == 'q')
                    sta[top++] = i >> 3 & 1;
                else if(str[j] == 'r')
                    sta[top++] = i >> 2 & 1;
                else if(str[j] == 's')
                    sta[top++] = i >> 1 & 1;
                else if(str[j] == 't')
                    sta[top++] = i & 1;
                else if(str[j] == 'K')
                {
                    int a = sta[top - 1];
                    top--;
                    int b = sta[top - 1];
                    top--;
                    sta[top++] = a && b;
                }
                else if(str[j] == 'A')
                {
                    int a = sta[top - 1];
                    top--;
                    int b = sta[top - 1];
                    top--;
                    sta[top++] = a || b;
                }
                else if(str[j] == 'N')
                {
                    int a = sta[top - 1];
                    top--;
                    sta[top++] = !a;
                }
                else if(str[j] == 'C')
                {
                    int a = sta[top - 1];
                    top--;
                    int b = sta[top - 1];
                    top--;
                    sta[top++] = (!a) || b;
                }
                else if(str[j] == 'E')
                {
                    int a = sta[top - 1];
                    top--;
                    int b = sta[top - 1];
                    top--;
                    sta[top++] = a == b;
                }
            }
            if(!sta[0])
            {
                flag = false;
                break;
            }
        }
        if(!flag)
            printf("not\n");
        else
            printf("tautology\n");
    }
    return 0;
}