本文共 2138 字，大约阅读时间需要 7 分钟。
1、
2、题目好难懂。。。
给定一个细胞链，只有AB两种字母组成，有三种方式，一种是OA，一种是OAB，一种是BOA，O代表是正常的细胞链，最后看一下这个细胞链是否是由这些组合构成的，如果有多种方式构成，输出排在前边的方式。如果不是这三种方式中的一种，那么该细胞链已变异，作为第四种输出
3、题目：
A chain of connected cells of two types A and B composes a cellular structure of some microorganisms of species APUDOTDLS.
If no mutation had happened during growth of an organism, its cellular chain would take one of the following forms:
simple stage O = A fully-grown stage O = OAB mutagenic stage O = BOA
Sample notation O = OA means that if we added to chain of a healthy organism a cell A from the right hand side, we would end up also with a chain of a healthy organism. It would grow by one cell A.
A laboratory researches a cluster of these organisms. Your task is to write a program which could find out a current stage of growth and health of an organism, given its cellular chain sequence.A integer n being a number of cellular chains to test, and thenn consecutive lines containing chains of tested organisms.
For each tested chain give (in separate lines) proper answers:
SIMPLE for simple stage FULLY-GROWN for fully-grown stage MUTAGENIC for mutagenic stage MUTANT any other (in case of mutated organisms)
If an organism were in two stages of growth at the same time the first option from the list above should be given as an answer.
4AAABBAABBAABA
SIMPLEFULLY-GROWNMUTANTMUTAGENIC
4、AC代码：
#include#include char str[100];int ans;int DP(int start,int end){ if(start==end && str[start]=='A') return 1; else if(end-start>=1 && str[end]=='A' && DP(start,end-1)) return 1; else if(end-start>=2 && str[end]=='B' && str[end-1]=='A' && DP(start,end-2)) return 2; else if(end-start>=2 && str[end]=='A' && str[start]=='B' && DP(start+1,end-1)) return 3; return 0;}int main(){ int n; scanf("%d",&n); while(n--) { scanf("%s",str); int l=strlen(str); int ans=DP(0,l-1); if(ans==1) printf("SIMPLE\n"); else if(ans==2) printf("FULLY-GROWN\n"); else if(ans==3) printf("MUTAGENIC\n"); else printf("MUTANT\n"); } return 0;}
转载地址：http://whddi.baihongyu.com/