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

    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 s 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 specified 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

    Select Code
    #include <bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        string str,sub;
        int sum=0,ans=0;
        while(cin>>sub>>str)
        {
            int j=0,ans=0,k=0;
            for(int i=0;i<sub.size();i++)
            {
                for(;j<str.size();j++)
                {
                    if(sub[i]==str[j]) {j++;ans++;break;}
                }
                if(ans==sub.size()) {cout<<"Yes"<<endl;k=1;}
            }
            if(!k) cout<<"No"<<endl;
        }
        return 0;
    }
    所遇皆星河
  • 相关阅读:
    工单系统(帮助中心)
    理解RESTful架构
    trace显示不出东西
    thinkphp
    在一个元素中查找子元素
    阻止表单元素失去焦点
    RelativeLayout不能调用measure去直接测量子元素
    兼容加载Xml字符串
    IE下载时提示无法下载,重试后成功
    借用layer让弹层不限制在iframe内部
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11632270.html
Copyright © 2011-2022 走看看