大数的减法------神秘数

Description

倘若一个数它的立方的后三位全是1，我们称此类数为神秘数。现在我们想知道第K个这样的数是多少，相信你能解决。

Input

输入一个正整数K，直到文件结束,K的位数最多100位。

Output

输出第K个数，占一行

Sample Input

1

Sample Output

471

 

 

 

 

#include<stdio.h>
#include<string.h>
int main()
{
    char str[120];
    int i, j, t, k;
    while( gets( str ) )
    {
         int len;
         len = strlen( str );
         t = 0;
         str[len-1] = str[len-1] - '0' - 1;
         if( str[len-1] < 0 )
                  {
                      str[len-1] += 10;
                      t = -1;
                  }
                 
                 
         for( i = len-2; i >= 0; i-- )
             {
                  str[i] = str[i]-'0' + t;
                  t = 0;
                  if( str[i] < 0 )
                    {
                             str[i] += 10;
                             t = -1;
                    }
                 
             }
            
            
         k = 0;
         for( i = 0; i < len; i++ )
         {
              if( str[i] != 0 )
                  k = 1;
              if( k == 1 )
                 printf( "%d",str[i] );
         }
         printf( "471\n" );
    }
}