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-;
 typedef long long ll;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int N=;
 int n,m,tt;
 int digit[];
 int main()
 {
     int i,j,k,ca=;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     while(scanf("%d",&n)!=EOF&&n)
     {
         int temp=n;
         int len=;
         int sum=;
         while(n)
         {
             digit[len++]=n%;
             if(digit[len-]>&&digit[len-]<)  digit[len-]-=;
             if(digit[len-]==)digit[len-]-=;
             n/=;
         }
         for(i=len-;i>=;i--)
         {
             sum+=pow(,i)*digit[i];
         }
         printf("%d: %d\n",temp,sum);
     }
 }