利用位运算
#include<iostream>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 50 + 7;
int n, m;
char s[maxn];
ll a[maxn] = {0};
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", s);
for (int j = 0; j < m; ++j) {
a[i] = a[i] * 2 + (s[j] == '#');
}
// cout << a[i] << endl;
}
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if ((a[i] & a[j]) && a[i] != a[j]) {
puts("No");
return 0;
}
}
}
puts("Yes");
return 0;
}