跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1266. Binary Table

  • ID: 1272
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 位运算
  • 枚举
  • 分治
  • 动态规划
  • FFT
  • 数学
  • 算法思想
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Binary Table

题目描述

C. Binary Table
time limit per test
6 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 or 1. In one move, you are allowed to pick any row or any column and invert all values, that is, replace 0 by 1 and vice versa.

What is the minimum number of cells with value 1 you can get after applying some number of operations?

Input

The first line of the input contains two integers n and m (1≤n≤20, 1≤m≤100000)− the number of rows and the number of columns, respectively.

Then n lines follows with the descriptions of the rows. Each line has length m and contains only digits '0' and '1'.

Output

Output a single integer− the minimum possible number of ones you can get after applying some sequence of operations.

Example
Input
3 4
0110
1010
0111
Output
2


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 750 题。保留原作者与原赛事署名。