2023年12月24日发(作者：)

n = 1;if (num >0){for (i = 0; i <= 9; i++){if (num >= pow(10.0, i) && num <= pow(10.0, i + 1) - 1){len = i + 1;break;}}m[0] = num / pow(10.0, len - 1);for (i = len-1; i >=1; i--){a = num % (int)pow(10.0,i) / (int)pow(10.0,i-1 );m[n] = a;n++;}for (j = 0; j <= n-1; j++){b = m[j];if (j < n - 1){switch (b){case 0:printf("ling "); break;case 1:printf("yi "); break;case 2:printf("er "); break;case 3:printf("san "); break;case 4:printf("si "); break;case 5:printf("wu "); break;case 6:printf("liu "); break;case 7:printf("qi "); break;case 8:printf("ba "); break;

case 9:printf("jiu "); break;}}else{switch (b){case 0:printf("ling"); break;case 1:printf("yi"); break;case 2:printf("er"); break;case 3:printf("san"); break;case 4:printf("si"); break;case 5:printf("wu"); break;case 6:printf("liu"); break;case 7:printf("qi"); break;case 8:printf("ba"); break;case 9:printf("jiu"); break;}}}}else if (num == 0){printf("ling");}else{num = -num;for (i = 0; i <= 9; i++){if (num >= pow(10.0, i) && num <= pow(10.0, i + 1) - 1){len = i + 1;break;

}}m[0] = num / pow(10.0, len - 1);for (i = len - 1; i >= 1; i--){a = num % (int)pow(10.0, i) / (int)pow(10.0, i - 1);m[n] = a;n++;}printf("fu ");for (j = 0; j <= n - 1; j++){b = m[j];if (j < n - 1){switch (b){case 0:printf("ling "); break;case 1:printf("yi "); break;case 2:printf("er "); break;case 3:printf("san "); break;case 4:printf("si "); break;case 5:printf("wu "); break;case 6:printf("liu "); break;case 7:printf("qi "); break;case 8:printf("ba "); break;case 9:printf("jiu "); break;}}else{switch (b){case 0:printf("ling"); break;