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 int utopianTree(int n) {
int height = 1;
for (int i = 1; i <= n; i++) {
if (i % 2 == 1) {
height *= 2;
} else {
height += 1;
}
}
return height;
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
// Use this for local testing:
// BufferedWriter bufferedWriter = new BufferedWriter(new OutputStreamWriter(System.out));
// Use this for HackerRank submission:
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = Integer.parseInt(bufferedReader.readLine().trim());
for (int tItr = 0; tItr < t; tItr++) {
int n = Integer.parseInt(bufferedReader.readLine().trim());
int result = Result.utopianTree(n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
}
bufferedReader.close();
bufferedWriter.close();
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Utopian Tree
You are viewing a single comment's thread. Return to all comments →
//JAVA15: import java.io.*;
class Result {
}
public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
}