Advertisement
Guest User

Untitled

a guest
Dec 22nd, 2014
150
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.12 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int a[100][100],n,m,i,j,column=0,row=0,k=0,x,y,z=0;
  7. while(scanf("%d",&n) !=EOF) {
  8. if(n==0)
  9. break;
  10.  
  11. k = 0; /*reset*/
  12. z = 0;
  13.  
  14. for(i=0; i<=n-1; i++) {
  15. for(j=0; j<=n-1; j++) { /*@@*/
  16. scanf("%d",&m);
  17. a[i][j]=m;
  18. }
  19. }
  20. for(i=0; i<=n-1; i++) {
  21. row = 0;/*reset*/
  22. column = 0;
  23. for(j=0; j<=n-1; j++) {
  24. row+=a[i][j];
  25. column+=a[j][i];
  26. }
  27. if(row%2==1) {
  28. x=i;
  29. k++;
  30. }
  31. if(k>=2) {
  32. printf("Corrupt\n");/*\n!!*/
  33. break;
  34. }
  35. if(column%2==1) {
  36. y=i;/*think about this*/
  37. z++;
  38. }
  39. if(z>=2) {
  40. printf("Corrupt\n");
  41. break;
  42. }
  43. }
  44. if(k==0&&z==0)
  45. printf("OK\n");
  46. if(k==1&&z==1)
  47. printf("Change bit (%d,%d)\n",x + 1,y + 1);
  48. }
  49.  
  50. return 0;
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement