NYOJ540 奇怪的排序

原题链接

在没有更好的方法前，最笨的方法就是最好的方法。

#include <cstdio>
#include <cstdlib>

int cmp(const void *a, const void *b){
	int aa = *(int *)a, bb = *(int *)b;
	int i = 0, j = 0;
	while(aa){
		i = i * 10 + aa % 10;
		aa /= 10;
	}
	while(bb){
		j = j * 10 + bb % 10;
		bb /= 10;
	}
	return i - j;
}

int main(){
	int t, a, b, *vec;
	scanf("%d", &t);
	while(t-- && scanf("%d%d", &a, &b)){
		int count = b - a + 1;
		vec = (int *)malloc(sizeof(int) * count);
		for(int i = 0; i != count; ++i)
			vec[i] = a + i;
		qsort(vec, count, sizeof(int), cmp);
		int ok = 1;
		for(int i = 0; i != count; ++i)
			if(ok) printf("%d", vec[i]), ok = 0;
			else printf(" %d", vec[i]);
		printf("\n");
		free(vec);
	}
	return 0;
}

转载于:https://www.cnblogs.com/changmu/p/3639731.html