-
Notifications
You must be signed in to change notification settings - Fork 0
/
10098.c
51 lines (51 loc) · 823 Bytes
/
10098.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int reg2[20];
void allsort(int l,char *sa,char *s,int now)
{
int i,j;
if (now==l)
{
for (i=0;i<l;i++)
printf("%c",sa[i]);
putchar('\n');
}
else for (i=0;i<l;i++)
if (!i || s[i]!=s[i-1])
{
int reg1=0;
for (j=0;j<now;j++) if (sa[j]==s[i]) reg1++;
if (reg2[i]>reg1)
{
sa[now]=s[i];
allsort(l,sa,s,now+1);
}
}
}
int cmp(const void *a,const void *b)
{
return *(char *)a-*(char *)b;
}
main()
{
int i,j,k,l,m,n;
char s[20];
char sa[20];
scanf("%d",&n);
while (n--)
{
getchar();
scanf("%s",s);
memset(sa,0,sizeof(sa));
memset(reg2,0,sizeof(reg2));
l=strlen(s);
qsort(s,l,sizeof(char),cmp);
for (i=0;i<l;i++)
for (j=0;j<l;j++)
if (s[i]==s[j]) reg2[i]++;
allsort(l,sa,s,0);
putchar('\n');
}
return 0;
}