13 15 2003 2005 239 250 1399 1500 999999 0
13: 12 15: 13 2003: 1461 2005: 1462 239: 197 250: 198 1399: 1052 1500: 1053 999999: 531440
分析:根据题目,在十进制里面去掉了4,那么也就是变成了9进制。然后因为跳过了4,那么大于4的值显然就应该减1
#include <iostream> #include <cmath> using namespace std; int main(int argc, char const *argv[]) { int number, numT; while (cin >> number && number != 0) { numT = number; int k = 0; int result = 0; while (number) { int t = number % 10; t = t >= 5 ? t - 1 : t; result += t * pow(9, k++); number /= 10; } cout << numT << ": " << result << endl; } return 0; }
原文:http://www.cnblogs.com/xiezhw3/p/4104488.html