CodeForces - 523C Name Quest

最新推荐文章于 2019-01-22 15:41:43 发布

axiqia

最新推荐文章于 2019-01-22 15:41:43 发布

阅读量622

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/axiqia/article/details/44710389

版权

ACM 专栏收录该内容

27 篇文章 1 订阅

订阅专栏

CodeForces - 523C

Name Quest

Description

A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more letters (at that, the remaining letters remain in the same order), he gets happy. For example, if s=«aba», then strings «baobab», «aabbaa», «helloabahello» make him very happy and strings «aab», «baaa» and «helloabhello» do not.

However rather than being happy once, he loves twice as much being happy twice! So, when he got string t as a present, he wanted to cut it in two parts (the left part and the right part) so that each part made him happy.

Help s determine the number of distinct ways to cut the given string t into two parts in the required manner.

Input

The first line contains string s, consisting of lowercase English letters. The length of string s is from 1 to 1000 letters.

The second line contains string t, that also consists of lowercase English letters. The length of string t is from 1 to 10⁶ letters.

Output

Print the sought number of ways to cut string t in two so that each part made s happy.

Sample Input

Input

aba
baobababbah

Output

Input

mars
sunvenusearthmarsjupitersaturnuranusneptune

Output

Source

VK Cup 2015 - Qualification Round 2

/*  
    coder: Shawn_Xue  
    date: 2015.3.16  
    result: AC  
*/ 
#include <iostream>
#include <string>

using namespace std;

int main()
{
    string s1, s2;
        
    while(cin >> s1 >> s2)
    {
        int len1 = s1.length();
        int len2 = s2.length();

        int m = 0;
        int n = len1;

        int i, j;

        for( i = 0; i < len2; i ++)
        {
            if(s2[i] == s1[m])
                m ++;
            if(m == len1)
                break;
        }

        for( j = len2-1; j >= i; j --)
        {
            if(s2[j] == s1[n-1])
                n --;
            if(n == 0)
                break;
        }
        //cout << i <<j <<endl;
        if(j > i)
            cout << j-i << endl;
        else
            cout << 0 << endl;
    }

    return 0;
}