Pagini recente » Borderou de evaluare (job #2281901) | Cod sursa (job #1258345)
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
bool litere[30];
string s;
ifstream in("bool.in");
ofstream out("bool.out");
bool rezolva(int c)
{
static int i;
int fosttermen = -1, curenttermen = 0;
int negari = 0;
int armura = 0;
for (i = c; i < s.length(); i++)
{
if (s[i] >= 'A'&&s[i] <= 'Z' && (s[i + 1] == ' ' || s[i + 1] == ')'))
{
if (armura == 0)
{
if (negari % 2 == 0)
{
curenttermen = litere[s[i] - 64];
}
else { curenttermen = !litere[s[i] - 64]; }
}
negari = 0;
}
if (s[i] == ')'){ if (negari % 2 == 1){ curenttermen = !curenttermen; } break; }
if (s[i] == '(')
{
if (armura == 0)
{
if (negari % 2 == 0)
{
curenttermen = rezolva(i + 1);
}
else
{
curenttermen = !rezolva(i + 1);
}
}
else rezolva(i + 1);
negari = 0;
}
if (s[i] == 'T'&&s[i + 1] == 'R'){
i += 3;
if (armura == 0){
if (negari % 2 == 0)
{
curenttermen = 1;
}
else
{
curenttermen = 0;
}
}
negari = 0;
}
if (s[i] == 'F'&&s[i + 1] == 'A'){
i += 4;
if (armura == 0){
if (negari % 2 == 0)
{
curenttermen = 0;
}
else
{
curenttermen = 1;
}
}
negari = 0;
}
if (s[i] == 'N'&&s[i + 1] == 'O'){ i += 2; negari++; }
if (s[i] == 'A'&&s[i + 1] == 'N')
{
negari = 0;
if (fosttermen != 0){ fosttermen = curenttermen; }
curenttermen = 0;
i += 2;
armura = 0;
}
if (s[i] == 'O'&&s[i + 1] == 'R')
{
i += 1;
if (curenttermen == 1){ armura = 1; }
negari = 0;
}
}
if (fosttermen == -1)
{
if (curenttermen == 1){ return true; }
else { return false; }
}
if (fosttermen >= 0)
{
if (curenttermen == 1 && fosttermen == 1){ return true; }
else { return false; }
}
}
int main()
{
int i, n;
char c;
getline(in, s);
in >> n;
for (i = 1; i <= n; i++)
{
in >> c;
litere[c - 64] = !litere[c - 64];
out << rezolva(0);
}
}