1457.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 50 行

/*  This Code is Submitted by wywcgs for Problem 1457 on 2005-03-20 at 17:46:45 */ 
#include <stdio.h>

int main()
{
    int n, row, col, hori[100], vert;
    int i, j, vertFlag, horiFlag, temp;
    
    while(scanf("%d", &n) == 1){
        if(n == 0){
            return 0;
        }else{
            for(i = 0; i < n; i++){
                hori[i] = 0;
            }
            vertFlag = 0;
            horiFlag = 0;
            for(i = 0; i < n; i++){
                vert = 0;
                for(j = 0; j < n; j++){
                    scanf("%d", &temp);
                    hori[j] += temp;
                    vert += temp;
                }
                if(vert % 2 == 1){
                    row = i;
                    vertFlag++;
                }
            }
            for(i = 0; i < n; i++){
                if(hori[i] % 2 == 1){
                    col = i;
                    horiFlag++;
                }
                if(horiFlag > 1){
                    break;
                }
            }
            if((vertFlag == 0) && (horiFlag == 0)){
                printf("OK\n");
            }else if((vertFlag == 1) && (horiFlag == 1)){
                printf("Change bit (%d,%d)\n", (row+1), (col+1));
            }else{
                printf("Corrupt\n");
            }
        }
    }
    
    return 0;
}