반응형
문제 : https://www.hackerrank.com/challenges/java-loops/problem
풀이 :
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 result = a;
for(int j=0; j<n; j++){
result+= Math.pow(2,j)*b;
System.out.print(result+" ");
}
System.out.println();
}
in.close();
}
}
Math.pow만 알면 어려울것 없는 문제
반응형
'Java > Algorithm' 카테고리의 다른 글
[Java-Algorithm] HackerRank Java 2D Array - DS 풀이 (0) | 2021.01.25 |
---|---|
[Java-Algorithm] HackerRank Java Date and Time 풀이 (0) | 2021.01.25 |
[Java-Algorithm]HackerRank Java Static Initializer Block 풀이 (0) | 2021.01.25 |
[Java-Algorithm]HackerRank Java End-of-file (0) | 2021.01.22 |
[Java-Algorithm]HackerRank - Java Stdin and Stdout II (0) | 2021.01.22 |