hdu----(5050)Divided Land(二进制求最大公约数)
Divided Land
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 123 Accepted Submission(s): 64
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 ≤ 21000)
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 #include <stdio.h>
2 #include <string.h>
3 #define MAXN 1000
4 struct BigNumber{
5 int len;
6 int v[MAXN];
7 };
8 bool isSmaller(BigNumber n1,BigNumber n2)
9 {
10 if(n1.len<n2.len)
11 return 1;
12 if(n1.len>n2.len)
13 return 0;
14 for(int i=n1.len-1;i>=0;i--)
15 {
16 if(n1.v[i]<n2.v[i])
17 return 1;
18 if(n1.v[i]>n2.v[i])
19 return 0;
20 }
21 return 0;
22 }
23 BigNumber minus(BigNumber n1,BigNumber n2)
24 {
25 BigNumber ret;
26 int borrow,i,temp;
27 ret=n1;
28 for(borrow=0,i=0;i<n2.len;i++)
29 {
30 temp=ret.v[i]-borrow-n2.v[i];
31 if(temp>=0)
32 {
33 borrow=0;
34 ret.v[i]=temp;
35 }
36 else
37 {
38 borrow=1;
39 ret.v[i]=temp+2;
40 }
41 }
42 for(;i<n1.len;i++)
43 {
44 temp=ret.v[i]-borrow;
45 if(temp>=0)
46 {
47 borrow=0;
48 ret.v[i]=temp;
49 }
50 else
51 {
52 borrow=1;
53 ret.v[i]=temp+2;
54 }
55 }
56 while(ret.len>=1 && !ret.v[ret.len-1])
57 ret.len--;
58 return ret;
59 }
60 BigNumber div2(BigNumber n)
61 {
62 BigNumber ret;
63 ret.len=n.len-1;
64 for(int i=0;i<ret.len;i++)
65 ret.v[i]=n.v[i+1];
66 return ret;
67 }
68 void gcd(BigNumber n1,BigNumber n2)
69 {
70 long b=0,i;
71 while(n1.len && n2.len)
72 {
73 if(n1.v[0])
74 {
75 if(n2.v[0])
76 {
77 if(isSmaller(n1,n2))
78 n2=minus(n2,n1);
79 else
80 n1=minus(n1,n2);
81 }
82 else
83 n2=div2(n2);
84 }
85 else
86 {
87 if(n2.v[0])
88 n1=div2(n1);
89 else
90 {
91 n1=div2(n1);
92 n2=div2(n2);
93 b++;
94 }
95 }
96 }
97 if(n2.len)
98 for(i=n2.len-1;i>=0;i--)
99 printf("%d",n2.v[i]);
100 else
101 for(i=n1.len-1;i>=0;i--)
102 printf("%d",n1.v[i]);
103 while(b--)
104 printf("0");
105 printf("n");
106 }
107 int main()
108 {
109 int cases,le,i;
110 BigNumber n1,n2;
111 char str1[MAXN],str2[MAXN];
112 scanf("%d",&cases);
113 for(int w=1;w<=cases;w++)
114 {
115 scanf("%s%s",str1,str2);
116 le=strlen(str1);
117 n1.len=le;
118 for(i=0;i<le;i++)
119 n1.v[i]=str1[le-1-i]-'0';
120 le=strlen(str2);
121 n2.len=le;
122 for(i=0;i<le;i++)
123 n2.v[i]=str2[le-1-i]-'0';
124 printf("Case #%d: ",w);
125 gcd(n1,n2);
126 }
127 return 0;
128 }
- 达尔文漏算的一步却让它填补,科学家认为人类最初认可的进化论不再适用
- 假如黑客攻击您的互联网汽车会怎么样?
- 享学课堂谈-Python初学者的设计模式入门
- 本体网络Ontology Zero入选国家工信部区块链开源项目计划
- 完全无人驾驶将首先在中国大城出现
- 榴莲售出的三拼域名ancaiyun.com 已建站
- 微信提现免费!申请微信免费提现的教程
- 程序员也是天文学家?利用机器学习寻找行星
- python及numpy,pandas易混淆的点
- 也许 vue+css3 做交互特效更简单
- 2017年你不可不知的十大黑科技!涨见识!
- 土豪!网络营销”英文域名Emarketing.com交易
- 前端学习自学笔记:day06
- 十大最蠢密码公布 果然123456是占榜首的最容易记的一个
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- 在tinycolinux上编译pypy和hippyvm
- IDEA 热部署配置 HotSwapAgent-IntelliJ-IDEA-plugin
- 在tinycolinux上编译odoo8
- 在tinycolinux上编译jupyter和rootcling组建混合cpp,python学习环境
- 110分钟使用Python搭建自己的IP定位查询接口
- python实现在线微博数据可视化
- 在tinycolinux上安装chrome
- 如何在Ubuntu 18.04服务器上安装Python 3和设置编程环境
- python趣味题-数字加密
- 快手解析视频真实链接(爬取快手视频)
- 在tinycolinux上安装和使用cloudwall
- 洛谷 P1896 [SCOI2005]互不侵犯(状压dp)
- Mybatis 详解
- 用Python玩转微信
- Python播放暂停音乐