I_am_Invincible's blog

By I_am_Invincible, 4 days ago, In English

Hello good people. The moment we've all been waiting for has finally arrived. Today, for the first time in history, the greatest of all time, tourist , will face off against his rival, conqueror_of_tourist in a blitz round. It’s not just a battle of skill; it's a clash of legacies, a showdown that will determine if the Conqueror can truly live up to his name, or if tourist will add another title to his already legendary status: the Conqueror of Conqueror_of_Tourist. The tension is palpable and the stakes are higher than ever. Who will emerge victorious in this epic faceoff? I am very excited. Stay tuned and buckle up, folks. Fingers crossed as history is about to be made !!!

Full text and comments »

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

By I_am_Invincible, 2 weeks ago, In English

I am so much loving the fact how some newbies, pupils and specialists are solving in lightning speed with compilation errors and getting their accounts disabled lol. They won't be able to do even one percent of that without AI :)

If you are a cheater feel free to downvote cuz i don't care haha.

Full text and comments »

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

By I_am_Invincible, 3 weeks ago, In English

HI good people. Recently i learned about mo's algorithm and grabbed some basic idea of SQRT decomposition. I solved a few problems related to it but those were just direct implementation. So i would I like to know from you if you found some problems that you solved using anyone of these two topics. It will be helpful if you provide me the link to those problems in the comment that you think are related to these topics. (also if the problems are more recent it will be more appreciated. Thank you)

N.B. Also this is just for learning purpose. I know these topics are very tough for someone at this level but i want to give them a try out of interest you can say :D

Full text and comments »

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

By I_am_Invincible, history, 2 months ago, In English

Hello everyone. I want to touch the blue color within the 31st of may. If anyone wanna join this race with me you're welcome.

Full text and comments »

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

By I_am_Invincible, history, 4 months ago, In English

I am very annoyed by the fact that no matter how much I try I can't even cross the pupil barrier.. Now everyday or in every two days I am going to past here the problems I am solving.. If I don't slv any problem I can update the post.. Maybe this will help me in pushing myself everyday..any newbie or pupil or even higher rated coder can do the same or slv the porblems I am posting here.. I will slv it no matter what if I can't then watch the edi and slv somehow but will solve everyday for sure.. I think I will start doing cses again first.. Hope for the best..

N.B. I am not bluffing I am pretty much serious about it so pls dont write anything hateful that will demotivate me. Thanks :D

Full text and comments »

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