Break Standard Weight
来源:互联网 发布:软文写作 知乎 编辑:程序博客网 时间:2024/05/16 04:15
The balance was the first mass measuring instrument invented. In its traditional form, it consists of a pivoted horizontal lever of equal length arms, called the beam, with a weighing pan, also called scale, suspended from each arm (which is the origin of the originally plural term "scales" for a weighing instrument). The unknown mass is placed in one pan, and standard masses are added to this or the other pan until the beam is as close to equilibrium as possible. The standard weights used with balances are usually labeled in mass units, which are positive integers.
With some standard weights, we can measure several special masses object exactly, whose weight are also positive integers in mass units. For example, with two standard weights1 and 5, we can measure the object with mass 1, 4, 5 or 6 exactly.
In the beginning of this problem, there are 2 standard weights, which masses are x and y. You have to choose a standard weight to break it into 2 parts, whose weights are also positive integers in mass units. We assume that there is no mass lost. For example, the origin standard weights are 4 and 9, if you break the second one into 4 and 5, you could measure 7 special masses, which are 1, 3, 4, 5, 8, 9, 13. While if you break the first one into 1 and 3, you could measure 13 special masses, which are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13! Your task is to find out the maximum number of possible special masses.
Input
There are multiple test cases. The first line of input is an integer T < 500 indicating the number of test cases. Each test case contains 2 integers x and y. 2 ≤ x, y ≤ 100
Output
For each test case, output the maximum number of possible special masses.
Sample Input
24 910 10
Sample Output
139
暴力枚举,模拟所有情况出来。
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<cmath>#include<set>using namespace std;int N,n,m,i,k;set<int> str;int solve(int n,int m){for(i=1;i<=n/2;++i){str.insert(i);str.insert(n-i);str.insert(m);str.insert(n);if(n!=m)str.insert(abs(m-n));if(m-n+i)str.insert(abs(m-n+i));if(m-i)str.insert(abs(m-i));if(n-2*i)str.insert(abs(n-2*i));if(m+2*i-n)str.insert(abs(m+i-n+i));if(m+n-2*i)str.insert(abs(m+n-i-i));str.insert(m+n);str.insert(m+i);str.insert(m+n-i);if(k<str.size())k=str.size();str.clear();}return k;}int main(){scanf("%d",&N);while(N--){k=0;scanf("%d%d",&n,&m);solve(n,m);solve(m,n);printf("%d\n",k);}return 0;}
- B - Break Standard Weight
- B - Break Standard Weight
- Break Standard Weight
- Break Standard Weight
- Break Standard Weight
- Break Standard Weight
- ZOJ-BREAK STANDARD WEIGHT
- zoj3706 Break Standard Weight
- zoj 3706 Break Standard Weight
- zju 3706 Break Standard Weight
- zoj 3706 Break Standard Weight
- ZOJ3706:Break Standard Weight(DP)
- zoj 3706 Break Standard Weight
- Break Standard Weight zoj 3706
- ZOJ 3706 Break Standard Weight
- zoj 3706 Break Standard Weight
- ZOJ 3706 Break Standard Weight
- ZOJ 3706Break Standard Weight
- shell 脚本调试(使用shell的执行选项)
- Android面试
- 码农《二》
- SpringMVC+JQueryMobile开发 data-external-page与JQM机制
- DMA
- Break Standard Weight
- JS特性性能缺陷及JIT的解决方案
- 如何面试一个Android开发者
- Arcpy中用pathon写一个DEM生成等高线再用面裁剪的Toolbox工具
- 利用StickyListHeaders来实现ListView的分组实现
- Java数据结构-二叉树及其遍历
- kaldi主页搬家了……
- HDU 水题 杨辉三角行
- 两个大数相减