The Trip. 2007

给出一组数，把这组数分成最少的组，并且使所有组每组内数字的个数的最大值最小

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>
#include <map>
#include <string>
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
//#pragma comment(linker, "/STACK:1024000000,1024000000") 

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;

const int MAXN(10010);

int arr[MAXN];
vector<int> vec[MAXN];

int main()
{
	int n;
	bool print_len(false);
	while(scanf("%d", &n), n)
	{
		if(print_len)
			printf("\n");
		print_len = true;
		for(int i = 0; i < n; ++i)
			scanf("%d", arr+i);
		sort(arr, arr+n);
		int ans = 0, tans;
		for(int i = 0; i < n; ++i)
		{
			if(i == 0 || arr[i] != arr[i-1])
				tans = 0;
			++tans;
			ans = max(ans, tans);
		}
		for(int i = 0; i < ans; ++i)
			vec[i].clear();
		for(int i = 0; i < n; ++i)
			vec[i%ans].push_back(arr[i]);
		printf("%d\n", ans);
		for(int i = 0; i < ans; ++i)
		{
			printf("%d", vec[i][0]);
			for(int j = 1; j < vec[i].size(); ++j)
				printf(" %d", vec[i][j]);
			printf("\n");
		}
	}
	return 0;
}