給你個思路吧
#include
using namespace std;
/*此函數(shù)為產(chǎn)生數(shù)字的倒序用*/
int make(int i)
{
int a[10],c;
int b = 0,sum = 0,max = 1;
while(i % 10 == 0)
i /= 10;
int t = i,digit = 0;
while ( t ) //判斷n有幾位
{
t /= 10;
digit++;
}
for( c=i;digit > 0;c=c/10,b++)
{
a[b] = c%10;
max *= 10;
digit --;
}
max /= 10;
for (c = 0;c < b;c ++,max /= 10)
sum += a[c] * max;
return sum;
}
int main()
{
int i,sum = 0;
cin>>i;
sum = i + make(i);
cout