zoukankan      html  css  js  c++  java
  • Codeforces Round #243 (Div. 2) B(思维模拟题)

    http://codeforces.com/contest/426/problem/B

    B. Sereja and Mirroring
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:

    • the upper half of matrix c (rows with numbers from 1 to x) exactly matches b;
    • the lower half of matrix c (rows with numbers from x + 1 to 2x) is symmetric to the upper one; the symmetry line is the line that separates two halves (the line that goes in the middle, between rows x and x + 1).

    Sereja has an n × m matrix a. He wants to find such matrix b, that it can be transformed into matrix a, if we'll perform on itseveral (possibly zero) mirrorings. What minimum number of rows can such matrix contain?

    Input

    The first line contains two integers, n and m (1 ≤ n, m ≤ 100). Each of the next n lines contains m integers — the elements of matrix a. The i-th line contains integers ai1, ai2, ..., aim (0 ≤ aij ≤ 1) — the i-th row of the matrix a.

    Output

    In the single line, print the answer to the problem — the minimum number of rows of matrix b.

    Sample test(s)
    input
    4 3
    0 0 1
    1 1 0
    1 1 0
    0 0 1
    output
    2
    input
    3 3
    0 0 0
    0 0 0
    0 0 0
    output
    3
    input
    8 1
    0
    1
    1
    0
    0
    1
    1
    0
    output
    2
    Note

    In the first test sample the answer is a 2 × 3 matrix b:


    001
    110

    If we perform a mirroring operation with this matrix, we get the matrix a that is given in the input:


    001
    110
    110
    001


    。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。
    、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、
    题意就是问你给定一个矩阵,求它的最小对称单元

     1 #include<iostream>  
     2 #include<cstdio>  
     3 #include<cmath>  
     4 #include<cstdlib>  
     5 #include <algorithm>  
     6 #include<cstring>  
     7 #include<string>  
     8 using namespace std;  
     9   
    10 int a[100][100], b[100][100], c[100][100];  
    11 int main()  
    12 {  
    13     int n, m, i, j, line, temp = 0;  
    14     scanf("%d%d", &n, &m);  
    15     for (i = 0; i < n; i++)  
    16     {  
    17         for (j = 0; j < m; j++)  
    18         {  
    19             scanf("%d", &a[i][j]);  
    20         }  
    21     }  
    22     line = n;  
    23     while (!(line % 2))  
    24     {  
    25         for (i = 0; i < line / 2; i++)  
    26         {  
    27             for (j = 0; j < m; j++)  
    28             {  
    29                 if (a[i][j] != a[line - 1 - i][j])  
    30                 {  
    31                     temp++;  
    32                 }  
    33             }  
    34         }  
    35         if (temp)  
    36         {  
    37             break;  
    38         }  
    39         else  
    40         {  
    41             line /= 2;  
    42         }  
    43     }  
    44     printf("%d
    ", line);  
    45     return 0;  
    46 }  
  • 相关阅读:
    bzoj3932 [CQOI2015]任务查询系统
    bzoj1901 Zju2112 Dynamic Rankings
    bzoj3524 [Poi2014]Couriers/2223 [Coci 2009]PATULJCI
    bzoj1529 [POI2005]ska Piggy banks
    bzoj1552 [Cerc2007]robotic sort
    bzoj2208 [Jsoi2010]连通数
    2016NOI冬令营day5
    A1035 Password (20)(20 分)
    1048 数字加密(20 分)
    福尔摩斯的约会
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3906668.html
Copyright © 2011-2022 走看看