Hello coders, today we are going to solve **Java Loops II HackerRank Solution**.

**Problem**

We use the integers ** a**,

**, and**

*b***to create the following series:**

*n** ( a+2*^{0}* . b), ( a+2*^{0}* . b + **2*^{1} . b*), . . . . . , ***( a+2**^{0}** . b + 2 ^{1} . b + . . . + 2^{n-1} . b)**

You are given ** q **queries in the form of

**,**

*a***, and**

*b***. For each query, print the series corresponding to the given**

*n***,**

*a***, and**

*b***values as a single line of**

*n***space-separated integers.**

*n***Input Format**

The first line contains an integer, ** q**, denoting the number of queries.

Each line

**of the**

*i***subsequent lines contains three space-separated integers describing the respective**

*q***,**

*a*_{i}**, and**

*b*_{i}**values for that query.**

*n*_{i}**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 ** n **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
```

**Explanation**

We have two queries:

- We use
to produce some series*a=0, b=2, and n=10*,*s*_{0},*s*_{1},*s*_{2}**. . . .**,:*s*_{n-1}=*s*_{0}*0 + 1 . 2 = 2*=*s*_{1}*0 + 1 . 2 + 2 . 2 = 6*=*s*_{2}*0 + 1 . 2 + 2 . 2**+ 4 . 2 = 14**…. and so on.*- Once we hit
*n = 10,*we print the first 10 terms as a single line of space-separated integers.

- We use
to produce some series*a=5, b=3, and n=5*,*s*_{0},*s*_{1},*s*_{2}**. . . .**,:*s*_{n-1}=*s*_{0}*5 + 1 . 3 = 8*=*s*_{1}*5 + 1 . 3 + 2 . 3 = 14*=*s*_{2}*5 + 1 . 3 + 2 . 3**+ 4 . 3 = 26*=*s*_{2}*5 + 1 . 3 + 2 . 3**+ 4 . 3 + 8 . 3= 50*=*s*_{2}*5 + 1 . 3 + 2 . 3**+ 4 . 3**+ 8 . 3**+ 16 . 3 = 98*

We print each element of our series as a single line of space-separated values.

**Solution –** **Java Loops 2**

import java.util.*; import java.io.*; class Solution{ public static void main(String []argh){ Scanner in = new Scanner(System.in); int sum = 0; int t=in.nextInt(); for(int i=0;i<t;i++){ int a = in.nextInt(); int b = in.nextInt(); int n = in.nextInt(); if( (n>=1&&n<=15) && (a>=0&&a<=50) && (b>=0&&b<=50) ){ int j=0; while(j<n){ int s = (int)Math.pow(2,j)*b; sum = sum+s; int ss = sum+a; System.out.print(ss + " "); j++; } sum = 0; int ss = 0; } System.out.println(""); } in.close(); } }

**Disclaimer:** The above Problem ( ** Java Loops 2** ) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.

Olaoluwathanks to you… it worked…. buh i would suggest you explain the code in plain text… you are appreciated