CF844B.Rectangles

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given $n×m$ table. Each cell of the table is colored white or black. Find the number of non-empty sets of cells such that:

All cells in a set have the same color.
Every two cells in a set share row or column.

输入格式

The first line of input contains integers $n$ and $m$ ( $1<=n,m<=50$ ) — the number of rows and the number of columns correspondingly.

The next $n$ lines of input contain descriptions of rows. There are $m$ integers, separated by spaces, in each line. The number equals $0$ if the corresponding cell is colored white and equals $1$ if the corresponding cell is colored black.

输出格式

Output single integer — the number of non-empty sets from the problem description.

输入输出样例

输入#1
```
1 1
0
```
输出#1
```
1
```
输入#2
```
2 3
1 0 1
0 1 0
```
输出#2
```
8
```

说明/提示

In the second example, there are six one-element sets. Additionally, there are two two-element sets, the first one consists of the first and the third cells of the first row, the second one consists of the first and the third cells of the second row. To sum up, there are $8$ sets.

首页