OJ Board

Code: Select all

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

#define NULL 0

char s[130];
bool b[130];
bool flag;
class node
{
public:
	node* left;
	node* right;
	char val;
	node()
	{
		left=NULL;
		right=NULL;
		val=0;
	}
	
};

int numOfSmall()
{
	int i,count=0;
	i=0;
	while(s[i])
	{
		if(s[i]>='a' && s[i]<='z')
		{
			count++;
		}
		i++;
	}
	return count;
}

int numOfRoot()
{
	int i=0,count=0;
	while(s[i])
	{
		if(s[i]=='K' || s[i]=='A' || s[i]=='E' || s[i]=='C')
		{
			count++;
		}
		i++;
	}
	return count;
}

int numOfN()
{
	int i,count=0;
	i=0;
	while(s[i])
	{
		if(s[i]=='N')
		{
			count++;
		}
		i++;
	}
	return count;
}

node* constructTree()
{
	int i;
	node* n=new node();
	for(i=0;s[i];i++)
	{
		if(b[i]==true && (s[i]=='K' || s[i]=='A' || s[i]=='E' || s[i]=='C'))
		{
			n->val=s[i];
			b[i]=false;
			n->left=constructTree();
			n->right=constructTree();
			return n;			
		}
	}
	for(i=0;s[i];i++)
	{
		if(b[i]==true && s[i]>='a' && s[i]<='z')
		{
			n->val=s[i];
			b[i]=false;
			n->left=NULL;
			n->right=NULL;
			return n;			
		}
	}
	flag=false;
	return NULL;
}

node* makeRoot()
{
	int i;
	node* n=new node();
	for(i=0;s[i];i++)
	{
		if(b[i]==true && (s[i]=='K' || s[i]=='A' || s[i]=='E' || s[i]=='C'))
		{
			n->val=s[i];
			b[i]=false;
			n->left=constructTree();
			n->right=constructTree();
			return n;
		}
	}
	return n;
}

void print(node* n)
{
	if(n==NULL)
	{
		return;
	}
	printf("%c",n->val);
	print(n->right);
	print(n->left);

	return;
}

int main(void)
{
	int i,N;
	while(1)
	{
		gets(s);
		if(strcmp(s,"0")==0)
		{
			break;
		}
		if(numOfRoot()==0)
		{
			if(numOfSmall()!=1)
			{
				printf("no WFF possible\n");
				continue;
			}
			else
			{
				N=numOfN();
				for(i=0;i<N;i++)
				{
					printf("N");
				}
				for(i=0;s[i];i++)
				{
					if(s[i]>='a' && s[i]<='z')
					{
						printf("%c",s[i]);
					}
				}
				printf("\n");
				continue;
			}
		}
		memset(b,true,sizeof(b));
		flag=true;
		node* n=makeRoot();
		if(!flag)
		{
			printf("no WFF possible\n");
			continue;
		}
		N=numOfN();
		for(i=0;i<N;i++)
		{
			printf("N");
		}
		print(n);
		printf("\n");
	}
	return 0;
}