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. Algorithms
  3. Recursion
  4. Recursive Digit Sum
  5. Discussions

Recursive Digit Sum

  • bercolax
     + 7 comments

    This is not a case for recursion at all. The below code in Java will solve without any recursion being used.

    import java.math.*;

public class Solution {

    public static void main(String[] args) {
        String arr[] = new Scanner(System.in).nextLine().split("[ ]");
        int output = (Integer.parseInt(arr[1])*new BigInteger(arr[0]).remainder(new BigInteger("9")).intValue())%9;
        System.out.println(output == 0 ? 9:output);
    }
}