rus's blog

By rus, history, 13 months ago, translation, In English

1407A — Ahahahahahahahaha

Tutorial
Solution

1407B — Big Vova

Tutorial
Solution

1407C — Chocolate Bunny

Tutorial
Solution

1407D — Discrete Centrifugal Jumps

Tutorial
Solution

1407E — Egor in the Republic of Dagestan

Tutorial
Solution

Read more »

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

By rus, 14 months ago, translation, In English

biection and I are glad to invite you to Codeforces Round #669 (Div. 2), which will take place on Sep/08/2020 17:35 (Moscow time). The round will be rated for all the participants with rating strictly less than 2100.

The problems were created and prepared by biection and rus. We would also like to thank everyone who was involved in the round preparation:

You will have 2 hours to solve 5 tasks. One of them is interactive, you should know how to deal with them.

Special thanks to my amazing minipig Schweine, who inspired us during the entire preparation time.

oink

Scoring will be announced shortly before the round.

UPD1: There will be no pictures of minipig in the statements. :)

UPD2: The scoring is 500-1000-1500-2000-2500.

UPD3: EdItOrIaL.

UPD4: Congrats to winners!

Div1 + Div2:

  1. ksun48

  2. WZYYN

  3. Proszek_na_ludka

  4. neal

  5. jiangly

Div2:

  1. Chynole

  2. deep_fake

  3. GiannisAttemptafreethrow

  4. watemus

  5. wasureta

Read more »

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

By rus, 17 months ago, In English

I came up with the task but after long unsuccessful thinking I decided to write about it.

You're given a rooted tree which consists of n vertexes. You need to arrange weights from 1 to n-1 (permutation) on edges, so that the maximal distance from root over all vertices will be minimized. Find out this distance.

Can someone provide polynomial solution?

Read more »

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