【题目】:
nce again Tavas started eating coffee mix without water! Keione told him that it smells awful, but he didn’t stop doing that. That’s why Keione told his smart friend, SaDDas to punish him! SaDDas took Tavas’ headphones and told him: “If you solve the following problem, I’ll return it to you.”
The problem is:
You are given a lucky number n. Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
If we sort all lucky numbers in increasing order, what’s the 1-based index of n?
Tavas is not as smart as SaDDas, so he asked you to do him a favor and solve this problem so he can have his headphones back.
Input
The first and only line of input contains a lucky number n (1 ≤ n ≤ 109).
Output
Print the index of n among all lucky numbers.
Sample test(s)
input
4
output
1
input
7
output
2
input
77
output
6
【思路】:此题暴力超时,可递归把幸运数字先算出来,若是小于等于n就加1.因为当它等于n时,会进入下一次运算,数据太大的话会超出int,所以数据类型用long long。
【代码】:
#include <iostream>
using namespace std;
long long n;
int cnt;
void solve(long long a,int &cnt){
long long c1 = a * 10 + 4;
long long c2 = a * 10 + 7;
if(c1 <= n)
cnt++;
else
return;
if(c2 <= n)
cnt++;
else
return ;
solve(c1,cnt);
solve(c2,cnt);
}
int main(){
cin>>n;
cnt = 0;
if(n < 4)
cnt = 0;
else if(n < 7)
cnt = 1;
else
cnt = 2;
solve(4,cnt);
solve(7,cnt);
cout<<cnt<<endl;
return 0;
}