//by bell /* [Challenge] Shift 'em bits! by Zuke You work at a bit-shifting company dealing with strings of bits that only contain a single 1-bit and have 0 for the other bits, e.g. "000100". You organize strings of similar length into tables; they look like this: 00100 00001 10000 10000 01000 Your obsessive compulsive boss is demanding that all 1s in a table line up in a single column. To do that, you are only allowed to shift each 1-bit of a row to the left or the right: 01000 # << 1 01000 # << 3 01000 # >> 1 01000 # >> 1 01000 # 6 shifts total Your computer runs on an AI. And this morning when you booted your system, you clumsily set the 'greedy' flag to True. Now your AI computer asks for money every time you command it to do something. It decides to charge $1 for each unit of bit-shift. Given that you've spent half your money on ice cream and video games, you'd like to keep the rest to yourself. Given the position of 1s at each row of the table, print the minimum cost. > 3 5 1 1 2 # example given above 6 > 1 9 2 6 12 */ #include #include #include #include using namespace std; int main() { int n=5,funds=30,itab=0,k,median=0,me=0; const int N=12; double cost; vector vbox(N,0); srand(time(NULL)); n=rand()%4+3; cout<<"Tables contain "<0&&itab<3){ cost=0; median=0; me=0; cout<<"The "<n){ median=-n; me=((me)?(me+i+1):(2*i+2)); } if((2*median)==n){ me=i+1; if((n%2))median=-n; } } me/=2; for(int i=0;i0)?"Hoorray! You still have funds to spend on ice cream!":"You are broke, sorry...")<

shiftBitsZuke