Maximum Xor permutation

rahul_prashar · January 21, 2020, 4:34pm

sir can u please help me to correct my code only 1 test case is passing i have explained my code with comments

Jun18APP0015 · January 22, 2020, 12:02pm

Share your code after giving proper indentation. Its not readable.

Robin_rst · January 30, 2020, 9:05pm

Just brute force the solution since 2^10 can be upto only 1024. So for particular number of one’s in a string , precompute the numbers formed with that number of one’s and then just find max xor among any three number with that particular number of one’s.

For better understanding , please do refer this -:
Comments are added.

github.com

robinrst/HackerBlocks/blob/master/MaximumXorPermutation.cpp

#include        "algorithm"
#include        "iostream"
#include        "numeric"
#include        "iomanip"
#include        "cstring"
#include        "math.h"
#include        "bitset"
#include        "string"
#include        "vector"
#include        "ctime"
#include        "queue"
#include        "stack"
#include        "map"
#include        "set"

#include        "ext/pb_ds/assoc_container.hpp" // Common file
#include        "ext/pb_ds/tree_policy.hpp" // Including tree_order_statistics_node_update
#include        "ext/pb_ds/detail/standard_policies.hpp"

using namespace std;

This file has been truncated. show original

Robin_rst · February 6, 2020, 4:26pm

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.