We can virtually give a contest, to solve the problems in contest-kind of environment. I see some advantages of it.

But, we don't get a expected rating after the virtual contest ends.

Any way to see what would have been the expected rating change after giving a virtual contest?

I would be grateful, if anyone could

• point out why the below solution TLEd?

• give hints to improve the code running time?

Logic explanation in plain english:

• Create a dictionary of string, int.

• the key stores the patterns of len 19 for each number w.r.t to parity of each digit e.g ( 00000000101010111011 )

• the count of pattern is incremented, decremented accordingly.

• Ans is just a dictionary lookup for given pattern

20594344

Contest 371 DIV2 Problem C : http://mirror.codeforces.com/contest/714/problem/C

Hello Friends, Codeforces has done many things right, that other OJs lack. The problem number is also conveying the information of difficulty i.e. A, B are easy, C is medium, D and E are hard. Also it is prefixed with the contest-url id , making it easy to navigate to the problem (and all the things linked to it like editorial, standings, etc).

Feature Request: It would be more beneficial if somehow the problem id also displayed which div it belongs to, since Div1 A is pretty hard as compared to Div2 A, but there is no way of knowing. The is good majority of people that'll always be in Div2(since beginners start from here).

Suggesstion: If possible, we can append 'D2' or 'D1' to respective problem ids.

Please let me know your thoughts, and if possible please make it reach to MikeMirzayanov :)

This problem has a tag binary-search and also on a2oj ladder it's given under binary search. Div2 : B http://mirror.codeforces.com/contest/492/problem/B

I solved it by plain sorting the array and finding the max difference as given in the editorial.

But, I would like to know how to solve this by binary search? Any hints/pointers please? I am curious to do this with a new approach.

Can anyone help with explaining the sample test case for 'Stones Game' on A2Oj, Ladder 2, problem no. 5, problemId = 8

https://a2oj.com/p?ID=8

It says, m player, n stones and need to find whether player with index idx has a optimal strategy to win the game or not? Yes/No answer to be given.

But, if we look at example 1

   2 2 2

Here, players=2, stones = 2 and Answer to find for player index =2. Let's call players by name A and B, so we have following scenarios

   A | B | A | B
   0   1              ->> B wins
   1   1              ->> B wins
   2   0              ->> A WINS

The answer to this test case given on a2oj is YES, but clearly we can see that B can't win in 3rd case. Am I missing something here? Can anyone please help me out?

Thanks,

Example: http://mirror.codeforces.com/contest/680/standings the 48th user in standings (kllljee) has successfully hacked 6 submission. I would like to know what input he gave during hacking the submission. Can this be seen anywhere?

I only see a list as shown in image.

EDIT: This is regarding viewing hacks after the contest.

Thanks,