Hdu 2116

最新推荐文章于 2020-02-07 11:05:28 发布

脑阔大大

最新推荐文章于 2020-02-07 11:05:28 发布

阅读量388

点赞数

分类专栏：杭电 oj

本文链接：https://blog.youkuaiyun.com/The_Dream_of_Rookie/article/details/50449767

版权

杭电 oj 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了如何判断两个32位或64位整数相加是否超出整数范围，提供了算法实现和样例输入输出。

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

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

Sample Output

  
  
   
   WaHaHa

对于这题来说的话就是一道简单的数学题；

代码：

#include<stdio.h>
__int64  Pow(int n)
{
 __int64  s=1;
 int i;
 for(i=1;i<=n;i++)
    s*=2;
 return s;
}
int main()
{
 int n,f;
 __int64  t,a,b,min,max;
 while(scanf("%d",&n)!=EOF)
 {
  scanf("%I64d %I64d",&a,&b);
  max=Pow(n-1);
  min=-max;
  max--;
  if(n==64){
   f=0;
   if(a<0 && b<0){
    t=min-a;
    if(t>b)  f=1;
   }
   else if(a>0 && b>0){
    t=max-a;
    if(b>t)  f=1;
   }
   if(f) printf("Yes\n");
   else  printf("WaHaHa\n");
   continue;
  }
  if((a+b)>max || (a+b)<min)  printf("Yes\n");
  else printf("WaHaHa\n");
 }
 return 0;
}