1978737_ac_15ms_24k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <string.h>
# include <stdlib.h>

int l;
int L, C;
char ch[100];
char output[100];

int cmp(const void *a,const void *b)
{
	return *(char *)a-*(char *)b;
}

int right(char *ch)
{
	int i;
	int no;
	int len;

	no = 0;len = strlen(ch);
	for(i = 0; i < len; i++)
		if(ch[i]=='a'||ch[i]=='e'||ch[i]=='i'||ch[i]=='o'||ch[i]=='u')
			no++;
	if(no&&len-no>=2)
		return 1;
	else
		return 0;
}

void f(char *ch,int n)
{
	int i;
	int len;

	len = strlen(ch);
	for(i = 0; i <= len-n; i++)
	{
		output[L-n] = ch[i];
		if(n>1)
			f(&ch[i+1],n-1);
		else
			if(right(output))
				puts(output);
	}
}
int main()
{
	int i;

	scanf("%d%d",&L,&C);
	getchar();
	for(i = 0; i < C; i++)
	{
		scanf("%c",&ch[i]);
		getchar();
	}
	qsort(ch,C,sizeof(ch[0]),cmp);
	f(ch,L);
	return 1;
}