import java.util.*; public class Solution { private int count = 0; public void checked(int n,int max,int[] map){ if(n == max){ count++; return; } for (int i = 0; i < max; i++) { map[n] = i; if(judge(n,map)) checked(n+1,max,map); } } public boolean judge(int n,int[] map){ for (int i = 0; i < n;...