cry's blog

CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)
By cry, 2 months ago, In English

Hello Codeforcers!

We are pleased to invite you to participate in CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!). This round will start on Mar/30/2024 17:35 (Moscow time) and will be rated for all participants. There will be $$$8$$$ problems to be solved in $$$3$$$ hours, with one divided into two subtasks. Similar to USACO, you will help Farmer John and his cows resolve a series of first world problems. Be there or be square.

This round was cooked up by smax, sum, oursaco, cry, and buffering.

We would like to thank the following people for making the round possible:

Score Distribution:

$$$500 - 1000 - (1250 + 750) - 2250 - 2500 - 3000 - 3000 - 4500$$$

Editorial

Congratulations to our Winners and First Solves!

Top 5:

  1. maroonrk

  2. Radewoosh

  3. ecnerwala

  4. cnnfls_csy

  5. orzdevinwang

First Solves:

A. A_G
B. jiangly
C1. ksun48
C2. turmax
D. Omer223
E. tourist
F. Radewoosh
G. tourist
H. ecnerwala

And here is the information from our title sponsor:

Hello, Codeforces!

We, the TON Foundation team, are pleased to support CodeTON Round 8.

The Open Network (TON) is a fully decentralized layer-1 blockchain designed to onboard billions of users to Web3.

Since July 2022, we have been supporting Codeforces as a title sponsor. This round is another way for us to contribute to the development of the community.

The winners of CodeTON Round 8 will receive valuable prizes.

The first 1,023 participants will receive prizes in TON cryptocurrency:

  • 1st place: 1,024 TON
  • 2–3 places: 512 TON each
  • 4–7 places: 256 TON each
  • 8–15 places: 128 TON each
  • …
  • 512–1,023 places: 2 TON each

We wish you good luck at CodeTON Round 8 and hope you enjoy the contest!

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

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Another Amazing CodeTON Let's Go !

→ Reply
»
5 weeks ago, # |
  Vote: I like it +86 Vote: I do not like it

As a tester I really enjoyed the round and I highly recommend everyone to participate in it!

→ Reply
»
5 weeks ago, # |
  Vote: I like it +33 Vote: I do not like it

As a tester, this round will happen at a really funny time!

→ Reply
»
5 weeks ago, # |
  Vote: I like it +33 Vote: I do not like it

As a tester I really liked the problems, I recommend you to participate!

→ Reply
»
5 weeks ago, # |
  Vote: I like it -16 Vote: I do not like it

What can 1 TON buy me ?

→ Reply
»
5 weeks ago, # |
← Rev. 3   Vote: I like it +75 Vote: I do not like it

Doge council decided that problems are great and you should participate

my Doge council
→ Reply
»
5 weeks ago, # |
  Vote: I like it +23 Vote: I do not like it

As a tester, I'm sad I couldn't participate.

→ Reply
»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

OMG! rainboy is tester!

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

As a tester, I can say that this round is GOATed!

→ Reply
»
5 weeks ago, # |
  Vote: I like it +37 Vote: I do not like it

As a monkey tester, the cows are friendly :)

→ Reply
»
4 weeks ago, # |
  Vote: I like it +27 Vote: I do not like it

As a tester, smax orz

→ Reply
»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

as a tester with photo of Stewie Griffin i say .........................................................................Brian Griffin

→ Reply
»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

smax orz

→ Reply
»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

As a tester, I enjoyed helping Farmer John with his never-ending problems.

→ Reply
»
4 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

As a tester, I can confirm the epicness of this contest.

→ Reply
»
4 weeks ago, # |
  Vote: I like it +28 Vote: I do not like it

As a tester, I have to say, excellent round, I hope everyone enjoys it thoroughly.

Having such intelligent individuals commenting on the problems is very encouraging, yet depressing at the same time.

Have a nice contest!

→ Reply
»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

orz myvaluska the pupil tester

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

As a non-tester, I want to say that I hope the round will be cool

→ Reply
»
4 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

Best div ever

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Is the score distribution right (1250-750) or it should be (1250-1750).

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +27 Vote: I do not like it

    C is broken up into two subtasks, the easy version worth $$$1250$$$ points and the harder version worth an additional $$$750$$$ points.

    → Reply
