zoukankan      html  css  js  c++  java
  • HDU 3215 The first place of 2^n (数论-水题)

    The first place of 2^n


    Problem Description
    LMY and YY are mathematics and number theory lovers. They like to find and solve interesting mathematic problems together. One day LMY calculates 2n one by one, n=0, 1, 2,… and writes the results on a sheet of paper: 1,2,4,8,16,32,64,128,256,512,1024,……

    LMY discovers that for every consecutive 3 or 4 results, there must be one among them whose first digit is 1, and comes to the conclusion that the first digit of 2n isn’t evenly distributed between 1 and 9, and the number of 1s exceeds those of others. YY now intends to use statistics to prove LMY’s discovery.
     

    Input
    Input consists of one or more lines, each line describing one test case: an integer N, where 0≤N≤10000.

    End of input is indicated by a line consisting of -1.
     

    Output
    For each test case, output a single line. Each line contains nine integers. The ith integer represents the number of js satisfying the condition that 2j begins with i (0≤j≤N).
     

    Sample Input
    0 1 3 10 -1
     

    Sample Output
    1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 0 4 2 1 1 1 1 0 1 0
     

    Source
     

    Recommend
    zhuweicong   |   We have carefully selected several similar problems for you:  3219 3217 3212 3218 3216 
     

    题目大意“:

    妈呀,这是我们大东华09年出的题啊,好厉害,事实上是好水啊。

    题目大意就是计算2^0到2^n这n个数首位为1的次数,2的次数,...9的次数。


    解题思路:

    我是不会告诉你log10一下就会找到你想要的东西的。


    解题代码:

    #include <iostream>
    #include <cstdio>
    #include <cmath>
    using namespace std;
    
    const int maxn=10010;
    const double lg2=log10(2.0);
    int a[maxn];
    
    void ini(){
        a[0]=1,a[1]=2,a[2]=4,a[3]=8;
        for(int i=4;i<maxn;i++){
            double x=i*lg2-int(i*lg2+1e-7);
            a[i]=pow(10.0,x);
        }
        //for(int i=0;i<20;i++) cout<<"2^"<<i<<" :"<<a[i]<<endl;
    }
    
    
    int main(){
        ini();
        int n;
        while(scanf("%d",&n)!=EOF && n!=-1){
            int cnt[10]={0};
            for(int i=0;i<=n;i++){
                cnt[a[i]]++;
            }
            printf("%d",cnt[1]);
            for(int i=2;i<=9;i++){
                printf(" %d",cnt[i]);
            }
            printf("
    ");
        }
        return 0;
    }
    






  • 相关阅读:
    CListCtrl 显示图片及大批量数据的加载速度与闪烁问题
    iPhone开发数组基本用法NSArray与NSMutableArray
    iPhone开发 让viewDidAppear/viewWillAppear 在页面加载前始终调用
    iPhone开发 SDK新手必读
    iPhone开发内存管理
    AfxEnableControlContainer has not been called yet
    ftp上传文件bat脚本
    struts2学习基础配制
    windows server 2008 R2忘记administrator密码
    linux cifs自动挂载远程windows硬盘或文件夹
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/4276854.html
Copyright © 2011-2022 走看看