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.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. Bob and Ben
  5. Discussions

Bob and Ben

  • xdavidliu
     + 0 comments

    simple java solution, O(1) space and O(number of trees) time

    import java.util.Scanner;

class Solution{
    static void solve(){
	Scanner sc=new Scanner(System.in);
	int ngame=sc.nextInt();
	for(int i=0;i<ngame;++i){
	    int ntree=sc.nextInt(), xor=0;
	    for(int j=0;j<ntree;++j){
		int nnode=sc.nextInt();
		sc.nextInt();
		int nimber=0;
	        if(nnode!=2) nimber=2-(nnode&1);
		xor=(j==0?nimber: xor^nimber);
	    }
	    System.out.println(xor==0?"BEN":"BOB");
	}
	sc.close();
    }
    public static void main(String[] args){
	solve();
    }
}