/* Mirielle🐶's 'Encryption [ Coding Challenge ] To encrypt an English text using Mirielle🐶's scheme, First, the spaces are removed from the text. Let L be the length of this text. Then, characters are written into a grid, whose rows and columns have the following constraints: For example, the sentence "if man was meant to stay on the ground god would have given us roots", after removing spaces, is 54 characters long. The square root of 54 is between 7 and 8, so it is written in the form of a grid with 7 rows and 8 columns. ifmanwas meanttos tayonthe groundgo dwouldha vegivenu sroots Ensure that rows x column >= L If multiple grids satisfy the above conditions, choose the one with the minimum area. rows x columns >= L The encoded message is obtained by displaying the characters in a column, inserting a space, and then displaying the next column and inserting a space, and so on. For example, the encoded message for the above rectangle is shown in the comment https://www.sololearn.com/post/160073/?ref=app */ #include #include #include #include #include #include using namespace std; using V = valarray; int main() { string sample[]{ "", "*", "@@", "haveaniceday", "this is a test", "~Swim~", "Lorem ipsum dolor sit amet", "if man was meant to stay on " "the ground god would have " "given us roots", "feed the dog", "chill out :)", "A Fool and His Money Are Soon " "Parted.", "chillpill-", " Loremipsum dolorsita met", "... --- ...", "Loremipsumdolorsitamet", }; auto encode = [](auto ts){ // Copy the test string to the array and // append the string of blank space of // appropriate length. Then partition the // array by moving all the spaces to the // right. // The function returns iterator to // the first space if there is one // else the itetator to the last // character to the string if there // is none, but we will always have some // blank space. // The itetator returned is used to // calculate the dimensions of our // matrix auto len = ceil(sqrt(ts.size())); V v(move(string(ts + string(len * len - ts.size(),' ')).data()), len * len); auto p = stable_partition(begin(v), end(v), [](auto ch){return ch!=' ';}); len = ceil(sqrt(p-begin(v))); stringstream ss; for(int i = 0; i < len; ++i) { V ov = v[slice(i, len, len)]; copy_if(begin(ov), end(ov), ostream_iterator{ss,""}, [](auto ch){ return !isspace(ch);}); ss << ' '; } return ss.str(); }; transform(begin(sample),end(sample),ostream_iterator{cout,"\n\n"},[=](auto ts){cout << "Original: " << ts << '\n' << "Encoded: "; return encode(ts); }); }

[Challenge] Mirielle🐶's 'Encryption.cpp