hdu 5050 Divided Land(JAVA大数)

Divided Land

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1679    Accepted Submission(s): 702

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 ¹⁰⁰⁰)

 

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

 

Source

2014 ACM/ICPC Asia Regional Shanghai Online

 

Recommend

hujie

题意：

给了两个二进制数，求两个数的最大公约数。

思路：

因为数字比较大，考虑JAVA大数。

代码：

import java.util.Scanner;
import java.util.function.BinaryOperator;
import java.math.*;
import java.util.Comparator;
public class Main{
    public static void main(String[] args){
    	Scanner s = new Scanner (System.in);
    	int t = s.nextInt();
    	for(int i=1;i<=t;i++){
    		String a1=new String ();
    		String a2=new String ();
    		a1=s.next();
    		a2=s.next();
    		BigInteger b1=new BigInteger(a1,2);
    		BigInteger b2=new BigInteger(a2,2);
    		b1.toString();
    		b2.toString();
    		BigInteger ans=b1.gcd(b2);		
    		System.out.println("Case #"+i+": "+ans.toString(2));
    	}
}
}