POJ 1936.All in All

305


题目




Description  



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.The length of s and t will no more than 100000.


Output  



For each test case output "Yes", if s is a subsequence of t,otherwise output "No".


Sample Input  



sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter


Sample Output  



Yes
No
Yes
No


 


题解



应该算是水题吧~

用两个变量记录指向s、t字符串的位置。

如果相等,则把指向s的+1

看循环完s是否在最后即可


代码



/*
By:OhYee
Github:OhYee
HomePage:http://www.oyohyee.com
Email:oyohyee@oyohyee.com
Blog:http://www.cnblogs.com/ohyee/

かしこいかわいい?
エリーチカ!
要写出来Хорошо的代码哦~
*/

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <iostream>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
using namespace std;

//DEBUG MODE
#define debug 0

//循环
#define REP(n) for(int o=0;o<n;o++)

const int maxn = 100005;

bool Do() {
    char s[maxn],t[maxn];
    if(scanf("%s%s",s,t) == EOF)
        return false;
    
    int t_len = strlen(t);
    int s_len = strlen(s);

    int it = 0;
    for(int i = 0;i < t_len;i++) {
        if(s[it] == t[i])
            it++;
        if(it == s_len)
            break;
    }

    printf("%s\n",(it == s_len) ? "Yes" : "No");

    return true;
}

int main() {
    while(Do());
    return 0;
}
发布评论
  • 点击查看/关闭被识别为广告的评论