#include #include #include using namespace std; /* This program is in response to a question posted by 1001pepi * https://www.sololearn.com/Discuss/2636124/binary-maximum-number * * Given a string containing only 0's and 1's and assuming that we * can perform left cyclic shift how can we find the permutation that * represents the maximum binary number? * * Expected inputs are the number of bit patterns to process followed * by that number of binary bit patterns. * * The patterns may be of any length up to 64-bits. No attempt has * been made to validate user input. Sample Input 3 00000001 10100001 00001111 Sample Output 11110000 240 Sample Input 3 000000001 1010101 1111 Sample Output 100000000 256 */ // declare functions void rotateStringLeft(string &str); unsigned long getMaxPermutationLeft(string str); string getMaxPattern(unsigned long len, int val); int main(void) { // declare variables unsigned long thismax, maxval; string tststr, maxpattern; int num; maxval = 0; cin >> num; // get number of binary patterns to process for (int i = 0; i < num; i++) { cin >> tststr; // get the binary pattern // determine maximum value for this pattern thismax = getMaxPermutationLeft(tststr); if (thismax > maxval) { maxval = thismax; maxpattern = getMaxPattern(tststr.length(), maxval); } } cout << maxpattern << " " << maxval; return 0; } // function to rotate a string left by one character // removes the first character of the string and places // it at the end of the string. void rotateStringLeft(string &str) { char msb = str[0]; str.erase(0, 1); str.append(&msb, 1); } // function to determine the highest value permutation of // a binary pattern using rotate left. unsigned long getMaxPermutationLeft(string str) { unsigned long thisval; int count = str.length(); unsigned long maxval = 0; do { thisval = stoul(str, nullptr, 2); if (maxval < thisval) { maxval = thisval; } count--; rotateStringLeft(str); } while (count > 0); return maxval; } // function to generate the bit pattern of a value // containing the specified number of bits. string getMaxPattern(unsigned long len, int val) { bitset<64> bitval(val); return bitval.to_string().substr(64-len, len); } /* * The author of this work hereby waives all claim of copyright * (economic and moral) in this work and immediately places it in * the public domain; it may be used, distorted or destroyed in * any manner whatsoever without further attribution or notice to * the creator. */

Binary Pattern Maximum Number