B - Break Standard Weight
来源:互联网 发布:开淘宝怎么上传照片 编辑:程序博客网 时间:2024/05/01 19:52
Description
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 weights 1 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
#include <iostream>#include <cstring>#include <iomanip>#include <algorithm>#include <cstdio>#include <cmath>using namespace std;int ans[100000];int xt;int fun(int a,int b,int c){ int flag[10000]={0}; memset(flag,0,sizeof(flag)); flag[a]=1; flag[b]=1; flag[c]=1; flag[abs(a-b)]=1; flag[abs(a-c)]=1; flag[abs(b-c)]=1; flag[abs(a-b-c)]=1; flag[abs(b-a-c)]=1; flag[abs(c-a-b)]=1; flag[a+c]=1; flag[a+b]=1; flag[b+c]=1; flag[a+b+c]=1; int sum=0; for(int i=1; i<10000; i++) if(flag[i]) sum++; ans[xt++]=sum; return 0;}int main(){ int t; scanf("%d",&t); while(t--) { int n,m,i; scanf("%d%d",&n,&m); xt=0; memset(ans,0,sizeof(ans)); for(i=1; i<=n/2; i++) fun(i,n-i,m); for(i=1; i<=m/2; i++) fun(i,m-i,n); int Max=ans[0]; for(i=1;i<xt;i++) if(ans[i]>Max) Max=ans[i]; printf("%d\n",Max); } 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
- ARM汇编程序中学ARM程序的结构和混合编程
- Jquery使用小技巧(1)
- [C++]inline函数
- 数组、List以及Map的遍历
- JDK概述
- B - Break Standard Weight
- 阶乘小结
- shell script 统计文本中字符串的出现的频率及按频率的多少从高到低输出_面试算法题之一
- Node学习笔记——模块和包
- Java设计模式透析之 —— 模板方法(Template Method)
- Openstack 宿主机电源管理
- 软件版本的GA 代表什么意思?
- 链表程序改良
- iPhoneSDK开发136技系列:第22技 使用粘贴板