first commit

J02022 - SỐ XA CÁCH.java

@@ -0,0 +1,36 @@
+package nyagami;
+
+import java.util.Scanner;
+
+public class test{
+    static int n;
+    static void Try(int i,int[] a, boolean[] vs){
+        if(i==n){
+            for(int j=0; j<n; j++){
+                System.out.print(a[j]);
+            }
+            System.out.println("");
+            return;
+        }
+        for(int j=1; j<=n; j++){
+            if(!vs[j] && (i==0 || (i>0 && Math.abs(j-a[i-1])!=1))){
+                vs[j]=true;
+                a[i]=j;
+                Try(i+1,a,vs);
+                vs[j]=false;
+            }
+        }
+    }
+    public static void main(String[] arg){
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        while(t-->0){
+            n = sc.nextInt();
+            boolean[] visited = new boolean[n+1];
+            int[] a = new int[n];
+            Try(0,a,visited);
+            System.out.println("");
+        }
+        sc.close();
+    }
+}