题意给你两个二进制数m,n 求他们的最大公约数用二进制表示 0<m,n<2^1000

先把二进制转换为十进制求出最大公约数再把结果转换为二进制数比較大要用到大数

import java.util.*;
import java.math.*;public class wl6_9 {static BigInteger two = BigInteger.valueOf(2), one = BigInteger.ONE,zero = BigInteger.ZERO;static BigInteger gcd(BigInteger a, BigInteger b) {while (!(a.mod(b).equals(zero))) {BigInteger t = a.mod(b);a = b;b = t;}return b;}static void bprint(BigInteger x) {if (x.equals(zero))return;bprint(x.divide(two));if (x.mod(two).equals(one))System.out.print(1);elseSystem.out.print(0);}public static void main(String[] args) {Scanner in = new Scanner(System.in);int T = in.nextInt();String a, b;for (int t = 1; t <= T; t++) {a = in.next();b = in.next();int la = a.length(), lb = b.length();BigInteger m = zero, n = zero;for (int i = 0; i < la; ++i) {m = m.multiply(two);if (a.charAt(i) == '1')m = m.add(one);}for (int i = 0; i < lb; ++i) {n = n.multiply(two);if (b.charAt(i) == '1')n = n.add(one);}System.out.printf("Case #%d: ", t);bprint(gcd(m, n));System.out.println();}in.close();}
}

Divided Land

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

HDU 5050 Divided Land(进制转换)相关推荐

HDU 5050 Divided Land （二进制上的最大公约数）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5050 题面: Divided Land Time Limit: 8000/4000 MS (Java/ ...
HDU 5050 Divided Land JAVA GCD
题意:给出二进制表示的长方形的边长.求出一个最大的正方形,使整个长方形分成最多的正方形.输出正方形的边长,同样也要用二进制输出. 思路:很直接的就想到了,正方形的边长是长方形的两个边长的GCD.但是因 ...
java 数字的进制转换
对整数进行进制转换,有现成的函数,就不需要倒着求余数了: package hdu;public class sum {public static void main(String[] args) {/ ...
C语言32位正整数作为id进程,SOJ4453 Excel列数进制转换
描述我们都知道Excel的列数是用字母表示的,比如第1列对应A,第27列对应AA. 假设给定一个正整数n,你能给出它所对应的字母表示么? 输入格式程序需要读入多个测试样例,每个测试样例中: 一个正 ...
讲清楚进制转换、进制计算那些事 —— 二进制转换十进制、十六进制
讲清楚进制转换.进制计算那些事信息在计算机中的表示 1.易于物理实现 2.可靠性高 3.运算规则简单数制及其不同进制之间的转换 1.常用进制数及其对应关系表 1-2 常见进制数所使用的基本符号 ...
python中不同进制的整数之间可以直接运算_Python 进制转换、位运算
一.进制转换编程用十进制,十进制转换为二进制.八进制.十六进制 In [135]: bin(23) Out[135]: '0b10111' In [136]: oct(23) Out[136]: ' ...
c语言进制转换pdf下载,C语言实现任意进制转换.doc
C语言实现任意进制转换.doc includestdio.h#includemath.h#includestring.hvoid dtox(double num,int jz)char xnum100 ...
进制转换converse
栈和队列是在软件设计中常用的两种数据结构,它们的逻辑结构和线性表相同. 其特点在于运算受到了限制:栈按"后进先出"的规则进行操作,队按"先进先出"的规则进行操作 ...
进制转换位运算（包括补码、原码、反码、~0等一些零碎东西一次说清）
我发现网上关于标题上的内容介绍的都很零碎,因此为了方便查找.也为了本人对这一部分的充分理解,就想着写一篇这样的博客(我分成了几个部分,以便查找): 一.进制转换让我们先来看看各个进制的定义: 十进制 ...
每日一题（进制转换）
前言:为了让小伙伴更方便的学习编程语言,小白每天都会分享一道编程题.小白也创建了一个微信公众号,会同步更新题目和相关的视觉领域的知识,如果小伙伴不方便在网页上阅读文章,可以关注微信公众号"小 ...

HDU 5050 Divided Land(进制转换)

Divided Land

HDU 5050 Divided Land(进制转换)相关推荐

最新文章

热门文章