首页 > 其他 > 详细

cf - 01串的问题

时间:2018-01-20 18:13:26      阅读:206      评论:0      收藏:0      [点我收藏+]

One beautiful July morning a terrible thing happened in Mainframe: a mean virus Megabyte somehow got access to the memory of his not less mean sister Hexadecimal. He loaded there a huge amount of n different natural numbers from 1 to n to obtain total control over her energy.

But his plan failed. The reason for this was very simple: Hexadecimal didn‘t perceive any information, apart from numbers written in binary format. This means that if a number in a decimal representation contained characters apart from 0 and 1, it was not stored in the memory. Now Megabyte wants to know, how many numbers were loaded successfully.

Input

Input data contains the only number n (1?≤?n?≤?109).

Output

Output the only number — answer to the problem.

Example
Input
10
Output
2
Note

For n = 10 the answer includes numbers 1 and 10.

 

题目分析 : 给你一个 n ,表示 1 - n 共 n 个数字,问有多少个数字中只含有 0 和 1

思路分析 : 对于一个只含有 01 数字的十进制数字,他一定可以通过这样的变换得来, a*10 和 a*10+1 , 既然有这样的规律,那么写一个深搜就可以直接过了。

代码示例 :

  

int ans = 0;
ll n;

void dfs(ll x){
    if (x > n) return;
    ans++;
    dfs(x*10);
    dfs(x*10+1);
}

int main() {   
    cin >> n;
    dfs(1);
    printf("%d\n", ans);
    
    return 0;
}

 

cf - 01串的问题

原文:https://www.cnblogs.com/ccut-ry/p/8321306.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!