## Algorithm

Problem Name: Java Loops II

In this HackerRank Functions in Java programming problem solution,

We use the integers a,b, and n to create the following series:

(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,b, and n . For each query, print the series corresponding to the given a,b, and 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 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
``````

## Code Examples

### #1 Code Example with Java Programming

```Code - Java Programming```

``````
import java.util.Scanner;

public class Solution{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);

int T = sc.nextInt();

for(int i = 0; i < T; i++){
int a = sc.nextInt();
int b = sc.nextInt();
int n = sc.nextInt();

int sum = a;
for(int j = 0; j < n; j++){
sum += (Math.pow(2, j) * b);
System.out.print(sum + " ");
}
System.out.println();
}
}
}
``````
Copy The Code &