rfpermen's blog

By rfpermen, history, 2 weeks ago, In English

I just want to flex my recent completion of 1000 days in a row of solving codeforces problem,

Here is my progression of doing this challenge from year to year,

If you are checking my account profile and wondering why the streaks shown to you is broken, it's because codeforces counts submission day based on the timezone setting for each user, and in my case it's UTC+7 (so my streaks only work for that timezone).

And if you are wondering how can I submit 3 solution at the same time everyday, well it's because I stash my accepted solution on vjudge, so honestly it's more like 1000 days in a row of submitting accepted solution, rather than solving it everyday.

But it's still hard to completed this challenge, especially there is a time when codeforces server is down for more than 24 hours, but luckily I already submit my solution at like 1 a.m. when that happen so I have 47 hours before my daily streaks is gone and luckily the server is up again before that happen.

Here is some other fun fact when I doing this challenge, since codeforces doesn't care of the difficulty of the problem you solve when counting daily streak, so I obviously just kept doing solving problem from the lowest rating, but since I solved 3 problems every single day, I literally starts to running out of easier problem, as for now when I sorted the problemset page from the lowest rated problem and then hide the problem that I already solved, then at the end of page three or the 300th easiest problem that I haven't solved would have a rating of 2000.

Note: I doing this challenge only for fun, not as my main source of training, since I believe solving from problem far below than your own rating most likely won't help you learn anything new.

Full text and comments »

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

By rfpermen, history, 2 years ago, In English

We are excited to invite you to Mirror BNPC-HS 2022 Final Round (Unrated) on Sunday, November 6th 2022, 11:05 UTC+7

The contest will be 5 hours long and will feature 10 problems. The order of the problems is the same as the original BNPC-HS contest.

The problems were written by Owmicron, vioalbert, Yoshiyuki, kresna, and alwyn

Problem components were prepared by jfcjaya, Owmicron, vioalbert, rfpermen, trainerherp, tyroflex, Nich728, alwyn, keziaaurelia, notwatermango, siplusplus, VinsenN

We would also like to thank:

Special thanks to COMPFEST for providing the floor tiles.

BNPC-HS (Bina Nusantara Programming Contest for High School Students) is an annual competitive programming competition hosted by Binus University as part of BeeFest, a national-level competition for high school students. This contest is mirrored from the Final Round of BNPC-HS 2022 and is open for everyone to join (not limited to high school students)

We have put great effort into preparing this contest, and we truly hope that you will enjoy it. See you in the contest!

UPD: contest is over!

Congratulations to our top 5:

  1. Lucina
  2. neko_nyaaaaaaaaaaaaaaaaa
  3. JomnoiZ
  4. merlin_
  5. boatinw99

You can upsolve the problems here. The editorial is available here.

Thank you for participating, see you next year!

Full text and comments »

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

By rfpermen, history, 2 years ago, In English

We are excited to invite you to TOKI Regular Open Contest #28 (Div. 2 Only, based on BNPC-HS 2022 Elimination Round) on Sunday, October 23rd 2022 19:05 UTC+7

Your rating should be less than 2000 or not yet rated in TLX to participate in this contest.

The contest will be 2 hours long and will feature 6 problems. Note that you should participate in the contest individually.

The problems were written by vioalbert, rfpermen, tyroflex, trainerherp, kresna, ConvexHull89, felix_suharjo.

Problem components were prepared by notwatermango, ConvexHull89, Carrotkun, felix_suharjo, alwyn, kresna, siplusplus, VinsenN, Owmicron.

We would also like to thank:

BNPC-HS (Bina Nusantara Programming Contest for High School Students) is an annual competitive programming competition hosted by Binus University as part of BeeFest, a national-level competition for high school students.

We have put great effort into preparing this contest and we truly hope that you will enjoy it. See you in the contest!

UPD: contest is over!

Congratulations to our top 5:

  1. i_love_varya
  2. cutmdo
  3. Nots0fast
  4. siganai
  5. andreast12

Congratulations to our first solvers:

  • A. i_love_varya
  • B. i_love_varya
  • C. i_love_varya
  • D. i_love_varya
  • E. Nots0fast
  • F. i_love_varya

You can upsolve the problems here.

Thank you for participating!

UPD 2: editorial is available in the upsolve link.

Full text and comments »

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

By rfpermen, history, 3 years ago, In English

We are excited to invite you to TOKI Mirror Open Contest (Unrated) — BNPC-HS 2021 Final Round on Saturday, October 16th 2021 13:05 UTC+7. The contest will be 5 hours long and will feature 10 problems. Note that you should participate in the contest individually. Scoring will be based on ICPC rules.

The problems were written by KerakTelor, Owmicron, Yoshiyuki, siplusplus, rfpermen, Berted, Nich728, VinsenN, and vioalbert.

Problem components were prepared by the Scientific Committee: rfpermen, Owmicron, ZeroScar, KerakTelor, jfcjaya, vistokartika, Littleboy123, vioalbert, VinsenN, and Yoshiyuki.

We would also like to thank:

BNPC-HS (Bina Nusantara Programming Contest for High School Students) is an annual competitive programming competition hosted by Binus University as part of BeeFest, a national-level competition for high school students.

We have put great effort into preparing this contest and we truly hope that you will enjoy it. See you in the contest!

UPD 1: Contest is over! Congratulations to our top 5!

  1. emthrm
  2. wiwitrifai
  3. SamAnd
  4. Luqman
  5. Nirjhor

Editorial will be published soon.

UPD 2: The problemset is available for upsolving here.

Full text and comments »

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