ZOJ3706 Break Standard Weight(set的使用)

题目：

Break Standard Weight

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

---

Author: YU, Zhi
Contest: The 10th Zhejiang Provincial Collegiate Programming Contest
Submit    Status思路：

这道题起始也就是枚举一下三个数中运算的所有情况，麻烦的是判断一个数字有没有出现过，因为set容器中有去重的效果，所以直接用set做，存一下代码

代码：

#include <cstdio>#include <cstring>#include <string>#include <iostream>#include <stack>#include <cmath>#include <set>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define inf 0x3f3f3f3f#define N 100000+20#define mod 10007#define M 1000000+10#define LL long longusing namespace std;set<int>s;int solve(int a,int b, int c){    s.insert(a);    s.insert(b);    s.insert(c);    if(b-a>=1)s.insert(b-a);    if(a-b>=1)s.insert(a-b);    if(c-a>=1)s.insert(c-a);    if(a-c>=1)s.insert(a-c);    if(b-c>=1)s.insert(b-c);    if(c-b>=1)s.insert(c-b);    s.insert(a+b);    s.insert(b+c);    s.insert(a+c);    s.insert(a+b+c);    if(c-a-b>=1)s.insert(c-a-b);    if(b-a-c>=1)s.insert(b-a-c);    if(a-b-c>=1)s.insert(a-b-c);    if(c-b+a>=1)s.insert(c-b+a);    if(c-a+b>=1)s.insert(c-a+b);    if(a+b-c>=1)s.insert(a+b-c);    if(a-b+c>=1)s.insert(a-b+c);    if(b+a-c>=1)s.insert(b+a-c);    if(b-a+c>=1)s.insert(b-a+c);}int main(){    int t,x,y;    scanf("%d",&t);    while(t--)    {        int sum=0;        scanf("%d%d",&x,&y);        for(int i=1; i<x; i++)        {            s.clear();            int num=x-i;            solve(i,num,y);            if(s.size()>sum)                sum=s.size();        }        for(int i=1; i<y; i++)        {            s.clear();            int num=y-i;            solve(i,num,x);            if(s.size()>sum)                sum=s.size();        }        printf("%d\n",sum);    }    return 0;}