Compression

最新推荐文章于 2022-02-22 23:58:07 发布

a-free-man

最新推荐文章于 2022-02-22 23:58:07 发布

阅读量725

点赞数

分类专栏：前缀和 # Codeforces

本文链接：https://blog.csdn.net/Wen_Yongqi/article/details/86664568

版权

给定一个二进制矩阵，找到最大的整数x，使得矩阵能被压缩成x*x大小的矩阵，且每个小块内全为0或全为1。通过前缀和计算并枚举矩阵的因子来确定最大x。

摘要由CSDN通过智能技术生成

http://codeforces.com/contest/1107/problem/D

You are given a binary matrix AA of size n×nn×n . Let's denote an xx -compression of the given matrix as a matrix BB of size nx×nxnx×nx such that for every i∈[1,n],j∈[1,n]i∈[1,n],j∈[1,n] the condition A[i][j]=B[⌈ix⌉][⌈jx⌉]A[i][j]=B[⌈ix⌉][⌈jx⌉] is met.

Obviously, xx -compression is possible only if xx divides nn , but this condition is not enough. For example, the following matrix of size 2×22×2 does not have any 22 -compression:

0101

1010

For the given matrix AA , find maximum xx such that an xx -compression of this matrix is possible.

Note that the input is given in compressed form. But even though it is compressed, you'd better use fast input.

Input

The first line contains one number nn (4≤n≤52004≤n≤5200 ) — the number of rows and columns in the matrix AA . It is guaranteed that nn is