# Zipper

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9212 Accepted Submission(s): 3263

Problem Description
Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order.

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".

Input
The first line of input contains a single positive integer from 1 through 1000. It represents the number of data sets to follow. The processing for each data set is identical. The data sets appear on the following lines, one data set per line.

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.

Output
For each data set, print:

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.

Sample Input
3 cat tree tcraete cat tree catrtee cat tree cttaree

Sample Output
Data set 1: yes Data set 2: yes Data set 3: no

Source

#include<cstdio>
#include<cstring>
const int maxn=1005;
char a[maxn],b[maxn],c[2*maxn];
bool vis[maxn][maxn],kase;
void dfs(int la,int lena,int lb,int lenb)
{
if(la>lena||lb>lenb||vis[la][lb])
{
return;
}
if(la==lena&&lb==lenb)
{
kase=1;
return;
}
vis[la][lb]=1;
if(!kase&&a[la]==c[la+lb])
{
dfs(la+1,lena,lb,lenb);
}
if(!kase&&b[lb]==c[la+lb])
{
dfs(la,lena,lb+1,lenb);
}
}
int main()
{
int t;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
kase=0;
memset(vis,0,sizeof(vis));
scanf("%s%s%s",a,b,c);
printf("Data set %d: ",i);
dfs(0,strlen(a),0,strlen(b));
printf("%s\n",kase?"yes":"no");
}
return 0;
}

#include<stdio.h>
#include<string.h>
const int maxn=205;
char a[maxn],b[maxn],c[maxn*2];
bool vis[maxn][maxn];
bool ok(int la,int lena,int lb,int lenb)
{
if(la==lena&&lb==lenb)
{
return 1;
}
int kase=0;
if((la<lena||lb<lenb)&&!vis[la][lb])
{
vis[la][lb]=1;
if(a[la]==c[la+lb])
{
kase=ok(la+1,lena,lb,lenb);
}
if(b[lb]==c[la+lb])
{
kase=kase||ok(la,lena,lb+1,lenb);
}
}
return kase;
}
int main()
{
int t,i,j,k,l;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
memset(vis,0,sizeof(vis));
scanf("%s%s%s",a,b,c);
printf("Data set %d: ",i);
printf("%s\n",ok(0,strlen(a),0,strlen(b))?"yes":"no");
}
return 0;
} 

• 本文已收录于以下专栏：

## hdu1501 Zipper（dfs && dp）

• Flynn_curry
• 2016年04月17日 16:06
• 328

## HDU 1501 Zipper 【DFS】

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...
• sunnykema
• 2015年04月10日 17:14
• 245

## hdu 1501 Zipper(DFS)

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...
• Luwhere
• 2016年02月25日 18:56
• 213

## hdu 1501 Zipper (DFS)

#include #include const int maxn = 205; char a[maxn] , b[maxn] , pat[maxn * 2]; int vis[maxn][maxn]...
• qq232218719
• 2013年09月03日 20:14
• 455

## HDU 1501 Zipper （DFS）

Problem Description Given three strings, you are to determine whether the third string can be for...
• u012313382
• 2015年03月25日 20:15
• 488

## hdu 1501 Zipper（dfs）

Problem Description Given three strings, you are to determine whether the third string can be forme...
• feizaoSYUACM
• 2017年06月29日 18:19
• 109

## HDU 1501 Zipper (DFS)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submissio...
• z1192277815
• 2017年03月23日 20:36
• 87

## Zipper（HDU 1501） —— DFS

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...
• jxust_tj
• 2014年09月19日 09:50
• 478

## HDU 1501 Zipper(DFS)

HDU 1501 Zipper(DFS) http://acm.hdu.edu.cn/showproblem.php?pid=1501 题意:给你3个字符串A,B和C.问你由字符串A和B的字符能否构成...
• u013480600
• 2014年06月09日 18:48
• 648

## HDU 1501 Zipper（DFS）

• dgq8211
• 2012年05月07日 10:08
• 846

举报原因： 您举报文章：Hdu 1501 Zipper【dfs】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)