Zipper
来源:互联网 发布:萌照软件下载 编辑:程序博客网 时间:2024/05/01 01:17
Font Size: ← →
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<iostream>#include<stdio.h>using namespace std;char mp1[201];char mp2[201];char mp3[420];int len3,flag;int mmpp[400][400];void DFS(int a,int b,int c){//if(flag)//return ;if(c==len3){flag=1;return ;}if(mmpp[a][b]==0){mmpp[a][b]=1;if(mp1[a]==mp3[c])DFS(a+1,b,c+1);if(mp2[b]==mp3[c])DFS(a,b+1,c+1);}}int main(){//freopen("a.in","r",stdin);int i,n;while(scanf("%d",&n)==1){for(i=1;i<=n;i++){scanf("%s %s %s",mp1,mp2,mp3);//len1=strlen(mp1);//len2=strlen(mp2);len3=strlen(mp3); memset(mmpp,0,sizeof(mmpp));flag=0;DFS(0,0,0);printf("Data set %d: ",i); if(flag)printf("yes\n");elseprintf("no\n");}}return 0;}
- Zipper
- Zipper
- Zipper
- Zipper
- Zipper
- zipper
- Zipper
- Zipper
- Zipper
- Zipper
- Zipper
- 1010. Zipper
- POJ2192 Zipper
- Sicily1010. Zipper
- poj2192 - Zipper
- Zipper (p2192)
- 1501 Zipper
- poj2192 Zipper
- 城里城外看SSDT
- CF 338E Optimize!
- java匹配字符串
- Java中的常见类型的输入输出
- SDJZ 放大的X
- Zipper
- SDJZ 摆积木
- parseBoolean
- QQ空间登录协议分析:JS篇
- android学习系列-JDBC连接SQL server与ADO.NET连接Sql Server对比(4)
- 欧拉函数
- Access Control
- 数据库查询优化方案(处理上百万级记录如何提高处理查询速度)
- 浅谈线程