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.
  1. Prepare
  2. Mathematics
  3. Combinatorics
  4. Anti-Palindromic Strings
  5. Discussions

Anti-Palindromic Strings

  • awkwardcandidate
     + 1 comment

    Here's my solution in JAVA:

        static int solve(int n, int m) {

        if (n == 1) return m%(1000000007);
    
BigInteger result = new BigInteger(""+m);
result = result.multiply(new BigInteger(""+(m-1)));
BigInteger newBig = new BigInteger(""+(m-2));
newBig = newBig.modPow(new BigInteger(""+(n-2)),new BigInteger("1000000007"));
result = result.multiply(newBig);


        return result.mod(new BigInteger("1000000007")).intValue();

    }