博客
关于我
POJ 2260 Error Correction 模拟 贪心 简单题
阅读量:429 次
发布时间:2019-03-06

本文共 2135 字,大约阅读时间需要 7 分钟。

Error Correction
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 6825   Accepted: 4289

Description

A boolean matrix has the parity property when each row and each column has an even sum, i.e. contains an even number of bits which are set. Here's a 4 x 4 matrix which has the parity property:
1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1

The sums of the rows are 2, 0, 4 and 2. The sums of the columns are 2, 2, 2 and 2.
Your job is to write a program that reads in a matrix and checks if it has the parity property. If not, your program should check if the parity property can be established by changing only one bit. If this is not possible either, the matrix should be classified as corrupt.

Input

The input will contain one or more test cases. The first line of each test case contains one integer n (n<100), representing the size of the matrix. On the next n lines, there will be n integers per line. No other integers than 0 and 1 will occur in the matrix. Input will be terminated by a value of 0 for n.

Output

For each matrix in the input file, print one line. If the matrix already has the parity property, print "OK". If the parity property can be established by changing one bit, print "Change bit (i,j)" where i is the row and j the column of the bit to be changed. Otherwise, print "Corrupt".

Sample Input

41 0 1 00 0 0 01 1 1 10 1 0 141 0 1 00 0 1 01 1 1 10 1 0 141 0 1 00 1 1 01 1 1 10 1 0 10

Sample Output

OKChange bit (2,3)Corrupt

计算每行每列1的数量,看奇数个的交叉点,大于一个或没有则不能实现。


#include<stdio.h>int main(){	int a[105][105];	int n;	while (~scanf("%d", &n))	{		int i, j;		int num1 = 0,num2=0;		if (!n)		{			break;		}		int x, y;		for ( i = 1; i <= n; i++)		{			int sum = 0;			for ( j = 1; j <= n; j++)			{				scanf("%d", &a[i][j]);				sum += a[i][j];			}			if (sum % 2 != 0)			{				x = i;				num1++;			}		}		for ( i = 1; i <= n; i++)		{			int sum = 0;			for ( j = 1; j<= n;j++)			{				sum += a[j][i];			}			if (sum % 2 != 0)			{				y = i;				num2++;			}		}				if (num1 == 0 && num2 == 0)		{			printf("OK\n");		}		else if (num1 == 1 && num2 == 1)		{			printf("Change bit (%d,%d)\n", x, y);		}		else		{			printf("Corrupt\n");		}	}	return 0;}


转载地址:http://gkwuz.baihongyu.com/

你可能感兴趣的文章
Mysql 优化 or
查看>>
mysql 优化器 key_mysql – 选择*和查询优化器
查看>>
MySQL 优化:Explain 执行计划详解
查看>>
Mysql 会导致锁表的语法
查看>>
mysql 使用sql文件恢复数据库
查看>>
mysql 修改默认字符集为utf8
查看>>
Mysql 共享锁
查看>>
MySQL 内核深度优化
查看>>
mysql 内连接、自然连接、外连接的区别
查看>>
mysql 写入慢优化
查看>>
mysql 分组统计SQL语句
查看>>
Mysql 分页
查看>>
Mysql 分页语句 Limit原理
查看>>
MySql 创建函数 Error Code : 1418
查看>>
MySQL 创建新用户及授予权限的完整流程
查看>>
mysql 创建表,不能包含关键字values 以及 表id自增问题
查看>>
mysql 删除日志文件详解
查看>>
mysql 判断表字段是否存在,然后修改
查看>>
MySQL 到底能不能放到 Docker 里跑?
查看>>
mysql 前缀索引 命令_11 | Mysql怎么给字符串字段加索引?
查看>>