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");
}