从y总那里学到的“暴搜”,确实挺不错!!!
ACcode:
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,ans;
void dfs(int x){
if(x>n)return;
if(x!=0) ans++;
dfs(x*10+4);
dfs(x*10+7);
}
void solve() {
cin>>n;
dfs(0);
cout<<ans<<"\n";
}
signed main() {
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int tt=1;
// cin>>tt;
while(tt--) solve();
return 0;
}
//3
over~