hdu 1501 Zipper
For example, consider forming "tcraete" from "cat" and "tree":
String A: cat
String B: tree
String C: tcraete
As you can see, we can form the third string by alternating characters from the two strings. As a second example, consider forming "catrtee" from "cat" and "tree":
String A: cat
String B: tree
String C: catrtee
Finally, notice that it is impossible to form "cttaree" from "cat" and "tree".
For each data set, the line of input consists of three strings, separated by a single space. All strings are composed of upper and lower case letters only. The length of the third string is always the sum of the lengths of the first two strings. The first two strings will have lengths between 1 and 200 characters, inclusive.
Data set n: yes
if the third string can be formed from the first two, or
Data set n: no
if it cannot. Of course n should be replaced by the data set number. See the sample output below for an example.
代码:
#include<iostream>
using namespace std;
char sa[210],sb[210],sc[420];
int la,lb,lc,flag;
int mark[210][210];
void dfs(int x,int y,int z)
{
if(flag)
return;
if(z>=lc)
{
flag=1;
return;
}
if(mark[x][y])
return;
mark[x][y]=1;
if(sa[x]==sc[z]&&x<la)
dfs(x+1,y,z+1);
if(sb[y]==sc[z]&&y<lb)
dfs(x,y+1,z+1);
}
int main()
{
int t,k;
while(~scanf("%d",&t))
{
for(k=1;k<=t;k++)
{
scanf("%s%s%s",sa,sb,sc);
la=strlen(sa);
lb=strlen(sb);
lc=strlen(sc);
if(lc!=la+lb)
{
printf("Data set %d: no\n",k);
continue;
}
flag=0;
memset(mark,0,sizeof(mark));
dfs(0,0,0);
if(flag)
printf("Data set %d: yes\n",k);
else
printf("Data set %d: no\n",k);
}
}
return 0;
}