Pagini recente » Cod sursa (job #1602034) | Cod sursa (job #1326114) | Cod sursa (job #2092132) | Cod sursa (job #811097) | Cod sursa (job #275145)
Cod sursa(job #275145)
#include <fstream>
using namespace std;
char temp[2000], edit[2000],c;
long i,n;
bool A['z'-'a'+2];
bool ev1();
bool ev2();
void filter()
{
unsigned int n=0;
for (i=0;i<=temp[i]!='\n';i++)
if (temp[i]!=' ') edit[n++]=temp[i];
}
bool eval()
{
bool mem=ev1();
while ( strncmp(i+edit, "OR", 2)==0)
{
i+=2;
mem |= ev1();
}
return mem;
}
bool ev1()
{
bool mem=ev2();
while (strncmp(i+edit, "AND", 3)==0)
{
i+=3;
mem&=ev2();
}
return mem;
}
bool ev2()
{
bool mem;
if (strncmp(i+edit, "TRUE", 4)==0)
{
i+=4;
return true;
}
if (strncmp(i+edit, "FALSE", 5)==0)
{
i+=5;
return false;
}
if (strncmp (i+edit, "NOT", 3)==0)
{
i+=3;
mem=!ev2();
}
else
{
if (edit[i]=='(')
{
i++;
mem=eval();
i++;
}
else
mem=A[edit[i++]-'A'];
}
return mem;
}
int main()
{
ifstream in ("bool.in");
ofstream out("bool.out");
for (i=0;i<=2000;i++)
{in>>temp[i]; if (temp[i]=='\n') break;};
filter();
for (i=0;i<='z'-'a'+1;i++)
A[i]= false;
in>>n;
in>>c;
while (n--)
{
in>>c;
A[c-'A']=!A[c-'A'];
i=0;
out<<(eval()?1:0);
}
return 0;
}