uva 10340 - All in All

最新推荐文章于 2022-01-10 10:33:49 发布

滑头鬼之亨

最新推荐文章于 2022-01-10 10:33:49 发布

阅读量932

点赞数

分类专栏：贪心文章标签： concatenation encryption input output each

本文链接：https://blog.csdn.net/Frankiller/article/details/7900855

版权

贪心专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Problem E

All in All

Input: standard input

Output: standard output

Time Limit: 2 seconds

Memory Limit: 32 MB

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 s1[100010],s2[100010];
 int i,j;
 while (scanf("%s%s",&s1,&s2)==2)
 {
  for (i=0,j=0;s1[i]!='\0'&&s2[j]!='\0';j++)
  if (s1[i]==s2[j]) ++i;
  if (s1[i]=='\0') printf("Yes\n");
              else printf("No\n");
 }
 return 0;
}