zoukankan      html  css  js  c++  java
  • POJ 3252, Round Numbers

    Time Limit: 2000MS  Memory Limit: 65536K
    Total Submissions: 2812  Accepted: 877


    Description

    The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other names) in order to make arbitrary decisions such as who gets to be milked first. They can't even flip a coin because it's so hard to toss using hooves.

    They have thus resorted to "round number" matching. The first cow picks an integer less than two billion. The second cow does the same. If the numbers are both "round numbers", the first cow wins,
    otherwise the second cow wins.

    A positive integer N is said to be a "round number" if the binary representation of N has as many or more zeroes than it has ones. For example, the integer 9, when written in binary form, is 1001. 1001 has two zeroes and two ones; thus, 9 is a round number. The integer 26 is 11010 in binary; since it has two zeroes and three ones, it is not a round number.

    Obviously, it takes cows a while to convert numbers to binary, so the winner takes a while to determine. Bessie wants to cheat and thinks she can do that if she knows how many "round numbers" are in a given range.

    Help her by writing a program that tells how many round numbers appear in the inclusive range given by the input (1 ≤ Start < Finish ≤ 2,000,000,000).

     

    Input
    Line 1: Two space-separated integers, respectively Start and Finish.

     

    Output
    Line 1: A single integer that is the count of round numbers in the inclusive range Start..Finish

     

    Sample Input
    2 12

     

    Sample Output
    6

     

    Source
    USACO 2006 November Silver


    // POJ3252.cpp : Defines the entry point for the console application.
    //

    #include 
    <iostream>
    using namespace std;

    static int  C[40][40];
    unsigned 
    long long roundNum(int N)
    {
        
    int n = N;
        
    int len = 0;
        
    while (n > 0)n >>= 1++len;

        unsigned 
    long long cnt = 0;
        
    for (int i = 1; i < len - 1++i)
            
    for (int j = (i>>1+ 1; j <= i; ++j) cnt +=C[i][j]; 

        
    int zeros = 0;
        
    for (int i = len - 2; i >= 0--i)
        {
            
    if ((N >> i) & 1 == 1)
                
    for (int j = ((len + 1>> 1- zeros - 1; j <= i; ++j) 
                    cnt 
    += C[i][j];
            
    else ++zeros;
        }
        
    return cnt;
    }

    int main(int argc, char* argv[])
    {
        C[
    0][0= 1;
        
    for (int i = 1; i < 40++i)
            
    for (int j = 0; j <=i; ++j)
                C[i][j] 
    = (j == 0? C[i - 1][j] : C[i-1][j-1+ C[i - 1][j];

        
    int A, B;
        scanf (
    "%d%d"&A, &B);
        cout 
    << roundNum (B + 1- roundNum (A) << endl;

        
    return 0;
    }

  • 相关阅读:
    通过Ajax的方式执行GP服务
    Arcgis for js之GP实现缓冲区计算
    sde用sql实现erase
    OL2中设置鼠标的样式
    OL2中重置地图DIV大小后地图的联动
    OL2中的多地图联动展示
    Codeforces Round #357 (Div. 2) Heap Operations
    POJ-1847 Tram
    【转】一些图论、网络流入门题总结、汇总
    POJ-2398 Toy Storage
  • 原文地址:https://www.cnblogs.com/asuran/p/1584246.html
Copyright © 2011-2022 走看看