baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 18:28:47 +00:00
Code Releases Activity

3972. 方格集数量

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/7800351/
This commit is contained in:
Baoshuo Ren 2021-09-18 19:53:15 +08:00 committed by Baoshuo Ren
parent 7129c8ffa6
commit 031765e9a0
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 32 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
AcWing/3972/3972.cpp Normal file
View File

@ -0,0 +1,32 @@
#include <bits/stdc++.h>
using namespace std;
int n, m, f[2][55];
long long ans;
bool g[55][55];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> g[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
f[0][i] += g[i][j];
f[1][j] += g[i][j];
}
}
for (int i = 1; i <= n; i++) {
ans += (long long)pow(2, f[0][i]) - 1;
ans += (long long)pow(2, m - f[0][i]) - 1;
}
for (int i = 1; i <= m; i++) {
ans += (long long)pow(2, f[1][i]) - 1;
ans += (long long)pow(2, n - f[1][i]) - 1;
}
cout << ans - n * m << endl;
return 0;
}