CF 834A-The Useless Toy

The Useless Toy

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Walking through the streets of Marshmallow City, Slastyona have spotted some merchants selling a kind of useless toy which is very popular nowadays – caramel spinner! Wanting to join the craze, she has immediately bought the strange contraption.

Spinners in Sweetland have the form of V-shaped pieces of caramel. Each spinner can, well, spin around an invisible magic axis. At a specific point in time, a spinner can take 4 positions shown below (each one rotated 90 degrees relative to the previous, with the fourth one followed by the first one):

After the spinner was spun, it starts its rotation, which is described by a following algorithm: the spinner maintains its position for a second then majestically switches to the next position in clockwise or counter-clockwise order, depending on the direction the spinner was spun in.

Slastyona managed to have spinner rotating for exactly n seconds. Being fascinated by elegance of the process, she completely forgot the direction the spinner was spun in! Lucky for her, she managed to recall the starting position, and wants to deduct the direction given the information she knows. Help her do this.

Input

There are two characters in the first string – the starting and the ending position of a spinner. The position is encoded with one of the following characters: v (ASCII code 118, lowercase v), < (ASCII code 60), ^ (ASCII code 94) or > (ASCII code 62) (see the picture above for reference). Characters are separated by a single space.

In the second strings, a single number n is given (0 ≤ n ≤ 109) – the duration of the rotation.

It is guaranteed that the ending position of a spinner is a result of a n second spin in any of the directions, assuming the given starting position.

Output

Output cw, if the direction is clockwise, ccw – if counter-clockwise, and undefined otherwise.

Examples
input
^ >
1
output
cw
input
< ^
3
output
ccw
input
^ v
6
output
undefined

题意：有四种变换图形，分别为V < ^ > V,然后给你初始位置和结束位置，再给你一个数 n，如果初始位置的图形经过n次顺时针改变到结束位置图形，则输出cw，若是逆时 针变换到结束位置图案，则输出ccw，若其他的就输出undefined，wa了三次，好尴 尬，原因就是没有理解到什么样的情况才能输出undefined，然后想到如果正反都能 得到结束位置的图形，就输出undefined，然后就对了。

#include <iostream>
#include<string.h>
#include<string>
#include<stdio.h>
using namespace std;
int main()
{
    char s[15];
    s[1]=s[5]=s[9]=118;
    s[2]=s[6]=s[10]=60;
    s[3]=s[7]=s[11]=94;
    s[4]=s[8]=s[12]=62;
    char c1,c2;
    long long n;
    scanf("%c %c",&c1,&c2);
    scanf("%lld",&n);
    n%=4;
    for(int i=5;i<=8;i++)
    {
        if(c1==s[i])
        {
            if(s[i+n]==c2&&s[i-n]==c2)
                printf("undefined\n");
            else if(s[i+n]==c2&&s[i-n]!=c2)
                printf("cw\n");
            else if(s[i-n]==c2&&s[i+n]!=c2)
                printf("ccw\n");
        }

    }
    return 0;
}