zoukankan      html  css  js  c++  java
  • hdu1501 poj2192

                                                                                      Zipper
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 14425   Accepted: 5110

    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

    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<string>
    using namespace std;char s1[410],s2[410],s3[410];int len1,len2,len3;
    int dfs(int x,int y,int t)
    {
        if(len1==x && len2==y) return 1;
        if(s3[t]==s1[x] && x<len1)
        {
            if(dfs(x+1,y,t+1))
                return 1;
    
        }
        if(s3[t]==s2[y] && y<len2)
        {
            if(dfs(x,y+1,t+1))
                return 1;
        }
        return 0;
    }
    int main()
    {
        
        int n;
        scanf("%d",&n);int h=1;
        while(n--)
        {
            scanf("%s %s %s",s1,s2,s3);
             len1 = strlen(s1);
             len2 = strlen(s2);
             len3 = strlen(s3);
        
            if(s3[len3-1]!=s1[len1-1] && s3[len3-1]!=s2[len2-1] ||(len1+len2)!=len3)
            {
                printf("Data set %d: no
    ",h++);
            }
            else
            {
                if(dfs(0,0,0))
                    printf("Data set %d: yes
    ",h++);
                else
                    printf("Data set %d: no
    ",h++);
            }
        }
        return 0;
    }
  • 相关阅读:
    使用QT实现一个简单的登陆对话框(纯代码实现C++)
    vivado + hdmi+ddr3(2)--------基于VIVADO的DDR3三个时钟
    Verilog实现之任意分频电路
    Verilog实现之异步fifo
    vivado + hdmi+ddr3(1)--------HDMI接口协议介绍及实现
    verilog实现之同步FIFO
    FPGA 开发基础---------格雷码转二进制
    verilog之生成语句
    verilog 实现之RAM
    FPGA开发基础--------Handshake Protocol握手协议(1)
  • 原文地址:https://www.cnblogs.com/Deng1185246160/p/3220302.html
Copyright © 2011-2022 走看看