Hello everyone!
I'm looking for the time complexity of the builder of c++ regex object. From a fast web search, i didn't find an answer (at least from the top 3 google search results lol). The stackoverflow's answer does not give an isnight of what it's happening in the constructor.
If you wonder why i'm looking for this, here are my two submission for the problem 1800A - Is It a Cat?.
