Divided Land
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 169 Accepted Submission(s): 91
Problem Description
It’s time to fight the local despots and redistribute the land. There is a rectangular piece of land granted from the government, whose length and width are both in binary form. As the mayor, you must segment the land into multiple squares of equal size for the villagers. What are required is there must be no any waste and each single segmented square land has as large area as possible. The width of the segmented square land is also binary.
Input
The first line of the input is T (1 ≤ T ≤ 100), which stands for the number of test cases you need to solve.
Each case contains two binary number represents the length L and the width W of given land. (0 < L, W ≤ 2 1000)
Each case contains two binary number represents the length L and the width W of given land. (0 < L, W ≤ 2 1000)
Output
For each test case, print a line “Case #t: ”(without quotes, t means the index of the test case) at the beginning. Then one number means the largest width of land that can be divided from input data. And it will be show in binary. Do not have any useless number or space.
Sample Input
3 10 100 100 110 10010 1100
Sample Output
Case #1: 10 Case #2: 10 Case #3: 110解决方案:理解了之后发现,就是求这两个二进制数的最大公约数嘛。但数据有点大,所以可以用java的大数来写。code:import java.util.*; import java.math.BigInteger; public class Main{ public static void main(String arg[]){ Scanner cin=new Scanner(System.in); int t=cin.nextInt(); String str1; String str2; for(int i=1;i<=t;i++){ str1=cin.next(); str2=cin.next(); BigInteger n1=new BigInteger(str1,2); BigInteger n2=new BigInteger(str2,2); n1=n1.gcd(n2); String str=""; //System.out.println(n2); //System.out.println(n1); while(n1.compareTo(new BigInteger("0"))==1){ if(n1.and(new BigInteger("1")).equals(new BigInteger("0"))) { str+='0'; } else{ str+='1'; } // System.out.println(str); //System.out.println(n1); n1=n1.shiftRight(1); } System.out.print("Case #"+i+": "); int len=str.length(); for(int s=len-1;s>=0;s--){ System.out.print(str.charAt(s)); } System.out.println(); }} }