Submission #69410391

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 A[22][1 << 22];
int main(void) {
  int N, K;
  int i, j;
  int U = 0;
  if (scanf("%d%d", &N, &K) != 2) return 1;
  A[0][0] = K;
  for (i = 1; i <= N; i++) {
    for (j = 0; j < (1 << (i - 1)); j++) {
      A[i][j * 2] = A[i - 1][j] / 2;
      A[i][j * 2 + 1] = A[i - 1][j] - A[i][j * 2];
    }
  }
  for (i = 1; i <= N; i++) {
    int min = A[i][0], max = A[i][0];
    for (j = 1; j < (1 << i); j++) {
      if (A[i][j] < min) min = A[i][j];
      if (A[i][j] > max) max = A[i][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int A[22][1 << 22];

int main(void) {
	int N, K;
	int i, j;
	int U = 0;
	if (scanf("%d%d", &N, &K) != 2) return 1;
	A[0][0] = K;
	for (i = 1; i <= N; i++) {
		for (j = 0; j < (1 << (i - 1)); j++) {
			A[i][j * 2] = A[i - 1][j] / 2;
			A[i][j * 2 + 1] = A[i - 1][j] - A[i][j * 2];
		}
	}
	for (i = 1; i <= N; i++) {
		int min = A[i][0], max = A[i][0];
		for (j = 1; j < (1 << i); j++) {
			if (A[i][j] < min) min = A[i][j];
			if (A[i][j] > max) max = A[i][j];
		}
		if (max - min > U) U = max - min;
	}
	printf("%d\n", U);
	for (i = 0; i < (1 << N); i++) {
		printf(" %d" + !i, A[N][i]);
	}
	putchar('\n');
	return 0;
}

Submission Info

Judge Result