Codeforces Round #426 (Div. 2)-A. The Useless Toy

最新推荐文章于 2020-03-19 09:02:27 发布

临渊行

最新推荐文章于 2020-03-19 09:02:27 发布

阅读量219

点赞数

分类专栏： Codeforces 文章标签：找规律

本文链接：https://blog.csdn.net/qq_32360995/article/details/76409402

版权

Codeforces 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

题目：

A. The Useless Toy

time limit per test 1 second

memory limit per test 256 megabytes

input

standard input

output

standard output

$\text{[math]}$

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):

$\text{[math]}$

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 ≤ 10⁹) – 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,<），顺时针输出cw，逆时针输出ccw，不确定输出undefined

思路：找规律，判断旋转90、180、360度...后的状态

CODE:

#include<bits/stdc++.h>
using namespace std;
int main()
{
        int n;
        char ch1,ch2;
        while(~scanf("%c%*c%c%d%*c",&ch1,&ch2,&n)){
                if(ch1=='^'){
                        if(ch2=='^'||ch2=='v') puts("undefined");
                        else if(ch2=='>'){
                                if(n%4==1) puts("cw");
                                else puts("ccw");
                        }
                        else{
                                if(n%4==1) puts("ccw");
                                else puts("cw");
                        }
                }
                else if(ch1=='>'){
                        if(ch2=='>'||ch2=='<') puts("undefined");
                        else if(ch2=='v'){
                                if(n%4==1) puts("cw");
                                else puts("ccw");
                        }
                        else{
                                if(n%4==1) puts("ccw");
                                else puts("cw");
                        }
                }
                else if(ch1=='v'){
                        if(ch2=='v'||ch2=='^') puts("undefined");
                        else if(ch2=='<'){
                                if(n%4==1) puts("cw");
                                else puts("ccw");
                        }
                        else{
                                if(n%4==1) puts("ccw");
                                else puts("cw");
                        }
                }
                else{
                        if(ch2=='>'||ch2=='<') puts("undefined");
                        else if(ch2=='^'){
                                if(n%4==1) puts("cw");
                                else puts("ccw");
                        }
                        else{
                                if(n%4==1) puts("ccw");
                                else puts("cw");
                        }
                }
        }
    return 0;
}