河南省第十一届ACM Attack City and Capture Territory

Bertha 。 2023-06-13 11:20 1阅读 0赞

题目描述  
The Three Kingdoms period was a relatively famous period in the history of China. From the Battle of Chibi (AD 211) to the reunification of China in the Western Jin Dynasty(AD 280). During the period, Cao’s Wei State, Liu’s Shu State, and Sun’s Wu Guo’s Three Kingdoms stood together. Therefore, it was called the Three Kingdoms period.  
In the last years of the Eastern Han Dynasty, Dong\_ Z specialized in power , the coalition forces of the world’s princes crusade against each other. Among them, Liu\_B and Sun\_Q, who are school students, also participated in the crusade.  
In AD 215 , Liu\_B and Sun\_Q simultaneously attacked JingZhou and directly threatened Dong Z’s city. There were N firepower points on the high wall, each fire point with different s trength Xi . Liu\_B and Sun\_Q looked at the high walls and the strong gates, they did not attack the city traightaway. They negotiate to attack firepower point alternately. Who breaks through the last firepower point, he will win the city.  
Because of limited weaponry, weapons of each side can only attack one firepower at a time. But they can control whether completely destroy this firepower point or weaken the strength of firepower point.  
Liu\_B has a strong think-tank. After calculation, he finds out who will attack first , who will more likely win the city .  
输入  
The first line of the input contains one integer T, which is the number of test cases (1<=T<=10). Each test case specifies:

*  Line 1: N ( 1 ≤ N ≤ 100 )
 *  Line 2: X1 X2… Xn ( 1 <= Xi<=1000 i=1…. n)  
    输出  
    For each test case , print “Liu\_B is sure to win.” Or “Liu\_B is not sure to win.” , suppose Liu\_B first attacks.  
    样例输入 Copy  
    3  
    2  
    1 3  
    2  
    3 3  
    5  
    1 2 3 4 5  
    样例输出 Copy  
    Liu\_B is sure to win.  
    Liu\_B is not sure to win.  
    Liu\_B is sure to win.

package ACM2018;
    import java.util.Scanner;
    public class H { 
    	public static int T;
    	public static int sz[];
    	public static boolean ans[];
    	public static void main(String[] args) { 
    		Scanner sc=new Scanner(System.in);
    		T=sc.nextInt();
    		ans=new boolean[T];
    		sc.nextLine();
    		for(int i=0;i<T;i++){ 
    			int n=sc.nextInt();
    			sz=new int[n];
    			sc.nextLine();
    			for(int j=0;j<n;j++){ 
    				sz[j]=sc.nextInt();
    			}
    			ans[i]=check();
    			sc.nextLine();
    		}
    		for(int i=0;i<ans.length;i++){ 
    			if(ans[i])
    				System.out.println("Liu_B is sure to win.");
    			else
    				System.out.println("Liu_B is not sure to win.");
    		}
    	}
    	public static boolean check() { 
    		int sszz[][]=new int [sz.length][10];
    		int sum[]=new int [10];
    		int count=0;
    		for(int i=0;i<sz.length;i++){ 
    			for(int j=0;j<10;j++){ 
    				sszz[i][j]=sz[i]%2;
    				sz[i]/=2;
    			}
    		}
    		for(int i=0;i<10;i++){ 
    			for(int j=0;j<sz.length;j++){ 
    				sum[i]+=sszz[j][i];
    			}
    			sum[i]=sum[i]%2;
    			count+=sum[i];
    		}
    		if(count!=0)
    			return true;//win
    		else
    			return false;
    	}
    }