ZOJ 3706 Break Standard Weight
来源:互联网 发布:淘宝全民疯抢设置入口 编辑:程序博客网 时间:2024/05/17 04:19
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 <cstdio>#include <cstring>#include <string>#include <map>#include <algorithm>#include <cmath>#include <queue>#include <stack>#define mod 1000000007using namespace std;int bijiao(int a, int b, int c){int sum=0;int f[250];memset(f,0,sizeof(f));f[a+b]=1;f[a+c]=1;f[c+b]=1;f[a]=f[b]=f[c]=1;f[abs(a-b)]=f[abs(a-c)]=f[abs(c-b)]=1;f[abs(a+b+c)]=1;f[abs(a-(c+b))]=f[abs(b-(a+c))]=f[abs(c-(a+b))]=1;f[abs(a-(c-b))]=f[abs(b-(a-c))]=f[abs(c-(a-b))]=1;for (int i=1;i<=a+b+c;i++){ if (f[i]==1) sum++;}return sum;}int main(){int i,j,t,x,y;scanf("%d",&t);for (i=1;i<=t;i++){scanf("%d%d",&x,&y);int max=0;for (j=1;j<=x/2;j++){int tmp=bijiao(j,x-j,y);if (tmp>max)max=tmp;}for (j=1;j<=y/2;j++){int tmp=bijiao(j,y-j,x);if(tmp>max)max=tmp;}printf("%d\n",max); }return 0;}
- zoj 3706 Break Standard Weight
- zoj 3706 Break Standard Weight
- 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
- ZOJ-3706-Break Standard Weight
- ZOJ-BREAK STANDARD WEIGHT
- ZOJ 3706 Break Standard Weight 解题报告
- zoj 3706 Break Standard Weight(数学题)
- ZOJ 3706 Break Standard Weight(暴力)
- ZOJ 3706 Break Standard Weight (模拟题)
- ZOJ 3706 Break Standard Weight(深搜处理)
- ZOJ-3706-Break Standard Weight【10th浙江省赛】【暴力】
- ZOJ Problem Set - 3706 Break Standard Weight(暴力)
- ZOJ 3706 Break Standard Weight(暴力思维)
- MYSQL、SQLite字段自增长
- [BZOJ1593] [Usaco2008 Feb]Hotel 旅馆
- 多媒体封装格式学习:H264封装成FLV(一)
- Android Theme and Menu 主题菜单相关
- InnoDB深入理解
- ZOJ 3706 Break Standard Weight
- Nginx和Apache共用80端口的配置方案
- MAC下Basictex如何安装宏包
- 如何在多线程操作数据库--多线程串行
- [Android开发]SQLiteDatabase是否需要调用close()方法探究
- Android&java优化---(1)---jvm架构
- 用SQL将多行字符串数据转换成一行数据(实例)
- JavaScript闭包
- eclipse配置多个git账号