shishyando's blog

By shishyando, 2 years ago, In English

We know about FST and we are really, really sorry about it. Even though we still hope that you liked the problems.

A: Digit Minimization
B: Z mod X = C
C: Column Swapping
D: Traps
E: MEX vs DIFF
F: Diverse Segments
G: Euclid Guess
H: Hard Cut

Full text and comments »

  • Vote: I like it
  • -206
  • Vote: I do not like it

By shishyando, 2 years ago, translation, In English

Hi, Codeforces!

We are glad to invite you to Codeforces Round 792 (Div. 1 + Div. 2) which will take place on May/19/2022 17:35 (Moscow time). You will have 2 hours to solve 8 problems. The round will be rated for participants of both divisions.

I would like to thank those who made this round possible:

We would also like to thank NEAR for supporting the round. This company is founded by former competitor AlexSkidanov. NEAR is built by many prominent competitive programmers, including twice ICPC champion eatmore and GCJ and TCO winner Egor.

  • The participants who end up in the first 255 positions will receive prizes in NEAR coins. The participant on the first place will receive Ⓝ128, the next two participants will receive Ⓝ64, the next four participants will receive Ⓝ32, etc.

Score Distribution:

500750125015001750200025003250

We really hope that you like the problems! Good luck!

Editorial: link

Full text and comments »

  • Vote: I like it
  • -426
  • Vote: I do not like it

By shishyando, 3 years ago, In English

Again, I hope that you liked all the problems. Share your ideas and solutions in the comments, because there are always different ones! So, the editorial:

A: GCD vs LCM
B: Array Cloning Technique
C: Tree Infection
D: GCD Guess
E: MinimizOR
Who did what?

Full text and comments »

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

By shishyando, 3 years ago, In English

Dear Codeforces Community,

Kirill22 and I are glad to invite you to Codeforces Round 781 (Div. 2), which will take place on 08.04.2022 17:35 (Московское время). This round will be rated for the participants with rating lower than 2100

These are some great people that we would like to thank:

You will have 2 hours to solve 5 problems.

One of these problems is interactive, please see the guide of interactive problems if you are not familiar with it.

The scoring distribution: 500750125015002250

P.S. I have been waiting for a long time to hold another contest and now this time has come. I really hope that you will like the problems, good luck!

UPD: Editorial

Full text and comments »

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

By shishyando, 3 years ago, In English

Hello, Codeforces!

On 12.09.2021 17:35 (Московское время) we will host Codeforces Global Round 16.

It is the fourth round of a 2021 series of Codeforces Global Rounds. The rounds are open and rated for everybody.

The prizes for this round:

  • 30 best participants get a t-shirt.
  • 20 t-shirts are randomly distributed among those with ranks between 31 and 500, inclusive.

The prizes for the 6-round series in 2021:

  • In each round top-100 participants get points according to the table.
  • The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
  • The best 20 participants over all series get sweatshirts and place certificates.

Thanks to XTX, which in 2021 supported the global rounds initiative!

The problems were written and prepared by shishyando and Artyom123.

We would like to thank these people:

You will have 2.5 hours to solve 8 problems. As always, we highly recommend reading all problems. Moreover, we really hope you upsolve the problems after the round, there are some interesting things to find out!

One of these problems is interactive, please see the guide of interactive problems if you are not familiar with it.

Score Distribution:

5007501000(750 + 1000)2000250030003750

Editorial:

The editorial

Winners

System testing finished, congrats to the winners!

  1. Radewoosh
  2. tourist
  3. QAQAutoMaton
  4. jiangly
  5. ksun48
  6. Alice_foo_foo
  7. He_Ren
  8. Benq
  9. tatyam
  10. hitonanode

Full text and comments »

Announcement of Codeforces Global Round 16
  • Vote: I like it
  • +692
  • Vote: I do not like it

By shishyando, 3 years ago, In English

Приветики! ヾ(≧▽≦*)o

This is a meme announcement, but it will be updated too.

We are incredibly happy to invite you to a special (for us and, we hope, for you) event, Codeforces Global Round 16. It will be held on 12.09.2021 17:35 (Московское время), rated for everyone of course! Feel free to participate!


The problems were written and prepared by shishyando and Artyom123.

We chose the green color because it matches the "Upvote" button (cyan is fine too).

You know what to do.


