I'm getting a TLE with this code and I'm carious to know the exact reason , also I want to calculate it's complexity , any help ?

Problem : Here

Submission : Here

Thanks in advance !

Currently i encountered a Div2-500 Problem at SRM 331 here

When I checked the editorial and the solutions , I found nearly all the solutions the users submitted or the author talked in the editorial was by using bitmask

Why it was so obvious for many users that it can be solved using Bitmasks ?

What are the keywords of a problem that tells us that it can be solved by Bitmasks ? What are the best bitmask problems for someone to start with ?

Few months left for the ACM National competition here in Egypt , and I think that this is time to set a good plan for training

As you know , training with a team is a total different story from training individual, and I have never experienced training as a member of a team before.

What do you think is the best training plan for a team ? On the long run and the short run ?

Is there any way to keep tracking the number of the problems I have solved ?

Is there any website that can tell me how many problems I have solved on different online judges , and even tell me how many times I got WA or TLE and all this sort of information to keep monitoring my progress ?

A year passed since I joined codeforces , and now I'm entering the new year with better experience and momentum

Do anyone have a training plan for this year ? How will your training differ this year from the other year ?

if anyone have good ideas and hints to give that I can use them in my training this year , I will be grateful for sure =)