UVA 11100 The Trip, 2007——水题

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1e4 + 10;
int n, a[maxn];
int main() {
while (~scanf("%d", &n) && n) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int ans = 1, t = 1;
for (int i = 1; i < n; i++) {
if (a[i] == a[i-1]) t++;
else t = 1;
ans = max(ans, t);
}
printf("%d\n", ans);
for (int i = 0; i < ans; i++) {
for (int j = i; j < n; j += ans) {
if (j != i) printf(" ");
printf("%d", a[j]);
}
printf("\n");
}
printf("\n");
}
return 0;
}