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 a2x × 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 it several(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

output

input

output

input

output

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:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>int num[111][111];int main ()
{int n,m;scanf ("%d%d",&n,&m);int i,k;for (i = 0;i < n;i++)for (k = 0;k < m;k++)scanf ("%d",&num[i][k]);int ans = n;aif (n % 2)printf ("%d\n",n);else{int tn = n;while (1){int tf = 1;for (i = 0;i < tn / 2;i++)for (k = 0;k < m;k++)if (num[i][k] != num[tn - 1 - i][k])tf = 0;if (tf){if (tn % 2)break;tn /= 2;}else{//tn *= 2;break;}}printf ("%d\n",tn);}return 0;
}

B. Sereja and Mirroring相关推荐

Codeforces Sereja and Mirroring
Description Let's assume that we are given a matrix b of size x × y, let's determine the operation o ...
Codeforces Round #243 (Div. 2) Problem B - Sereja and Mirroring 解读
http://codeforces.com/contest/426/problem/B 对称标题的意思大概是.应当指出的,当线数为奇数时,答案是线路本身的数 #include<iostream& ...
Codeforces Round #243 (Div. 2) A~C
题目链接 A. Sereja and Mugs time limit per test:1 second memory limit per test:256 megabytes input:stand ...
炫音乐可视化 html5 在线,HTML5打造的炫酷本地音乐播放器-喵喵Player
将之前捣腾的音乐频谱效果加上一个播放列表就成了现在的喵喵播放器(Meow meow Player,额知道这名字很二很装萌~),全HTML5打造的网页程序,可本地运行也可以挂服务器上用. 在线Demo及 ...
Codeforces 题目合集+分类+代码【Updating...】【361 in total】
961A - Tetris 模拟 ...
SQL Server HA - 数据库镜像2 （Mirroring）(1418错误解决)
SQL Server2008数据库镜像的配置 (1418错误解决) 准备三台安装SQL的服务器,三台中两台担当惊喜数据库,一天当作监控服务器在要做镜像的数据库之上右键单击,选择备份备份类型为完整, ...
iOS Airplay Screen Mirroring 同屏技术详解
投屏技术已经被大量用在身边的产品,比如电视投屏,投影仪,视频会议产品中. 在iOS平台外的其他平台中都已经有非常成熟的标准和实现.但在封闭的苹果iOS和Mac系统中,苹果使用私有的Airplay协议进 ...
Sereja and Brackets CodeForces - 380C （树状数组+离线）
Sereja and Brackets 题目链接: CodeForces - 380C Sereja has a bracket sequence s1, s2, ..., *s**n, or, in ...
Sereja and Brackets CodeForces - 380C （线段树+分治思路）
Sereja and Brackets 题目链接: CodeForces - 380C Sereja has a bracket sequence s1, s2, ..., *s**n, or, in ...

B. Sereja and Mirroring

B. Sereja and Mirroring相关推荐

最新文章

热门文章