Problem - C - Codeforces Well, I came up with an algorithm to look at every previous operations in each operation, and splitting bifurcating paths into two unique paths. That gave me a TLE though I believe is good to go in terms of time co…

Problem - B - Codeforces Silly I really failed this one in the real test. Should have calmed down and check all cases manually since there weren't many to come up. void solve(){ string s; cin >> s; int dec_pos = s.size(); for( int i = 0; i …