题解 | #整型存储#

#include<string>
#include<cstdio>
using namespace std;

class intStore
{
	public:
		int n;
		int reverse(int n)
		{
			int revn=0;
			while(n>0)
			{
				
				revn+=n%10;
				n=n/10;
				if(n<=0)
				{
					break;
				}
				revn=revn*10;
			}
			return revn;
		}
		
}; 

int main()
{
	class intStore c1;
	int N;
	for(int i=0;i<10;i++)
	{
		cin>>N;
		if(N==0)
		{
			break;
		}
		else 
		{
			c1.n=N;
			//cout<<N<<endl;
			int revN=c1.reverse(N);
			//cout<<revN<<endl;
			cout<<N<<' '<<revN<<endl;
		}
	}
}