bzoj 1923

裸高斯消元；

#include<bits/stdc++.h>
using namespace std;
bitset<1005> a[2005];
char s[1005];int n,m,ans=-1;
void gauss(){int tot=0;
    for(int i=1;i<=n;i++){int j=tot+1;  //
        while(!a[j][i] && j<=m)j++;
        if(j==m+1){ans=-1;return;}
        ans=max(ans,j);
        swap(a[j],a[++tot]);
        for(int k=1;k<=m;k++)if(k!=tot && a[k][i])a[k]^=a[tot];
    }
}
int main(){//freopen("in.in","r",stdin);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%s",s);for(int j=0;j<n;j++){a[i][j+1]=s[j]-'0';}
        scanf("%s",s);a[i][n+1]=s[0]-'0';
    }
    gauss();
    if(ans==-1)printf("Cannot Determine\n");
    else{
        printf("%d\n",ans);
        for(int i=1;i<=n;i++)
        if(a[i][n+1])printf("?y7M#\n");
        else printf("Earth\n");
    }
}