Блог пользователя Lyde

Автор Lyde, история, 11 месяцев назад, По-английски

Oh hi! Welcome to 24 random quotes!

I'm a competitive programmer, but I'm also pretty much a fan and often visit here to see some recent actions. I have a pretty unusual hobby: Collecting some sentences from blogs and comments and saving them as pictures, which I could use later for memes. Later I realized that I couldn't use it that much and after 4 years, it became a collection of well, memories. So I had the idea of sharing some of it with you guys for nostalgia! Most of them are light-hearted, and all of them are pretty memorable in my mind.

If you are an experienced member here you might realize some of them, so I will make it a challenge: Guess where this is from! (No prizes sadly) The spoiler to the link of the comment/blog and my personal opinion (or s/p) will be right below the quote.

Anyways, enjoy.

If newcomers find it confusing, then that's their bugaboo

s/p

Tourist can't compete against benq in this round, but he can make some crazy geometry problems to force benq to lose rating and get back to rank #1.

s/p

At this rate we'll have div10 for negatively rated people.

s/p

I'm surprised too. I thought I'm the only Codeforces user from Poland.

s/p

3 seconds? I didn't even hurry. I could have easily beat you by 10 seconds. I accept.

s/p

He got so confident that he'll win the race and I'm a useless candidate master who'll never be a true master, so we decided to take this race into a whole new level and post this blog to let the Codeforces community know about it when I win the race (I hope).

s/p

Since then, I have set dapingguo8 as my eternal rival, and after one million, two hundred and three thousand, and seven hundred and eighty two minutes, I am now writing this blog proud to say that I have finally passed dapingguo8 in rating.

s/p

My pen. Yes seriously. My pen.

s/p

instead of doing 1 linear search you doing 2. Thats why its called binary search. Works 2 times slower, but i dont care

s/p

17 Legends and me.

s/p

Just never resubmit and write a comment complaining about tight TL if you FST

s/p

Some things about previous rounds: one day, I got so many questions if the round is rated or not during the time we were figuring out if we really have to make it unrated. I got something like 50 questions about this and just answered "read the global announcement". 50 times. I wasted like 5 minutes to answer all such questions instead of answering the real ones.

s/p

Codeforces community is biased towards people with high rating and people who do something for the website. And this is sometimes a good thing; but it can also make people think that if a high-rated participant and a problemsetter allows himself (or herself) to be rude and offensive, then it is acceptable, and they are allowed to do it as well. That's why cases like this one are especially bad.

s/p

I can. n! ends with 0 for any n>4.

s/p

Dude, I'm not having fun solving problems, I'm having fun learning useless algorithms. Get lost.

s/p

My plan succeeded! Now I will always be the lexicographically first tester!

s/p

Thank you for a lot of hacking attempts!!!

s/p

Proves my point that AtCoder problems are just "You are given some initial sequence, you can perform 69 possible operations to generate sequence set S, see if x ∈ S or print |S| mod 696969420"

s/p

Waiting for someone to comment "This is a well known algorithm in China since 2011."

s/p

Come on, I organized a whole AGC in order to get the "Gold Medal" award on ProjectEuler! Don't ruin my plan!

s/p

Incoming XOR missiles...

s/p

Can we please make the contest 8 minutes shorter for the memes?

s/p

AI is such a noob

s/p

I hope we will be seeing each other soon :) And for everyone, make sure to take care of yourself, especially of your mental health, in these trying times.

s/p

I hope the last one is also the message of this year. Take care and have fun!

  • Проголосовать: нравится
  • +198
  • Проголосовать: не нравится

»
11 месяцев назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится

lol these are funny. good work OP

»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

both are equal

»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

What is the reason for having Kuroni in the tags?

»
11 месяцев назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

That binary search explanation was funniest one among all....

»
11 месяцев назад, # |
  Проголосовать: нравится +27 Проголосовать: не нравится

on one memorable contest, tourist tying with jiangly about to lose rating, to hacking someone and regaining first and about to be the first one to reach 4000 rating points and subsequently getting FST was truly one of the moments of all time.

»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Kuroni orz

»
11 месяцев назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится

Hey girl, are you my largest subtree? Because I have some queries that need to be deep inside of you.

s/p

> lucky
> div. 3
> it is like saying "paralympians are lucky because they can participate at paralympiads"

s/p

Work hard bro one day you got 7* coder codechef, legendary grandmaster on codeforces your cp skill beat Sundar Pichai and you become next CEO in google.

s/p
  • »
    »
    10 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    I believe this is the original "work hard bro" comment. There could be an older one though, I'm not sure.

»
11 месяцев назад, # |
Rev. 2   Проголосовать: нравится +10 Проголосовать: не нравится

Three on the top of my mind:

After seeing solution to E, I started to wonder what Segment trees can't do. Maybe it can even end world hunger in O(nlogn)??
We can optimize a bitset by using another bitset. This divides the constant every time by 64, and since $$$\lim_{n\rightarrow\infty}64^{-n} = 0$$$, the operation will eventually converge to O(1) if we use enough bitsets.
Spoiler
Hey, I understand that you want to make a point, but don't you think tagging is unnecessary? I believe noone likes to be tagged just to be asked to debug someone else's code.
Spoiler
»
11 месяцев назад, # |
  Проголосовать: нравится -29 Проголосовать: не нравится

I only predict near future, not what your rating will be in 2030

s/p
»
11 месяцев назад, # |
  Проголосовать: нравится +15 Проголосовать: не нравится

get a girlfriend

s/p