-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
98 lines (90 loc) · 2.01 KB
/
main.cpp
File metadata and controls
98 lines (90 loc) · 2.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include <bits/stdc++.h>
using namespace std;
bool eval(vector<char>& eval_sik, int n) {
if(n < 3 && eval_sik[0] == 'T' && eval_sik[1] == '|') {
return true;
}
if(n < 3 && eval_sik[0] == 'F' && eval_sik[1] == '&') {
return false;
}
if(eval_sik[n-1] == 'T' && eval_sik[n-2] == '|') {
return true;
}
if(eval_sik[n-1] == 'F' && eval_sik[n-2] == '&') {
return false;
}
bool v = true;
char last_oper;
for(int i = 0 ; i < n; i++) {
if(i == 0) {
if(eval_sik[i] == 'F') {
v = false;
}
} else {
if(eval_sik[i] == '&' || eval_sik[i] == '|') {
last_oper = eval_sik[i];
} else if(eval_sik[i] == 'T') {
if(last_oper == '&') {
v &= true;
} else { // or
v |= true;
}
} else {
if(last_oper == '&') {
v &= false;
} else { // or
v |= false;
}
}
}
}
return v;
}
int main() {
int n;
cin >> n;
cin.ignore();
string sik;
getline(cin, sik);
vector<char> arr;
char w;
cin >> w;
bool wanted;
if(w == 'T') {
wanted = true;
} else {
wanted = false;
}
for (char c: sik) {
if (c != ' ') {
arr.push_back(c);
}
}
if(eval(arr,n) == wanted) {
cout << 0;
return 0;
}
char last_mem;
for(int i = 0; i < n; i++) {
last_mem = arr[i];
if(arr[i] == 'T') {
arr[i] = 'F';
}
else if(arr[i] == 'F') {
arr[i] = 'T';
}
else if(arr[i] == '&') {
arr[i] = '|';
}
else if(arr[i] == '|') {
arr[i] = '&';
}
if(eval(arr, n) == wanted) {
cout << 1;
return 0;
}
arr[i] = last_mem;
}
cout << 2;
return 0;
}