hdu 4278 2012天津赛区网络赛 数学 *

8进制转为10进制

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-5;
typedef long long ll;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int N=1005;
int n,m,tt;
int digit[99];
int main()
{
    int i,j,k,ca=1;
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    while(scanf("%d",&n)!=EOF&&n)
    {
        int temp=n;
        int len=0;
        int sum=0;
        while(n)
        {
            digit[len++]=n%10;
            if(digit[len-1]>3&&digit[len-1]<9)  digit[len-1]-=1;
            if(digit[len-1]==9)digit[len-1]-=2;
            n/=10;
        }
        for(i=len-1;i>=0;i--)
        {
            sum+=pow(8,i)*digit[i];
        }
        printf("%d: %d\n",temp,sum);
    }
}