URAL 1102. Strange Dialog

题目链接：http://acm.timus.ru/problem.aspx?space=1&num=1102

正着做9种情况：

in

input

inputon

inputone

out

output

outputon

outputone

one

反着做貌似更简单一些，情况更少一点。

我是正着做的。

#include <cstdio>

const int MAXN = 10000000 + 5;

char str[MAXN];

bool Judge()
{
    if ( !(str[0] == 'o' || str[0] == 'p' || str[0] == 'i') ) return false;
    int i = 0;
    while ( str[i] != '\0' )
    {
        switch( str[i] )
        {
        case 'o':
            if ( str[i+1] == 'u' && str[i+2] == 't' )
            {
                if ( str[i+3] == 'p' && str[i+4] == 'u' && str[i+5] == 't' )
                {
                    if ( str[i+6] == 'o' && str[i+7] == 'n' )
                    {
                        i += 8;
                        if ( str[i] == 'e' ) ++i;

                    }
                    else i += 6;
                }
                else i += 3;
            }
            else if ( str[i+1] == 'n' && str[i+2] == 'e' )
                i += 3;
            else return false;
            break;
        case 'i':
            if ( str[i+1] == 'n' )
            {
                if ( str[i+2] == 'p' && str[i+3] == 'u' && str[i+4] == 't' )
                {
                    if ( str[i+5] == 'o' && str[i+6] == 'n' )
                    {
                        i += 7;
                        if ( str[i] == 'e' ) ++i;
                    }
                    else i += 5;
                }
                else i += 2;
            }
            else return false;
            break;
        case 'p':
            if ( str[i+1] == 'u' && str[i+2] == 't' && str[i+3] == 'o' && str[i+4] == 'n' ) i += 5;
            else return false;
            break;
        default :return false;
        }
    }
    return true;
}

int main()
{
    int n;
    scanf( "%d", &n );
    while ( n-- )
    {
        scanf( "%s", str );
        if ( Judge() ) puts("YES");
        else puts("NO");
    }
    return 0;
}