It would be nice to see the category of training tasks like DP, Graph Theory etc.
Problem Category
But it definitely should be an optional feature because knowing what kind of problem you are dealing with can drastically reduce the fun of solving it.
You're right but generally category of problem is obvious. I mean you know that it is DP but you don't know how to solve... This can be good for training a specific topic I guess.
I don't think that's good idea.
In a real competition, nobody will tell you that is graph theory, that is dp, that is ... etz. I think you shoul try to figure it out alone. And its often obviously what to use, the problem is to realize it.
I'm just telling it for training, not competition.. If someone knows that he should focus on dp, its useless to scan all problems to find one and start solving it..Main point here is training a specific topic, not figuring out what the category of problem is..
I understand. So when you want to train DP, then its easy to find tasks abou it.. Not bad at all,,
Yes that's excatly what I'm saying :)
I agree with gates.
The idea is bad because when you want to solve a task then you would already know what do you need to use. Maybe it would be good to put some tutorial tasks in such categories.
I agree with tutorial tasks in categories...
And ortschun, there is even another problem. Some tasks cannot be uniquely classified to some type of problem.
And ortschun, there is even another problem. Some tasks cannot be uniquely classified to some type of problem.
In a task, you generally know which technique you should use, that's not a problem, the problem is how to use it. I mean you know that you should use DP but main point is generating a recurrence, or you can easily say that a problem is related to graphs.So just specifying the category won't be a big deal I guess? Of course by "category" I mean general categories. Not like "minimum spanning tree,dijskstra" etc.
@ortschun: I don't agree with you. Sometimes it is hard to see graph problem, sometimes it is hard to see DP problem. So I think this is bad idea.
Alright. It was just an idea xP
@ortschun:
You say that it is always obvious what kind of problem it is, but that is incorrect. For example, many problems at the first glance could seem like Greedy problems while in fact they are DP problems and vice versa. Many graph - represented problems are actually DP and other problems are Graph problems although it is not trivial to realize that. And so on.
In addition, what would you suggest to do with problems that involves various methods. Writing all of them would definitely ruin the solving process, writing none of them would be meaningless for achievement of the goal you raised.
Well, I agree that such feature would be useful for training purposes at particular field. But then there should be an advanced search or something like that to be able to find problems that require certain methods and maybe of certain difficulity. But in no other way problems should be labeled.
You say that it is always obvious what kind of problem it is, but that is incorrect. For example, many problems at the first glance could seem like Greedy problems while in fact they are DP problems and vice versa. Many graph - represented problems are actually DP and other problems are Graph problems although it is not trivial to realize that. And so on.
In addition, what would you suggest to do with problems that involves various methods. Writing all of them would definitely ruin the solving process, writing none of them would be meaningless for achievement of the goal you raised.
Well, I agree that such feature would be useful for training purposes at particular field. But then there should be an advanced search or something like that to be able to find problems that require certain methods and maybe of certain difficulity. But in no other way problems should be labeled.
The idea is quite nice when it comes to find tasks or train in a specific field. I think that the category should be "hide" by default, or it can only be seen when you solved it (Apart from that, when you search for DP problems, you can see what problems are, or can be solved, by a DP-algorithm).