Pagini recente » Cod sursa (job #1599200) | Cod sursa (job #2982882) | Cod sursa (job #348106) | Cod sursa (job #1364126) | Cod sursa (job #1818298)
#include <iostream>
#include <stdio.h>
using namespace std;
const int N=1008;
char s[N];
int p;
int expresie();
int termen();
int factor();
int expresie()
{
int sum=termen();
while(s[p]=='|')
{
p++;
sum|=termen();
}
return sum;
}
int termen()
{
int prod=factor();
while(s[p]=='!'||s[p]=='&')
{
if(s[p]=='!')
{
p++;
prod!=factor();
}
else
{
p++;
prod&=factor();
}
}
return prod;
}
int factor()
{
int semn=1,val=0;
while(s[p]=='-')
{
p++;
semn=-semn;
}
if(s[p]=='(')
{
p++;
val=expresie();
p++;
return semn*val;
}
while(isdigit(s[p]))
{
val=val*10+(s[p]-'0');
p++;
}
return semn*val;
}
int main()
{
int n,k=0,i;
freopen("bool.in","r",stdin);
freopen("bool.out","w",stdout);
scanf("%d",&n);
gets(s);
for(int i=1; s[i]; i++)
{
if(s[i]=='T'&&s[i+1]=='R')
{
s[++k]='1';
i=i+3;
}
if(s[i]=='F'&&s[i+1]=='A')
{
s[++k]='0';
i=i+4;
}
if(s[i]=='O'&&s[i+1]=='R')
{
s[++k]='|';
i=i+1;
}
if(s[i]=='A'&&s[i+1]=='N')
{
s[++k]='&';
i=i+2;
}
if(s[i]=='N'&&s[i+1]=='O')
{
s[++k]='!';
i=i+2;
}
if(s[i]!=' ')
s[++k]=s[i];
}
s[++k]='\0';
int expresie();
int termen();
int factor();
for(i=1; i<=k; i++)
printf("%d\n",expresie());
return 0;
}