Kostroma's blog

MIPT-2015 ACM ICPC Workshop AimFund Contest Mirror, November, 29, 11-00 MSK
By Kostroma, 9 years ago, translation, In English

Hello, codeforces!

On the 18-th of November we held the contest made by our company at the MIPT-2015 ACM ICPC Workshop. The problemsetters of the contest are: zeliboba, gchebanov, Kostroma, riadwaw, yarrr, ValenKof, ArtDitel, Endagorion.

On Sunday, November, 29, at 11 a.m. MSK the unofficial translation of this contest will be held on the Yandex.Contest platform. We invite all of you to participate, being quite sure that everyone will find the problems interesting for them.

P.S. You can read more about the MIPT-2015 ACM ICPC Workshop in the Rubanenko blog.

  • Vote: I like it
  • +75
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Why not codeforces?

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve B, C and K?

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve G?

→ Reply
  • »
    »
    9 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    There's one solution in editorial provided by Tima

    Few hints to another solution(suppose a>0, simmetrical case is similar):

    Let's find minimal x such that sin(ax)=0
    Let's do it using binary search.

    We need to points such points l, r such that minimal such x is between them, and between them there's exactly one such x. How do we choose l? How to find r?

    → Reply