Pagini recente » Cod sursa (job #3282899) | Cod sursa (job #3134828) | Cod sursa (job #1621835) | Cod sursa (job #1319799) | Cod sursa (job #1821332)
#include <cstdio>
#include <cstring>
using namespace std;
FILE *fin = fopen("bool.in", "r");
FILE *fout = fopen("bool.out", "w");
char v[1000];
bool a[1000];
int dimensiune, p , n;
bool termen();
bool valoare();
bool expresie();
bool expresie()
{
bool sol = termen();
if(p+1<=dimensiune && v[p]=='O' && v[p+1]=='R')
{
p+=2;
bool x=termen();
sol = sol || x;
}
return sol;
}
bool termen()
{
bool sol = valoare();
if(p+2<=dimensiune && v[p]=='A' && v[p+1]=='N' && v[p+2]=='D')
{
p+=3;
bool x=valoare();
sol = sol && x;
}
return sol;
}
bool valoare()
{
bool x;
if(v[p]=='(')
{
p++;
x = expresie();
p++;
}
else
{
if(p+2<=dimensiune && v[p]=='N' && v[p+1]=='O' && v[p+2]=='T')
{
p+=3;
x = !valoare();
}
else
{
if(p+3<=dimensiune && v[p]=='T' && v[p+1]=='R' && v[p+2]=='U' && v[p+3]=='E')
{
p+=4;
x = 1;
}
else
{
if(p+4<=dimensiune && v[p]=='F' && v[p+1]=='A' && v[p+2]=='L' && v[p+3]=='S' && v[p+4]=='E')
{
p+=5;
x = 0;
}
else
{
x = a[v[p]-'A'];
p++;
}
}
}
}
return x;
}
char c;
int main()
{
fscanf(fin, "%c", &c);
int ramas = 1;
while(c!='\n')
{
if(c!=' ')
{
v[ramas] = c;
ramas++;
}
fscanf(fin, "%c", &c);
}
ramas--;
dimensiune = ramas;
fscanf(fin, "%d", &n);
fscanf(fin, "%c", &c);
for(int i = 1; i<=n;i++)
{
fscanf(fin, "%c", &c);
a[c-'A'] = 1-a[c-'A'];
p=1;
int solutie = expresie();
if(solutie == 1) fprintf(fout,"1");
else fprintf(fout,"0");
}
return 0;
}