hdu 1501 Zipper
2014-09-05 20:19
239 查看
Zipper
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6825 Accepted Submission(s): 2457
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
判断能否由字符串a,b中的字符不改变各自的相对顺序组合得到字符串c
#include <iostream> using namespace std; char a[210],b[210],c[500]; bool visit[210][210],ans; void DFS(int i,int j,int k) { if(c[k]=='\0') { ans=true; } if(ans || visit[i][j]) { return; } visit[i][j]=true; if(a[i]==c[k]) { DFS(i+1, j, k+1); } if(b[j]==c[k]) { DFS(i, j+1, k+1); } } int main() { int n; cin>>n; for(int i=1;i<=n;i++) { memset(visit, false, sizeof(visit)); ans=false; cin>>a>>b>>c; DFS(0, 0, 0); cout<<"Data set "<<i<<": "; if(ans) { cout<<"yes"<<endl; } else { cout<<"no"<<endl; } } return 0; }
相关文章推荐
- HDU-1501 (POJ-2192) Zipper (DFS||DP)
- hdu 1501 Zipper
- HDU 1501 Zipper(DFS)
- HDU 1501 Zipper【DP】
- hdu 1501 Zipper
- hdu 1501 Zipper(dfs或dp)
- 【记忆化搜索】HDU-1501 Zipper
- HDU 1501 Zipper
- hdu 1501 Zipper
- 【DFS(记忆化)】hdu 1501 Zipper
- hdu 1501 Zipper
- HDU 1501 Zipper
- POJ 2192 && HDU 1501 Zipper (记忆化搜索)
- hdu 1501 Zipper dfs
- Hdu 1501 Zipper
- hdu 1501 Zipper(dfs)
- hdu 1501 Zipper (dfs+记忆化搜索)
- HDU 1501 Zipper
- hdu 1501 Zipper
- HDU 1501 Zipper(DP/记忆化搜索)