Pagini recente » Cod sursa (job #1950592) | Borderou de evaluare (job #2862912) | Cod sursa (job #2734478) | Cod sursa (job #1950551) | Cod sursa (job #3192705)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bool.in");
ofstream fout("bool.out");
map <char,bool> bm;
char p[100005];
string s;
int pos;
int n;
bool AO();
bool EXP();
void create()
{
for(int i=0; p[i];i++)
{
if(p[i]>64 && p[i]<91 && p[i+1]==' ')
s.push_back(p[i]);
if(p[i]=='T' && p[i+1]=='R')
{
s.push_back('1');
i+=4;
}
if(p[i]=='F' && p[i+1]=='A')
{
s.push_back('0');
i+=5;
}
if(p[i]=='N' && p[i+1]=='O')
{
s.push_back('!');
i+=3;
}
if(p[i]=='A' && p[i+1]=='N')
{
s.push_back('&');
i+=3;
}
if(p[i]=='O' && p[i+1]=='R')
{
s.push_back('|');
i+=2;
}
if(p[i]=='(' || p[i]==')')
s.push_back(p[i]);
}
}
bool AO(){
bool res = EXP();
while (s[pos] == '&' || s[pos] == '|') {
if (s[pos] == '&') {
pos++;
res = res && EXP();
}
else {
pos++;
res = res || EXP();
}
}
return res;
}
bool EXP(){
bool res;
if (s[pos] == '(') {
pos++;
res = AO();
pos++;
}
else if(s[pos] == '!'){
pos++;
res = !EXP();
}
else{
res = bm[s[pos]];
}
return res;
}
int main()
{
fin.getline(p,100005);
fin>>n;
create();
fout<<s;
for(int i=1;i<=n;i++){
pos = 0;
char X;
fin>>X;
bm[X] = !bm[X];
fout<<AO();
}
return 0;
}