HackerRank_Java_ProblemSolving/Utopian_Tree.java at master · Fatihasa/HackerRank_Java_ProblemSolving

50 lines (36 loc) · 1.28 KB

Problem Link: https://www.hackerrank.com/challenges/utopian-tree/problem?h_r=next-challenge&h_v=zen&isFullScreen=false

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.regex.*;

public class Solution {

// Complete the utopianTree function below.

static int utopianTree(int n) {

int height = 0;

< 4CCF /div>

for(int i = 0 ; i<n+1 ; i++){

if(i%2==0)height+=1;

else height*=2;

}

return height;

}

private static final Scanner scanner = new Scanner(System.in);

public static void main(String[] args) throws IOException {

BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

int t = scanner.nextInt();

scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (int tItr = 0; tItr < t; tItr++) {

int n = scanner.nextInt();

scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

int result = utopianTree(n);

bufferedWriter.write(String.valueOf(result));

bufferedWriter.newLine();

}

bufferedWriter.close();

scanner.close();

}

Provide feedback