454 - Anagrams

[serur]

I'm getting RTE with this stuff, how do you think what may cause it?

Code: Select all

/*"anagrams"*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<assert.h>
#include<ctype.h>
#define L 1009
#define N 100
 
typedef
struct{
	char word[1009];
	char sig[1009];
}foo;

foo ans[N];

int isempty(char a[]){
	int t;
	for(t=0;t<(int)strlen(a);t++)
		if(!isspace(a[t]))
			return 0;
	return 1;
}
int foo_comp(const void *a,const void *b){
	int t;
	foo *x=(foo*)a;
	foo *y=(foo*)b;
	t=strcmp(x->sig,y->sig);
	if(t==0)
		return strcmp(x->word,y->word);
	else
		return t;

}
int char_comp(const char *a,const char *b){
	/*if((islower(*a) && islower(*b))||(isupper(*a) && isupper(*b)))
		return *a-*b;
	else{
		if(islower(*a) && isupper(*b))
			return *a-('a'-'A')-*b;
		else
			return *a+('a'-'A')-*b;
	}*/
	return *a-*b;
}
void det_sig(foo *A){
	char s[L];
	int t,k;
	qsort(A->sig,strlen(A->sig),sizeof(char),char_comp);
	for(t=0,k=0;t<(int)strlen(A->sig);t++)
		if(!isspace(A->sig[t]))
			s[k++]=A->sig[t];
	s[k]='\0';
	strcpy(A->sig,s);
}
int main()
{
	int T;
	int status;
	int n,t,i,j,k;
	char dummy[L];
#ifndef ONLINE_JUDGE
	freopen("A.in","r",stdin);
#endif
	scanf("%d",&T);
	gets(dummy); 
	gets(dummy); 
	while(T--)
	{
		for(i=0;gets(ans[i].word);i++)
		{
			if(isempty(ans[i].word))
				break;
			strcpy(ans[i].sig,ans[i].word);
			det_sig(&ans[i]);
		}
		n=i;
		qsort(ans,n,sizeof(foo),foo_comp);
		status=0;
		for(t=0;t<n-1;t++)
			if(strcmp(ans[t].sig,ans[t+1].sig)==0)
			{
				status=1;
				break;
			}
		if(!status)
			putchar('\n');
		else
		{
			k=1;t=k;
			while(t<=n)
				if(t==n || strcmp(ans[t].sig,ans[t-1].sig)!=0)
				{
					for(i=k-1;i<t;i++)
						for(j=i+1;j<t;j++)
							printf("%s = %s\n",ans[i].word,ans[j].word);
					k=t+1;
					t=k;
				}
				else
					t++;
		}
		if(T)
			putchar('\n');
	}
	return 0;
}

Thanks in advance

[ayon]

i take input as below:

Code: Select all

scanf("%d", &testCase);
gets(dummy);
gets(dummy);
while(testCase--)
{
     for(i = 0; gets(ans[i].word); ++i) // i used word[1009]
     {
          if(isempty(ans[i].word)) 
                break;
          ............
          ............
      }
      n = i;
}

there shouldn't be any blank line after the last test case

[serur]

Thank you!

The fact is, I have given up this problem...
Now I'll try again

Best regards.

EDIT: I have changed my code according to your instructions - see above.
But still RTE...

Also,

Code: Select all

3 

carthorse 
horse 
horse cart 
i do not know u 
ok i now donut 
orchestra 

aPPLE 
PPLEa 
LEaPP 

erosh 
erosh 
horse 
horse 
ac bd 
a cbd 
q 
q 
[horse]' 
[e]rosh' 
iiiiiiiiiiiiij 
iiiiiiiiiiiiji 
orchestra 
pq 
qp 
carthorse 
erosh 
horsecart 
ok i now donut 
oknow uidot n 
i do not know u 
abdc 
kencti kecut 
kecut kencit

Output:
carthorse  = horse cart 
carthorse  = orchestra 
horse cart  = orchestra 
i do not know u  = ok i now donut 

LEaPP  = PPLEa 
LEaPP  = aPPLE 
PPLEa  = aPPLE 

[e]rosh'  = [horse]' 
a cbd  = abdc 
a cbd  = ac bd 
abdc  = ac bd 
carthorse  = horsecart 
carthorse  = orchestra 
horsecart  = orchestra 
kecut kencit = kencti kecut 
i do not know u  = ok i now donut 
i do not know u  = oknow uidot n 
ok i now donut  = oknow uidot n 
erosh  = erosh 
erosh  = erosh 
erosh  = horse 
erosh  = horse 
erosh  = erosh 
erosh  = horse 
erosh  = horse 
erosh  = horse 
erosh  = horse 
horse  = horse 
iiiiiiiiiiiiij  = iiiiiiiiiiiiji 
pq  = qp 
q  = q 

[ayon]

my output for the last input

Code: Select all

