Educational Codeforces Round 48 (Rated for Div. 2) D.Vasya And The Matrix

地址：http://codeforces.com/contest/1016/problem/D

思维题，假设存在这样一个数组，那么如果把行和列的异或结果再异或起来，如果为0，该数组存在，因为如果数组存在的话，数组中的每个值都会被异或两遍，数组存在时，结果必然为0，让tmp[i][m] = a[i];tmp[n][i] =b[i],tmp[n][m] = 行异或结果 ^ a[n] ^ b[m];

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
const int N = 105;
int tmp[N];
int a[N],b[N];

int main()
{
    int n,m;
    while(~scanf("%d %d",&n,&m))
    {
        int suma = 0;
        int sumb = 0;
        for(int i = 1;i <= n;++i){
            scanf("%d",&a[i]);
            suma ^= a[i];
        }
        for(int i = 1;i <= m;++i){
            scanf("%d",&b[i]);
            sumb ^= b[i];
        }
        int ptr = suma ^ sumb;
        if(ptr != 0){
            printf("NO\n");
            continue;
        }
        else{
            printf("YES\n");
        }
        //就是利用suma^sumb == 0来得出tmp[n][m]为啥
        for(int i = 1;i < n;++i)
        {
            for(int j = 1;j < m;++j)
                cout << "0 ";
            cout << a[i] << endl;
        }
        for(int i = 1;i < m;++i)
            cout << b[i] << " ";
        int x = suma ^ a[n] ^ b[m];
//        int y = x ^ b[m];
        cout << x << endl;
    }
    return 0;
}