jinlifu1999's blog

By jinlifu1999, history, 3 years ago, In English
Tutorial is loading...
Code
Tutorial is loading...
Code
Tutorial is loading...
Code
Tutorial is loading...
Code
Tutorial is loading...
Code
Tutorial is loading...
Code

Read more »

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

By jinlifu1999, history, 3 years ago, In English

Hello, Codeforces!

It's my honor to invite you to Codeforces Round #536 (Div. 2), which takes place at 12:35 UTC, January 31st, 2019. The round will be rated for all division 2 participants (with rating less than 2100). Also we warmly welcome those division 1 participants to join us out of competition.

This is my second round on Codeforces platform, and my first round was on January 31st, 2018, which is such a coincidence that I would like to say thanks to KAN for his awesome coordination and great dedication to this round. Besides, much thanks to testers Aleks5d, cyand1317, mohammedehab2002, ---------- for their excellent testing work. Also, I would like to appreciate the Codeforces platform created and maintained by MikeMirzayanov, without which the round wouldn't be possible.

In order to celebrate the Lunar New Year (or Spring Festival) originated in China on February 5th, I proposed the round with 6 problems, whose theme is about the Lunar New Year. In this round, you are going to help Alice and Bob to solve some problems in the preparation of celebrating the Lunar New Year in 2 hours. I hope that those problems can interest you and improve your programming abilities, at the same time, bring you luckiness as well as high rating in the coming Lunar New Year!

As a convention, the scoring distribution will be announced soon.

Again, wish you more luckiness and higher rating!

UPD1: Editorial is published.

UPD2: The scoring distribution will be 500-1000-1250-1500-2250-3000. Note that there are 6 problems and you will be given 2 hours to solve them.

UPD3: System test is finished. We are sorry for that technical issue which ruined your happiness. Despite the issue, I hope you do learn something from the problem set, which might be far more important than the rating itself. Enjoy problems, and looking forward to the next contest with better problem set to learn something new, which in my opinion is what Codeforces platform wants to provide us with. Thanks for your participation and dedication even after the unrated announcement. :)

UPD4: The real Editorial is published. Thanks for your patience.

UPD5: Despite that the round is unrated, I have to announce the winners, who deserve it because of their hard work.

Div. 2

  1. ksi1996

  2. newbieyzr

  3. Zharaskhan

  4. I_AM_CHTHOLLY

  5. mzhmxzh

  6. radoslav192

  7. Vit.C

  8. visitWorld

  9. yycdage

  10. xuzhiyuan1

  11. zhangqingqi

  12. Crossguard

  13. gtrhetr

  14. Itst

  15. HwSh

Read more »

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

By jinlifu1999, history, 4 years ago, In English
Tutorial is loading...

Code (C++ version)

Tutorial is loading...

Code (C++ version)

Code (Python version)

Tutorial is loading...

Code (C++ version)

Code (Python version)

Tutorial is loading...

Code (C++ version)

Tutorial is loading...

Code (C++ version)

Tutorial is loading...

Code (My stupid solution: C++ version)

Code (demon1999's fast solution: C++11 version)

UPD1: Note that the editorial of problem E is modified with some correction. Sorry for that inconvenience.

UPD2: The editorial is complete now. Hope you find it useful. :P

UPD3: It's seems that all bonus questions can be found in the comments. :) Don't hesitate to give them an upvote. :P

UPD4: The editorial is updated.

Read more »

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

By jinlifu1999, 4 years ago, In English

Hello, Codeforces!

It's my honor to invite you to Codeforces Round #460 (Div. 2), which takes place at 13:05 UTC, January 31st. The round will be rated for all division 2 participants. Also we warmly welcome those division 1 participants to join us out of competition. Note that round starts in the unusual time! :)

This round is prepared by me and my friend wuminyan0607. Many thanks to my friend for helping me testing the round and generating testcases. Besides, many thanks to the Codeforces coordinator KAN for giving me a chance to hold this round, testers cdkrot, cyand1317, demon1999, Glebodin, vintage_Vlad_Makeev, FalseMirror for testing this round and MikeMirzayanov for the great Codeforces and Polygon platforms. Without their huge effort, this round would't be possible.

Hope you can find these problems interesting. Wish all of you fewer bugs and higher rating!

The scoring distribution will be announced soon.

UPD1: There will be 6 problems and you have 2 hours to solve them. The scoring distribution will be 500-750-1000-1500-2000-2500.

UPD2: System test is over. Hope you will like those problems. Congratulations to the winners!

Div. 2

  1. OO0OOO00O0O0O0O00OOO0OO (Solved all 6 problems and got 4 successful hacking attempts)

  2. pannibal (Solved all 6 problems)

  3. sasasagagaga

  4. answerrtx

  5. Kemal

  6. Ren_shimosawa

  7. UoA_Kanade

  8. just_soso

  9. jijiang

  10. TayTayTayTaylor

Div. 1 & Div. 2

  1. KrK

  2. Vercingetorix

  3. OO0OOO00O0O0O0O00OOO0OO

  4. uwi

  5. black_horse2014

  6. TonySnark

  7. zscoder

  8. Marco_L_T

  9. quailty

  10. pannibal

UPD3: Editorial is ready!

Read more »

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