Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int main()
- {
- int t,x;
- scanf("%d",&t);
- for (x=1; x<=t; ++x)
- {
- int n,k,i,j,a[110][110],b[110][110],symset= 0,sym= 0,cnt= 0,change= 0;
- scanf("%d%d",&n,&k);
- for (i=1; i<=n; ++i) for (j=1; j<=n; ++j) scanf("%d",&a[i][j]);
- //puts("A");
- for (i=1; i<=n; ++i) for (j=1; j<=n; ++j)
- {
- scanf("%d",&b[i][j]);
- if (b[i][j]!=a[i][j]) change++;
- }
- //puts("B");
- for (i=1; i<n; ++i)
- {
- for (j=i+1; j<=n; ++j)
- {
- //printf("%d %d ",b[i][j],b[j][i]);
- if (b[i][j]==b[j][i]) { /*puts("SYM++");*/ sym++; }
- if (a[j][i]!=a[i][j])
- {
- if (a[i][j]==b[j][i] && b[i][j]==a[j][i])
- symset++;
- }
- //puts("");
- cnt++;
- }
- }
- //printf("sym %d , cnt %d\n",sym , cnt);
- printf("Case %d: ",x);
- if (!change) puts("0");
- else if (sym==cnt) puts("-1");
- else if (k==2 && change==2 && symset==1) puts("-1");
- else if (change==2 && symset==1) printf("%d\n",change+1);
- else printf("%d\n",change);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement