FilesExpand file tree

 main

/

didi.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (40 loc) · 1.4 KB

 main

/

didi.java

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (40 loc) · 1.4 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

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.util.Arrays;

import java.util.StringTokenizer;

public class didi{

static StringBuilder sb = new StringBuilder();

static int n, m;

static boolean[] visit;

static int[] arr;

public static void main(String[] args) throws IOException {

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

StringTokenizer st = new StringTokenizer(br.readLine());

n = Integer.parseInt(st.nextToken());

m = Integer.parseInt(st.nextToken());

visit = new boolean[n];

arr = new int[m];

dfs(0,0);

System.out.println(sb);

}

private static void dfs(int depth, int start) {

if (depth == m) {

System.out.println(" depth :"+depth+" start :"+start+" arr :"+ Arrays.toString(arr));

for (int val : arr) {

sb.append(val).append(" ");

}

sb.append("\n");

return;

}

for (int i = start; i < n; i++) {

System.out.println( "i :"+i+" depth :"+depth+" start :"+start+" arr :"+ Arrays.toString(arr)+" visited :"+Arrays.toString(visit));

if (!visit[i]) {

visit[i] = true;

arr[depth] = i + 1;

dfs(depth + 1, i+1);

visit[i] = false;

}

}

}

}