Hexadecimal's Numbers 题解

点此打开原题链接：传送门 ！！！！！；

C. Hexadecimal's Numbers

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

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 ≤ 10⁹).

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的范围内，有多少个数只有1，0构成。

解法：暴力是肯定不行的，因为从n的范围可以看出来。所以考虑其他方法。方法有两种第一种是博主的所写的构造法，思路是，构造一个数，只有0或1构成，然后判断是否在n的范围内。具体是使用数组，然后逐个往数组里面填数。另一种是二进制的方法。有兴趣的可以尝试一下。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
int ans = 0,n,len;
int num[15];
//°ÑÊý×énumת»¯³ÉÊý×Ö¡£ 
int shuzi(int a[],int ll){
	int res = a[1];
	for(int i = 2 ; i <= ll ; i++){
		res *=10 ;
		res += a[i];
	}
	return res;
}
//¹¹ÔìÊý×Ö 
void dfs(int step,int ll){
	int res = shuzi(num,step);	
	//ÅжÏÊÇ·ñ·ûÌõ¼þ 
	if(step <= ll &&res <= n){
			ans++;
	}
	else return ;
	//¹¹ÔìÊý×Ö 
	for(int i = 0 ; i < 2 ;i ++){
		if(i == 0){
			step++;
			num[step] = 0;
			dfs(step,ll);
			step--;
		}
		else {
			step++;
			num[step] = 1;
			dfs(step,ll);
			step--;
		}
	}
	return;
}
int main(){
	while(~scanf("%d",&n)){
		len = log10(n) + 1; //¼Ó1µÄÔ­ÒòÊÇlog10£¨1£© = 0£» 
		memset(num,0,sizeof(num));
		num[1] = 1; // °Ñ0µÄÕâÖÖÇé¿öÅųýµô¡£ 
		ans = 0;
		dfs(1,len);
		printf("%d\n",ans);
	}
	return 0;
}