May Long Contest Editorial
codedecode0111
157

I think time complexity of CHEFCODE problem should be O(n* 2^(n/2)).

Thanks for Editorials it really helped us.

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.