uva 11100

xiaoxiao2021-02-28  98

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define MAX(x,y) ((x)>(y)?(x):(y)) int vis[1000100]; int d[100100]; int main() { int n; while(~scanf("%d",&n)&&n) { int res=0; memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) { scanf("%d",&d[i]); vis[d[i]]++; res=MAX(res,vis[d[i]]); } sort(d,d+n); printf("%d\n",res); for(int i=0;i<res;i++) { printf("%d",d[i]); for(int j=i+res;j<n;j+=res) printf(" %d",d[j]); printf("\n"); } } }
转载请注明原文地址: https://www.6miu.com/read-59743.html

最新回复(0)