-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path5.loopingArithExpn
More file actions
62 lines (43 loc) · 1.22 KB
/
Copy path5.loopingArithExpn
File metadata and controls
62 lines (43 loc) · 1.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*
Given three integers , , and , output the following series:
Input Format
The first line will contain the number of testcases . Each of the next lines will have three integers, , , and .
We have provided a code stub in the editor which handles the input operation.
Constraints
Output Format
Print the answer to each test case in separate lines.
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
In the first case:
1st term =
2nd term =
3rd term =
and so on.
As , we printed the first terms.
*/
import java.util.*;
import java.io.*;
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 sum=a; //initial sum=a not "0" , divid the expreession
for(int j=0;j<=n-1;j++){
sum = sum + (int)Math.pow(2,j)*b; //important to cast, or loss of precision
System.out.print(sum+" ");
}
System.out.println();
}
in.close();
}
}