Codeforces - 486 B. OR in Matrix

B. OR in Matrix
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
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

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int MAX = 1e6+10;
const int INF = 0x3fffffff;

int n,m;
int a[110][110];
int b[110][110];

int main(){
    scanf("%d%d",&n,&m);
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            scanf("%d",&b[i][j]);
            a[i][j]=1;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(b[i][j]==0){
                a[i][j]=0;
            }
            else{
                int flag=1;
                for(int k=1;k<=n;k++){
                    if(b[k][j]==0){
                        flag=0;
                        break;
                    }
                }
                for(int s=1;s<=m;s++){
                    if(b[i][s]==0){
                        flag=0;
                        break;
                    }
                }
                if(flag)    a[i][j]=1;
                else a[i][j]=0;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(b[i][j]){
                int f = 0;
                for(int k = 1;k <= m; k++)
                    f |= a[i][k];
                for(int k = 1; k <= n; k++)
                    f |= a[k][j];
                if(!f){
                    printf("NO\n");
                    return 0;
                }
            }
        }
    }
    printf("YES\n");
    for(int i=1;i<=n;i++){
        for(int j=1;j<m;j++){
            printf("%d ",a[i][j]);
        }
        printf("%d\n",a[i][m]);
    }
    return 0;
}