»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

1800 plz!

→ Reply
»
4 weeks ago, # |
← Rev. 2   Vote: I like it +23 Vote: I do not like it

Heh, just realized it would be ~4.5 years since my last rated contest, and I'm now kinda willing to take part in a rated one for old time's sake.

Hope that I would not get a -ve delta T.T

UPD: I screwed myself up badly T.T Still the problems were great anyway!

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

I wish codeforces had the same high quality UI design like ton.org does.

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck to everyone!

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

First time participating in a CodeTON, what is the difficulty of the problems in USACO terms?

Thank you in advance)

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Problems of CodeTON round has always been very unique and enjoyable.

Hope for a enjoyable round.

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Excited for this one, let's goo

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

value of TON tripled since the last CodeTON round, it's $5/TON now

so the first place winner will receive a prize of $5,000. wow

→ Reply
»
4 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

I'm so excited for this contest

→ Reply
»
4 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it

Looks like Codeforces has some serious issues with Leetcode.

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

I believe that listening to the best video game official soundtrack may help your performance during this round.

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

i want to work at TON. plz give me job. I know Tag language, a little. I identify myself as a lgm as well

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you all for this wonderful round. I am very excited!

→ Reply
»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

I'm glad that the prize isn't NOT coin :D

→ Reply
»
4 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

mike was too lazy fixing the problem ratings so he thought why not remove rainboy completely from the contest

→ Reply
»
4 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

WOW! Benq Geothermal and rainboy! This test will be wonderful!

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

What does (1250+750) represents in terms of points, like do we need to solve both the problems to get the points, if not why the D problem is of 750 pints ?

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

    I believe that problem will have easy and hard version

    → Reply
  • »
    »
    4 weeks ago, # ^ |
    ← Rev. 2   Vote: I like it +4 Vote: I do not like it

    Problem C has two versions — C1 (easy) and C2 (hard).

    Solving C1 gives 1250 points, solving C2 gives 750.

    The solution to C2 (most likely) is also a correct solution to C1. Thus, effectively, C1 is worth 1250 and C2 is worth 1250 + 750 = 2000 points.

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

      Thanks for the reply, if i only solve c1, do i get the 1250 ?

      → Reply
      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it +1 Vote: I do not like it

        Yes

        Or more specifically, similar to other problems, you won't get the full 1250 points — you'll get closer to the 1250 the sooner you solve the problem. Solving it at the very beginning of the contest would give the full 1250, but for example solving it now (at 2 hours 42 minutes into the contest), you'd only get 710 points.

        → Reply
        • »
          »
          »
          »
          »
          4 weeks ago, # ^ |
            Vote: I like it -13 Vote: I do not like it

          Thanks a alot for the clarification.

          → Reply
»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

Another 1024 TON to tourist.

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

Can newbies or beginners register??? And solve problem will there degradation in rating if my problem goes wrong???

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    anyone can participate, regardless of your rating!

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

i hope i can get 2 ton!

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

good luck everyone :>

→ Reply
»
4 weeks ago, # |
  Vote: I like it +16 Vote: I do not like it

As a tester, I almost forgot to make "as a tester" comment.

Anyway, the problems are great! Huge orz to the setters and I recommend everyone to participate in this round.

→ Reply
»
4 weeks ago, # |
  Vote: I like it -45 Vote: I do not like it

left after seeing polygons...

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

