cf - 01串的问题

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;
}

 

转载于:https://www.cnblogs.com/ccut-ry/p/8321306.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值