Submission #66191913

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N;
char S[4096][4096];
char T[4096][4096];
int main(void) {
  int i, j, k;
  int ans;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%4095s", S[i]) != 1) return 1;
  }
  for (i = 0; i < N; i++) {
    if (scanf("%4095s", T[i]) != 1) return 1;
  }
  ans = N * N + 100;
  for (k = 0; k < 4; k++) {
    /* 違う場所の数を数える */
    int cur = 0;
    for (i = 0; i < N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
char S[4096][4096];
char T[4096][4096];

int main(void) {
	int i, j, k;
	int ans;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%4095s", S[i]) != 1) return 1;
	}
	for (i = 0; i < N; i++) {
		if (scanf("%4095s", T[i]) != 1) return 1;
	}
	ans = N * N + 100;
	for (k = 0; k < 4; k++) {
		/* 違う場所の数を数える */
		int cur = 0;
		for (i = 0; i < N; i++) {
			for (j = 0; j < N; j++) {
				cur += S[i][j] != T[i][j];
			}
		}
		if (k + cur < ans) ans = k + cur;
		/* 回転させる */
		for (i = 0; i < N - 1 - i; i++) {
			for (j = 0; j < N - i * 2 - 1; j++) {
				char t = S[i][i + j];
				S[i][i + j] = S[N - 1 - i - j][i];
				S[N - 1 - i - j][i] = S[N - 1 - i][N - 1 - i - j];
				S[N - 1 - i][N - 1 - i - j] = S[i + j][N - 1 - i];
				S[i + j][N - 1 - i] = t;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result