hdu 5050 Divided Land---2014acm上海赛区网络赛
2014-09-27 20:05
489 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5050
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 115 Accepted Submission(s): 57
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
Sample Output
Source
2014 ACM/ICPC Asia Regional Shanghai Online
Recommend
hujie | We have carefully selected several similar problems for you: 5052 5051 5049 5048 5046
Statistic | Submit | Discuss | Note
用java大数类取个gcd就完了。。。一开始手写了下gcd居然还共享了一次wa.......ORZ
Divided Land
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 115 Accepted Submission(s): 57
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
Source
2014 ACM/ICPC Asia Regional Shanghai Online
Recommend
hujie | We have carefully selected several similar problems for you: 5052 5051 5049 5048 5046
Statistic | Submit | Discuss | Note
用java大数类取个gcd就完了。。。一开始手写了下gcd居然还共享了一次wa.......ORZ
import java.util.*; import java.math.*; public class Main { public static void main(String [] args)throws Exception{ Scanner cin=new Scanner(System.in); BigInteger one=new BigInteger("1"); BigInteger zero=new BigInteger("0"); BigInteger two= new BigInteger("2"); BigInteger four= new BigInteger("4"); BigInteger six = new BigInteger("6"); BigInteger A; BigInteger B; int T; T=cin.nextInt(); for(int tt=1;tt<=T;tt++){ String a,b; a=cin.next();b=cin.next(); A=new BigInteger(a,2); B=new BigInteger(b,2); BigInteger ans=A.gcd(B); System.out.print("Case #"+tt+": "); System.out.println(ans.toString(2)); } } }
相关文章推荐
- HDU 5050 Divided Land 2014 ACM/ICPC Asia Regional Shanghai Online
- hdu 5045 Contest--2014acm上海赛区网络赛
- hdu 5053 the Sum of Cube---2014acm上海赛区网络赛
- hdu 5050 Divided Land 大数求GCD 2014 ACM/ICPC Asia Regional Shanghai Online
- hdu 5050 Divided Land 大数求GCD 2014 ACM/ICPC Asia Regional Shanghai Online
- HDU 5478 2015 ACM/ICPC 上海赛区网络赛1011 模运算+快速幂
- 2014 ACM/ICPC 上海赛区网络赛解题报告汇总
- hdu 5047 Sawtooth--2014acm上海赛区邀请赛(附java模板)
- hdu5050_2014ACM上海__Divided Land
- HDU 5044(2014 ACM-ICPC上海网络赛)
- HDU - 5050 Divided Land
- 2014 网选 上海赛区 hdu 5047 Sawtooth
- Hdu 4035 Maze (dp求期望) - 2011 ACM/ICPC 成都赛区网络预选赛 1005
- acm_icpc网络赛第六站:上海赛区(跪烂心已死)
- hdu----(5050)Divided Land(二进制求最大公约数)
- HDU5024 2014 ACM-ICPC亚洲区域赛广州赛区网络赛C题 Wang Xifeng's Little Plot
- HDU 4277 USACO ORZ 第37届ACM/ICPC长春赛区网络赛1011题(搜索)
- hdu 5050 Divided Land
- hdu 2014西安赛区网络赛 5011Game
- HDU 5052 Yaoge’s maximum profit(树链剖分+线段树,2014上海网络赛1011)