Ilya_Is2022's blog

Unofficial SRound #1
By Ilya_Is2022, 17 months ago, translation, In English

Hello, Codeforces! ＼(≧▽≦)／

I, Ilya_Is2022, am glad to invite each of you to our interesting SRound #1 (Based on the failed city school championship), which will be held in [contest_time: 447021]! This round was developed independently of the division system created on Codeforces, so each participant of the competition will have something to solve (◕‿◕).

The round will be held according to the standard rules ICPC! Thus, the penalty for each incorrect parcel before the parcel becomes a complete solution will be equal to 20 minutes.

You will be asked $$$\log_{2} 32\le x\le\log_{2} 1024$$$, where $$$x$$$ is the number of tasks ʕ ᵔᴥᵔ ʔ and 2 hours 15 minutes to solve them.One of the tasks is interactive. Don't forget to read the instructions for interactive tasks.

The organizers of this round:

  • Isaev Ilya_Is2022 Ilya is the author of the tasks and the coordinator of the round.

  • Nekrasov nekstas Stanislav and Moskaleva vika1310 Victoria — authors of tasks.

Words of gratitude:

Go to the context page: SRound #1

UPD 1:

  1. The date and time of the event remain unchanged. (As you may have noticed, our round does not overlap with any of the official competitions)

  2. Self-registration for the contest is already available! (Click).

  3. See you at the contest (｡• ᵕ •｡`)!

UPD 2:

  1. We apologize for the error in the text translation of the English version of tasks D1 and D2.

  2. Thank you all for participating in the round!

  3. EDITORIAL: Click

Top of today's participants:

  1. aufannn

  2. Kira_1234

  3. Frus

  4. Sayfer

  5. jeroenodb

  6. nikuradze

  7. shevlopmes

The wizard for solving the wrong D2: Believer.

The phase of completing and viewing tests with parcels is open!

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

Comments Comments (8)
| Write comment?
»
17 months ago, # |
  Vote: I like it +5 Vote: I do not like it

excited!!! added to calendar:)

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    We really hope that no official competitions will be scheduled on this date and time :)

    → Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Excited!!!

→ Reply
»
17 months ago, # |
  Vote: I like it +3 Vote: I do not like it

How to Solve D2 and Last problem.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    For the last problem, I ran a bruteforce on my computer to find all the numbers in the interval (loop over the 1e9 candidate squares, then check if it is a palindrome). This takes a couple minutes to run, but then you get only 21 of these numbers, so you can just paste them in the source code, and for queries just check which of these lie in the interval.

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I did D2 on the basis of — Number of places I have for the odd and even indices if sum of even or odd ind. cannot fit into it print "NO" else "YES"

    → Reply
»
17 months ago, # |
  Vote: I like it +3 Vote: I do not like it

I think that the Testcases of D2 might be wrong. Consider the 9th test in Test Case 3. It says that the answer for 0 1 1 should be YES, but I think it should be NO. Can someone please construct a n (without leading zeroes according to statement) which shows why answer for 0 1 1 should be YES?

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

    Yes, seems like.

    a,b >= 1 and k >= 0 Could be more clear and easy to think.

    → Reply