Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int main()
- {
- int a[100][100],n,m,i,j,column=0,row=0,k=0,x,y,z=0;
- while(scanf("%d",&n) !=EOF) {
- if(n==0)
- break;
- k = 0; /*reset*/
- z = 0;
- for(i=0; i<=n-1; i++) {
- for(j=0; j<=n-1; j++) { /*@@*/
- scanf("%d",&m);
- a[i][j]=m;
- }
- }
- for(i=0; i<=n-1; i++) {
- row = 0;/*reset*/
- column = 0;
- for(j=0; j<=n-1; j++) {
- row+=a[i][j];
- column+=a[j][i];
- }
- if(row%2==1) {
- x=i;
- k++;
- }
- if(k>=2) {
- printf("Corrupt\n");/*\n!!*/
- break;
- }
- if(column%2==1) {
- y=i;/*think about this*/
- z++;
- }
- if(z>=2) {
- printf("Corrupt\n");
- break;
- }
- }
- if(k==0&&z==0)
- printf("OK\n");
- if(k==1&&z==1)
- printf("Change bit (%d,%d)\n",x + 1,y + 1);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement