【冀宝er要逆袭】Faulty Odometer-码表跳跃问题

问题描述
　　You are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, however: it proceeds from the digit 2 to the digit 4 and from the digit 7 to the digit 9, always skipping over the digit 3 and 8. This defect shows up in all positions (the one’s, the ten’s, the hundred’s, etc.). For example, if the odometer displays 15229 and the car travels one mile, odometer reading changes to 15240 (instead of 15230).

输入
　　Each line of input contains a positive integer in the range 1..999999999 which represents an odometer reading. (Leading zeros will not appear in the input.) The end of input is indicated by a line containing a single 0. You may assume that no odometer reading will contain the digit 3 and 8.

输出
　　Each line of input will produce exactly one line of output, which will contain: the odometer reading from the input, a colon, one blank space, and the actual number of miles traveled by the car.

样例输入

15
2005
250
1500
999999
0

样例输出

15: 12
2005: 1028
250: 160
1500: 768
999999: 262143

题意：码表坏了时候 显示数字不会显示3和8，从2直接到4,7直接到9，输入码表显示的时间，问真正的时间是什么。

思路：
例如 2050 那么可以分成2000+50，对于50，也就是5个10，中间的3不算，也就是4个10，暴力出10,100,1000.。。。的数据就可以知道10对应8,1000，对应512，那么就是4个8加上2个512
如果是5050，就是4个512加上4个8.

#include <iostream>
using namespace std;
int a[20]={1,8,64,512,4096,32768,262144,2097152,16777216,134217728};
int main(int argc, char *argv[])
{
    int n,k,pos;
    while(cin>>n)
    {
        if(!n)break;
        k=n;
        int cnt=0,ans=0;
        while(k!=0)
        {
            pos=k%10;
            if(pos>7)
                pos-=2;
            else if(pos>2)
                pos-=1;
            ans+=pos*a[cnt];
            cnt++;
            k=k/10;
        }
        cout<<n<<": "<<ans<<endl;
    }
    return 0;
}