642 - Word Amalgamation

[novice]

I keep getting WA, but I think I have the right concept, can someone give me some input/output?

here is my code in C.pls some1 chk



/* @BEGIN_OF_SOURCE_CODE */
/* @JUDGE_ID: 25021WT 642 C */


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

int sort (char * , char * );


void main()
{
char s[105][8],t[105][8] ,c[8],st[8];
int i,j, print,k,l,len;

// freopen("amalgama.in","r",stdin);
// freopen("amalgama.out","w",stdout);


for(k=0;;k++)
{
scanf("%s",&s[k]);
if(strcmp(s[k],"XXXXXX")==0)
break;
}

for(l=0;;l++)
{
scanf("%s",&t[l]);
if(strcmp(t[l],"XXXXXX")==0)
break;
}


for(j=0;j<l;j++)
{
print = 0;
strcpy(st,t[j]);
len = strlen(st);
qsort(st,len,sizeof(char),
(int (*)(const void *,const void *))sort);


for(i=0;i<k;i++)
if(len == strlen(s[i]))
{
strcpy(c,s[i]);
len = strlen(c)
qsort(c,len,sizeof(char),
(int (*)(const void *,const void *))sort);



if(strcmp(st,c)==0)
{
printf("%s\n",s[i]);
print++;
}
}

if(!print)
printf("NOT A VALID WORD\n");

printf("******\n");

}

fclose(stdin);
fclose(stdout);


}


int sort (char *a , char *b )
{
if(*a > *b)
return 1;
else if( *a < *b)
return -1;
return 0;
}


/* @END_OF_SOURCE_CODE */

[sohel]

First consider this loop:

main()
{
while(1)//-----------------------Never ends , condition always true
{
time=0;
while(gets(dic[time])&&strcmp(dic[time],"XXXXXX"))
{
time++;
}
while(gets(nus)&&strcmp(nus,"XXXXXX"))
{
.
.
.
.
.
your program never ends.


and another hint.
you have to sort the words lexicographically if there are multiple outputs for a particular case.

Hope this helps.

[ayaw]

mine got WA

Code: Select all

#include <stdio.h>
#include <string.h>
int N=0;
char DIC[101][7];

int compare(char *a, char *b) {
   int i;
   for(i=0;a[i];i++) {
      if(a[i]>b[i]) return 1;
      if(b[i]>a[i]) return -1;
   }
   if(b[i]==0) return 0;
   else return -1;
}

void sort(void) {
   char temp[7];
   int i,j,tv;
   for (i=0;i<N-1;i++) {
      for(j=0;j<N-1;j++) {
         if( compare(DIC[j],DIC[j+1]) == 1) {
            strcpy(temp,DIC[j]);
            strcpy(DIC[j],DIC[j+1]);
            strcpy(DIC[j+1],temp);
   }   }   }
}

valid(char *a, char *b) {
   int i,j;
   char temp[7];
   if(strlen(a)!=strlen(b)) return 0;
   strcpy(temp,a);
   for(i=0;b[i];i++)
      for(j=0;temp[j];j++)
         if(b[i]==temp[j]) temp[j]='X';
   for(i=0;temp[i];i++)
      if(temp[i]!='X') return 0;
   return 1;
}

amalgamation(char *a) {
   int i,flag=0;
   for(i=0;i<N;i++)
      if(valid(DIC[i],a)) {
         printf("%s\n",DIC[i]);
         flag = 1;
      }
   return flag;
}

main() {
   char buffer[7];
   while(1) {
      gets(buffer);
      if(strcmp(buffer,"XXXXXX")==0) break;
      strcpy(DIC[N],buffer);
      N++;
   }
   sort();
   while(1) {
      gets(buffer);
      if(strcmp(buffer,"XXXXXX")==0) break;
      if(!amalgamation(buffer)) printf("NOT A VALID WORD\n");
      printf("******\n");
   }
   return 0;
}

[plamplam]

This is a very simple problem, just make sure you are doing the sorting correctly. A simple letter frequency is enough to solve this. And you should really not get Wrong Answer if you manage to pass the sample input. If you do get Wrong Answer, then it is most probably because of your sorting function

[sith]

Hello.
I've got AC but my Ranking too small.
My solution has been written in Java.
I believe that my solution is pretty optimal but why I've got so low rate?
Here is my solution:

Code: Select all

import java.io.*;
import java.util.*;

class Main {

    private static final String STARS = "******\n";
    private static final String DELIMITER = "XXXXXX";

    public static void main(String[] args) {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 1024 * 1024);

        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));

        String line;
        try {
            Map<String, Set<String>> vocabulary = new HashMap<String, Set<String>>();
            while ((line = reader.readLine()) != null) {
                if (line.equals(DELIMITER)) {
                    break;
                }

                String sortedWord = getSortedWord(line);
                Set<String> words = vocabulary.get(sortedWord);

                if (words == null) {
                    words = new HashSet<String>();
                    vocabulary.put(sortedWord, words);
                }

                words.add(line);


            }

            while ((line = reader.readLine()) != null) {
                if (line.equals(DELIMITER)) {
                    break;
                }
                String sortedWord = getSortedWord(line);
                Set<String> words = vocabulary.get(sortedWord);
                if (words == null) {
                    writer.write("NOT A VALID WORD\n");
                    writer.write(STARS);
                } else {
                    String[] sortedWords = words.toArray(new String[words.size()]);
                    Arrays.sort(sortedWords);
                    for (String word : sortedWords) {
                        writer.write(word + "\n");
                    }
                    writer.write(STARS);
                }
            }
            writer.flush();
        } catch (IOException e) {
            e.printStackTrace();  //To change body of catch statement use File | Settings | File Templates.
        }
    }

    private static String getSortedWord(String line) {
        char[] chars = line.toCharArray();
        Arrays.sort(chars);

        return String.valueOf(chars);
    }

}


[brianfry713]

C is faster than JAVA.

[sith]

I know it
But I look at statistics and there are
JAVA (379) solved submits
1988 - total succefull submits
my ranking is 1958
So I can be 1988 - 379 = 1609 ranking at least
But I believe that all Java solutions are very similar so how can I get 1609 position?

[brianfry713]

Those are the total JAVA submissions, not unique number of user's JAVA AC submissions. Add up the different languages and they equal the number of submissions, so you can't judge how your JAVA code runtime compares based just on that.