very tough contest ;(

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

INTERESTING_FORCES unfortunately got so many penalties in C2

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Very good and interesting problemset.

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

this contes could be better

→ Reply
»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

Problem D: Learning to Paint is a straight-forward application of the famous interview problem.

I have added hints and thought process for this problem on CF Step.

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

254174144

Problem D. Can someone explain, why random gives TL?

Code
→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    apparently multiset always TLEs and the authors wanted priority queue solution. T_T made same mistake during contest.

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

      No, the intended solution with set instead of priority_queue passes in 0.5 s.

      The question is how to make a bad test for my random solution, because it passes random tests locally in $$$\le$$$ 1 s.

      → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Ohhh noooo T_T tourist.

→ Reply
»
4 weeks ago, # |
  Vote: I like it -9 Vote: I do not like it

the problem f is broken

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone please explain solution to probelm-C2

→ Reply
»
4 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

is C2 constructive, casework problem?

calculate the distance, first select power of 2 to get extra, second select even until 2, then add rest? idk

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

    you are in right direction

    → Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Actually I think it's optimal to first select the intervals with odd length...

    → Reply
»
4 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

need hints for c1 :/

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

    chosen vertices will also form a polygon

    → Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    hint
    → Reply
  • »
    »
    4 weeks ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it

    Number of triangles equals (number of chosen dots) + (number of unchosen dots that located between them) — 2.

    → Reply
»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

A question about task E: "It may be the case that the game will continue indefinitely" as far as I'm concerned, that's not true, right? I couldn't find any example configuration where the game continued indefinitely

→ Reply
  • »
    »
    4 weeks ago, # ^ |
    ← Rev. 2   Vote: I like it +24 Vote: I do not like it

    You're correct, that never happens.

    I guess the problemsetters didn't want to spoil anything, as the fact that every game terminates doesn't trivially follow from the way the game is described (before you think about strategy).

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

      Good to know that, thanks

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

      that sentence was added an hour before the round LOL

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

As a music gamer, I got defeated by the tiebreaker (looking forward to the solution). Anyway thanks for the cool round!

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    The song is mega but the problem is well-known in China(it was set 8 years ago in UOJ) and many Chinese just copy the code of that problem...

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

why did I notice E so late? T_T, idk how to solve D without segtree or efficiently with segtree

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

Can anyone tell why my code is giving wrong answer for question c2? https://mirror.codeforces.com/contest/1942/submission/254186598

UPD: Nvm, system tests are over

→ Reply
»
4 weeks ago, # |
  Vote: I like it -38 Vote: I do not like it

Problem C has definitely ruined all this competition.

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    it was an interesting problem, but a lot of casework in c2.I could not solve.

    → Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +50 Vote: I do not like it

    C ain't that bad, for both versions. Good observations would result in better execution.

    → Reply
»
4 weeks ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

i did bad, very bad. c1 defeated me. i don't know why i did not notice that the inner polygon is also created for 2 hours.

→ Reply
»
4 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

well that was a waste of a morning, lol

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

In D problem1
1- if i do dp to get maximum sum(mx_sum) and hm ways i can get this sum (freq)
2- k-=freq
3- then dose 1 again but i wanna second max so i use the mx_sum from last dp.

is this solution will pass?

→ Reply
»
4 weeks ago, # |
  Vote: I like it -24 Vote: I do not like it

A frustrating contest indeed !!

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

Are some of my observations for E incorrect?

  • The only thing which actually matters is the min gap between some $$$a_i$$$ and $$$b_i$$$, i.e, $$$min(b_i - a_i)$$$.

  • Any move always preserves the parity of this, meaning P1 will always win for an odd value and lose for an even value.

  • The gap between $$$b_{i - 1}$$$ and $$$a_i$$$ doesn't matter since A's movement left / B's movement right is bounded while the other's is unbounded (subject to the loss by parity above).

  • So for each odd gap upto $$$L$$$, we can count the number of ways of the min gap between an $$$a_i$$$ and $$$b_i$$$ being exactly that, the answer should be the sum of those values.

  • We can get the ways of assigning gaps so min gap between $$$a_i$$$ and $$$b_i$$$ is $$$\geq x$$$ and rest are $$$\geq 0$$$ using bars and stars, so we take (ways of $$$min\ gap \geq x$$$) — (ways of $$$min\ gap \geq x + 1$$$).

This doesn't work for the large sample, any guesses on what I might be missing? (or is it just an implementation skill issue?)

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    I don't think that only the min gap between some $$$a_i$$$ and $$$b_i$$$ matters. If you consider the array of non-zero $$$a_i - b_i$$$, $$$\Delta$$$, then $$$\Delta = {2, 4}$$$ is a loss for the first player but $$$\Delta = {2, 3}$$$ is a win. The minimum value is the same, but the result differs.

    → Reply
    • »
      »
      »
      4 weeks ago, # ^ |
      ← Rev. 3   Vote: I like it +29 Vote: I do not like it

      Edit: I'm a dumbass, I misread the problem and though the farmer had to move ALL of their cows left / right in a given move...

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

        Holy cow, I also misread the problem and "solved" it in the exact same way you did lol

        → Reply
      • »
        »
        »
        »
        4 weeks ago, # ^ |
        ← Rev. 2   Vote: I like it +8 Vote: I do not like it

        I think proving it as a win by showing the interaction is hard since there are so many states. This kind of explains the solution so I'll put it in a spoiler:

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

    The only thing that matters is that the gap between some $$$a_i$$$ and $$$b_i$$$ should be odd.

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Any reason for such tight constraints in D, isn't brute force O(n^2klogk)

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    There exists a more efficient solution, IG. $$$O(n^2*log(k)))$$$

    → Reply
    • »
      »
      »
      4 weeks ago, # ^ |
      ← Rev. 3   Vote: I like it 0 Vote: I do not like it

      Yes i know that, my solution was nk logn as well but got tle in implementation, now that i think about probably my fault for using segtree, should have used set instead

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

        I take my words back still giving tle with a set, was able to pass it by making an array of reverse iterators, not a fan of the constraints

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

