C - Hexadecimal‘s Numbers（递归）

C - Hexadecimal’s Numbers（递归）

题干

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.

Examples
Input
10
Output
2
Note
For n = 10 the answer includes numbers 1 and 10.

题解

简单翻一下题干：
给定上限n，求1- n范围内有多少个数字仅由01组成
意识到从1开始，每一个01组成的数都有1进行若干次* 10 和 * 10 + 1得到，那么按照这个思路递归即可

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mod =1e9+7;
int upperBound;
int ans = 0;

void recur(int n){
    if(n > upperBound) return;
    ans++;
    recur(n * 10);
    recur(n * 10 + 1);
}

int main()
{
    cin>>upperBound;
    recur(1);
    cout<<ans<<endl;
    return 0;
}