OJ Board

Code: Select all

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

#define DELIMITATORS " \n\'\"\\|.,;:?!()[]{}+-*=_&%$#@<>/"

typedef struct list
{
	char p[201];
	struct list *next;
} *List;

List ConsList()
{
	List result;
	
	result = (List) malloc(sizeof(struct list));
	strcpy(result->p, "");
	result->next = NULL;
	return result;
}

void FreeList(List l)
{
	List itr, tmp;
	
	itr = l;
	
	while (itr)
	{
		tmp = itr;
		itr = itr->next;
		free(tmp);
	}
}

Lista AddWordist(List l, char s[201])
{
	List n, itr, prev;
	int cmp;
	
	if (strcmp(l->p, "") == 0)
	{
		strcpy(l->p, s);
		return l;
	}
	
	itr = l;
	prev = NULL;
	
	while (itr)
	{
		cmp = strcmp(itr->p, s);
		
		if (cmp == 0)
		{
			return l;
		}
		else if (cmp > 0)
		{
			n = ConsList();
			strcpy(n->p, s);
			n->next = itr;
			
			if (prev)
			{
				prev->next = n;
			}
			else
			{
				l = n;	
			}
			
			return l;
		}
		
		prev = itr;
		itr = itr->next;
	}
	
	n = ConsList();
	strcpy(n->p, s);
	prev->next = n;
	return l;
}

void PrintList(List l)
{
	List itr;
	
	itr = l;
	
	while (itr)
	{
		printf("%s\n", itr->p);
		itr = itr->next;
	}
}

void lower_case(char *word)
{
	char lower[27], upper[27];
	int i, j;
	
	strcpy(upper, "ABCDEFGHIJKLMNOPQRSTUVWXYZ");
	strcpy(lower, "abcdefghijklmnopqrstuvwxyz");
	
	for (i = 0; i < strlen(word); i++)
	{
		for (j = 0; j < 26; j++)
		{
			if (word[i] == upper[j])
			{
				word[i] = lower[j];
			}
		}
	}
}

int main()
{
	List l;
	char line[201], *p;
	
	l = ConsList();
	
	while (fgets(line, 200, stdin) != NULL)
	{
		p = strtok(line, DELIMITATORS);
		
		while (p != NULL)
		{
			lower_case(p);
			l = AddWordList(l, p);
			p = strtok(NULL, DELIMITATORS);
		}
	}
	
	PrintList(l);
	FreeList(l);
	return 0;
}

Code: Select all

In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. 

Code: Select all

..a word is defined as a consecutive sequence of alphabets, in upper and/or lower case.

Code: Select all

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

char str[250];
char dic[6000][256];
int cnt,i,flag;

int compare(const void *a, const void *b){
	return strcmp((char *)a,(char *)b);
}

void tolower(char *c){
	int ii;
	for (ii=0;c[ii]!=0;ii++){
		c[ii] = c[ii] | 0x20;
	}
	return;
}

int main(){
	char *pch;
	cnt = 0;
	while (gets(str)!=NULL){
		pch = strtok(str," :\\;,./\n\t\'\"`~!@#$%^&*-_+=1234567890");
		while (pch != NULL){
			tolower(pch);
			flag = 1;
			for (i=0;i<cnt;i++){
				if (strcmp(pch,&dic[i][0])==0){
					flag = 0;
					break;
				}
			}
			if (flag == 1){
				strcpy(&dic[cnt][0],pch);
				cnt++;
			}
			pch = strtok(0," :\\;,./\n\t\'\"`~!@#$%^&*-_+=1234567890");
		}
	}
	qsort(&dic[0][0],cnt,256,compare);
	for (i=0;i<cnt;i++)
		printf("%s\n",&dic[i][0]);
	return 0;
}

Code: Select all

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

char dic[10000][205];
char inp[205];


int main()
{
	int l,i,j,n=0;
	char buff[205];
	
	while(scanf("%s",&inp)==1)
	{
                       PARSE WORD & SAVE IN DIC[];
	}
                 SORT (DIC[]);

	OUTPUT DISTINCT WORD
}