hdu——1501——Zipper
来源:互联网 发布:中级java工程师面试题 编辑:程序博客网 时间:2024/04/30 21:51
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
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
如果输入的是ab,cd,则c可以是abcd,但是不能是adcb
#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>using namespace std;const int M=1005;int n;string A,B,C;int lenA,lenB,lenC;int vis[M][M];int f;void dfs(int a,int b,int c){if(c==lenC) { f=1; return; } if(vis[a][b]) return; vis[a][b]=1; if(A[a]==C[c]||B[b]==C[c]) { if(A[a]==C[c]&&a<lenA) dfs(a+1,b,c+1); if(B[b]==C[c]&&b<lenB) dfs(a,b+1,c+1); } return;}int main(){while(scanf("%d",&n)!=EOF){for(int k=1;k<=n;k++){cin>>A>>B>>C;lenA=A.size();lenB=B.size();lenC=C.size(); memset(vis,0,sizeof(vis)); f=0;if(lenA+lenB==lenC){dfs(0,0,0);}if(f)cout<<"Data set "<<k<<": yes"<<endl;elsecout<<"Data set "<<k<<": no"<<endl;}}return 0;}
0 0
- hdu——1501——Zipper
- Zipper(HDU 1501) —— DFS
- (step4.3.5)hdu 1501(Zipper——DFS)
- hdu1501——Zipper
- (DP)POJ2192—Zipper
- 【hdu1501】zipper——dfs
- 动态规划入门——Zipper
- ACM-DFS之Zipper——hdu1501
- 杭电ACM1501——Zipper~~DFS
- poj2192——Zipper(动态规划)
- hdu 1501 Zipper
- hdu 1501 Zipper--LCS
- HDU-1501-Zipper
- Hdu 1501 Zipper
- hdu zipper 1501
- hdu 1501 Zipper
- HDU 1501 Zipper
- hdu 1501 Zipper
- RRDTool 详解
- Linux是如何蔓延到技术世界的每一个角落?
- 工作中遇到的问题记录
- 自我介绍的内容要包含四个方面
- monkeyrunner按键
- hdu——1501——Zipper
- buffer cache实验8-free buffer waits-完成
- 非法字符的正则表达式
- 【微信攻略】如何增加微信公众号订阅量?
- shell中的 /dev/null
- Xcode5下关于CocoaPods不能引用头文件
- CXF入门教程(4) -- 设置上下文连接属性
- buffer cache实验10-buffer cache优化指标与总结
- JAVA正则表达式 Pattern和Matcher