Codeforces 834A-The Useless Toy
来源:互联网 发布:图片剪刀手软件 编辑:程序博客网 时间:2024/05/22 02:10
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.
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 cw, if the direction is clockwise, ccw – if counter-clockwise, and undefined otherwise.
^ >1
cw
< ^3
ccw
^ v6
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 longconst 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;}
- Codeforces 834A-The Useless Toy
- Codeforces 834 A The Useless Toy
- CodeForces 834A The Useless Toy
- codeforces 834-A. The Useless Toy
- codeforces 834A The Useless Toy
- 【CodeForces】834A The Useless Toy 水
- 834A. The Useless Toy
- CodeForces 834 A.The Useless Toy(水~)
- 【CodeForces】426Div2 A The Useless Toy
- Codeforces 843A:The Useless Toy
- A. The Useless Toy
- A. The Useless Toy
- CF 834A-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
- (模拟)Codeforces Round #426 A. The Useless Toy
- Codeforces Round #426 (Div. 2) A. The Useless Toy
- 量子支票--淘汰比特币们的新技术
- C++学习-I/O
- .NET C#到Java没那么难,DB篇
- CBoard框架使用总结三--AdminLTE可扩展性分析
- 头节点链表C程序
- Codeforces 834A-The Useless Toy
- 中大型网站架构演变之路
- Java 图形界面开发--图文并茂建立学生管理系统
- 默认参数
- 全面介绍Windows内存管理机制及C++内存分配实例
- iMindMap思维导图软件之树状思维导图
- Java基础拾遗(二)
- MATLAB与FPGA设计滤波器2-1
- 【JavaScript学习】Date类型