zoukankan      html  css  js  c++  java
  • HDU 4588 Count The Carries 数学

    Count The Carries
    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87326#problem/C

    Description

    One day, Implus gets interested in binary addition and binary carry. He will transfer all decimal digits to binary digits to make the addition. Not as clever as Gauss, to make the addition from a to b, he will add them one by one from a to b in order. For example, from 1 to 3 (decimal digit), he will firstly calculate 01 (1)+10 (2), get 11,then calculate 11+11 (3),lastly 110 (binary digit), we can find that in the total process, only 2 binary carries happen. He wants to find out that quickly. Given a and b in decimal, we transfer into binary digits and use Implus's addition algorithm, how many carries are there?.

    Input

    Two integers a, b(0<=a<=b<1000000000), about 100000 cases, end with EOF.

    Output

    One answer per line.

    Sample Input

    1 2
    1 3
    1 4
    1 6

    Sample Output

    0
    2
    3
    6

    HINT

    题意

    二进制累加,从A累加到B,问你在二进制中,一共进位了多少次

    题解

    我并不知道怎么做的……

    队友啪啪啪就拍完了= =

    代码:

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <cstdlib>
    #include <algorithm>
    
    using namespace std;
    
    long long x[70],y[70];
    
    int main()
    {
        long long a,b;
        while(scanf("%lld%lld",&a,&b)!=EOF)
        {
            long long now=0;
            long long cnt=0;
            if(a>0) a--;
            for(long long i=1LL;i<=60*1LL;i++)
            {
    
                x[i]=(1LL<<(i-1LL))*(a>>i)+max(0LL,(a%(1LL<<i)-(1LL<<(i-1LL))+1LL));
                y[i]=(1LL<<(i-1LL))*(b>>i)+max(0LL,(b%(1LL<<i)-(1LL<<(i-1LL))+1LL));
                now+=y[i]-x[i];
                cnt+=1LL*(now>>1LL);
                now=now>>1LL;
            }
            while(now)
            {
                cnt+=1LL*now;
                now>>=1LL;
            }
            printf("%lld
    ",cnt);
        }
        return 0;
    }
  • 相关阅读:
    SQL Server存储过程(二)
    WPF 小知识 (设置背景图)
    关于SQL Server中索引使用及维护简介
    学习asp.net比较完整的流程(转)
    web开发常用默认端口
    接口和类的几大区别
    WEB建站规划之建站目的
    个人经验:页面无刷新传输数据的多种方法总结
    旅游电子商务探讨
    vs2008中文版提供下载(包含中文msdn)
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4722379.html
Copyright © 2011-2022 走看看