Problem in CPRMT WA

[spd_sof]

I am getting wrong answer for the following problem.....

#include <iostream>
#include <list>
#include <string>
#include <cctype>
#include<stdio.h>
#include<string.h>
using namespace std;
void Msort(char*a,int size);
void init(int*);
int c[256];
int main()
{
	char str1[1010],str2[1010];
	int i;
	while(cin>>str1>>str2)
	{
	  Msort(str1,strlen(str1));	
	  Msort(str2,strlen(str2));
	  //cout<<str1<<"\n";
	  //cout<<str2;
	for(i=0;str1[i];i++)
		c[str1[i]]++;
     /*for(i=0;i<256;i++)
	printf("%d",c[i]);*/
	
for(i=0;str2[i];i++)
	if(c[str2[i]]!=0) { printf("%c",str2[i]);  c[str2[i]]=0;}	
printf("\n");     	
init(c);		
}
return 0;
}
void Msort(char*a,int size){
      int i,j;
char temp;

for(i=0;i<size;i++){
    for(j=0;j<size;j++)
	{
          if(a[i]<a[j]){
	temp=a[i];
	   a[i]=a[j];
	  a[j]=temp;
	  }
	}
}
}
void init(int*arr){
	int i=0;
	for(i=0;i<256;i++) arr[i]=0;
}

i there something wrong with the logic or are there in strange testcases

[leppyr64]

You're not checking for end of file.

[spd_sof]

how can i do that....
i did this but still getting WA
scanf("%s%s",str1,str2)!=EOF

[leppyr64]

That looks correct, tere must be something else wrong. Please post your updated code. Don't place your updated code in your original post, put it in a reply to this one. If you just edit your previous post I don't get an alert.

[spd_sof]

Hers is the updated code

#include<stdio.h>
#include<string.h>
//using namespace std;
void Msort(char*a,int size);
void init(int*);
int c[256];
int main()
{
	char str1[1010],str2[1010];
	int i;
	while(scanf("%s%s",str1,str2)!=EOF)
	{
	  Msort(str1,strlen(str1));	
	  Msort(str2,strlen(str2));
	  //cout<<str1<<"\n";
	  //cout<<str2;
	for(i=0;str1[i];i++)
		c[str1[i]]++;
     /*for(i=0;i<256;i++)
	printf("%d",c[i]);*/
	
for(i=0;str2[i];i++)
	if(c[str2[i]]!=0) { printf("%c",str2[i]);  c[str2[i]]=0;}	
printf("\n");     	
init(c);		
}
return 0;
}
void Msort(char*a,int size){
      int i,j;
char temp;

for(i=0;i<size;i++){
    for(j=0;j<size;j++)
	{
          if(a[i]<a[j]){
	temp=a[i];
	   a[i]=a[j];
	  a[j]=temp;
	  }
	}
}
}
void init(int*arr){
	int i=0;
	for(i=0;i<256;i++) arr[i]=0;
}

[leppyr64]

There's two t's in test.

[leppyr64]

"test"

[spd_sof]

"test"

sir i didnt get u... do you mean any particular test case.???

[leppyr64]

"tot" has two t's as well. So does "total". "totter" has three of them!

[spd_sof]

"tot" has two t's as well. So does "total". "totter" has three of them!

so wats the point....

[leppyr64]

Maybe you should test some of those strings, because you clearly haven't tested much at all.

[spd_sof]

Input file:
pretty 
women
walking
down
street
the
total
totter
total
test
totter
test
Output file:
e
nw
et
ot
t
et

Is there anything wrong....or am i logically incorrect

[leppyr64]

There are two t's in test and totter.

[spd_sof]

ok so the ans

for

totter
test

should be
tt and not t....is it

[leppyr64]

Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b.

Is there a permutation of "tt" that is a subsequence of "test"? Is there a permutation of "tt" that is a subsequence of "totter"?

[leppyr64]

Is that what the problem asks you for?

So what is the solution for:
test
totter

[spd_sof]

Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b.

Is there a permutation of "tt" that is a subsequence of "test"? Is there a permutation of "tt" that is a subsequence of "totter"?

i mean the

ans for
test and totter should be ett and not et

ans for
total and test should be tt and not t..

ans to your question is then
"NO"

[leppyr64]

Those answers are correct.

[spd_sof]

i finally got accepted .....thank u for ur help....

btw.... the question shld have been explained with more examples....that would have saved a lot of time..

[leppyr64]

I strongly disagree. The problem stated itself clearly and then left the work to the solver. I would prefer that this problem not even have sample input.