Codeforces 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

题意：给你两个字符和旋转次数，问第一个字符是顺时针旋转还是逆时针旋转还是两个方向旋转都可以变成第二个字符

解题思路：将字符的四种状态用数组记录下来，然后判断初始状态和最终状态在哪个位置，然后判断哪种旋转方式可以成功即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int a[10],n;
char s1, s2;

int main()
{
a[0] = 118, a[1] = 60, a[2] = 94, a[3] = 62;
while (cin >> s1 >> s2)
{
scanf("%d", &n);
int k,kk;
for(int i=0; i<4; i++)
{
if ((int)s1 == a[i]) k = i;
if ((int)s2 == a[i]) kk = i;
}
if ((k + n) % 4 == kk && (((k-n) % 4) + 4) % 4 == kk) printf("undefined\n");
else if ((k + n) % 4 == kk) printf("cw\n");
else printf("ccw\n");
}
return 0;
}