Pagini recente » Cod sursa (job #2673532) | Cod sursa (job #3184071) | Cod sursa (job #340409) | Cod sursa (job #1888787) | Cod sursa (job #2813589)
#include <iostream>
#include <fstream>
#define MAX 1004
using namespace std;
char s[MAX],c;
bool valori[30]; /// v[0] = valoarea lui a, v[1] = al lui b, ..., a[25] = al lui z
int n,i;
ifstream fin("bool.in");
ofstream fout("bool.out");
bool expresie();
bool or_operatie();
bool and_operatie();
int main()
{
fin.getline(s, 1002); /// -1, pt mai trebuie si \0 de la final
fin >> n;
for(int i = 0; i <= 26; i++){
valori[i] = false;
}
for(int j = 1; j <= n; j++){
fin >> c;
i = 0; /// aici era bugul ;D
/// cand re-evaluam expresia i era deja la 32
/// dar i mai era si variabila din for
valori[c-'A'] = !valori[c-'A'];
fout << or_operatie();
}
return 0;
}
/**
proritate: - or
- and
- expresie
or = and or and
and = exp and exp
exp = 1. un alt or
2. TRUE / FALSE
3. alta variabila
4. NOT exp
**/
bool and_operatie(){
bool r = expresie(); /// setam true defaultu
if(s[i] == ' '){
i++;
}
while(s[i] == 'A' && s[i+1] == 'N'){
i += 3; /// trecem peste ND si un spatiu
r = (r && expresie());
}
return r;
}
bool or_operatie(){
bool r = and_operatie(); /// setam true defaultu
if(s[i] == ' '){
i++;
}
while(s[i] == 'O' && s[i+1] == 'R'){
i += 2; /// trecem peste R si un spatiu
r = (r || and_operatie());
}
return r;
}
bool expresie(){
bool r = true;
if(s[i] == ' '){
i++;
}else if(s[i] == '('){
i++;
r = or_operatie();
i++;
}else if(s[i] == ')'){
i++;
}else{
if(s[i] == 'N' && s[i+1] == 'O'){
/// NOT
i += 3; /// trecem peste OT si un spatiu
r = !(expresie());
}else if(s[i] == 'T' && s[i+1] == 'R'){
i += 4; /// trecem peste RUE si un spatiu
r = true;
}else if(s[i] == 'F' && s[i+1] == 'A'){
i += 5; /// trecem peste ALSE si un spatiu
r = false;
}else{
r = valori[s[i]-'A'];
i++;
}
}
return r;
}