50004. 15 - puzzle
難度：3/5 Used Time: 16:241
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
int n;
int map[4][4];
int zero_x = 0, zero_y = 0;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
inline static void ipt(){
for(int i = 0; i < 4; i++) for(int j = 0; j < 4; j++){
scanf("%d", &map[i][j]);
if(map[i][j] == 0){
zero_x = i;
zero_y = j;
}
}
return;
}
inline static bool check(){
for(int i = 0; i < 4; i++) for(int j = 0; j < 4; j++){
if(i == 3 && j == 3) break;
if(map[i][j] != i * 4 + j + 1) return false;
}
return true;
}
inline static bool is_valid(int x, int y){
if((x >= 0 && x < 4) && (y >= 0 && y < 4)){
return true;
}
return false;
}
inline static void print_line(int arr[], int n){
printf("%d", arr[0]);
for(int i = 1; i < n; i++) printf(" %d", arr[i]);
printf("\n");
}
inline static void print_board(){
for(int i = 0; i < 4; i++) print_line(map[i], 4);
}
int main(){
ipt();
// print_board();
bool win_flag = false;
while(scanf("%d", &n) != EOF && n != 0){
for(int i = 0; i < 4; i++){
int neigh_x = zero_x + dx[i], neigh_y = zero_y + dy[i];
if(is_valid(neigh_x, neigh_y) && map[neigh_x][neigh_y] == n){
map[neigh_x][neigh_y] = 0;
map[zero_x][zero_y] = n;
zero_x = neigh_x;
zero_y = neigh_y;
break;
}
}
if(check()){
win_flag = true;
break;
}
}
print_board();
if(win_flag == true){
printf("1 %d\n", n);
}
else{
printf("0\n");
}
}