please write in c++.DO NOT WRITE MAIN.CPP,only need to write proj0.cpp

Consider combinatorial puzzles,for example, one such puzzle is POT + PAN = BIB. In these puzzles, you must assign each letter a distinct digit, such that if we substitute the digits in place of the letters, the resulting mathematical equation is true. In our continuing example, if we set P=2, O=3, T=1, A=7, N=4, B=5, and I=0, we get 231 + 274 = 505..

in the file proj0.cpp, you will find an incomplete implementation for:

bool verifySolution(std::string s1, std::string s2, std::string s3, const std::map & mapping)

Your assignment is to finish implementing this. To find out what the proposed mapping has for s1[0] (the first character in std::string s1), you can use the member function at of the map class: that is, mapping.at(s[0]). You are not required to check that the digits assigned are distinct, merely that it satisfies the equation.

DO NOT WRITE MAIN.CPP,only need to write proj0.cpp. no need to use recursion

proj0.cpp code:

#include

#include

#include "proj0.hpp"

bool verifySolution(std::string s1, std::string s2, std::string s3, const std::map & mapping)

{

return false; // FYI, this stub is not a correct solution.

}

Main.cpp:

#include "projo.hpp" int main() return 0