OJ Board

Code: Select all

HOUSE
GOOD
NOW
THING
THIS
PIGLET
MEN
TREE
BUT
WAS
AID
IN
THE
IS
IT
OTHER
BEECH
ALL
VERY
AND
FOREST
COME
OF
GRAND
ON
TRESPASSERS
FOR
PARTY
TIME
TO
MIDDLE
LIVED
THAT
THEMIDDLEOFTHEHOUSEN
HAD
#
BVTYRFMYVHRQMV MNMHRDKMTDN QMUAGERMV MFURMZVQQYRMASMNMORRPUMFDRRMN QMFURMORRPUMFDRRMINEMV MFURMZVQQYRMASMFURMSADREFMN QMBVTYRFMYVHRQMV MFURZVQQYRASFURUAGER RJFFAUVEUAGERINENBVRPRASODAXR OANDQIUVPUMUNQMFDREBNEERDEMIMA MVFM

Code: Select all

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

#define MAX 100
#define MAX_S 255

char dic[MAX][30];
int n;


int find_word(char *item)
{
	int i;
	for(i=0;i<n;i++)
		if(strcmp(dic[i],item)==0)
			return 1;
	return 0;
}


int main()
{
	char buf[MAX_S],word[MAX_S],sen[MAX_S],res[MAX_S];
	int i,len,k,pos,w,s,cnt,max;
	n=0;
//	freopen("554.in","r",stdin);
	//freopen("554.out","w",stdout);
	while(1)
	{
		gets(buf);
		if(strcmp(buf,"#")==0)
			break;
		strcpy(dic[n++],buf);
	}
	while(gets(buf))
	{
		len=strlen(buf);
		if(!len)
			continue;
		int pp;
		max=-1;
		strcpy(res,buf);
		for(k=1;k<=26;k++)
		{
			w=s=cnt=0;
			for(i=0;i<len;i++)
			{
				if(buf[i]==' ')
					pos=0;
				else
					pos=buf[i]-'A'+1;
				pos=(pos+k)%27;
				if(!pos)
				{
					word[w]='\0';
					sen[s++]=' ';
					if(find_word(word))
						cnt++;
					w=0;
					word[w]='\0';
				}
				else
				{
					word[w++]='A'+pos-1;
					sen[s++]='A'+pos-1;
				}
			}
			word[w]='\0';
			sen[s]='\0';
			if(find_word(word))
				cnt++;
			if(max<cnt)
			{
				max=cnt;
				strcpy(res,sen);
				pp=k;
			}
		}
		puts(res);
		//printf("%d\n",pp);
	}
	return 0;
}

Code: Select all

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

#define SAFE printf("Safe\n");
char * shift(char * str, int k)
{
    char * decoded = (char *)malloc(251);
    int i;
    strcpy(decoded, str);

    for(i=0; decoded[i]; i++)
    {
        int num;
        if(isalpha(decoded[i]))
        {
            num = decoded[i] - 'A' + 1;
        }
        else
        {
            num = 0;
        }

        num+=k;
        if(num>26)
            num-=27;

        if(!num)
        {
            decoded[i] = ' ';
        }
        else
        {
            decoded[i]  = num + 'A' - 1;
        }


    }
    decoded[i] = 0;

    return decoded;
}

int countWords(char ** dictionary, char *str)
{
    int count = 0;
    char word[21];

    FILE * stream = fmemopen(str,strlen(str),"r");

    while(fscanf(stream, "%s",word)>0)
    {

        int i = 0;
        for(i; dictionary[i]; i++)
        {
            if(!strcmp(word,dictionary[i]))
            {
                //printf("%s matches %s in the dictionary!\n",word,dictionary[i]);
                count++;
                continue;
            }
            else
            {
                //printf("%s does not match %s in the dictionary\n",word,dictionary[i]);
            }
        }
    }
    fclose(stream);
    return count;
}

int main()
{
    char  ** dictionary = (char **)malloc(100);
    memset(dictionary,0,100);
    int i = 0;
    while(1)
    {
        char * word = (char *)malloc(22);
        //scanf("%s",word);
        fgets(word, 22, stdin);
        word[strlen(word)-1] = 0;
        if(strcmp(word,"#"))
        {
            dictionary[i] = word;
            i++;
        }
        else
        {
            break;
        }
    }

    /*

    dictionary input end

    */

    char message[252];
    fgets(message, 252, stdin);
    message[strlen(message) - 1] = 0;

    char ** decoded_strings = (char **)malloc(27);
    int k;

    int match_count[27];

    int max = 0;
    int max_words = 0;
    int index = 0;
    for(k=0; k<27; k++)
    {
        decoded_strings[k] = (char *)malloc(251);
        decoded_strings[k] = shift(message,k);
        match_count[k] = countWords(dictionary,decoded_strings[k]);

        if(match_count[k]>max)
        {
            max = match_count[k];
            max_words = 1;
            index = k;
        }
        else if(match_count[k] == max)
        {
            max_words++;
        }
    }



    if(max_words>1)
    {
        int i;
        int maxlen = 0;
        int ndex = 0;
        for(i=0; i<27; i++)
        {

            if(match_count[i] == max)
            {
                int len = strlen(decoded_strings[i]);
                if(len>maxlen)
                {
                    maxlen = len;
                    ndex = i;
                }
            }
        }

        printf("%s\n",decoded_strings[ndex]);
    }
    else if(max_words == 1)
    {
        printf("%s\n",decoded_strings[index]);
    }
    /*
    printf("Dictionary:\n");
    for(i=0; dictionary[i]; i++)
    {
        printf("%s\n",dictionary[i]);
    }

    printf("Decoded strings:\n");
    for(k=0; k<27; k++)
    {
        printf("%d %s %d\n",k,decoded_strings[k], countWords(dictionary,decoded_strings[k]));
    }*/



    //printf("Safe\n");

    /*

    end

    */


    /*
        free
    */

    // free dictionary
    for(i=0; dictionary[i]; i++)
    {
        free(dictionary[i]);
    }
    free(dictionary);
    //printf("Freed dictionary\n");
    //free decoded strings

    for(i=0; decoded_strings[i]; i++)
    {
        free(decoded_strings[i]);
    }
    //printf("Freed decoded words\n");
    //free(decoded_strings);
    return 0;
}