算法竞赛入门经典（刘汝佳）习题3-9 UVa10340

//2017 3 13 P59 习题3-9（子序列） #include<stdio.h>#include<string.h>#include<stdlib.h>#define MAXN 1000int main(){    char s[MAXN], t[MAXN];    scanf("%s %s",s , t);    int len_s = strlen(s);    int len_t = strlen(t);    int j = 0;    for(int i = 0;i <= len_t;i++)    {        if(s[j] == t[i])        {            if(j == len_s)            {                printf("%s can get %s.\n",t , s);                exit(0);            }            else                j++;        }    }    printf("%s can not get %s\n",t , s);    return 0;}