FilesExpand file tree

 master

/

checker.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

84 lines (76 loc) · 1.64 KB

 master

/

checker.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

84 lines (76 loc) · 1.64 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

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

78

79

80

81

82

83

/*

ID: xieke.b1

PROG: checker

LANG: C++

*/

#include <iostream>

#include <fstream>

#include <string>

#include <string.h>

#include <algorithm>

#include <vector>

#include <cmath>

using namespace std;

ofstream fout("checker.out");

ifstream fin ("checker.in");

const int INF = 999999999;

int N;

const int MAXN = 15;

int ys[MAXN];

bool y_ocupy[MAXN];

bool og[MAXN*3];

bool og2[MAXN*3];

int ans_cnt = 0;

void dfs(int cur){

if(cur==N){

ans_cnt++;

if(ans_cnt<=3){

for(int i=0; i<N-1; i++){

fout<<ys[i]+1<<" ";

}

fout<<ys[N-1]+1<<endl;

}

return ;

}

for(int i=0; i<N; i++){

if(!y_ocupy[i]){

bool ok = true;

if(!og[i-cur+MAXN] && !og2[i+cur]){

og[i-cur+MAXN]=true;

og2[i+cur] = true;

y_ocupy[i] = true;

ys[cur] = i;

dfs(cur+1);

y_ocupy[i] = false;

og[i-cur+MAXN] = false;

og2[i+cur] = false;

}

/*

for(int j=0; j<cur; j++){

int pre_x = j;

int pre_y = ys[j];

if( abs(cur-pre_x)==abs(i-pre_y) ){

ok = false;

break;

}

}

if(ok){

y_ocupy[i] = true;

ys[cur] = i;

dfs(cur+1);

y_ocupy[i] = false;

}

*/

}

}

}

void work(){

memset(y_ocupy, 0, sizeof(y_ocupy));

dfs(0);

fout<<ans_cnt<<endl;

}

int main(){

fin>>N;

work();

return 0;

}