Question

Game in C++. Need to make use of object-oriented techniques, i.e. implementation of classes and objects. Given a file containing a list of 4-letter words, the program needs to make the user guess. Each word difference is a minus one point. Each match is plus 4 points. String in capital or lower case should not pose a problem. The nearest match condition is the least number of difference between the two words.

For example:

(file.txt)

JAZZ BUZZ FUZZ FIZZ QUIZ

(Program)

Enter a four-letter word which ends in 'z': jazz

Points +4

Total: 4

Enter a four-letter word which ends in 'z': bizz

Nearest match: BUZZ FIZZ (1 change needed)

Points -1

Total: 3

Enter a four-letter word which ends in 'z': jazz

You entered that already! Try a new one...

Enter a four-letter word which ends in 'z': just

Word does not end in 'z'. Try a new one...

Answer 1

Code:

#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
class A
{
   public:
   vector<string> tokenise(string fullpath, char chr)//returns tokens from a sentence by splitting words seperated by space
   {
       string strdup = "";//inner string which stores each word
       int i = 0; vector<string>tokens;
       for (i = 0; fullpath[i]; i++)//read entire string
       {
           if (fullpath[i] != chr)//if it is not a space add it to strdup
           {
               strdup += fullpath[i];
           }
           else
           {
               tokens.push_back(strdup);//otherwise add the string obtained tokens
               strdup = "";//initialise for next word
           }
       }
       tokens.push_back(strdup);
       return tokens;//return
   }
   string upp(string a)//converts entire string to uppercase
   {  
       transform(a.begin(), a.end(), a.begin(), ::toupper);;
       return a;
   }
   string low(string a)//converts entire string to lowercase
   {
       transform(a.begin(), a.end(), a.begin(), ::tolower);;
       return a;
   }
   int comp(string a, string b)//gives no. of non-matching characters
   {
       int ans = 0;a=upp(a);b=upp(b);
       for(int i=0;i<a.size();i++)
       {
           if(a[i]!=b[i]) ans++;
       }
       return ans;
   }
   vector<string> read_file()//returns words from a file
   {
       ifstream file ("file.txt");string line;
       vector<string>res, res2;
       while( getline ( file, line) )//read file line by line
       {
           res2 = tokenise(line,' ');//tokenise
           for(int i = 0; i < res2.size(); i++)//push tokens into res
           {
               res.push_back(res2[i]);
           }
       }
       return res;
   }
   void operate(vector<string> res, map<string,int> m)//objective function
   {
       int total = 0, cnt = 0;
       while(1)
       {
           cout << "Enter a four-letter word which ends in 'z': ";
           string inp;cin>>inp;
           if(m.find(low(inp)) == m.end() && m.find(upp(inp)) == m.end())//if string is not present in required words
           {
               if(inp[inp.size()-1] != 'z' && inp[inp.size()-1] != 'Z')//if last letter isn't z
               {
                   cout<<"Word does not end in 'z'. Try a new one..."<<endl;
                   continue;
               }
               int ans = 5, num;vector<string> loc;//ans has no of non-matching characters
               for(map<string,int>::iterator iter = m.begin(); iter != m.end(); ++iter)
               {
                   num=comp(iter->first, inp);
                   if(num<ans)//if there is a string with less no. of non-matching characters
                   {
                       ans = num;loc.clear();loc.push_back(iter->first);
                   }
                   else if(num==ans)//if the string has same no. of non matching characters as that of a previously obtained one
                   {
                       loc.push_back(iter->first);
                   }
               }
               cout<<"Nearest match: ";
               for(int k=0;k<loc.size();k++) cout<<loc[k]<<" ";//print all near matching strings
               cout<<"("<<ans<<" change needed)"<<endl;
               cout<<"Points -"<<ans<<endl;
               total-=ans;
               cout<<"Total: "<<total<<endl;
           }
           else if(m[upp(inp)] == 1)//if inp has already been guessed
           {
               cout<<"You entered that already! Try a new one..."<<endl;
           }
           else//if inp hadn't been guessed yet
           {
               cout<<"Points +4"<<endl;
               total += 4;
               cout<<"Total: "<<total<<endl;
               m[upp(inp)]=1;
               cnt++;//no of correct guesses
           }
           if(cnt == m.size()) break;//no of correct guesses is equal to available words, stop asking
       }
   }
};  
int main()
{
   A obj;
   vector<string>res=obj.read_file();
   map<string, int>m;//map stores 0 if the word hadn't been guessed, 1 otherwise
   for(int i = 0; i < res.size(); i++)
   {
       m.insert(make_pair(res[i], 0));
   }
   obj.operate(res, m);
   return 0;
}

Output: