Divided Land
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1540 Accepted Submission(s): 657
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这道题题意是给一个长方形的长和宽,并且长和宽是二进制表示的,把这个长方形分成小正方形,要求不浪费,并且尽可能大,1,不浪费的话说明正好宽和长都可以尽可能分完所以是长和宽的公因数,2.尽可能大,所以题意就很明显了,找最大公因数,并且二进制形式输出出来。因为是大数还设计二进制转换,所以用java中的BigInteger。因为第一次用编译错误了两次,mian函数外面的公共类要用Main才行。。。。import java.math.BigInteger;//导入大数包 import java.util.Scanner;//导入输入包 public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int t; BigInteger A; BigInteger B;//定义两个大数 t = sc.nextInt();//读入样例个数 for(int i = 1; i <= t; i++) { A = sc.nextBigInteger(2); B = sc.nextBigInteger(2);//以2进制读入大数 System.out.print("Case #" + i + ": "); System.out.println(A.gcd(B).toString(2));//以二进制输出gcd } } }