Question

Write a program that searches for specified words hidden within a matrix of letters.

C++ HELP -pls keep basic as possible, thanksssss

1. Read a file that the user specifies. The file will first specify the dimensions of the matrix (e.g., 20 30). These two numbers specify the number of rows in the matrix and then the number of columns in the matrix.
2. Following these two numbers, there will be a number of rows of letters. These letters should be read into your matrix row by row, column by column.
3. Following the rows of letters, there will be some number of words that might be hidden within the matrix. You are to search for these words and report 1) whether or not a given word is found within the matrix, and if so, the starting and ending matrix coordinates of the word.
4. Search for each word one at a time (i.e., read a word, search for it, report the results, and then read the next word from the file). Continue until all words have been searched for.
5. Start by creating your own file of data. You can start with a small matrix size and your own hidden words. When you’re ready, start testing one or more of the files I’m going to upload for your use.
6. To test your program, I suggest searching for the first 4 letters in the top row, then the first 4 letters in the leftmost (first) column, and then the first 4 letters starting from position [0][0] down the diagonal to the right and down. That will let you know if you are traversing the matrix properly.
7. Provide for fault-tolerance when trying to open the input file. If it doesn’t exist or can’t be found, tell the user. Also, tell the user the name of the file that can’t be found/opened. Then give the user a chance to enter another file name and try to open that file. Continue until you either find and open the file or until the user types something like “quit” or “exit.” If you feel comfortable doing so, use the perror function to report the system’s error message; then report your own error messages. Make sure your program can handle bad file names and/or non-existent files.
8. Don’t report success or failure for each word as you go. Instead, report only words that are found; but for words that are not found, shove them into a vector of strings and wait until you’ve searched for all words before reporting the words that weren’t found. Thus, you will have all successfully found words appear first -- along with their coordinates and (optionally) their direction -- and then the words that weren’t found will be listed at the end.
9. Assume that words can appear more than once in the matrix.
10. Don’t worry about wrapping around the edges of the matrix. Instead, if you hit an edge while searching, assume the word isn’t in the matrix.

FILE LOOKS LIKE THIS(HiddenWords-ComedyMovies.txt):

15 18
SCFRBOBROBERTSLOKL
TNLESREKCILSYTICRL
AOEPOBLRUAECHBUDEA
RITOTHEYOMTOLBATPH
LCHAIBAONILLAURGEI
AEKNLULDDGCISLHKLN
CRRURDBHSAGTEOPLUS
LOTCLULHLLBPCRAPLA
UMSKIROPOULALPEAAK
EHNSAHNNSTLASACCEH
LSOORADTEHSHBKCROA
EUOUFMEMECOHETHEER
SRMPARTRBTAROSAASV
SLEISTOOTHERUTLESE
NATTAHNAMSEYSLSSMY

ALLOFME
ANNIEHALL
BABE
BEINGTHERE
BIG
BOBROBERTS
BULLDURHAM
CARS
CATBALLOU
CITYSLICKERS
MEATBALLS

Answer 1

#include <bits/stdc++.h>
using namespace std;

int main() {
   string file_name;
   //input the file name
   cin>>file_name;
   //open file
   ifstream myfile(file_name);
   if(myfile.is_open())
   {
       //take input of row and coloumn
       int row,col;
       myfile>>row>>col;
       //declare char matrix
       char mat[row][col];
       //input the character matrix
       for(int i=0;i<row;i++)
       {
           for(int j=0;j<col;j++)
           myfile>>mat[i][j];
       }
       //vectors of string not found in matrix
       vector<string> notFound;
       while(!myfile.eof())
       {
           //get the word
           string word;
           getline(myfile,word);
           //push the word in noFound if word will be found it will be removed
           notFound.push_back(word);
           //start traversing the matrix
           for(int i=0;i<row;i++)
           {
               for(int j=0;j<col;j++)
               {
                   //if first character matches
                   if(word[0]==mat[i][j])
                   {
                       //bool variable to store if word is found or not
                       bool found=false;
                       //search in right direction
                       if(j+word.size()-1<col)
                       {
                           //make test string of characters of matrix from i,j to i,j+word.size()-1
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i][j+k];
                           //if test is same as word
                           if(test==word)
                           {
                               //make found is true
                               found=true;
                               //pop the string from notFound vector
                               notFound.pop_back();
                               //print the position and direction
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in right direction"<<endl;
                           }
                       }
                       //search in left direction
                       //rest is similar to above case
                       if(j-word.size()+1>=0&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i][j-k];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in left direction"<<endl;
                           }
                       }
                       //search in vertical down direction
                       if(i+word.size()-1<row&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i+k][j];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in vertical downward direction"<<endl;
                           }
                       }
                       //search in vertical up direction
                       if(i-word.size()+1>=0&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i-k][j];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in vertical upward direction"<<endl;
                           }
                       }
                       //search in diagonally down-right
                       if(i+word.size()-1<row&&j+word.size()-1<col&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i+k][j+k];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in diagonally down-right direction"<<endl;
                           }
                       }
                       //search in diagonally down-left
                       if(i+word.size()-1<row&&j-word.size()+1>=0&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i+k][j-k];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in diagonally down-left direction"<<endl;
                           }
                       }
                       //search in diagonally up-left
                       if(i-word.size()+1>=0&&j-word.size()+1>=0&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i-k][j-k];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in diagonally up-left direction"<<endl;
                           }
                       }
                       //search in diagonally up-right
                       if(i-word.size()+1>=0&&j+word.size()-1<col&&found==false)
                       {
                           string test="";
                           for(int k=0;k<word.size();k++)
                           test+=mat[i-k][j+k];
                           if(test==word)
                           {
                               found=true;
                               notFound.pop_back();
                               cout<<word<<" is found at pos "<<i<<" "<<j<<" in diagonally up-right direction"<<endl;
                           }
                       }
                   }
               }
           }
       }
       //print not found words
       cout<<"The words not found are"<<endl;
       for(int i=0;i<notFound.size();i++)
       cout<<notFound[i]<<endl;
       myfile.close();
   }
   //if file can not be opened inform user
   else
   {
       cout<<"The file is not found"<<endl;
   }
   return 0;
}

Output of code run in input given in question