BestCoder Round #64 (div.2) 1003 Array HDU 5587

最新推荐文章于 2015-12-18 22:07:51 发布

qq1319479809

最新推荐文章于 2015-12-18 22:07:51 发布

阅读量261

点赞数

本文链接：https://blog.csdn.net/qq1319479809/article/details/50088833

版权

ACM 同时被 3 个专栏收录

121 篇文章 0 订阅

订阅专栏

HDU

49 篇文章 0 订阅

订阅专栏

BestCoder

35 篇文章 0 订阅

订阅专栏

Array

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 119 Accepted Submission(s): 65

Problem Description

Vicky is a magician who loves math. She has great power in copying and creating.
One day she gets an array {1}。 After that, every day she copies all the numbers in the arrays she has, and puts them into the tail of the array, with a signle '0' to separat.
Vicky wants to make difference. So every number which is made today (include the 0) will be plused by one.
Vicky wonders after 100 days, what is the sum of the first M numbers.

Input

There are multiple test cases.
First line contains a single integer T, means the number of test cases.

(1≤T≤2∗103)
Next T line contains, each line contains one interger M.

(1≤M≤1016)

Output

For each test case,output the answer in a line.

Sample Input

Sample Output

Source

BestCoder Round #64 (div.2)

出题人：

其实 ${A}_{i}$ 为i二进制中1的个数。每次变化 ${A}_{k+{2}^{i}}={A}_{k}+1$ , $(k<{2}^{i})$ 不产生进位，

二进制1的个数加1。然后数位dp统计前m个数二进制1的个数，

计算每一位对答案的贡献。只需考虑该位填1，其高位与低位的种数即可。

我用搜索

先求出1,3,7,15。。。。。的前缀和( a[i] )及对应位置 (b[i] )

输入数n

再搜索3中情况

1 b[i]=n return a[i]

2 b[i]+1=n return a[i]+1

3 b[i]+1<n return a[i]+dfs(n-b[i]-1)+num-b[i];

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
        using namespace std; const int N=100005; long long a[N]= {0}; ///前缀和 long long b[N]; ///前缀和对应的位置 long long n,m,t; int kkk=0; int fun(long long num) ///num对应的位置 { for(; t>=1; t--) { if(b[t]<=num) return t; } } long long dfs(long long num) { kkk++; int temp=fun(num); if(b[temp]==num) return a[temp]; ///1 else if(b[temp]+1==num) return a[temp]+1; ///2 else return a[temp]+dfs(num-b[temp]-1)+num-b[temp]; ///3 } int main() { int T,i,kk; for(i=1; i<60; i++) { b[i]=b[i-1]*2+1; a[i]=b[i-1]+1+a[i-1]*2; if(b[i]>10000000000000000) break; } scanf("%d",&T); while(T--) { t=54; scanf("%lld",&n); printf("%lld\n",dfs(n)); } return 0; }

qq1319479809

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
BestCoder Round #64 (div.2) 1003 Array HDU 5587

Array Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
复制链接

扫一扫