Java Loops II HackerRank Solution

Java Loops II HackerRank Solution
Java Loops I

Java Loops II HackerRank Solution

We use the integers , , and  to create the following series:

You are given  queries in the form of a, b, and n. For each query, print the series corresponding to the given a,b , and n values as a single line of n space-separated integers.

Input Format

The first line contains an integer, q, denoting the number of queries.
Each line i of the q subsequent lines contains three space-separated integers describing the respective ai,bi , and ni values for that query.

Constraints

  • 0<=q<=500
  • 0<=a,b=50
  • 1<=n<=15

Output Format

For each query, print the corresponding series on a new line. Each series must be printed in order as a single line of  space-separated integers.

Sample Input

2
0 2 10
5 3 5

Sample Output

2 6 14 30 62 126 254 510 1022 2046
8 14 26 50 98

Java Loops II HackerRank Code Solution:

// Java Loops II HackerRank Solution

import java.util.*;
import java.io.*;
import java.math.*;

class Solution{
    public static void main(String []argh){
        Scanner in = new Scanner(System.in);
        int t=in.nextInt();
        for(int i=0;i<t;i++){
            int a = in.nextInt();
            int b = in.nextInt();
            int n = in.nextInt();
            int c=a;
        
            

            for(int j=0;j<n;j++){
                
            System.out.print(""+(c+=Math.pow(2,j)*b)+" ");}
            System.out.println();
        }


        in.close();
    }
}


// Java Loops II HackerRank Solution

Disclaimer: This problem is originally created and published by HackerRank, we only provide solutions to this problem. Hence, doesn’t guarantee the truthfulness of the problem. This is only for information purposes.

Leave a Comment