Hexadecimal‘s Numbers

 

 题意：给一个十进制的数字n，问1~n有多少个数字是二进制能表示出来的

题解：多种解法，我写了个枚举长度二进制的和dfs的

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
ll ans;
ll f;
void solve()
{
    string s;
    cin>>s;
    int len=s.length();              
    ll maxx=(1<<len)-1;           //最大的二进制
    for(int i=0;i<len;i++)
    {
        f=f*10+(s[i]-'0');
    }
    for(int i=1;i<=maxx;i++)
    {
        ll t=0;
        ll l=1;
        int j=i;
        while(j)
        {
            t+=l*(j%2);
            j/=2;
            l*=10;
        }
        if(t<=f) ans++;    //这个二进制转化为十进制比f小就可以
    }
    ac;
}
int main()
{
    //init();
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
ll m,len,ans;
void dfs(int deep,ll sum)
{
    if(deep==len) {
        if(sum<=m) ans++;
        return;
    }
    dfs(deep+1,sum*10+1);
    dfs(deep+1,sum*10+0);
}
void solve()
{
   ll n;
   cin>>n;
   m=n;
   while(n)
   {
       len++;
       n/=10;
   }
   if(!len){cout<<0;return;}
   dfs(1,0);dfs(1,1);
   cout<<ans-1<<endl;
}
int main()
{
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}