zoukankan      html  css  js  c++  java
  • All in All

        You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.

        Given two strings and t , you have to decide whether s  is a subsequence of t , i.e. if you can remove

    characters from t  such that the concatenation of the remaining characters is s .

     

    Input

        The input contains several testcases. Each is specied by two strings s , t  of alphanumeric ASCII

    characters separated by whitespace. Input is terminated by EOF .

     

    Output

        For each test case output, if s is a subsequence of t .

     

    Sample Input

    sequence subsequence

    person compression

    VERDI vivaVittorioEmanueleReDiItalia

    caseDoesMatter CaseDoesMatter

     

    Sample Output

    Yes

    No

    Yes

    No

    #include <iostream>
    using namespace std;
    char s[100000],t[100000];
    int p,q;
    int main() {
        while (scanf("%s%s",s,t)==2) {
            p=0;
            q=0;
            while (s[p]!=''&&t[q]!='') {
                if (t[q]==s[p]) p++;
                q++;
            }
            if (s[p]=='') printf("Yes
    ");
            else printf("No
    ");
        }
    }
  • 相关阅读:
    Nginx与Apache的对比
    gc buffer busy waits(ZT)
    Brocade SAN Switch Change Domain ID (ZT)
    Oracle异机恢复时报错ora19870 ora19507
    row cache lock (ZT)
    can a select block a truncate (ZT)
    NBU常用命令
    the RRD does not contain an RRA matching the chosen C
    Solaris10 x64安装64bit perl
    Solaris and Oracle 32bit Linking Error "fatal: symbol 'ntcontab'
  • 原文地址:https://www.cnblogs.com/soildom/p/8323788.html
Copyright © 2011-2022 走看看