Game problem of game tree taking ball

Package A;
/* Game tree to take the ball game problem
/public class MyA {
	
	//decision procedure, the current number of remaining balls =x
	static Boolean f (int x) {
		int[] op = {1, 3, 7, 8};
 //each of these 4 operations and, if feasible, use this for
		(int i = 0; i < op.length; i++) {
			if (x >= op[i]) {if
				
				(f (x-op[i)) = = Fal SE)		//opponent to make a judgment return
					true; 				Each other must lose, then their own will win
			}
		} return
		false; 							No matter how moves, the other party will always win, then their own must be lost
	} public

	static void Main (string[] args) {
		//dynamic planning: A calculated child problem is stored and then directly fetched
		// The method of dynamic buffering. can improve efficiency.
//		System.out.println (f ());		 System.out.println (f (5-1));		 System.out.println (f (5-3));
		 System.out.println (f);
		System.out.println (f (2));
	}

True