zoukankan      html  css  js  c++  java
  • CodeForces 259A Little Elephant and Chess

     Little Elephant and Chess
    Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    The Little Elephant loves chess very much.

    One day the Little Elephant and his friend decided to play chess. They've got the chess pieces but the board is a problem. They've got an 8 × 8 checkered board, each square is painted either black or white. The Little Elephant and his friend know that a proper chessboarddoesn't have any side-adjacent cells with the same color and the upper left cell is white. To play chess, they want to make the board they have a proper chessboard. For that the friends can choose any row of the board and cyclically shift the cells of the chosen row, that is, put the last (rightmost) square on the first place in the row and shift the others one position to the right. You can run the described operationmultiple times (or not run it at all).

    For example, if the first line of the board looks like that "BBBBBBWW" (the white cells of the line are marked with character "W", the black cells are marked with character "B"), then after one cyclic shift it will look like that "WBBBBBBW".

    Help the Little Elephant and his friend to find out whether they can use any number of the described operations to turn the board they have into a proper chessboard.

    Input

    The input consists of exactly eight lines. Each line contains exactly eight characters "W" or "B" without any spaces: the j-th character in the i-th line stands for the color of the j-th cell of the i-th row of the elephants' board. Character "W" stands for the white color, character "B" stands for the black color.

    Consider the rows of the board numbered from 1 to 8 from top to bottom, and the columns — from 1 to 8 from left to right. The given board can initially be a proper chessboard.

    Output

    In a single line print "YES" (without the quotes), if we can make the board a proper chessboard and "NO" (without the quotes) otherwise.

    Sample Input

    Input
    WBWBWBWB
    BWBWBWBW
    BWBWBWBW
    BWBWBWBW
    WBWBWBWB
    WBWBWBWB
    BWBWBWBW
    WBWBWBWB
    Output
    YES
    Input
    WBWBWBWB
    WBWBWBWB
    BBWBWWWB
    BWBWBWBW
    BWBWBWBW
    BWBWBWWW
    BWBWBWBW
    BWBWBWBW
    Output
    NO

    Hint

    In the first sample you should shift the following lines one position to the right: the 3-rd, the 6-th, the 7-th and the 8-th.

    In the second sample there is no way you can achieve the goal.

     1 #include <stdio.h>
     2 #include <string.h>
     3 int main()
     4 {
     5     int i,j;
     6     char a[10][10];
     7     while(scanf("%s",a[1])!=EOF)
     8     {
     9         for(i=2;i<=8;i++)
    10             scanf("%s",a[i]);
    11         //for(i=1;i<=8;i++)
    12             //printf("%s
    ",a[i]);
    13         int flg=1;
    14         for(i=1;i<=8;i++)
    15         {
    16             if(a[i][0]==a[i][7])
    17             {
    18                 //printf("1 %d
    ",i);
    19                 flg=0;
    20                 break;
    21             }
    22             for(j=1;j<=7;j++)
    23             {
    24                 if(a[i][j]==a[i][j-1])
    25                 {
    26                     //printf("2 %d %d
    ",i,j);
    27                     flg=0;
    28                     break;
    29                 }
    30             }
    31             if(flg==0)
    32                 break;
    33         }
    34         if(flg==1)
    35             printf("YES
    ");
    36         else
    37             printf("NO
    ");
    38     }
    39     return 0;
    40 }
    View Code
  • 相关阅读:
    LeetCode数学系列(3)——快速幂算法(50题)
    LeetCode树系列(3)——200题岛屿数量
    Arrays.sort()详解
    图表示学习系列(1)——GCN学习笔记:第一部分,详细讲解GCN
    LeetCode动态规划系列(3)——编辑距离问题求解
    深度学习系列(9)——node2vec算法中的alias采样介绍
    LeetCode数学系列(2)——解决约瑟夫问题
    Java数据结构系列(4)——队列常用方法
    LeetCode树系列(1)——广度搜索应用,图的BFS
    LeetCode树系列(2)——深度搜索运用:LeetCode695题详解
  • 原文地址:https://www.cnblogs.com/cyd308/p/4771502.html
Copyright © 2011-2022 走看看