http://www.lydsy.com/JudgeOnline/problem.php?id=1622
Description
约翰想要计算他那N(1≤N≤1000)只奶牛的名字的能量.每只奶牛的名字由不超过1000个字待构成,没有一个名字是空字体串, 约翰有一张“能量字符串表”,上面有M(1≤M≤100)个代表能量的字符串.每个字符串由不超过30个字体构成,同样不存在空字符串.一个奶牛的名字蕴含多少个能量字符串,这个名字就有多少能量.所谓“蕴含”,是指某个能量字符串的所有字符都在名字串中按顺序出现(不一定一个紧接着一个).
所有的大写字母和小写字母都是等价的.比如,在贝茜的名字“Bessie”里,蕴含有“Be”
“sI”“EE”以及“Es”等等字符串,但不蕴含“lS”或“eB”.请帮约翰计算他的奶牛的名字的能量.
Input
第1行输入两个整数N和M,之后N行每行输入一个奶牛的名字,之后M行每行输入一个能量字符串.
Output
一共N行,每行一个整数,依次表示一个名字的能量.
Sample Input
5 3
Bessie
Jonathan
Montgomery
Alicia
Angola
se
nGo
Ont
INPUT DETAILS:
There are 5 cows, and their names are "Bessie", "Jonathan",
"Montgomery", "Alicia", and "Angola". The 3 good strings are "se",
"nGo", and "Ont".
Bessie
Jonathan
Montgomery
Alicia
Angola
se
nGo
Ont
INPUT DETAILS:
There are 5 cows, and their names are "Bessie", "Jonathan",
"Montgomery", "Alicia", and "Angola". The 3 good strings are "se",
"nGo", and "Ont".
Sample Output
1
1
2
0
1
OUTPUT DETAILS:
"Bessie" contains "se", "Jonathan" contains "Ont", "Montgomery" contains
both "nGo" and "Ont", Alicia contains none of the good strings, and
"Angola" contains "nGo".
1
2
0
1
OUTPUT DETAILS:
"Bessie" contains "se", "Jonathan" contains "Ont", "Montgomery" contains
both "nGo" and "Ont", Alicia contains none of the good strings, and
"Angola" contains "nGo".
HINT
Source
1 #include <cstring> 2 #include <cstdio> 3 4 const int N(1005); 5 char name[N][N]; 6 int n,m,ans[N]; 7 8 inline void Get(char *s) 9 { 10 int len=strlen(s); 11 for(int i=0; i<n; ++i) 12 { 13 int k=0,L=strlen(name[i]); 14 for(int j=0; j<L; ++j) 15 { 16 if((name[i][j]-s[k]==32)||name[i][j]==s[k]|| 17 (s[k]-name[i][j]==32)) k++; 18 if(k==len) { ans[i]++; break; } 19 } 20 } 21 } 22 23 int Presist() 24 { 25 scanf("%d%d",&n,&m); 26 for(int i=0; i<n; ++i) 27 scanf("%s",name[i]); 28 for(char s[N]; m--; ) 29 scanf("%s",s),Get(s); 30 for(int i=0; i<n; ++i) 31 printf("%d\n",ans[i]); 32 return 0; 33 } 34 35 int Aptal=Presist(); 36 int main(int argc,char**argv){;}