ZOJ 3818 Pretty Poem 類比題，zoj3818

ZOJ 3818 Pretty Poem 類比題，zoj3818

題目連結：點擊開啟連結

#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 55;char a[N], b[N];int main() {int T;scanf("%d", &T);while(T-- > 0) {scanf("%s", a);int Len = strlen(a), len = 0;for(int i = 0; i < Len; i ++) {if((a[i] >= 'a' && a[i] <= 'z')|| (a[i] >= 'A' && a[i] <= 'Z')) {b[len ++] = a[i];}}bool yes = 0;for(int i = 1; i < len; i ++) {for(int j = 1; j < len; j ++) {for(int k = 0; k < len; k ++) {if(k != 0) {if(3*i + 3*j + k != len) continue;if(i == j) {bool no = 0;for(int z = 0; z < i; z ++) {if(b[z] != b[z+i]) {no = 1;break;}}if(!no) continue;}if(i == k) {bool no = 0;for(int z = 0; z < i; z ++) {if(b[z] != b[z+i+i+j+j]) {no = 1;break;}}if(!no) continue;}if(j == k) {bool no = 0;for(int z = i; z < i+j; z ++) {if(b[z] != b[z+i+j+j]) {no = 1;break;}}if(!no) continue;}bool ok = 1;for(int z = 0; z < i; z ++) { // check(a)if(b[z] != b[z+i+j] || b[z] != b[z+(i+i+j+j+k)]) {ok = false;}}for(int z = i; z < i+j; z ++) {if(b[z] != b[z+i+j] || b[z] != b[z+(i+i+j+j+k)]) {ok = false;}}if(ok) {//printf("%d %d %d\n", i, j, k);yes = 1;}if(yes) break;} else {if(3*i + 2*j != len) continue; if(i == j) {bool no = 0;for(int z = 0; z < i; z ++) {if(b[z] != b[z+i]) {no = 1;break;}}if(!no) continue;}bool ok = 1;for(int z = 0; z < i; z ++) { // check(a)if(b[z] != b[z+i+j] || b[z] != b[z+(i+i+j+j)]) {ok = false;}}for(int z = i; z < i+j; z ++) {if(b[z] != b[z+i+j]) {ok = false;}}if(ok) {//printf("%d %d\n", i, j);yes = 1;}if(yes) break;}}if(yes) break;}  if(yes) break;}if(yes) puts("Yes");else puts("No");}return 0;}