Sort by

recency

|

1306 Discussions

|

  • + 0 comments

    BigInteger fac = n;
    for(int i=1; i < n; i++){ fac *= i; } Console.WriteLine(fac);

  • + 0 comments

    Wow, Extra Long Factorials really push the limits of standard math tools! Tackling huge numbers like these definitely needs creative Unique SEO Strategies—think niche keywords, long-tail queries like omegle chat, and maybe even some math-based content clustering. I've seen unique approaches like leveraging coding forums and educational platforms for traffic. Always fun when math and SEO get to team up!

  • + 0 comments
    def extraLongFactorials(n):
        mult=1
        # Write your code here
        while n!=1:
            mult*=n
            n=n-1
        print(mult)
    
  • + 0 comments

    My Java 8 Solution

    public static void extraLongFactorials(int n) {
            BigInteger result = BigInteger.ONE;
            
            for (int i = 1; i <= n; i++) {
                result = result.multiply(BigInteger.valueOf(i));
            }
            
            System.out.println(result);
        }
    
  • + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-extra-long-factorials-problem-solution.html