Submission #70691625

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>
#include <stdlib.h>
#include <string.h>
int cmp(const void* x, const void* y) {
  return strcmp(*(const char**)x, *(const char**)y);
}
int N, M;
char S[16][16];
int ndata = 0;
char data[16 * 16][16 * 16];
char *pdata[16 * 16];
int main(void) {
  int i, j, k;
  int ans = 1;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%15s", S[i]) != 1) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp(const void* x, const void* y) {
	return strcmp(*(const char**)x, *(const char**)y);
}

int N, M;
char S[16][16];

int ndata = 0;
char data[16 * 16][16 * 16];
char *pdata[16 * 16];

int main(void) {
	int i, j, k;
	int ans = 1;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%15s", S[i]) != 1) return 1;
	}
	for (i = M; i <= N; i++) {
		for (j = M; j <= N; j++) {
			for (k = 0; k < M; k++) {
				memcpy(data[ndata] + M * k, S[i - M + k] + (j - M), M);
			}
			pdata[ndata] = data[ndata];
			ndata++;
		}
	}
	qsort(pdata, ndata, sizeof(*pdata), cmp);
	for (i = 1; i < ndata; i++) {
		ans += strcmp(pdata[i - 1], pdata[i]) != 0;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result