Huge Thanks and much Love

to great people who contributed in the round creation

These people really deserve all the warm words and that green upvotes:

  • isaf27, the one who did a lot of things for the round to happen, I just can't find the exact words to thank him orz

  • Monogon again for being (you already know his privileges, don't you?) VIP celebrity superstar luminary notable tester
  • physics0523 for making researches about the tasks (as he always does <3)
  • ptd for his code for the editorial(*^-^*)
  • kpw29 for making the testers list a bit more colorful and for being a part of another among us meme
  • Supercell, because sometimes we play brawl stars and it helps us invent new problems
  • Microsoft for the kaomoji's used in this blog
  • MikeMirzayanov for... agh, the copy-pasted part has already ended... for his immeasurable contribution to the development of the community!

About the problems and the contest overall:

This is our third round and we tried our best to make it special for the whole Codeforces community!

You will have 2.5 hours to solve 8 problems. As always, we highly recommend reading all problems. Moreover, we really hope you upsolve the problems after the round, there are some interesting things to find out!

A formal thing we should say (◔_◔)

One of these problems is interactive, please see the guide of interactive problems if you are not familiar with it.


Score Distribution:

5007501000(750 + 1000)2000250030003750


Editorial: Editorial


Winners

System testing finished, congrats to the winners!

  1. Radewoosh
  2. tourist
  3. QAQAutoMaton
  4. jiangly
  5. ksun48
  6. Alice_foo_foo
  7. He_Ren
  8. Benq
  9. tatyam
  10. hitonanode

Full text and comments »

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

By shishyando, history, 4 years ago, translation, In English

Hello again, Codeforces!

Artyom123 and I are happy to invite you to Codeforces Round 708 (Div. 2), which will take place on Mar/17/2021 17:35 (Moscow time). This round will be rated for the participants with rating lower than 2100

These are some awesome people that we would like to thank:

You will have 2 hours to solve 5 problems (and 2 subtasks). This time the statements are not related to Valorant, but we still play it sometimes.

We hope that you will like all problems and you won't face any troubles during the contest. Good luck!

The scoring distribution: 500750(750 + 500)1750(1500 + 1500)

UPD: Editorial

Full text and comments »

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

By shishyando, history, 4 years ago, translation, In English

We are really sorry to make the round unrated. Anyway, we hope that you enjoyed the problems!

1497A - Meximization

Idea: shishyando

Tutorial
Implementation

1497B - M-arrays

Idea: Artyom123

Tutorial
Implementation

1497C1 - k-LCM (easy version)

Idea: shishyando

Tutorial
Implementation

1497C2 - k-LCM (hard version)

Idea: isaf27

Tutorial
Implementation

1497D - Genius

Idea: shishyando

Tutorial
Implementation

1497E1 - Square-Free Division (easy version)

Idea: Artyom123

Tutorial
Implementation

1497E2 - Square-Free Division (hard version)

Idea: isaf27

Tutorial
Implementation

Full text and comments »

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

By shishyando, history, 4 years ago, In English

All problems were prepared on Polygon by me, so if you faced any problems (we know about A) I am really sorry about it.

Tutorial is loading...

Idea: shishyando

Jury solution: pastebin

Tutorial is loading...

Idea: Artyom123

Jury solution: pastebin

Tutorial is loading...

Idea: shishyando

Jury solution: pastebin

Tutorial is loading...

Idea: Artyom123

Jury solution: pastebin

Tutorial is loading...

Idea: shishyando

Jury solution: pastebin

Tutorial is loading...

Idea: isaf27 + Kotehok3

Jury solution: pastebin

Full text and comments »

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

By shishyando, history, 4 years ago, translation, In English

Hello, Codeforces!

Artyom123, Kotehok3 and I are happy to invite you to Codeforces Round 671 (Div. 2), which will be held on Sep/19/2020 17:35 (Moscow time). This round will be rated for all participants, whose rating is lower than 2100 (We really hope so).

We would like to thank:

You will be given 6 problems and 2 hours to solve them (or to play Valorant, because the contest is related to it for some reason). One problem has an easy version and a hard version.

You will have to help the agents from the game to grind that rating. Try your best as if you are playing ranked and they are your teammates!

gl hf

Here is the score distribution:

5007501250(750 + 1000)22503000

UPD: Editorial

Full text and comments »

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