to find best matches b/w two couples by comparing their answers...

EDN Admin · Jul 8, 2012

PLZZZZ....HELP ME TO SOLVE THIS PROBLEM....I HAV TRIED BUT THEIR ARE MANY RUN TIME ERRORS... 
 
DEFINITION 
Class Name: MatchMaker 
Method Name: getBestMatches 
Paramaters: String[], String, int 
Returns: String[] 
Method signature (be sure your method is public): String[] 
getBestMatches(String[] members, String currentUser, int sf); 
(be sure your method is public) 
 
PROBLEM STATEMENT 
A new online match making company needs some software to help find the "perfect 
couples". People who sign up answer a series of multiple-choice questions. 
Then, when a member makes a "Get Best Mates" request, the software returns a 
list of users whose gender matches the requested gender and whose answers to 
the questions were equal to or greater than a similarity factor when compared 
to the users answers. 
 
Implement a class MatchMaker, which contains a method getBestMatches. The 
method takes as parameters a String[] members, String currentUser, and an int sf: 
- members contains information about all the members. Elements of members are 
of the form "NAME G D X X X X X X X X X X" 
* NAME represents the members name 
* G represents the gender of the current user. 
* D represents the requested gender of the potential mate. 
* Each X indicates the members answer to one of the multiple-choice 
questions. The first X is the answer to the first question, the second is the 
answer to the second question, et cetera. 
- currentUser is the name of the user who made the "Get Best Mates" request. 
- sf is an integer representing the similarity factor. 
 
The method returns a String[] consisting of members names who have at least sf 
identical answers to currentUser and are of the requested gender. The names 
should be returned in order from most identical answers to least. If two 
members have the same number of identical answers as the currentUser, the names 
should be returned in the same relative order they were inputted. 
 
Inputs are valid if all of 
the following criteria are met: 
- members will have between 1 and 50 elements, inclusive. 
- Each element of members will have a length between 7 and 44, inclusive. 
- NAME will have a length between 1 and 20, inclusive, and only contain 
uppercase letters A-Z. 
- G can be either an uppercase M or an uppercase F. 
- D can be either an uppercase M or an uppercase F. 
- Each X is a capital letter (A-D). 
- The number of Xs in each element of the members is equal. The number of Xs 
will be between 1 and 10, inclusive. 
- No two elements will have the same NAME. 
- Names are case sensitive. 
- currentUser consists of between 1 and 20, inclusive, uppercase letters, A-Z, 
and must be a member. 
- sf is an int between 1 and 10, inclusive. 
- sf must be less than or equal to the number of answers (Xs) of the members. 
 
NOTES 
The currentUser should not be included in the returned list of potential mates. 
 
 
EXAMPLES 
 
For the following examples, assume members = 
{"BETTY F M A A C C", 
"TOM M F A D C A", 
"SUE F M D D D D", 
"ELLEN F M A A C A", 
"JOE M F A A C A", 
"ED M F A D D A", 
"SALLY F M C D A B", 
"MARGE F M A A C C"} 
 
If currentUser="BETTY" and sf=2, BETTY and TOM have two identical answers and 
BETTY and JOE have three identical answers, so the method should return 
{"JOE","TOM"}. 
 
If currentUser="JOE" and sf=1, the method should return 
{"ELLEN","BETTY","MARGE"}. 
If currentUser="MARGE" and sf=4, the method should return [].....this z ma code:
#include<iostream> 
#include<string> 
using namespace std; 
class matchMaker 
{ 
<span style="white-space

re public: 
<span style="white-space

re string[] getBestMatches(string members[], string currentUser, int sf) 
<span style="white-space

re { 
<span style="white-space

re <span style="white-space

re int i=0,scount=0,x; 
<span style="white-space

re <span style="white-space

re string rtn[10]={0}; 
for(i=0;i<20 && scount<2;i++) 
<span style="white-space

re { 
<span style="white-space

re if(currentUser!= && scount<2) 
































} 
}; 
int main() 
{ 
matchMaker maObj; 
string str[7]={ "TOM M F A D C A", 
"SUE F M D D D D", 
"ELLEN F M A A C A", 
"JOE M F A A C A", 
"ED M F A D D A", 
"SALLY F M C D A B", 
"MARGE F M A A C C"}; 
string user="BETTY F M A A C C"; 
maObj.getBestMatches(str,user,2); 
getch(); 
return 0; 


plz help!!!

View the full article

to find best matches b/w two couples by comparing their answers...

EDN Admin

Well-known member

Similar threads