hdoj Zipper 1501 (DP||DFS)两字符串组合为一个字符串
来源:互联网 发布:ubuntu共享文件夹 编辑:程序博客网 时间:2024/06/07 19:55
Zipper
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8551 Accepted Submission(s): 3017
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//题意:给你3个字符串,问第三个字符串是否可以由前两个字符串组成(并且前两个字符串的字符顺序不能改变)#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;char a[210];char b[210];char c[410];int vis[210][210];int dfs(int i,int j,int k){if(c[k]=='\0')return 1;if(vis[i][j])return 0;vis[i][j]=1;if(a[i]==c[k]&&dfs(i+1,j,k+1))return 1;if(b[j]==c[k]&&dfs(i,j+1,k+1))return 1;return 0;}int main(){int t,T=1;scanf("%d",&t);while(t--){memset(vis,0,sizeof(vis));scanf("%s%s%s",a,b,c);printf("Data set %d: ",T++);if(dfs(0,0,0))printf("yes\n");elseprintf("no\n");}return 0;}
0 0
- hdoj Zipper 1501 (DP||DFS)两字符串组合为一个字符串
- HDOJ 1501 Zipper(dfs)
- HDOJ 题目1501 Zipper(DFS)
- Zipper(DFS,DP)
- hdoj 1501 Zipper 【DFS + 剪枝】
- POJ-2192 Zipper-DP-字符串
- HDU 1501 Zipper(DP,DFS)
- HDU 1501 Zipper(DP,DFS)
- POJ2192 Zipper(DP||DFS)
- hdu1501 Zipper(dfs && dp)
- HDOJ Zipper (DFS)
- HDU-1501 (POJ-2192) Zipper (DFS||DP)
- hdu 1501 Zipper(dfs或dp)
- POJ 2192 Zipper(字符串)
- HDU 1501 Zipper(DFS)
- HDU 1501 Zipper (DFS)
- hdu 1501 Zipper(dfs)
- 暑期dp46道(26)HDOJ 1501 Zipper dfs+记忆化搜索
- iOS 7 的实时毛玻璃模糊 (live blur)
- GCD死锁
- Python集合
- Openstack通用技术
- VMWare11虚拟机安装OSX10.9系统图文教 mac
- hdoj Zipper 1501 (DP||DFS)两字符串组合为一个字符串
- 【代码笔记】iOS-点击搜索跳转到另外一个页面
- hibernate中ehcache何时会被调用
- javascript中的比较
- Java SE 学习笔记 chapter2
- UIsearchController
- opencv-图像增强
- 《纸牌屋》是如何成为热播剧的?
- 《Android源码设计模式解析与实战》读书笔记(二十)