Project Euler #172: Investigating numbers with few repeated digits

  • + 1 comment

    int fact(int n){ if(n<=1) return 1; return fact(n-1)*n; } public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int t = in.nextInt(); ; Solution s = new Solution(); for(int i=0;i

    }