USACO 1.2.2 Transformations(transform)

1、為什麼MAX等於10以下資料在我的機器上結果正確，而提交通不過？換成11就可以。有誰知道了麻煩留言告訴一聲。：）

10

@--------@

----------

----------

----------

----------

----------

----------

----------

----------

----------

@---------

----------

----------

----------

----------

----------

----------

----------

----------

---------@

/*<br />ID: gengjia1<br />LANG: C<br />TASK: transform<br />*/<br />#include <stdio.h><br />#include <stdlib.h><br />#include <string.h><br />//#define NDEBUG<br />#include <assert.h><br />#define MAX 11//10通不過？？<br />//順時針旋轉90度公式a[i][j]->a[j][N-i-1]<br />void rotate90(char a[][MAX],int N)<br />{<br />char tmp[MAX][MAX];<br />int i, j;<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />tmp[j][N-i-1] = a[i][j];<br />}<br />}<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />a[i][j] = tmp[i][j];<br />}<br />}<br />}<br />//水平翻轉公式a[i][j]->a[i][N-j-1]<br />void reflect(char a[][MAX], int N)<br />{<br />char tmp;<br />int i, j;<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N/2; j++)<br />{<br />tmp = a[i][N-j-1];<br />a[i][N-j-1] = a[i][j];<br />a[i][j] = tmp;<br />}<br />}<br />}<br />int compare(char b[][MAX], char a[][MAX], int N)<br />{<br />int i, j;<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />if(b[i][j] != a[i][j])<br />{<br />return 1;//不相等返回1<br />}<br />}<br />}<br />return 0;<br />}<br />int main(void) {<br />FILE *fin = fopen ("transform.in", "r");<br />FILE *fout = fopen ("transform.out", "w");<br />int N, count = 0;<br />char before[MAX][MAX], after[MAX][MAX];<br />char tb[MAX][MAX];<br />int i, j;<br />fscanf (fin, "%d", &N);<br />assert(N >= 1);<br />assert(N <= MAX);<br />for(i = 0; i < N; i++)<br />{<br />fscanf (fin, "%s", before[i]);<br />}<br />for(i = 0; i < N; i++)<br />{<br />fscanf (fin, "%s", after[i]);<br />}</p><p>for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />tb[i][j] = before[i][j];<br />}<br />}<br />rotate90(before, N);<br />if(compare(before, after, N) == 0)<br />{<br />count = 1;<br />}<br />else if(rotate90(before, N), compare(before, after, N) == 0)<br />{<br />count = 2;<br />}<br />else if(rotate90(before, N), compare(before, after, N) == 0)<br />{<br />count = 3;<br />}<br />else<br />{<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />before[i][j] = tb[i][j];<br />}<br />}<br />reflect(before, N);<br />if(compare(before, after, N) == 0)<br />{<br />count = 4;<br />}<br />else if(rotate90(before, N), compare(before, after, N) == 0)<br />{<br />count = 5;<br />}<br />else if(rotate90(before, N), compare(before, after, N) == 0)<br />{<br />count = 5;<br />}<br />else if(rotate90(before, N), compare(before, after, N) == 0)<br />{<br />count = 5;<br />}<br />}<br />if(count == 0)<br />{<br />for(i = 0; i < N; i++)<br />{<br />for(j = 0; j < N; j++)<br />{<br />before[i][j] = tb[i][j];<br />}<br />}<br />if(compare(before, after, N) == 0)<br />{<br />count = 6;<br />}<br />else<br />{<br />count = 7;<br />}<br />}<br />fprintf (fout, "%d/n", count);<br />fclose(fin);<br />fclose(fout);<br />exit(0);<br />}<br />