Ripatti's blog

Codeforces Beta Round #59 (Div. 2)
By Ripatti, 13 years ago, translation, In English
Hello everyone!

I am problems' author of today round. I hope you will like this contest :)

I thank Artem Rakhov, Maria Belova and Dmitry Matov for help in preparing of the round.

Good luck!

UPD.
Winner is levlam.
Tutorial.
  • Vote: I like it
  • +91
  • Vote: I do not like it

13 years ago, # |
  Vote: I like it +7 Vote: I do not like it
Wish it to be nice ;) good job anyway ;)
→ Reply
13 years ago, # |
  Vote: I like it +16 Vote: I do not like it
this is my first contest.
wish it to be nice. 
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Good Luck :) I wish you high rating after this contest!
    → Reply
13 years ago, # |
  Vote: I like it +2 Vote: I do not like it
Hope for a good contest. :)
→ Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
It was a nice contest .. really one word .. "Nice" :)
→ Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Nice problemset,thanks
→ Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Can anyone explain the 1st test case for "D. Dividing Island"?
i.e.
Input
3 4 2 2 3
5 8 3
Output
YES
aaabb
aabbb
cbb..
ccb..
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Output is one of possible dividings of icelands with 5 a's, 8 b's and 3 c's

    Maybe you should ask more specific question?
    → Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
In problem C,whats 34th test case ?
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    output the leading zero.
    see sample via my submission -> source ID -> test case is on the bottom.
    → Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    answer is a number with leading zero
    I have just had my solution fault on the same test :(
    → Reply
13 years ago, # |
  Vote: I like it +1 Vote: I do not like it
It was a good contest. Thank you ;)
→ Reply
13 years ago, # |
  Vote: I like it +1 Vote: I do not like it
It was really nice contest :)
→ Reply
13 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it
Understandable problem description +Perfect Language are the main advantages of the today's Round
in contrast to Round # 58
Problem E needs more clarification!!
Karlsson wins when he makes the final chocolates eating !!?
 and the same for Lillebror!?
this was ambiguous point.
/////////////
Question off the round - what's the effect of checking out of the round button in the right top of the standings page !?
I'm afraid that makes me out of the today contest !!! :D
 
 
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it
    yeah! today's problem statements are more easy to understand.
    → Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
When will the rating change?
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Now the rating is changed
    But hopelessly ;My rating decreased although today's rank [173] is my best rank and also today's score is my best score 1240
    I'm trying to understand the rating system mechanism from here
    http://codeforces.com/blog/entry/102
    but no sufficient details or (examples ) !!!
      
    → Reply
    • 13 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it
      Rating isn't depend on your score.
      It only depend on your place, count of players and their(and your) ratings.
      Maybe, your rating decreased because of small number of participants or most of all has rating less than you.
      → Reply
      • 13 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it
        Really awesome mechanism to reflect how skilled u r amongst other participant..
        → Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Who is going to publish the solution and analysis for today's round..i am waiting for it....
→ Reply
13 years ago, # |
  Vote: I like it +1 Vote: I do not like it
Nice Problems. Thanks
→ Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Thanks for this round! It was great!
→ Reply
13 years ago, # |
  Vote: I like it 0 Vote: I do not like it
What is the O(n) solution for B ??
→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    int ans=0;
    FOR(a,1,n) if (rank[a]<k) ans=max(ans, k-rank[a]+a-1);
    cout << ans;
    → Reply