hdu 2116 Has the sum exceeded

來源:互聯網
上載者:User

判斷兩個數的和是否溢出

k=64時單獨考慮

 

[cpp]
# include <stdio.h>  
# include <math.h>  
int main() 

    int k; 
    __int64 a,b,c,d; 
    while(scanf("%d",&k)!=EOF) 
    { 
        scanf("%I64d%I64d",&a,&b); 
        c=(__int64)(pow(2,k-1)+0.001)-1; 
        d=(-1)*(__int64)(pow(2,k)+0.001); 
        if((a<0&&b>0)||(a>0&&b<0)) 
        { 
            puts("WaHaHa"); 
            continue; 
        } 
        if(k==64)   
        {   
            if(a>0&&b>0&&c-a<b)   
                printf("Yes\n");   
            else if(a<0&&b<0&&d-a>b)   
                printf("Yes\n");   
            else printf("WaHaHa\n");  
            continue; 
        }   
        if(a>0&&c-a<b) 
            printf("Yes\n"); 
        else if (a<0&&d-a>=b) 
            printf("Yes\n"); 
        else 
            printf("WaHaHa\n"); 
    } 
    return 0; 

# include <stdio.h>
# include <math.h>
int main()
{
    int k;
    __int64 a,b,c,d;
    while(scanf("%d",&k)!=EOF)
    {
        scanf("%I64d%I64d",&a,&b);
  c=(__int64)(pow(2,k-1)+0.001)-1;
  d=(-1)*(__int64)(pow(2,k)+0.001);
        if((a<0&&b>0)||(a>0&&b<0))
        {
            puts("WaHaHa");
            continue;
        }
  if(k==64) 
        { 
            if(a>0&&b>0&&c-a<b) 
                printf("Yes\n"); 
            else if(a<0&&b<0&&d-a>b) 
                printf("Yes\n"); 
            else printf("WaHaHa\n");
   continue;
        } 
        if(a>0&&c-a<b)
   printf("Yes\n");
  else if (a<0&&d-a>=b)
            printf("Yes\n");
        else
            printf("WaHaHa\n");
    }
    return 0;
}
 

 

判斷兩個數和的位元

 

 

 

 

[cpp]
#include<stdio.h>  
#include<string.h>  
__int64 a[70],b[70];  
int main() 

    __int64 d,c; 
    int num,k,i,flag,j; 
    while(scanf("%d",&k)!=-1) 
    { 
        flag=0; 
        scanf("%I64d%I64d",&c,&d); 
        num=0; 
        memset(a,0,sizeof(a)); 
        memset(b,0,sizeof(b)); 
        if((c<0&&d>0)||(c>0&&d<0)) 
        { 
            puts("WaHaHa"); 
            continue; 
        } 
        if(c<0&&d<0) 
        {c=-c;d=-d;flag=1;} 
        while(c) 
        { 
            a[num++]=c%2; 
            c=c/2; 
        } 
        num=0; 
        while(d) 
        { 
            a[num]+=d%2; 
            num++; 
            d/=2; 
        } 
        for(i=0;i<68;i++) 
        { 
            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==1) 
            { 
                for(j=i-1;j>=0;j--) 
                    if(a[j]!=0)break; 
            } 
               if(i<k-1)puts("WaHaHa"); 
               else if(i==k-1&&flag==1&&j<0) 
                   puts("WaHaHa"); 
            else puts("Yes"); 
    } 
    return 0; 

#include<stdio.h>
#include<string.h>
__int64 a[70],b[70];
int main()
{
    __int64 d,c;
    int num,k,i,flag,j;
    while(scanf("%d",&k)!=-1)
    {
  flag=0;
        scanf("%I64d%I64d",&c,&d);
        num=0;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        if((c<0&&d>0)||(c>0&&d<0))
        {
            puts("WaHaHa");
            continue;
        }
        if(c<0&&d<0)
        {c=-c;d=-d;flag=1;}
        while(c)
        {
            a[num++]=c%2;
            c=c/2;
        }
        num=0;
        while(d)
        {
            a[num]+=d%2;
            num++;
            d/=2;
        }
        for(i=0;i<68;i++)
        {
            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==1)
   {
    for(j=i-1;j>=0;j--)
     if(a[j]!=0)break;
   }
               if(i<k-1)puts("WaHaHa");
      else if(i==k-1&&flag==1&&j<0)
       puts("WaHaHa");
            else puts("Yes");
    }
    return 0;
}

 

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.