You are viewing a single comment's thread. Return to all comments →
This problem is defined as that n is the length of the original decoded string.
But in sample input 2 and TC #12,
10 3 1110011011
The output is
10000101
The length of the output in sample case is 8, so the input 'n' has to be 8.
Cipher
You are viewing a single comment's thread. Return to all comments →
This problem is defined as that n is the length of the original decoded string.
But in sample input 2 and TC #12,
The output is
10000101
The length of the output in sample case is 8, so the input 'n' has to be 8.