Not gonna give any div1+div2 round onwards. Only div2 seems to be the way.

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

Great contest. Loved the problems! 💯
Fixed my bug on problem D only to see the "contest over" message flash right before I could submit. 🤧
Well, that's also a fun experience once in a while. The mistakes stick harder! 😂
Expert, here I come! 🤓

→ Reply
»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

not able to solve prob D since last 3 rounds. Disappointment as always

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Us bro, us! I even dropped C2 in hopes of D 🤡

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone help me with this? Why is this wrong? https://mirror.codeforces.com/contest/1942/submission/254188720

→ Reply
»
4 weeks ago, # |
← Rev. 2   Vote: I like it +10 Vote: I do not like it

Could you please pose H in a data structure training contest... (or at least have a subtask?) From $$$O(NQ)$$$ to $$$\widetilde{O}(N+Q)$$$ is apparent (if you have prepared) and boring.

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    imo it is impossible to solve this without a dynamic dp template and there are too many details in implementing. feels like this round does not have a real extremely hard problem.

    → Reply
»
4 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it
Happy
Sad
→ Reply
»
4 weeks ago, # |
← Rev. 2   Vote: I like it -19 Vote: I do not like it

.

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

    FST on B here too, and C1 took too long for me.. and could not crack C2 :(

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any $$$O(nk)$$$ solution for D?

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

    Authors seem to hint that there exists one of a similar order, $$$O(n^2 + k)$$$

    → Reply
»
4 weeks ago, # |
  Vote: I like it +21 Vote: I do not like it

E

I misread it as selecting the kth cow and moving it (which is also a common situation, I think), and wasted an infinite amount of time. It would have been better if you had written it like a subset.

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please explain how my $$$O(n^2log(k)log(nA))$$$ solution passes in D?

Submission

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    $$$n\leq10^3, k\leq5\cdot10^3$$$ and time limit is 4.5 seconds..

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

      Yeah but surely it would take more than 1 second right?

      → Reply
»
4 weeks ago, # |
  Vote: I like it +28 Vote: I do not like it

Thanks for the contest, I liked ABCEF, all are high-quality interesting problems. But I dont understand why problems like D still being accepted for Div1s in 2024, isn't it just very standard problem?

→ Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +116 Vote: I do not like it

    I definitely think there's a place for problems like D in Div1s. Even though you can say there is a standard "merge sorted lists using a priority queue" idea, it took me some time to reduce the problem to that (and I enjoyed it).

    → Reply
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +32 Vote: I do not like it

    💀

    → Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

just realize number of participant too low compare to regular round, why is this the case?

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Little bit sad for my unclear submissions for C, basically it's an easy observe problem with short code...

→ Reply
»
4 weeks ago, # |
  Vote: I like it +128 Vote: I do not like it

Thanks for the contest!

For problem E, the case of $$$n = 1$$$ previously appeared in AGC 020 A which I wrote — not a big deal of course, but it helped me to come up with the solution a little bit faster.

→ Reply
»
4 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

Hello folks,

Do you know that JavaScript V8 4.8.0 was released in 2015? And included in node since 2016. That's over 8 years ago. Unlike most programming languages, JavaScript has evolved significantly since then. Latest available V8 version is 12.5.0 (Mar 18, 2024).

I'm well aware that JS is not usually used for competitive programming. But using obsolete language version is a guarantee that it will stay this way.

→ Reply
»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

Cool round, had fun. Congrats to the setters

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Read E for the first time and solved it in 20 mins, bruhhhhhhhhh

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

Cool round , although it was strange to have a C like this

Anyway , does anybody has 7 rating points to donate to me :(

→ Reply
»
4 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

It seems that G is a little too easy for the position? I personally consider F more difficult than G.

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

Why has TON skyrocketed so dramatically?

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone help me with Golang

https://mirror.codeforces.com/contest/1942/submission/254314439

For this problem, in test 6 with n=200000, TIME_LIMIT_EXCEEDED even if I only debug and read & print the input

→ Reply
»
4 weeks ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

MathForces

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I think there are too many math-like problems.

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

    But it cannot be denied that the competition was indeed quite good.

    → Reply
»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

How to exchange TON into dollars?thanks!

→ Reply
»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi guys, I am new to codeforces so I want to ask something from you guys. I am very polite about this. In this CodeTON contest I solved Accepted 2 Questions and two were Runtime error. But My Rating Change is 0. Not even Positive or negative. Can you tell me why this hapenned? I also got a positive score of 1512 but my rating change is 0. Please help me figure about that.

→ Reply
»
4 weeks ago, # |
  Vote: I like it +38 Vote: I do not like it

Ummm, So how can I recieve the TON? I only realised that I can put a wallet in setting after the contest :))

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

