fjnu 1142 Error Correction
来源:互联网 发布:数据库系统书籍 编辑:程序博客网 时间:2024/05/01 01:39
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 file 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
KEY:开两个数组来记录行列的和值,用两个函数分别返回他们的情况,然后作出判断输出;
#include<iostream>
using namespace std;
int a[101][101];
int r[101];
int c[101];
int n;
int x,y;
void CountRow()
...{
int i,j;
int sum;
for(i=1;i<=n;i++)
...{
sum=0;
for(j=1;j<=n;j++)
sum+=a[i][j];
r[i]=sum;
}
}
void CountCol()
...{
int i,j;
int sum;
for(j=1;j<=n;j++)
...{
sum=0;
for(i=1;i<=n;i++)
sum+=a[i][j];
c[j]=sum;
}
}
int isRow()
...{
int t=0;
int i;
for(i=1;i<=n;i++)
if(r[i]%2!=0)
...{
t++;
x=i;
}
if(t>1) return -1;
if(t==1) return 1;
if(t==0) return 0;
}
int isCol()
...{
int t=0;
int i;
for(i=1;i<=n;i++)
if(c[i]%2!=0)
...{
t++;
y=i;
}
if(t>1) return -1;
if(t==1) return 1;
if(t==0) return 0;
}
void input()
...{
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
}
int main()
...{
// freopen("fjnu_1142.in","r",stdin);
int t1,t2;
while(cin>>n&&n!=0)
...{
input();
CountRow();
CountCol();
t1=isRow();
t2=isCol();
if(t1==-1||t2==-1) cout<<"Corrupt"<<endl;
if(t1==0&&t2==0) cout<<"OK"<<endl;
if(t1==1&&t2==1) cout<<"Change bit ("<<x<<","<<y<<")"<<endl;
}
return 0;
}
- fjnu 1142 Error Correction
- Error Correction
- Error Correction
- Error Correction
- Error Correction
- Error Correction
- zoj 1949 Error Correction
- zoj 1949 Error Correction
- ZOJ 1949Error Correction
- zoj 1949 Error Correction
- zoj1949-------------Error Correction
- ZOJ 1949 Error Correction
- zoj 1949.Error Correction
- zoj 1949 Error Correction
- ZOJ 1949 Error Correction
- POJ2260:Error Correction
- 错误纠正(Error Correction)
- Error Correction(zoj 1949)
- js操作数组汇总
- log4j使用大全
- .net面试题大全(有答案)
- Windows快捷键
- 个人对应的金庸人物
- fjnu 1142 Error Correction
- API 使用 XML的COM组件
- 实数小数后只保存2位,实现方法
- java 调用命令 备份MYSQL数据库
- 加密算法学习笔记之二__一个完整的加密过程
- 对妹妹的愧疚
- MySql 中文乱码问题,:
- linux软件安装
- A reply from Jeffery Richter