while(true)
{
// n为电话号码的长度
for(i = 0; i < n; i++)
printf("%c", c[number[i]][answer[i]]);
printf("\n");
int k = n - 1;
while(k >= 0)
{
if(answer[k] < total[number[k]] - 1)
{
answer[k]++;
break;
}
else
{
answer[k] = 0; k--;
}
}
if(k < 0)
break;
}