数位DP ACdream 1154 Lowbit Sum
2014-08-01 14:04
411 查看
Problem Description 先把题目附上,以后再学习学习
long long ans = 0;for(int i = 1; i <= n; i ++)
ans += lowbit(i)
lowbit(i)的意思是将i转化成二进制数之后,只保留最低位的1及其后面的0,截断前面的内容,然后再转成10进制数
比如lowbit(7),7的二进制位是111,lowbit(7) = 1
6 = 110(2),lowbit(6) = 2,同理lowbit(4) = 4,lowbit(12) = 4,lowbit(2) = 2,lowbit(8) = 8
每输入一个n,求ans
Input
多组数据,每组数据一个n(1 <= n <= 10^9)
Output
每组数据输出一行,对应的ans
Sample Input
1 2 3
Sample Output
1 3 4
相关文章推荐
- ACdreamOJ 1154 Lowbit Sum (数位dp)
- ACdream 1154 Lowbit Sum(数位DP)
- ACdream 1154 Lowbit Sum (数位DP)
- ACdream 1154 Lowbit Sum (数位DP)
- ACdream OJ 1154 Lowbit Sum
- ACdream 1154 Lowbit Sum (数位dp)
- ACdreamOJ 1154 Lowbit Sum (数字dp)
- acdream 1064 完美数 (数位dp)
- ACdream 完美数 数位DP
- ACdream 1064 完美数(数位dp)
- XMUT ACdream DP专场E题 - 喵哈哈的日常选数问题(数位DP)
- ACDream 1064——完美数(数位DP)
- ACdream 1154 Lowbit Sum
- ACdream 1154 Lowbit Sum(数学:推理)
- acdream 1154 Lowbit Sum
- 【HDU3530】 [Sdoi2014]数数 (AC自动机+数位DP)
- ZOJ 3494 (AC自动机+高精度数位DP)
- zoj 3494 BCD Code (ac自动机+数位dp)
- 【ASC 23】G. ACdream 1429 Rectangular Polygon --DP
- uva 11361 - Investigating Div-Sum Property(数位dp)