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.
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner scn = new Scanner(System.in);
int q = scn.nextInt(); // q represent number of series u want to print
for(int i = 1; i <= q; i++) {
int a, b, n;
a = scn.nextInt(); //First element in the series
b = scn.nextInt(); //Second element in the series
n = scn.nextInt(); // number of elements in the series
int series = a; // we initialize with a to avoid multiple addition
// of a in the main logic
// j represent the exponential of base case (b^e)
for(int j = 0; j < n; j++){
//main logic
//(1<<j) is the fast way to get 2^j
series += (1<<j) * b;
System.out.print(series + " ");
}
System.out.println();
}
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Java Loops II
You are viewing a single comment's thread. Return to all comments →
Java Optimal Code (100% beats) #java #coding
import java.io.; import java.util.;
public class Solution {
}