Has the sum exceeded hdu 2116 很不错的数学题目

最新推荐文章于 2015-09-11 21:53:59 发布

青苹之末

最新推荐文章于 2015-09-11 21:53:59 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏：数学问题文章标签：数学二进制存储 sizeof

本文链接：https://blog.csdn.net/were__wolf/article/details/20643941

数学问题专栏收录该内容

39 篇文章

订阅专栏

本文深入探讨了在特定技术领域中遇到的编程难题，包括但不限于算法优化、数据结构应用、复杂系统集成等关键问题。通过实例分析，提供了解决方案和优化策略，旨在帮助开发者提升解决实际问题的能力。

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

Has the sum exceeded

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

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

Recommend

威士忌

这个题目应该讲是很不好过的哎，我想了很久的啊，这个题目是问c+d的和能否在-2^k-1and (2^k-1)-1之间，能的话就是证明就是 YES，否则哇哈哈了，对于

c和d进行二进制化分，求出位数来，想一下，反正是2的几次方，换成是2进制

来进行判断是很不错的。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
__int64 a[70];
int main()
{

    __int64 c,d;
    int num,k,i,j,flag;
    while(scanf("%d",&k)!=EOF)
    {
        flag=0;
        scanf("%I64d%I64d",&c,&d);
        num=0;
        memset(a,0,sizeof(a));
        if((c<0&&d>0)||(c>0&&d<0))
        {
            printf("WaHaHa\n");
            continue;
        }
        //符号不一样一定是不行的
         if(c<0&&d<0)
        {
            c=-c;
            d=-d;
            flag=1;
        }
        
        while(c)
        {
           a[num++]=c%2;
           c=c/2;
        }
        //把c换成是二进制形式
        num=0;
        while(d)
        {
            a[num]=a[num]+d%2;//不明白为什么改成了a[num++]=a[num++]+d%2;就错了
            num++;
            d=d/2;
        }
        /*在数组里逆序存储二进制,
        列如当c=7,d=5.那么相加得
        出12,也就是1100,存到数组
        里的形式也就是0011000**了        
        然后对其进行判断就可以了
        
        
        */
        for(i=0;i<68;i++)
        {
            a[i+1]=a[i+1]+a[i]/2;
            a[i]=a[i]%2;
        }
        for(i=68; i>=0; i--)
        if(a[i]!=0)
        break;
        if(i==k-1&&flag)
        {
            for(j=i-1;j>=0;j--)
            {
                if(a[j])
                break;
            }
        }
        if(i<k-1)
        printf("WaHaHa\n");
        else
        /*
        这个地方是求出如果我们求
        的是负数，列如c=-4,d=-4，
        相加得出-8，为2的三次方，
        k=4,则特别拿出来进行判断
        就可以了
        */
        if(i==k-1&&flag&&j<0)
        {
             printf("WaHaHa\n");
        }
        else
        printf("Yes\n");





    }
    return 0;
}