2014ACM集训13级PK赛3-Break Standard Weight
来源:互联网 发布:淘宝上的win10激活码 编辑:程序博客网 时间:2024/05/16 07:51
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 <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>int ans[100100];int xb;int qiu (int a,int b,int c){ int n[10000] = {0}; memset(n,0,sizeof (n)); n[a] = 1; n[b] = 1; n[c] = 1; n[(int)fabs(a-b)] = 1; n[(int)fabs(a-c)] = 1; n[(int)fabs(b-c)] = 1; n[(int)fabs(a-b-c)] = 1; n[(int)fabs(b-a-c)] = 1; n[(int)fabs(c-a-b)] = 1; n[a+b] = 1; n[a+c] = 1; n[b+c] = 1; n[a+b+c] = 1; int sum = 0; for (int i = 1;i < 10000;i++) if (n[i]) sum++; ans[xb++] = sum; return 0;}int main(){ int N; scanf ("%d",&N); while (N--) { int a,b,i; scanf ("%d%d",&a,&b); memset(ans,0,sizeof (ans)); xb = 0; for (i = 1;i <= a / 2;i++) qiu(i,a - i,b); for (i = 1;i <= b / 2;i++) qiu(i,b - i,a); int imax = ans[0]; for (i = 1;i < xb;i++) if (imax < ans[i]) imax = ans[i]; printf ("%d\n",imax); } return 0;}
- 2014ACM集训13级PK赛3-Break Standard Weight
- 2014ACM集训13级PK赛3-Taxi Fare
- 2014ACM集训13级PK赛3-Modular Inverse
- 2014ACM集训13级PK赛3-Friends
- 2014ACM集训13级PK赛3-Java Beans
- 2014寒假ACM集训13级PK赛-翻转排序
- 2014寒假ACM集训13级PK赛-购买矿石
- 2014ACM集训13级PK赛2-Somali Pirates
- 2014ACM集训13级PK赛2-Wu Xing
- 2014ACM集训13级PK赛2-Ordinal Numbers
- 2014ACM集训13级PK赛2-Conic Section
- 2014ACM集训13级PK赛2-Kagome Kagome
- 2014ACM集训13级PK赛2-Javabeans
- 2014ACM集训13级PK赛2-Median
- 2014ACM集训13级PK赛4-K-Nice
- 2014ACM集训13级PK赛4-Light Bulb
- 2014ACM集训13级PK赛5-Easy Task
- 2014ACM集训13级PK赛3-Draw Something Cheat
- WinCE 项目记录
- 蛇形填数
- android Animations 动画效果(二)
- POJ 2479 Maximum sum[DP]
- Android 环境的搭建
- 2014ACM集训13级PK赛3-Break Standard Weight
- Node.js
- HTTP协议状态码
- [Liferay]Portlet 规范中ResourceURL 介绍以及使用
- 蛙步学排序算法之一 - 冒泡排序
- c++ 64位二进制 移位运算并输出结果
- VPS还是虚拟主机,究竟应该如何选择
- 数据库工具类:DatabaseHelper
- 关于漏洞