【HDU - 5050 】Divided Land (Java大数,大数进制转换,大数gcd)
題干:
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)
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 1100Sample Output
Case #1: 10 Case #2: 10 Case #3: 110題目大意:
? 讀入二進制形式的兩個數,讓你以二進制的形式輸出他倆對應十進制數字的gcd。
解題報告:
不得不說一句,IDEA牛逼。所有功能全都自動補全出來。
AC代碼:
import java.math.*; import java.util.Scanner; public class Main{public static void main(String[] args) {Scanner cin = new Scanner(System.in);int t;t = cin.nextInt();BigInteger a,b;for(int i = 1; i<=t; i++) {a= cin.nextBigInteger(2);b= cin.nextBigInteger(2);System.out.print("Case #" + i + ": ");System.out.println(a.gcd(b).toString(2));}} }?
創作挑戰賽新人創作獎勵來咯,堅持創作打卡瓜分現金大獎總結
以上是生活随笔為你收集整理的【HDU - 5050 】Divided Land (Java大数,大数进制转换,大数gcd)的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: 【CodeForces - 485A】F
- 下一篇: 【牛客 - 82B】区间的连续段(贪心,