[e]rosh'  = [horse]'
a cbd  = abdc
a cbd  = ac bd
abdc  = ac bd
carthorse  = horsecart
carthorse  = orchestra
erosh  = erosh
erosh  = erosh
erosh  = horse
erosh  = horse
erosh  = erosh
erosh  = horse
erosh  = horse
erosh  = horse
erosh  = horse
horse  = horse
horsecart  = orchestra
i do not know u  = ok i now donut
i do not know u  = oknow uidot n
iiiiiiiiiiiiij  = iiiiiiiiiiiiji
kecut kencit = kencti kecut
ok i now donut  = oknow uidot n
pq  = qp
q  = q

but i am not sure why RTE. and my process is little bit different than yours, to check for anagram i just compare two strings' frequency. i used

Code: Select all

struct{ 
   char word[1009]; 
   int freq[130]; // for 127 charcaters
}

[Kallol]

Well, I am getting crazy ....continuously getting RTE , but I dont know whats the reason ? All the sample input and output matches for my prgram and arraysize are far too big than its necessary ... I have absolutely no idea whats going wrong here :s

can any one help me? Here is my code..

Code: Select all

removed after AC

Thanx.

[ayon]

tui amar ager post gulo porish ni?
use

Code: Select all

       while(1) 
      { 
         if(gets(s) == NULL)
              break;
         if(strcmp(s,"")==0) 
         { 
            break; 
         } 
         strcpy(a[i],s); 
         i++; 
      }

[Kallol]

Thanx Ayon !

i finally got AC. But whats the reason for these types of nasty input system ??

[ayon]

because the last test case ends with EOF, not newline

[ALEXANDRIA_2]

Hi all, I still wondering what makes my program PE...
can u give me some hints...
thanks before..

Code: Select all

input:
2

carthorse
horse
horse cart
i do not know u
ok i now donut
orchestra

aaa
aaa
aaa

Code: Select all

output:
carthorse = horse cart--->end of line
carthorse = orchestra---->eol
horse cart = orchestra--->eol
i do not know u = ok i now donut--->eol
--->new line
aaa = aaa-->eol
aaa = aaa-->eol
aaa = aaa--->eol

[Jan]

Dont open a new thread if there is one already. My accepted code returns same output.

[ALEXANDRIA_2]

Thanks for replying Jan
finally found my silly mistake
I forgot to print a new line after the last output

[zooom]

Code: Select all

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<numeric>
using namespace std;

int main(){
 int testcases;
 cin>>testcases;
 string emptyss;
 getline(cin,emptyss);
 getline(cin,emptyss);
 bool ans=false;
	while(testcases>0){
		if(ans){
		cout<<endl;
		}
	ans=true;
	string dummy;
	vector<string>finals(100);
	vector<string>charac(100);
		for(int i=0;i<finals.size();i++){
		finals[i]=charac[i]="zzzzzz";
		}
	int m=0;
		while(getline(cin,dummy)){
			if(dummy==""){
			break;
			}
//cout<<dummy<<endl;
		finals[m]=dummy;
		m++;
		}
//for(int i=0;i<6;i++){
//cout<<finals[i]<<endl;
//}
	m=0;
	sort(finals.begin(),finals.end());
	string itr;
		for(int i=0;i<finals.size();i++){
			if(finals[i]=="zzzzzz"){
			break;
			}
			for(int j=0;j<finals[i].length();j++){
				if(finals[i].at(j)!=32){
					itr+=finals[i].substr(j,1);
				}
			}
//cout<<itr<<endl;
		vector<char>anand(itr.length());
			for(int i=0;i<itr.length();i++){
				anand[i]=(char)itr[i];
			}
			itr="";
		sort(anand.begin(),anand.end());
			for(int i=0;i<anand.size();i++){
				itr+=(char)anand[i];
			}
		charac[i]=itr;
		itr="";
		}
		for(int i=0;i<charac.size();i++){
			if(charac[i]=="zzzzzz"){
			break;
			}
			for(int j=i+1;j<charac.size()-1;j++){
				if(charac[i]==charac[j]){
				cout<<finals[i]<<" "<<"="<<" "<<finals[j]<<endl;
				}
			}
		}
	testcases--;
	}
 }

I wrote The following code checked against the inputs given above .. the output was in the same order .. please anyone tell me the error why i am getting WA!

[Obaida]

I am getting WA for this problem..
Any one who got recent Acc plz reply the output of this case:

Code: Select all

1

aaaa
aaa a
a           aaa
aaaa
aaaa

My output is:

Code: Select all

aaaa = aaaa
aaaa = aaa a
aaaa = a           aaa
aaa a = a           aaa

>>i searched uvatoolkit bt this problem don't exists.
Advance thank for helping..

[mf]

I am getting WA for this problem..
Any one who got recent Acc plz reply the output of this case:

Code: Select all

1

aaaa
aaa a
a           aaa
aaaa
aaaa

I get:

Code: Select all

a           aaa = aaa a
a           aaa = aaaa
aaa a = aaaa

[Obaida]

I changed my code a bit. Got the above case right but still getting wa(such a simple code!!).
Would you please help me with some test case?
And here is my code:-

Code: Select all

removed