A. The Useless Toy
2017-08-01 23:17
405 查看
Walking through the streets of Marshmallow City, Slastyona have spotted some merchants selling a kind of useless toy which is very popular nowadays – caramel spi
b860
nner! 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
*/
//题意:
/*
有四个方向,给出两个方向,再给出旋转的次数,输出是顺时针旋转的,还是逆时针旋转的。
cw顺时针,ccw逆时针
*/
b860
nner! 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
*/
//题意:
/*
有四个方向,给出两个方向,再给出旋转的次数,输出是顺时针旋转的,还是逆时针旋转的。
cw顺时针,ccw逆时针
*/
#if 0 #include<bits/stdc++.h> using namespace std; int main() { char c,cr; int a,b,k; cin>>c>>cr>>k; if(c=='^') a=1; else if(c=='>') a=2; else if(c=='v') a=3; else if(c=='<') a=4; if(cr=='^') b=1; else if(cr=='>') b=2; else if(cr=='v') b=3; else if(cr=='<') b=4; if(k%2==0) cout<<"undefined"<<endl; else if((a==1&&b==2)||(a==2&&b==3)||(a==3&&b==4)||(a==4&&b==1)) { if(k%4==1) cout<<"cw"<<endl; else if(k%4==3) cout<<"ccw"<<endl; } else if((a==2&&b==1)||(a==3&&b==2)||(a==4&&b==3)||(a==1&&b==4)) { if(k%4==1) cout<<"ccw"<<endl; else if(k%4==3) cout<<"cw"<<endl; } } #endif
相关文章推荐
- Codeforces Round #426 (Div. 2) A. The Useless Toy
- 【CodeForces】426Div2 A The Useless Toy
- Codeforces 834 A The Useless Toy
- Codeforces Round #426 (Div. 2) A The Useless Toy
- Codeforces Round #426 (Div. 2) A The Useless Toy
- Codeforces Round #426 (Div. 2) A. The Useless Toy
- #426 (Div. 2) A. The Useless Toy
- CodeForces 834 A.The Useless Toy(水~)
- codeforces 834-A. The Useless Toy
- Codeforces 834A - The Useless Toy
- Codeforces Round #426 (Div. 2) The Useless Toy
- Codeforces Round #426 (Div. 2) The Useless Toy 数组环
- CF834A-The Useless Toy
- CF 834A-The Useless Toy
- Codeforces 843A:The Useless Toy
- The Useless Toy
- 【Codeforces Round #426 (Div. 2) A】The Useless Toy
- A. The Useless Toy
- cfThe Useless Toy(水)
- (模拟)Codeforces Round #426 A. The Useless Toy