philolo1's blog

Problemset : Counting of solved problem twice
By philolo1, 13 years ago, In English
I just realised something: If you solved the problems of Division 2 and then you solve the problems of Division one, than the problems that are in both Divisions are counted not just once, but for every division.
I do not like it, because I want to know how many problems I solved on the problemset, but not committing the problems on Division one is not an option, because it looks like I did not solve them.
  • Vote: I like it
  • +13
  • Vote: I do not like it

13 years ago, # |
  Vote: I like it -17 Vote: I do not like it

Is it so important for you? You are solving the problems, the counter isn't the main thing on CodeForces.
Moreover, there can be differences in testsets for the first div and for the second.


→ Reply
  • 13 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it
    It is not that important, but I just wanted to point this out.
    → Reply
  • 13 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it
    If you really want to diffentiate between the problems, then you should use different limits on them to make DIV1-harder, or DIV2 simpler. So question is, why should it pass for DIV-2 and not for DIV-1, only because the hacks were diffent. Should they not be combined.
    → Reply
»
10 years ago, # |
← Rev. 3   Vote: I like it -8 Vote: I do not like it

I totally agree. They should be counted as one problem so that counter shows the correct number of problems that someone solved.

PS: I know that it's changed, but it remains the same for the old problems, and I think that they also should be changed.

→ Reply