-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1003.cpp
68 lines (62 loc) · 1.38 KB
/
1003.cpp
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
#include<iostream>
using namespace std;
int sayYes(string ca);
void print(int n);
int main() {
int n;
cin >> n;
string ca[n] = {};
for (int i=0; i<n; i++) {
cin >> ca[i];
}
for (int i=0; i<n; i++) {
print(sayYes( ca[i] ));
cout << endl;
}
return 0;
}
int sayYes(string ca) {
int flagP = -1,
flagT = -1,
isYes = 1, i;
for (i=0; i<100 && ca[i]!='\0'; i++) {
// 规则一 与 二 判断
if (ca[i]!='P' && ca[i]!='A' && ca[i]!='T') return 0;
else {
if (ca[i]=='P') {
if (flagP != -1) return 0;
flagP = i;
}
else if (ca[i]=='T') {
if (flagT != -1) return 0;
flagT = i;
}
}
}
int a = flagP,
b = flagT - flagP - 2,
c = i - flagT - a -1;
if (a<0 || b<0 || c<0) return 0;
// 按照规则三还原字符串
if (b > 0) {
string temp;
for (int j=0; j<a; j++) {
temp[j] = 'A';
}
temp[flagP] = 'P';
for (int j=0; j<b; j++) {
temp[j+flagP+1] = 'A';
}
temp[flagT-1] = 'T';
for (int j=0; j<c; j++) {
temp[j+flagT] = 'A';
}
// 递归
isYes = sayYes(temp);
}
return isYes;
}
void print( int n) {
if( n == 1) cout << "YES";
else cout << "NO";
}