Educational Codeforces Round 33 (Rated for Div. 2)----A. Chess For Three

最新推荐文章于 2022-10-05 21:56:05 发布

weixin_30454481

最新推荐文章于 2022-10-05 21:56:05 发布

阅读量83

点赞数

原文链接：http://www.cnblogs.com/chsobin/p/7988572.html

版权

*原题链接 http://codeforces.com/contest/893/problem/A

*所用算法

　简单模拟

*具体思路

　　用一个watch变量保存上一次观看者

*代码

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 int main(){
 5     int n, win, watch=3;                  
 6     while(scanf("%d", &n)==1){    //好像没有多样例
 7         bool flag = true;
 8         watch=3;         //初始观看的人
 9         int i=0;
10         for(;i<n;++i){
11             scanf("%d", &win);
12             if(watch==win){
13                 flag = false;
14                 ++i;
15                 break;
16             }
17             else{
18                 watch = 6-win-watch;    //小技巧
19             }
20         }    
21         for(;i<n;++i) scanf("%d", &win);
22         if(flag) printf("YES\n");
23         else printf("NO\n");
24     }    
25     return 0;
26 }