A. Chess For Three
来源:互联网 发布:学校网络舆情应急预案 编辑:程序博客网 时间:2024/06/04 20:31
Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two players, not three.
So they play with each other according to following rules:
- Alex and Bob play the first game, and Carl is spectating;
- When the game ends, the one who lost the game becomes the spectator in the next game, and the one who was spectating plays against the winner.
Alex, Bob and Carl play in such a way that there are no draws.
Today they have played n games, and for each of these games they remember who was the winner. They decided to make up a log of games describing who won each game. But now they doubt if the information in the log is correct, and they want to know if the situation described in the log they made up was possible (that is, no game is won by someone who is spectating if Alex, Bob and Carl play according to the rules). Help them to check it!
The first line contains one integer n (1 ≤ n ≤ 100) — the number of games Alex, Bob and Carl played.
Then n lines follow, describing the game log. i-th line contains one integer ai (1 ≤ ai ≤ 3) which is equal to 1 if Alex won i-th game, to 2 if Bob won i-th game and 3 if Carl won i-th game.
Print YES if the situation described in the log was possible. Otherwise print NO.
3112
YES
212
NO
In the first example the possible situation is:
- Alex wins, Carl starts playing instead of Bob;
- Alex wins, Bob replaces Carl;
- Bob wins.
The situation in the second example is impossible because Bob loses the first game, so he cannot win the second one.
解题说明:此题是一道模拟题,需要找到下面规律:6-每次的胜者-上一局被放置play的人=下一局被放置play的人 。
#include<cstdio>#include<iostream>#include<string>#include<cstring>#include<cmath>using namespace std;int main() {int i,n, a[10000];int match = 3;scanf("%d", &n);for (i = 0; i<n; i++) {scanf("%d", &a[i]);if (a[i] == match) {printf("NO\n");return 0;}else{match = 6 - match - a[i];}}printf("YES\n");return 0;}
- chess for three A
- A. Chess For Three
- CodeForces 893A Chess For Three
- cfA. Chess For Three
- 【 Educational Codeforces Round 33 A】Chess For Three
- Codeforce 893A Chess For Three (模拟)
- codeforces893A chess for three题解
- Educational Codeforces Round 33 (Rated for Div. 2) 893A. Chess For Three
- Static Equilibrium for a Plate with Support at Three Points
- Codeforces Edu 33 A 893AChess For Three
- hdu1524 A Chess Game
- A Chess Game
- A. Kalevitch and Chess
- POJ A Chess Game
- A. Rikka with Chess
- HDU5794 A Simple Chess
- HDU5794 A Simple Chess
- HDU5794 A Simple Chess
- linux零环境安装apache
- Java的Spi机制研究
- Linux系列—centos7 更新yum源
- UART接口与COM口的区别
- 公众号门店分类联动,微信门店管理,改变分类后,下级分类自动变化
- A. Chess For Three
- java web之路 jsp page对象 pageContext对象
- Jupyter运行时出现下面的错误:Unexpected error while saving file: arma/Untitled.ipynb [Errno 13] Permission deni
- &传参
- Spring工作原理
- 分布式事物 TCC模式见解
- spring事务传播机制-REQUIRED嵌套REQUIRES_NEW
- NEUQOJ:1104 3n+1数链
- 关于RIP