Question

Max profit

You are given two binary strings S and of leg cost of een

Consider a non-empty substring 51 of 5 and a rom empty sing 21 od Gales,

exclusive or of St and QI.

You are given a Profit function:

- Profit=floor(len(X)/2 2X10) where X10 is the decimal value of binary representation and m

Notes

• A substring is a contiguous sequence of characters within a string. For example the list of all non-empty substings of the son be "apple", "app", "pple", "app". "ppl", "ple", "ap", "pp, pl, "le. a. pe

• Exclusive-or compares two input bits and generates one output bit. If the bits are the same, the result is 0. If the bits are

1.

In the string X, the leftmost character is treated as the MSB (Most Significant Bit) and the rightmost character is treat Significant Bit) of the binary representation. hi​

Answer 1

Answer:

worthless app

Explanation:

idiotttttttttttttttttttttttttt