codeforces 535B 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.

Examples

input

Copy

4

output

Copy

1

input

Copy

7

output

Copy

2

input

Copy

77

output

Copy

6

题意，有一个从小到大的数列，每个数都是由4或者7构成，现在给出一个数，求这个数在这个数列的第几位

还是看了别人的想法，看了一会儿才理解。

我也发现了这个规律，只有一位数时，只有4 7

两位数，有 44 47 74 77

。

。

。

成2倍关系

预处理，然后再判断这个n，当这位是7时，要加上为4的个数

#include<bits/stdc++.h>  
using namespace std;  
typedef long long ll;  
const int inf = 0x3f3f3f3f;  
int main()   
{  
	// freopen("shuju.txt","r",stdin);
	int tmp=2;
	int b[15]={0};
	for(int i=1;i<=10;i++)
	{
		b[i]=b[i-1]+tmp;
		tmp*=2;
	}
    char a[15];
    cin>>a;
    int len=strlen(a);
    int ans=b[len-1];
    for(int i=1;i<=len;i++)
    {
    	if(a[i-1]=='7')
    	{
    		ans+=1<<(len-i);
    	}
    }
    cout<<ans+1<<endl;
    return 0;  
}