POJ 2192
来源:互联网 发布:php软件公司源码 编辑:程序博客网 时间:2024/06/05 16:49
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<string.h>#include<cstdio>#include<cstdlib>#include<vector>#include<iostream>#include<algorithm>#define M 201using namespace std;string s1,s2,s3;int l1,l2,l3;int a[M][M];void dp(int data){int i,j,k,t1,t2;for(i=1;i<=l2;i++)a[0][i]=a[0][i-1]+(s2[i-1]==s3[i-1]);for(i=1;i<=l1;i++)a[i][0]=a[i-1][0]+(s1[i-1]==s3[i-1]);for(i=1;i<=l1;i++)for(j=1;j<=l2;j++)a[i][j]=max(a[i-1][j]+(s1[i-1]==s3[i+j-1]),a[i][j-1]+(s2[j-1]==s3[i+j-1]));cout<<"Data set "<<data<<": ";if(a[l1][l2]==l3)cout<<"yes";elsecout<<"no";cout<<endl;}void init(){cin>>s1>>s2>>s3;l1=s1.length();l2=s2.length();l3=s3.length();}int main(){int n;cin>>n;for(int i=1;i<=n;i++){init();dp(i);}return 0;}
阅读全文
0 0
- poj 2192
- poj 2192
- poj 2192
- POJ 2192
- POJ 2192
- POJ-2192
- POJ 2192
- POJ 2192
- POJ 2192 Zipper
- poj 2192 Zipper
- poj 2192 Zipper DP
- Poj 2192 Zipper
- poj 2192 DFS+剪枝
- DFS poj 2192 zipper
- DP poj 2192
- poj 2192 dp
- poj 2192 字符串匹配
- poj 2192 zipper
- 2048小游戏
- struts2_ognl和valueStack简介
- [bigdata] IntelliJ run project
- Toolbar的使用
- 最小生成树问题
- POJ 2192
- 欢迎使用CSDN-markdown编辑器
- shell
- vi编辑器
- python 元组
- Prim算法
- shell 命令执行顺序 一
- shell执行命令顺序 二
- poj2528 线段树+骚气的离散化姿势