Thanks! This platform seems really interesting for challenging and coding with friends.

The final Round is scheduled on 13th Nov, 12 PM (IST); we will mail the test link and other details to qualified teams. Still, if you have any doubts, you can dm me

I got my prize but instead of Noise Earbuds, I received Boat Earbuds.

I think it would be better if you have given this feedback voting option in editorial blog instead of announcement blog, Anyway it's a great initiative.

This site contains some of the topic-wise questions of atcoder. But it doesn't have tags for many problems so if atcoder brings official tags feature,it will be more helpful.

This comment...

And I'm realizing after reading your comment :(

n will always in the form n=a^i+b*j Proof:- Let at any point n=a^x+b*y now

1) If we multiply a — n=a*(a^x+b*y)=a^(x+1)+b*a*y = a^i+b*j (let x+1=i and a*y=j)

2) If we add b — n=a^x+b*y+b = a^x+b*(y+1) = a^i+b*j (let y+1=j)

Read the blog comments, score distribution and check the profile of my registered friends.

You can refer Codeforces EDU section. It consists of a great source of Tutorials with problems to practice it.

Same here, That means I had read the wrong question and still my code passed the pretests... :) Very weak pretest for div2 D :(

Here is an article on assertion article Here is my yesterday code, although it failed still u can see how I used assert. Code link

In interective problems u can use assertion on number of queries to make sure whether it is wrong ans or query limit exceeded

Thanks a lot, so should I add it to my template and use whenever i want to use unordered_map, or do i need to change something in struct anytime?

Exactly same thing happened with me too, It was my myth that unordered_map is always faster than map . See this comment and blog u will understand. Comment Blog

But in either case complexity will not increase from nlogn...

In problem F, complexity of my code is O(nlogn) which is fine according to constraints but it is giving TLE in system testing can anyone please find out the problem. solution link

Accepted code link: https://cses.fi/paste/32323f6cf9bbab6019bdd6/

How to delete, I have set 1 template from preferences and no template left when I deleted that one.

Update: It is solved now , Thanks....

Whenever I try to submit to codeforces CP editor is asking me to select language. PS: I have manually set CF tools through preferences. Anyone please help me out in this....

As a tester I must say problems are really interesting and well written and please notice unusual solving time. Good luck to all...

Erase function in Vector takes O(n) complexity so it will cause TLE. We have to use ordered set which takes O(log n) complexity for erase function. For more information You Can refer to these links-

For 10. Playlist I used two-pointer technique with sliding window concept, It is much more intuitive.

Keep on increasing window length, while we have subarray a with unique numbers. As soon as we find a duplicate, we delete from the array till the subarray does not contain duplicate