The Useless Toy（水题 暴力枚举）
来源：互联网 发布：thinkphp5开发大型cms 编辑：程序博客网 时间：2024/05/01 15:09
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 <bits/stdc++.h>using namespace std;int main(){ char ch1,ch2,s; int t,flag=0,flag1=0; while(cin>>ch1>>ch2) { cin>>t; t=t%4; if(ch1=='^') { if(t==0) { cout<<"undefined"<<endl; break; } if(t==1) { flag=0; flag1=0; s='>'; if(s==ch2) { flag=1; } s='<'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } if(t==2) { /* flag=0; flag1=0; s='v'; if(s==ch2) { flag=1; } s='v'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; */ s='v'; if(s==ch2) cout<<"undefined"<<endl; } if(t==3) { flag=0; flag1=0; s='<'; if(s==ch2) { flag=1; } s='>'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } } else if(ch1=='>') { if(t==0) { cout<<"undefined"<<endl; break; } if(t==1) { flag=0; flag1=0; s='v'; if(s==ch2) { flag=1; } s='^'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } if(t==2) { /*flag=0; flag1=0; s='<'; if(s==ch2) { flag=1; } s='<'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; */ s='<'; if(s==ch2) cout<<"undefined"<<endl; } if(t==3) { flag=0; flag1=0; s='^'; if(s==ch2) { flag=1; } s='v'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } } else if(ch1=='v') { if(t==0) { cout<<"undefined"<<endl; break; } if(t==1) { flag=0; flag1=0; s='<'; if(s==ch2) { flag=1; } s='>'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } if(t==2) { /*flag=0; flag1=0; s='^'; if(s==ch2) { flag=1; } s='^'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; */ s='^'; if(s==ch2) cout<<"undefined"<<endl; } if(t==3) { flag=0; flag1=0; s='>'; if(s==ch2) { flag=1; } s='<'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } } else if(ch1=='<') { if(t==0) { cout<<"undefined"<<endl; break; } if(t==1) { flag=0; flag1=0; s='^'; if(s==ch2) { flag=1; } s='v'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } if(t==2) { /*flag=0; flag1=0; s='>'; if(s==ch2) { flag=1; } s='>'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; */ s='>'; if(s==ch2) cout<<"undefined"<<endl; } if(t==3) { flag=0; flag1=0; s='v'; if(s==ch2) { flag=1; } s='^'; if(s==ch2&&!flag) { flag1=1; } if(flag==1&&flag1!=1) cout<<"cw"<<endl; else if(flag!=1&&flag1==1) cout<<"ccw"<<endl; else cout<<"undefined"<<endl; } } } return 0;}优化后的代码： #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; } 唉唉唉。。。非得搞得那么复杂化。。。- The Useless Toy（水题 暴力枚举）
- Codeforces834A The Useless Toy
- CF834A-The Useless Toy
- The Useless Toy
- The Useless Toy
- A. The Useless Toy
- A. The Useless Toy
- 834A. The Useless Toy
- CodeForces 834 A.The Useless Toy（水~）
- Codeforces 834A-The Useless Toy
- 【CodeForces】426Div2 A The Useless Toy
- Codeforces 834 A The Useless Toy
- CodeForces 834A The Useless Toy
- CF 834A-The Useless Toy
- codeforces 834-A. The Useless Toy
- #426 (Div. 2) A. The Useless Toy
- codeforces 834A The Useless Toy
- 【CodeForces】834A The Useless Toy 水
- opencv 分辨率与resize
- 各种排序算法解析
- Java常用类及其方法（四）Integer
- Java实践（四）---进阶笔记之二
- 商务谈判
- The Useless Toy（水题 暴力枚举）
- cookie和jsp的简介
- 【笨鸟先飞】Java重新学习日记7---高级数组之集合
- hdu 5365 计算几何 给几个点判断是否为正方形
- Codeforces 835 D Palindromic characteristics（区间DP）
- Qt一步步搭建TcpServer1——封装QTcpServer，QTcpSocket
- 仿饿了么搜索页面特效
- 指针数组实现字符排序
- Java常用类及其方法（五）Character
