We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
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
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #172: Investigating numbers with few repeated digits
You are viewing a single comment's thread. Return to all comments →
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