题解

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int t,A,B;
struct num{
	int e,r; 
}a[N];
int Change(int x)
{
	int k=0;
	while(x!=0)
	{
		k*=10;
		k+=x%10;
		x/=10;
	}
	return k;
}
bool cmp(num x,num y)
{
	if(x.e<y.e)
	{
		return 1;
	}
	return 0; 
}
int main()
{
	cin>>t;
	while(t--)
	{
		cin>>A>>B;
		int l=0;
		memset(a,2e5,sizeof 0);
		for(int i=A;i<=B;++i)
		{
			a[++l].e=Change(i);
			a[l].r=i;
		}
		sort(a+1,a+l+1,cmp); 
		for(int i=1;i<=l;++i)
		{
			cout<<a[i].r<<" ";
		}
		cout<<endl;
	}
	return 0;
}