[알고리즘/백준] #1074 Z

package algorithm_lab.day09.q2;

import java.util.Scanner;

public class BJ_1074 {
	static int cnt;
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int r = sc.nextInt();
		int c = sc.nextInt();
		int size = (int)Math.pow(2,N);
		
		cnt=0;
		findxy(size,r,c);
		System.out.println(cnt);
	}
	
	public static void findxy(int size, int r, int c) {
		if(size==1) return;
		
		if(r<size/2&&c<size/2) {
			findxy(size/2,r,c);
		}else if(r<size/2&&c>=size/2) {
			cnt+=(size*size)/4;
			findxy(size/2,r,c-size/2);
		}else if(r>=size/2&&c<size/2) {
			cnt+=(size*size)/4*2;
			findxy(size/2,r-size/2,c);
		}else {
			cnt+=(size*size)/4*3;
			findxy(size/2,r-size/2,c-size/2);
		}
	}
}