变量重复定义

最新推荐文章于 2022-11-15 14:33:33 发布

原创最新推荐文章于 2022-11-15 14:33:33 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#zoj

错题集（每次赛前看一遍）专栏收录该内容

5 篇文章

订阅专栏

本文深入探讨了智能算法在不同技术领域的应用，包括但不限于大数据、机器学习、人工智能、云计算等，详细介绍了各种算法的核心概念、原理及实际应用场景，旨在帮助读者理解如何利用智能算法解决复杂问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

地址：http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=4998

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 and5, 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 7special 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

2
4 9
10 10

Sample Output

13
9

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int ads(int i)
{
	if(i<0) i*=-1;
	return i;
}
int main()
{
	int t,m,n,i,j,a[205],max,sum;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&m,&n);max=0;
		for(i=1;i<=m/2;i++)
		{
			memset(a,0,sizeof(a));sum=0;j=m-i;
			a[i]=1;
			a[j]=1;
			a[n]=1;
			a[i+j]=1;
			a[i+n]=1;
			a[j+n]=1;
			a[i+j+n]=1;
			a[ads(i-j)]=1;
			a[ads(n-j)]=1;
			a[ads(i-n)]=1;
			a[ads(i+n-j)]=1;
			a[ads(i+j-n)]=1;
			a[ads(j+n-i)]=1;
			for(j=1;j<=m+n;j++)
				if(a[j]==1) sum++;
			if(sum>max) max=sum;
		}
		if(m!=n)
		{
			for(i=1;i<=n/2;i++)
			{
				memset(a,0,sizeof(a));sum=0;j=n-i;
				a[i]=1;
				a[j]=1;
				a[m]=1;
				a[i+j]=1;
				a[i+m]=1;
				a[j+m]=1;
				a[i+j+m]=1;
				a[ads(i-j)]=1;
				a[ads(m-j)]=1;
				a[ads(i-m)]=1;
				a[ads(i+m-j)]=1;
				a[ads(i+j-m)]=1;
				a[ads(j+m-i)]=1;
				for(j=1;j<=m+n;j++)
					if(a[j]==1) sum++;
				if(sum>max) max=sum;
			}
		}
		printf("%d\n",max);
	}
	return 0;
}