Pagini recente » Cod sursa (job #1306294) | Cod sursa (job #2465776) | Cod sursa (job #341855) | Cod sursa (job #2181206) | Cod sursa (job #2836946)
#include <fstream>
using namespace std;
const int L = 1e3;
const int N = 1e2;
char s[L+1], schimb[N+1];
int p;
void transforma()
{
int i = 0, m = 0;
while(s[i] != '\0')
{
if(s[i] == 'T' && s[i+1] == 'R')
{
s[m++] = '1';
i += 4;
}
else if(s[i] == 'F' && s[i+1] == 'A')
{
s[m++] = '0';
i += 5;
}
else if(s[i] == 'N' && s[i+1] == 'O')
{
s[m++] = '!';
i += 3;
}
else if(s[i] == 'A' && s[i+1] == 'N')
{
s[m++] == '&';
i += 3;
}
else if(s[i] == 'O' && s[i+1] == 'R')
{
s[m++] = '|';
i += 2;
}
else if('A' <= s[i] && s[i] <= 'Z')
{
s[m++] = s[i++];
}
else if(s[i] == '(' || s[i+1] == ')')
{
s[m++] = s[i++];
}
else
{
i++;
}
}
}
int main()
{
ifstream in("bool.in");
ofstream out("bool.out");
int n;
in.getline(s, L + 1);
in >> n;
in >> schimb;
transforma();
out << s << "\n";
return 0;
}