zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 33 (Rated for Div. 2) A题

    A. Chess For Three

    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!

    Input
    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.

    Output
    Print YES if the situation described in the log was possible. Otherwise print NO.

    input

    3
    1
    1
    2


    output

    YES

    思路:简单的模拟即可。

    AC代码:

     1 #include<bits/stdc++.h>
     2 
     3 using namespace std;
     4 int main(){
     5     int _;
     6     cin>>_;
     7     int flag=1;
     8     int arr[_+10];
     9     int a,b,c;
    10     a=1;b=2;c=3;
    11     for(int i=1;i<=_;i++){
    12         cin>>arr[i];
    13         if(arr[i]==c){
    14             flag=0;
    15         }
    16         if(flag){
    17             if(arr[i]==a){
    18                 swap(b,c);
    19             }else if(arr[i]==b){
    20                 swap(a,c);
    21             }else if(arr[i]==c){
    22                 swap(a,b);
    23             }
    24        }
    25     }
    26     if(flag){
    27         puts("YES");
    28     }else{
    29         puts("NO");
    30     } 
    31     return 0;
    32 }
  • 相关阅读:
    JavaScript递归函数解“汉诺塔”
    《JavaScript DOM编程艺术》学习笔记(三)
    《JavaScript DOM编程艺术》学习笔记(二)
    《JavaScript DOM编程艺术》学习笔记(一)
    《手把手教你实现电商网站开发》课程学习总结
    学校水卡、本地公交卡破解记
    第一篇博客
    mysql5.7.5以上版本使用distinct和order by 报错备忘录
    group_concat长度限制踩坑备忘录
    ArrayList、LinkedList、Vector的区别
  • 原文地址:https://www.cnblogs.com/pengge666/p/11511054.html
Copyright © 2011-2022 走看看