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. Java
  3. Introduction
  4. Java Loops II
  5. Discussions

Java Loops II

  • RodneyShag
     + 18 comments

    Java solution - passes 100% of test cases

    If using Math.pow(), make sure you cast it to an integer since it returns a double.

    import java.util.Scanner;

class Solution{
    public static void main(String [] args) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        for (int i = 0; i < t; i++) {
            int a = scan.nextInt();
            int b = scan.nextInt();
            int n = scan.nextInt();
            
            for (int j = 0; j < n; j++) {
                a += b * (int) Math.pow(2, j);
                System.out.print(a + " ");
            }
            System.out.println();
        }
        scan.close();
    }
}

    From my HackerRank Java solutions.