2392.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 33 行

/* This Code is Submitted by wywcgs for Problem 2392 on 2006-10-10 at 15:31:34 */
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 10240;

int main()
{
	int a[N], an[N], n;

	for(int t = 0; scanf("%d", &n) != EOF && n != 0; t++) {
		if(t != 0) putchar('\n');
		for(int i = 0; i < n; i++) scanf("%d", &a[i]);
		sort(a, a+n); memset(an, 0, sizeof(an));
		int k = 0, m = 0; an[0] = 1;
		for(int i = 0; i < n; i++)
			if(i == 0 || a[i] != a[i-1]) an[m++] = 1;
			else an[m-1]++;
		for(int i = 0; i < m; i++) k >?= an[i];
		printf("%d\n", k);
		for(int i = 0; i < k; i++) {
			for(int j = i; j < n; j += k) {
				if(j > i) printf(" ");
				printf("%d", a[j]);
			}
			printf("\n");
		}
	}

	return 0;
}