zju1949.cpp

浙江大学acmoj上的几道题目的代码

#include<stdio.h>
#include<string.h>

int a[100][100];

int findrow(int a[][100],int n)
{
	int sum=0;
	int wrong=0,wrow;
	int i,j;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			sum+=a[i][j];
		if(sum%2==1)
		{
			wrow=i;
			wrong++;
		}
		sum=0;
	}
	if(wrong>1)
		return -1;
	else if(wrong==1)
		return wrow;
	else 
		return 0;
	
}

int findcolumn(int a[][100],int n)
{
	int sum=0;
	int wrong=0,wcolumn;
	int i,j;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)	
			sum+=a[j][i];
		if(sum%2==1)
		{
			wrong++;
			wcolumn=i;
		}
		sum=0;
	}
	if(wrong>1)
		return -1;
	else if(wrong==1)
		return wcolumn;
	else 
		return 0;
	
}

int main()
{	
	int i,j;
	int row,column;
	int size;
	scanf("%d",&size);
	while(size!=0)
	{
		for(i=1;i<=size;i++)
			for(j=1;j<=size;j++)
				scanf("%d",&a[i][j]);
		row=findrow(a,size);
		column=findcolumn(a,size);
		if(row==0&&column==0)
			printf("OK\n");
		else if(row==-1||column==-1)
			printf("Corrupt\n");
		else
			printf("Change bit (%d,%d)\n",row,column);
		memset(a,0,sizeof(a));
		scanf("%d",&size);
	}
	return 0;
}