All in All, UVa 10340

最新推荐文章于 2023-11-28 21:17:33 发布

转载最新推荐文章于 2023-11-28 21:17:33 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Genesis2018/p/9079928.html

本文介绍了一个用于验证消息是否被巧妙地通过插入随机生成的字符串进行编码的算法。通过比较两个字符串来判断一个字符串是否是另一个字符串的子序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

All in All

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 Specification

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 Specification

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<stdio.h>
#include<string.h>
int main()
{
    char s[100001], t[100001];
    while(scanf("%s %s", s, t)!=EOF)
    {
        int len_t=strlen(t), len_s=strlen(s);
        int count_s=0;
        for(int i=0; i<len_t; i++)
        {
            if(s[count_s]==t[i])
                count_s++;
        }
        if(count_s == len_s)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}

转载于:https://www.cnblogs.com/Genesis2018/p/9079928.html