【codeforces 486B OR in Matrix】

OR in Matrix
Description
Let’s define logical OR as an operation on two logical values (i. e. values that belong to the set {0, 1}) that is equal to 1 if either or both of the logical values is set to 1, otherwise it is 0. We can define logical OR of three or more logical values in the same manner:

where is equal to 1 if some ai = 1, otherwise it is equal to 0.

Nam has a matrix A consisting of m rows and n columns. The rows are numbered from 1 to m, columns are numbered from 1 to n. Element at row i (1 ≤ i ≤ m) and column j (1 ≤ j ≤ n) is denoted as Aij. All elements of A are either 0 or 1. From matrix A, Nam creates another matrix B of the same size using formula:

.

(Bij is OR of all elements in row i and column j of matrix A)

Nam gives you matrix B and challenges you to guess matrix A. Although Nam is smart, he could probably make a mistake while calculating matrix B, since size of A can be large.

Input
The first line contains two integer m and n (1 ≤ m, n ≤ 100), number of rows and number of columns of matrices respectively.

The next m lines each contain n integers separated by spaces describing rows of matrix B (each element of B is either 0 or 1).

Output
In the first line, print “NO” if Nam has made a mistake when calculating B, otherwise print “YES”. If the first line is “YES”, then also print m rows consisting of n integers representing matrix A that can produce given matrix B. If there are several solutions print any one.

Sample Input
Input
2 2
1 0
0 0
Output
NO
Input
2 3
1 1 1
1 1 1
Output
YES
1 1 1
1 1 1
Input
2 3
0 1 0
1 1 1
Output
YES
0 0 0
0 1 0

题解 ：
由给出的数组 B 求出数组A ：初始化数组A为 1， 如果 Bij == 0，则 A所在行所在列均为 0 ；由A 求出数组 C ：初始化数组C为0， 若 Aij == 1 ，则 C 所在行所在列均为 1 ；
比较 C与 B 是否 相同 ；

#include<cstdio>
#include<cstring>
using namespace std;
int ma[101][101],mb[101][101],mm[101][101];
int main()
{
    int M,N,i,j,kl,pl;
    scanf("%d%d",&M,&N);
    for(i = 1 ; i <= M ; i++)
        for(j = 1 ; j <= N ; j++)
        scanf("%d",&mb[i][j]);
    for(i = 1; i <= M ; i++)
        for(j = 1 ; j <= N; j++)
        ma[i][j] = 1;
    for(i = 1 ; i <= M ; i++)
        for(j = 1 ; j <= N ; j++)
        {
            if(mb[i][j] == 0)
            {
                for(kl = 1 ; kl <= N ; kl++)
                    ma[i][kl] = 0;
                for(kl = 1 ; kl <= M ; kl++)
                    ma[kl][j] = 0;
            }
        }
        memset(mm,0,sizeof(mm));
        for(i = 1 ; i <= M ; i++)
            for(j = 1 ; j <= N ; j++)
            {
                pl = 0;
                for(kl = 1 ; kl <= N ; kl++)
                    if(ma[i][kl] == 1)
                    pl = 1;
                for(kl = 1 ; kl <= M ; kl++)
                    if(ma[kl][j] == 1)
                    pl = 1;
                if(pl)
                    mm[i][j] = 1;
            }
            pl = 1;
            for(i = 1 ; i <= M ; i++)
                for(j = 1 ; j <= N ; j++)
                if(mm[i][j] != mb[i][j])
                    pl = 0;
                if(pl){
                    printf("YES");
                    for(i = 1 ; i <= M ; i++)
                    {
                            printf("\n");
                        for(j = 1 ; j < N ; j++)
                          printf("%d ",ma[i][j]);
                          printf("%d",ma[i][N]);
                    }
                }
                else
                    printf("NO\n");
    return 0;
}