POJ_2260_ErrorCorrection
来源:互联网 发布:java接口关键字 编辑:程序博客网 时间:2024/06/01 13:40
Error Correction
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5920 Accepted: 3823
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:
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.
1 0 1 00 0 0 01 1 1 10 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
Source
Ulm Local 1998
简单的模拟特别点就是可以用异或运算的特点0^0=0 1^1=0 1^0=1
来记1的奇偶
#include <iostream>#include <stdio.h>using namespace std;const int M=105;int ti[M][M];int main(){ int n; int p; int cx,cy,nx,ny; while(scanf("%d",&n)!=EOF) { if(n==0) break; nx=0;ny=0; for(int i=0;i<n;i++) { p=0; for(int j=0;j<n;j++) { scanf("%d",&ti[i][j]); p^=ti[i][j]; } if(p!=0) { nx++; cx=i; } } for(int i=0;i<n;i++) { p=0; for(int j=0;j<n;j++) p^=ti[j][i]; if(p!=0) { ny++; cy=i; } } if(nx==0&&ny==0) printf("OK\n"); else if(nx==1&&ny==1) printf("Change bit (%d,%d)\n",cx+1,cy+1); else printf("Corrupt\n"); } return 0;}
0 0
- POJ_2260_ErrorCorrection
- MFC CString类成员函数实现原理
- Android如何屏蔽媒体扫描
- iOS 获取苹果设备的IP地址
- YaHoo 初始化css代码+IE常见兼容问题汇总
- 机器学习 之 生成式模型 VS 判别式模型
- POJ_2260_ErrorCorrection
- org.hibernate.MappingException: An association from the table tuser refers to an unmapped c
- tableViewCell的复用方法
- 为什么C#串口程序在关闭串口时候会死锁
- 第三方框架
- android 记录和恢复ListView滚动的位置 四种方法
- 开发日记
- mui.fire()用法
- 队列复习篇之顺序存储结构