杭电1501 Zipper
来源:互联网 发布:手机cad画图软件 编辑:程序博客网 时间:2024/04/30 05:02
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".
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.
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.
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
3cat tree tcraetecat tree catrteecat tree cttaree
Sample Output
Data set 1: yesData set 2: yesData set 3: no
#include<stdio.h>#include<string.h>#define max 205int flag=0;char a[max],b[max],c[max+max];bool visit[max][max]={0};void DFS(int i,int j,int k){if(c[k]=='\0'){flag=1;return;}if(visit[i][j]){return;}visit[i][j]=1;if(a[i]!='\0'&&a[i]==c[k]){DFS(i+1,j,k+1);}if(b[j]!='\0'&&b[j]==c[k]){DFS(i,j+1,k+1);}}int main(){int t,num=0;scanf("%d",&t);while(t--){flag=0;memset(visit,0,sizeof(visit));scanf("%s %s %s",a,b,c);DFS(0,0,0);if(flag) printf("Data set %d: yes\n",++num);else printf("Data set %d: no\n",++num);}return 0;}
0 0
- 杭电1501 Zipper
- 杭电1501 Zipper DFS
- 杭电 1501 zipper(典型dfs)
- HDU--杭电--1501--Zipper--深搜、DP都好
- 杭电1501 hdu1501 Zipper(深搜dfs)
- 杭电-1501Zipper(dfs+标记数组)
- 杭电ACM1501——Zipper~~DFS
- 1501 Zipper
- 1501 Zipper
- 1501 Zipper
- hdu 1501 Zipper
- hdu 1501 Zipper--LCS
- HDU-1501-Zipper
- Hdu 1501 Zipper
- hdu zipper 1501
- hdu 1501 Zipper
- hdoj 1501 Zipper
- HDU 1501 Zipper
- [IOS]从相册获取图片和视频进行上传
- svn帐号修改
- VIM个性化配置
- java.lang.OutOfMemoryError:GC overhead limit exceeded填坑心得
- 分支-17 统计学生成绩(15)
- 杭电1501 Zipper
- Android面试准备复习之Android知识点大扫描 .
- Objective-C----初识Objective-C
- PostgreSql初探(1)-源码安装
- 折弯机——C#读写ini文件
- Linux中 too many open files 的问题解决
- 解决ajax提交form,点击保存按钮和点击回车效果不同的问题
- 利用mybatis-generator自动生成代码
- Mysql 多表联合查询效率分析及优化