2392901_ac_0ms_8k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 35 行

#include <stdio.h>

int main()
{
	int b, s, t, i, mark;
	char str[101], big[101], sma[101];

	while(scanf("%s",str)==1&&str[0]!='0')
	{
		b = s = 0;mark = 0;
		for(i = 0; str[i]!='\0'; i++)
			if(str[i]<='Z')
				if(str[i]=='N')
					mark++;
				else
					big[b++] = str[i];
			else
				sma[s++] = str[i];
			if(s==0)
			{
				printf("no WFF possible\n");
				continue;
			}
			for(i = 0; i < mark; i++)
				printf("N");
			if(b>s)
				t = s-1;
			else
				t = b-(b==s);
			for(i = 0; i < t; i++)
				printf("%c%c",big[i],sma[i]);
			printf("%c\n",sma[i]);
	}
	return 1;
}