Submission #72276403

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 cards[2][114514];
int main(void) {
  int n, m;
  int i;
  int cur = 0;
  if (scanf("%d", &n) != 1) return 1;
  for (i = 0; i < 2 * n; i++) {
    cards[0][i] = i + 1;
  }
  if (scanf("%d", &m) != 1) return 1;
  for (i = 0; i < m; i++) {
    int next = cur ^ 1;
    int k;
    int j;
    if (scanf("%d", &k) != 1) return 1;
    if (k == 0) {
      for (j = 0; j < n; j++) {
        cards[next][j * 2] = cards[cur][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int cards[2][114514];

int main(void) {
	int n, m;
	int i;
	int cur = 0;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 0; i < 2 * n; i++) {
		cards[0][i] = i + 1;
	}
	if (scanf("%d", &m) != 1) return 1;
	for (i = 0; i < m; i++) {
		int next = cur ^ 1;
		int k;
		int j;
		if (scanf("%d", &k) != 1) return 1;
		if (k == 0) {
			for (j = 0; j < n; j++) {
				cards[next][j * 2] = cards[cur][j];
				cards[next][j * 2 + 1] = cards[cur][n + j];
			}
		} else {
			for (j = 0; j < k; j++) {
				cards[next][j + (n * 2 - k)] = cards[cur][j];
			}
			for (j = k; j < n * 2; j++) {
				cards[next][j - k] = cards[cur][j];
			}
		}
		cur = next;
	}
	for (i = 0; i < n * 2; i++) {
		printf("%d\n", cards[cur][i]);
	}
	return 0;
}

Submission Info

Judge Result