Koch Snowflake

Describe

Koch Snowflake is one of the most famous factal. It is built by starting with an equilateral triangle, removing the inner third of each side, building another equilateral triangle at the location where the side was removed, and then repeating the process indefinitely.

Let Kn be the Koch Snowflake after n-th iteration. It is obvious that the number of sides of Kn, Nn, is 3*4n. Let's number the sides clockwisely from the top of Koch Snowflake.

Let si,n be the i-th side of Kn. The generation of si,n is defined as the smallest m satifying si,n is a part of the sides of Km. For example, in the above picture, the yellow sides are of generation 0; the blue sides are of generation 1; the red sides are of generation 2.

Given a side si,n, your task is to calculate its generation.

  input=n;i  
  output = G(n,i)

Input

The input contains several test cases.
The first line contains T(T <= 1000), the number of the test cases.
The following T lines each contain two numbers, i(1 <= i <= 10^9) and n(0 <= n <= 1000). Your task is to calculate the generation of side si,n.

5
1 0
1 1
2 1
10 2
16 3

Output

For each test case output the generation of the side.

0
0
1
2
0

Have a try

import java.util.Scanner;

public class Koch_Snowflake {

  public static int Generation(int n, int i){
      if (n > 0){
        int group = i%4;
        if (group == 2 || group == 3){ return n; }
        else {
          int groupNum;
          if (group == 1) { groupNum = (i+3)/4; }
          else{ groupNum = i/4;}
          return Generation(n-1, groupNum);
        }
      }
      else { return 0;}
  }

  public static void main(String[] args) {
      Scanner in = new Scanner(System.in);
      while(in.hasNext()) {
        int i = in.nextInt();
        int n = in.nextInt();
        int result = Generation(n,i);
        System.out.println(result);
      }
  }
}