int Product(int nNum)
{
int nPrv = nNum / 10;
int nLast = nNum % 10;
if ( nNum < 10 )
{
return nNum;
}
return nLast * Product(nPrv);
}
int _tmain(int argc, _TCHAR* argv[])
{
int nNum = 0;
while ( 1 )
{
scanf("%d", &nNum);
printf("%d,%d\n",nNum,Product(nNum));
}
return 0;
}
// 注意输入的如果含零 结果会是0
追问就是简单点的
追答就一个递归难理解点.