zoukankan      html  css  js  c++  java
  • Wanna go back home

    题目描述

    Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1≤i≤N), he will travel a positive distance in the following direction:

    North if the i-th letter of S is N
    West if the i-th letter of S is W
    South if the i-th letter of S is S
    East if the i-th letter of S is E
    He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.

    Constraints
    1≤|S|≤1000
    S consists of the letters N, W, S, E.

    输入

    The input is given from Standard Input in the following format:
    S

    输出

    Print Yes if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print No.

    样例输入

    SENW
    

    样例输出

    Yes
    

    提示

    If Snuke travels a distance of 1 on each day, he will be back at home at the end of day 4.

    这题队友WA了3发。。。

    主要是那句 He has not decided each day's travel distance.

    这个其实东南西北只要都走一遍就好了

    不要忘记努力,不要辜负自己 欢迎指正 QQ:1468580561
  • 相关阅读:
    delphi AlphaControls
    MATLAB 中NORM运用
    matlab画图形函数 semilogx
    fir2(n,f,m)
    离散系统频响特性函数freqz()
    snr ber Eb/N0之间的区别与联系
    MATLAB中白噪声的WGN和AWGN函数的使用
    matlab 功率谱分析
    用matlab实现同一个序列重复N倍
    Stem函数绘图
  • 原文地址:https://www.cnblogs.com/smallocean/p/8799300.html
Copyright © 2011-2022 走看看