zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–1970 All in All

    Time Limit: 2 Seconds      Memory Limit: 65536 KB


    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, print "Yes" if s is a subsequence of t or "No" if not.

    Sample Input

    sequence subsequence
    person compression
    VERDI vivaVittorioEmanueleReDiItalia
    caseDoesMatter CaseDoesMatter

    Sample Output

    Yes
    No
    Yes
    No


    Source: University of Ulm Local Contest 2002

      1: #include<iostream>
    
      2: #include<string>
    
      3: using namespace std;
    
      4: int main(void)
    
      5: {
    
      6:   string s,t;
    
      7:   while(cin>>s>>t)
    
      8:   {
    
      9:     int preIndex = -1;
    
     10:     bool no = false;
    
     11:     for(int i = 0; i < s.length(); i++)
    
     12:     {
    
     13:       int index = t.find_first_of(s[i], preIndex + 1);
    
     14:       if(index == string::npos)
    
     15:       {
    
     16:         cout<<"No"<<endl;
    
     17:         no = true;
    
     18:         break;
    
     19:       }
    
     20:       preIndex = index;
    
     21:     }
    
     22:     if(!no)
    
     23:       cout<<"Yes"<<endl;
    
     24:   }
    
     25:   return 0;
    
     26: }
  • 相关阅读:
    常用的dos命令
    定时器
    自动化工具下载地址
    Eclipse自动提示
    An error occurred: No action handlers found
    生产消费的经典案例
    SpringBoot 优雅的参数效验
    40 个 SpringBoot 常用注解
    极简入门,Shiro的认证与授权流程解析
    Java多线程批量处理、线程池的使用
  • 原文地址:https://www.cnblogs.com/malloc/p/2494449.html
Copyright © 2011-2022 走看看