i got a message from system saying that my solution coincides with some other solution for C2 1942C2 - Bessie's Birthday Cake (Hard Version) i think this is a coincidence an exactly similar question with the same logic was asked in one of the regional math olympiad i gave in fact for this particular question i gave three wrong submission before it was finally accepted and those submissions also used the same logic you can check that. System testing has skipped my submission can someone please help MikeMirzayanov priyanshu.p. Around 60 other people have a similar solution so it can be a common solution.

→ Reply
»
3 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

Dear Codeforces and MikeMirzayanov,

My Python submission for problem 1942C2 was independently developed, and any similarities with other submissions are coincidental. The logic employed in my solution was based on my unique approach, building upon the solution I devised for problem 1942C1. I assure you that there was no intentional violation of the rules.

→ Reply
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Help Please

→ Reply
»
3 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

Hello codeforcers and MikeMirzayanov. I had written original solution for C2, it had also appeared in a regional mathematics contest here at india, so the idea was kind of intutive to me. I had solved all problems from myself, and even my idea for 1942C1 (which was easier version of C2) was original, and I had used my very own method and I extended the same idea to cater C2 as well. As someone who is serious and honest for rating, I find this a mere coincidence and I assure you no such violation of rules would be done by mistakely or otherwise.

→ Reply
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

This is my family and my old friends

→ Reply
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi may I ask if prizes have been given out? I havent received anything, thank you!

→ Reply
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Just received a notification about filling the wallet address. But my TON keeper says that there are two address formats, starting with E and starting with U.

Which one should I write in my profile?

→ Reply
»
10 days ago, # |
  Vote: I like it +37 Vote: I do not like it

I won two TON coins in CodeTON Round 8, but now I don't know how I can receive them. I have a TON account

and also I updated my wallet before April 16 UTC.

What can I do beside just waiting?

→ Reply
»
5 days ago, # |
← Rev. 2   Vote: I like it +15 Vote: I do not like it

I'm still not received the Ton Coin, have anyone received it ?

→ Reply