C137's blog

NCD 2019 Online mirror
By C137, history, 6 years ago, In English

World finals was yesterday, and I am sure you all got excited to take part in 2020 WF, so What are you waiting for? Start training hard :D

I would like to invite you all to take part in NCD 2019 qualification contest, NCD ( National Center of Distinguished students) is a high school in Syria, the best students in Syria study in NCD and they receive special programs. Every year top teams from NCD compete with university students in ACM contests and achieve great results.

The onsite contest will be held tomorrow you can check your timezone Apr/06/2019 18:30 (Moscow time), however the contest might be delayed for some time due to some delays from onsite event, you will be given 10-13 problems to be solved in 5 hours, the contest will be held on Codeforces gym, registration will be open 6 hours before the start of the contest.

The contest was prepared and tested by me Hasan, EleCursity, NeuTronic, massoud8032000, Hash, Geo_Ghaffar and others.

We hope you find the problems interesting, see you on the standings page :D

Due to some unexpected events, the round was delayed 9 hours after the system testing of global round.

UPD the contest is over thank you for your participation, please share with us your feedback, and if you have any questions leave them in the comments below, and we will do our best to answer them.

Finally, congratiolations for TooNewbie who solved all the problems :D

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

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

The Link of the contest ?

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

Auto comment: topic has been updated by C137 (previous revision, new revision, compare).

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

How i can solve m

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

    Compare the numbers by taking logarithm on both sides and handling 0 valued corner cases. Code

    → Reply
»
6 years ago, # |
  Vote: I like it +1 Vote: I do not like it

How to solve A, E, G and J?

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Spoiler
    → Reply
    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Can you explain in more detail how it solves question A?

      → Reply
      • »
        »
        »
        »
        6 years ago, # ^ |
          Vote: I like it +3 Vote: I do not like it
        Spoiler
        → Reply
»
6 years ago, # |
  Vote: I like it +7 Vote: I do not like it

The difficulty of the topic is very suitable for me. But how to solve the problem B?

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

I have a $$$O(T * 90000 * log(90000))$$$ solution for problem G, my submission is here 54345315.

I think it may can get the correct answer, but the time cost is about $$$1$$$ sec for $$$T = 1$$$ scenario.

So if $$$T > 1$$$, I will get TLE.

Do you guys know what the correct solution is?

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

    There is no need for doing binary search. You can use some formulas.

    Code
    → Reply