题意:
p、q、r、s、t为逻辑变量
K、A、N、C、E为逻辑运算符
问他们组成的逻辑表达式是否为永真式
其中:
K : x && y
A : x || y
N : !x
C : (!x)||y
E : x==y
话说楼主看到这题,第一反应是用堆栈,然后写完之后发现自己用的是递归,也是醉了。。。
堆栈的解法可以看这里 : http://blog.csdn.net/lyy289065406/article/details/6642766
这是递归的
//Memory Time
//168K 0MS
#include<iostream>
using namespace std;
bool p, q, r, s, t;
bool getTrueFalse(char* ss, int &pt);
int main()
{
char ss[128];
while(cin>>ss && ss[0] != '0')
{
bool flag = 1;
for(int i = 0; i < 32; i++) //此处可以优化
{
p = i & 0x01;
q = (i & 1 << 1) >> 1;
r = (i & 1 << 2) >> 2;
s = (i & 1 << 3) >> 3;
t = (i & 1 << 4) >> 4;
int pt = 0;
if(getTrueFalse(ss, pt) == 0)
{
flag = 0;
break;
}
}
if(flag)
cout << "tautology" << endl;
else
cout << "not" << endl;
}
return 0;
}
bool getTrueFalse(char* ss, int &pt)
{
int localPt = pt;
pt++;
//p, q, r, s, and t
if(ss[localPt] == 'p')
return p;
if(ss[localPt] == 'q')
return q;
if(ss[localPt] == 'r')
return r;
if(ss[localPt] == 's')
return s;
if(ss[localPt] == 't')
return t;
//K, A, N, C, E mean and, or, not, implies, and equals as defined in the truth table below.
/*
K --> and: x && y
A --> or: x || y
N --> not : !x
C --> implies : (!x)||y
E --> equals : x==y
*/
if(ss[localPt] == 'N')
{
return !getTrueFalse(ss, pt);
}
bool temp1,temp2;
if(ss[localPt] == 'K' || ss[localPt] == 'A' || ss[localPt] == 'C' || ss[localPt] == 'E')
{
temp1 = getTrueFalse(ss,pt);
temp2 = getTrueFalse(ss,pt);
}
if(ss[localPt] == 'K')
return (temp1 && temp2);
if(ss[localPt] == 'A')
return temp1 || temp2;
if(ss[localPt] == 'C')
return (!temp1) || temp2;
if(ss[localPt] == 'E')
return temp1 == temp2;
}