/* Strange Root A number has a strange root if its square and square root share any digit. For example, 2 has a strange root because the square root of 2 equals 1.414 and it contains 4 (which is the square of 2). Examples: Input: 11 Output: true (the square root of 11 is 3.317, the square of 11 is 121. They share the same digit (1).) Input: 24 Output: false (the square root of 24 (4.899) and square (576) do not share any digits) Write a program to check if the user input has a strange root or not. */ #include #include using namespace std; namespace { inline string num_square(int num){ return to_string(num*num); } inline string num_sroot(int num){ return to_string(sqrt(num)); } bool is_strangeRoot(int num){ string sqr{num_square(num)}; string root{num_sroot(num)}; cout << "\nsqr = " << sqr << "\nroot = " << root << '\n'; string src{sqr}, dst{root}; // chars from src string are // searched in dst string. // try to ensure src string is // always shorter if(src.size() > dst.size()) swap(src, dst); for(auto c : src) if(auto pos=dst.find(c); pos != string::npos) { cout << "common digit = " << c << '\n'; return true; } cout << "common digit = none\n"; return false; } // end is_strangeRoot } // end namespace int main() { // check the numbers from 2 to 1000 and // display if they have strange root for(int num{2}; num <= 1000; ++num) cout << num << " has strange root : " << (is_strangeRoot(num) ? "Yes\n\n" : "No\n\n"); }

[Challenge] Strange Root.cpp