杭电2116Has the sum exceeded

最新推荐文章于 2023-12-26 07:30:00 发布

hpuzsk

最新推荐文章于 2023-12-26 07:30:00 发布

阅读量355

点赞数

分类专栏：数学文章标签：杭电

本文链接：https://blog.csdn.net/z8110/article/details/48379991

版权

数学专栏收录该内容

92 篇文章 0 订阅

订阅专栏

Has the sum exceeded

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4030 Accepted Submission(s): 849

Problem Description
As we all know, in the computer science, an integer A is in the range of 32-signed integer, which means the integer A is between -2^31 and (2^31)-1 (inclusive), and A is a 64-signed integer, which means A is between -2^63 and (2^63)-1(inclusive). Now we give the K-signed range, and two K-signed integers A and B, you should check whether the sum of A and B is beyond the range of K-signed integer or not.

Input
There will be many cases to calculate. In each case, there comes the integer K (2<=K<=64) first in a single line. Then following the line, there is another single line which has two K-signed integers A and B.

Output
For each case, you should estimate whether the sum is beyond the range. If exceeded, print “Yes”, otherwise “WaHaHa”.

Sample Input
32
100 100

Sample Output
WaHaHa

Author
Wangye

Source
HDU 2007-10 Programming Contest_WarmUp

不算难题，考虑一下溢出的情况，加法溢出就减法，减法溢出

附代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
__int64 a,b,m,n,Max,Min;
void ac(int n)
{
	__int64 ans=1;
	for(int i=1;i<n;i++)
	ans*=2;
	Min=-ans;
	Max=ans-1;
}
int main()
{
	while(scanf("%I64d%I64d%I64d",&n,&a,&b)!=EOF)
	{
		ac(n);
		//printf("%I64d %I64d\n",Max,Min);
			if((a>=0&&b<=0)||(a<=0&&b>=0))
			printf("WaHaHa\n");
			if(a>0&&b>0)
			{
			if(a>Max-b)
			printf("Yes\n");
			else
			printf("WaHaHa\n");
			}
			if(a<0&&b<0)
			{
			if(a<Min-b)
			printf("Yes\n");
			else
			printf("WaHaHa\n");	
			}
	}
	return 0;
}