Zipper
来源:互联网 发布:java io流读取txt文件 编辑:程序博客网 时间:2024/05/16 15:55
http://poj.org/problem?id=2192
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<stdio.h>
#include<string.h>
#define NN 405
char s1[NN],s2[NN],s3[NN];
int m,len1,len2,len3,flag;
void DFS(int x,int y,int z)
{
if(z>=len3)
{
flag=1;
return;
}
if(flag)
{
return;
}
if(s1[x]!=s3[z]&&s2[y]!=s3[z])
{
return;
}
if(s1[x]==s3[z]&&x<len1)
DFS(x+1,y,z+1);
if(s2[y]==s3[z]&&y<len2)
DFS(x,y+1,z+1);
}
int main()
{
int i,j;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
flag=0;
scanf("%s %s %s",s1,s2,s3);
len1=strlen(s1);
len2=strlen(s2);
len3=strlen(s3);
printf("Data set %d: ",i);
if(s1[len1-1]!=s3[len3-1]&&s2[len2-1]!=s3[len3-1])//实际上不要这步判断也是可以的但会超时。
{
printf("no\n");
continue;
}
if(len1+len2!=len3)
{
printf("no\n");
continue;
}
DFS(0,0,0);
if(flag==0)
printf("no\n");
else
printf("yes\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
- java正则表达式验证IP,邮箱类
- 三个字摞一起念什么?【肯定有你不知道的】
- 互联网的大变局 HTML5是趋势非最佳选择
- ALV布局
- ubuntu终端telnet乱码
- Zipper
- 双缓冲初解
- Java 基础一些代码练习笔记( GenericFoo<T> 泛型2)
- Arduino第五次实验---NOKIA手机蓝牙控制小车前进
- actionscript数组
- 扑克你所不知道的
- Android NDK 日志
- 不借助第三个变量实现两个变量之间的值传递和交换
- powershell-无法加载文件,因为在此系统中禁止执行脚本。