Pagini recente » Cod sursa (job #3186064) | Cod sursa (job #555719) | Cod sursa (job #2457549) | Cod sursa (job #971876) | Cod sursa (job #312940)
Cod sursa(job #312940)
#include <fstream.h>
#include <string.h>
#include <stdlib.h>
#define MaxN 109
#define MaxS 1009
#define MaxC 300
char S[MaxS],sch[MaxN];
int N,var[MaxC],k;
int termen();
int factor();
void cit()
{
ifstream fin("bool.in");
fin.get(S,MaxS,'\n'); fin.get();
fin>>N; fin.get();
fin.get(sch,MaxN,'\n');
fin.close();
}
int eval()
{
int r=termen();
while(S[k]=='O' && S[k+1]=='R')
{
k+=3;
r=r or termen();
}
return r;
}
int termen()
{
int r=factor();
while(S[k]=='A' && S[k+1]=='N' && S[k+2]=='D')
{
k+=4;
r=r and factor();
}
return r;
}
int factor()
{
int r;
if(S[k]=='(')
{
k++;
r=eval();
k++;
}
else
if(S[k]=='N' && S[k+1]=='O' && S[k+2]=='T')
{
k+=4;
r=!factor();
} else
if(S[k]=='T' && S[k+1]=='R' && S[k+2]=='U' && S[k+3]=='E')
{
k+=5;
r=1;
} else
if(S[k]=='F' && S[k+1]=='A' && S[k+2]=='L' && S[k+3]=='S' && S[k+4]=='E')
{
k+=6;
r=0;
} else
{
r=var[S[k]-'A'];
k+=2;
}
return r;
}
int main()
{
cit();
ofstream fout("bool.out");
for(int i=0;i<N;i++)
{
if(var[sch[i]-'A']==0)
var[sch[i]-'A']=1;
else
var[sch[i]-'A']=0;
k=0;
fout<<eval();
}
fout.close();
}