UVA10340-All in all

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

hentaidesu

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

阅读量327

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM UVA 文章标签： UVA ACM

本文链接：https://blog.youkuaiyun.com/hentaidesu/article/details/47067335

ACM 同时被 2 个专栏收录

18 篇文章

订阅专栏

UVA

16 篇文章

订阅专栏

本文探讨了一种创新的加密方法，通过插入随机生成的字符串来编码消息。为了验证此方法的有效性，开发了一个程序来判断最终字符串是否包含原始消息的子序列。文章详细阐述了如何通过比较两个字符串来确定一个是否为另一个的子序列，提供了多个实例以展示方法的应用。

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

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 ﬁnal 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 speciﬁed 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

注意遍历过程中t与s的顺序，并不是在t中找到s的字符即可，还要有s的顺序。

代码如下：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Maxn 100010
char s[Maxn],t[Maxn];
int main()
{
    int i,j,m,c;
    while(scanf("%s%s",s,t)!=-1)
    {
        m=0;c=0;j=0;
        for(i=0;i<strlen(s);i++)
        {
			j=m;
            for(;j<strlen(t);)
            {
            	j=m;
                if(s[i]==t[j])
                {
                    m++;c++;break;
                }
                m++;
            }
        }
        if(c==strlen(s))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}