poj 2864 Pascal Library

//這題就相當於統計二維矩陣的列中出現1的個數，如果個數等於列數，就輸出yes，否則輸出no！ #include <iostream>using namespace std;int grid[510][110];int main(){    int n, d, i, j, ans, tmp;    bool flag;    while (cin >> n >> d){          if (n == 0 && d == 0)  break;          flag = false;          for (i = 0; i < d; i++)             for (j = 0; j < n; j++)                 cin >> grid[i][j];                           for (i = 0; i < n; i++){              tmp = 0;              for (j = 0; j < d; j++){                  if (grid[j][i] == 1)                     tmp++;              }              if (tmp == d){                  cout << "yes" << endl;                  flag = true;                  break;              }          }          if (!flag)             cout << "no" << endl;    }        system("pause");}