显示原始代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, m;
vector<int> clas[N];
void init(vector<int> &k, string n, int i) {
int idx = 1;
for (int j = 0; j < n.size(); j++) {
if (n[j] == '1') {
k.push_back(idx);
clas[idx].push_back(i);
}
idx++;
}
}
int main() {
cin >> n >> m;
vector<int> stu[N];
for (int i = 0; i < n; i++) {
string a;
cin >> a;
init(stu[i], a, i);
}
for (int i = 1; i <= n; i++) {
bool flag = false;
for (int j = 1; j <= m; j++) {
if (clas[j].size() == 1) {
cout << j << "!" << endl;
int tem = clas[j][0];
flag = true;
for (int l = 0; l < stu[tem].size(); l++) {
vector<int>::iterator it = find(clas[stu[tem][l]].begin(), clas[stu[tem][l]].end(), tem);
if (it != clas[stu[tem][l]].end()) {
clas[stu[tem][l]].erase(it);
}
}
}
}
if (flag == false)
break;
}
int cnt = 0;
for (int i = 1; i <= m; i++)
if (clas[i].size() != 0)
cnt++;
cout << cnt;
}