Codeforces Round #299 (Div. 2)B. Tavas and SaDDas

B. Tavas and SaDDas

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Once 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有多少个只有4和7组成的数

就是用队列做一下就ok了

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
using namespace std;
#define ll long long
int main()
{
    ll i,j;
    ll  n;
    ll  cnt;
     cin>>n;
        cnt=0;
        ll  x,y;
        ll  a;
        queue<ll> que;
        que.push(4);
        que.push(7);
        while(1)
        {
            x=que.front();
            que.pop();
            if(x<=n)
            {
                cnt++;
            }
            else break;
            a=x*10+4;
            que.push(a);
            a=x*10+7;
            que.push(a);
            y=que.front();
            que.pop();
            if(y<=n)
                cnt++;
            else break;
            a=y*10+4;
              que.push(a);
            a=y*10+7;
              que.push(a);
        }
  cout<<cnt<<endl;


}