Pagini recente » Cod sursa (job #2175192) | Cod sursa (job #848941) | Cod sursa (job #1870197) | Cod sursa (job #1858866) | Cod sursa (job #2851089)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bool.in");
ofstream fout("bool.out");
char s[1006], c, t[1006], *p;
bool val[40];
int n, i;
bool eval();
bool termen();
bool factor();
void citire()
{
fin.getline(t, 1006);
fin >> n;
fin.get();
}
bool eval()
{
bool r;
r = termen();
while (s[i] == 'O' && s[i+1] == 'R')
{
i += 2;
r |= termen();
}
return r;
}
bool termen()
{
bool r;
r = factor();
while (s[i] == 'A' && s[i+1] == 'N' && s[i+2] == 'D')
{
i += 3;
r &= factor();
}
return r;
}
bool factor()
{
bool r = 0;
if (s[i] == 'N' && s[i+1] == 'O' && s[i+2] == 'T')
{
i += 3;
r =! factor();
}
else if (s[i] == '(')
{
++i;
r = eval();
++i;
}
else if (isalpha(s[i]))
{
r = val[s[i]-'A'];
++i;
}
else if (s[i] == 'T' && s[i+1] == 'R' && s[i+2] == 'U' && s[i+3] == 'E')
{
i += 4;
r = true;
}
else if (s[i] == 'F' && s[i+1] == 'A' && s[i+2] == 'L' && s[i+3] == 'S' && s[i+4] == 'E')
{
i += 5;
r = false;
}
return r;
}
int main()
{
citire();
p = t;
p = strtok(t, " ");
while(p)
{
strcat(s, p);
p = strtok(NULL, " ");
}
for (int k = 1; k <= n; ++k)
{
i = 0;
fin >> c;
val[c-'A'] = !val[c-'A'];
fout << eval();
}
return 0;
}