ZOJ Problem Set–1949 Error Correction
2012-05-10 13:33
459 查看
Time Limit: 2 Seconds Memory Limit: 65536 KB
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
4
1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 0 1 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 1 1 0
1 1 1 1
0 1 0 1
0
Sample Output
OK
Change bit (2,3)
Corrupt
Source: University of Ulm Local Contest 1998
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
4
1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 0 1 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 1 1 0
1 1 1 1
0 1 0 1
0
Sample Output
OK
Change bit (2,3)
Corrupt
Source: University of Ulm Local Contest 1998
1: #include<iostream>
2: #include<vector>
3: using namespace std;
4:
5: int main(void)
6: {
7: int n;
8: while(cin>>n && n)
9: {
10: vector<vector<int> > matrix;
11: bool rowBreaked = false, colBreaked = false;
12: int colSum = 0, oddRowCount = 0, oddColCount = 0, oddRowIndex = -1, oddColIndex = -1;
13: for(int i = 0; i < n;i++)
14: {
15: int rowSum = 0;
16: vector<int> v;
17: int num;
18: for(int j = 0; j < n;j++)
19: {
20: cin>>num;
21: v.push_back(num);
22: rowSum += num;
23: }
24: matrix.push_back(v);
25: if(rowSum%2)
26: {
27: oddRowCount++;
28: oddRowIndex = i;
29: }
30: }
31: if(!rowBreaked)
32: {
33: for(int i = 0; i < n;i++)
34: {
35: colSum = 0;
36: for(int j = 0; j < n; j++)
37: {
38: colSum += matrix[j][i];
39: }
40: if(colSum%2)
41: {
42: oddColCount++;
43: oddColIndex = i;
44: }
45: }
46: }
47: if(oddColCount == 1 && oddRowCount == 1)
48: {
49: cout<<"Change bit ("<<oddRowIndex + 1<<","<<oddColIndex + 1<<")"<<endl;
50: }
51: else if(oddColCount == 0 && oddRowCount == 0)
52: {
53: cout<<"OK"<<endl;
54: }
55: else
56: {
57: cout<<"Corrupt"<<endl;
58: }
59: }
60: return 0;
61: }
相关文章推荐
- ZOJ Problem Set–1251 Box of Bricks
- ZOJ Problem Set–1514 Fake Tickets
- ZOJ Problem Set – 1056 The Worm Turns
- ZOJ Problem Set–1101 Gamblers
- ZOJ Problem Set–1405 Tanning Salon
- ZOJ Problem Set–1180 Self Numbers
- ZOJ Problem Set–1152 A Mathematical Curiosity
- ZOJ Problem Set–1216 Deck
- ZOJ Problem Set–1526 Big Number
- ZOJ Problem Set–1879 Jolly Jumpers
- ZOJ Problem Set - 1949 Error Correction
- ZOJ Problem Set–1151 Word Reversal
- ZOJ Problem Set–1915 Above Average
- ZOJ Problem Set–2405 Specialized Four-Digit Numbers
- ZOJ Problem Set - 1949 Error Correction
- ZOJ Problem Set–1109 Language of FatMouse
- ZOJ Problem Set–1292 Integer Inquiry
- ZOJ Problem Set–2104 Let the Balloon Rise
- ZOJ Problem Set–1383 Binary Numbers
- ZOJ Problem Set–1188 DNA Sorting