zoukankan      html  css  js  c++  java
  • poj 3913(水)

    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

    The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace.The length of s and t will no more than 100000.

    Output

    For each test case output "Yes", if s is a subsequence of t,otherwise output "No".

    Sample Input

    sequence subsequence
    person compression
    VERDI vivaVittorioEmanueleReDiItalia
    caseDoesMatter CaseDoesMatter
    

    Sample Output

    Yes
    No
    Yes
    No
    题意:递增或递减
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cmath>
     4 #include<algorithm>
     5 typedef long long ll;
     6 #include<cstring>
     7 #define N 200
     8 using namespace std;
     9 int main()
    10 {
    11     int t;
    12     scanf("%d",&t);
    13     int a[N],b[N],c[N];
    14     for(int i=0;i<t;i++)
    15     {
    16         scanf("%d%d%d",&a[i],&b[i],&c[i]);
    17     }
    18     printf("Gnomes:
    ");
    19     for(int j=0;j<t;j++)
    20     {
    21         if((a[j]<b[j]&&b[j]<c[j])||(a[j]>b[j]&&b[j]>c[j]))
    22             printf("Ordered
    ");
    23         else
    24             printf("Unordered
    ");
    25     }
    26 }

  • 相关阅读:
    作业3月30号
    21、,模块与包的使用
    作业3月26号
    20、面向函数与匿名函数及模块
    作业3月25号
    19、迭代器及函数的递归调用
    作业3月24号
    06-函数
    3.17---购物车练习
    3.15---文件处理练习2
  • 原文地址:https://www.cnblogs.com/Aa1039510121/p/5809199.html
Copyright © 2011-2022 走看看