Pretest2's blog

I am the 2nd testcase. ASK ME ANYTHING!
By Pretest2, history, 11 months ago, In English

Hi I am Pretest2. I hit 1800 recently. AMA.

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

»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

congrats !! can you suggest me some roadmap ... i really want to become green :(

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Solving a2oj problem b ladder would be a good step ahead

    → Reply
»
11 months ago, # |
  Vote: I like it +116 Vote: I do not like it

Please Forgive me for i have failed you 😔

→ Reply
»
11 months ago, # |
  Vote: I like it +89 Vote: I do not like it

why are you always so annoying

→ Reply
»
11 months ago, # |
  Vote: I like it +9 Vote: I do not like it

Give me tricks to pass you.

→ Reply
»
11 months ago, # |
  Vote: I like it +4 Vote: I do not like it

what will you do on 22 jan?

→ Reply
»
11 months ago, # |
  Vote: I like it +9 Vote: I do not like it

Go get a shower

→ Reply
»
11 months ago, # |
  Vote: I like it -8 Vote: I do not like it

Thanks! can you suggest to me how to do well in the contest..? I want to become green'

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it -7 Vote: I do not like it

    Focus on Problem B of past 100 contests maybe.

    → Reply
    • »
      »
      »
      11 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      thank you brother, most of the time ididn't well understand in read question! how to adjust it

      → Reply
»
11 months ago, # |
  Vote: I like it -8 Vote: I do not like it

Congrats on 1800. Any good suggestions for solving problems of each rating ?

→ Reply
»
11 months ago, # |
  Vote: I like it +9 Vote: I do not like it

How does it feel knowing that I failed you in life? I am sorry, I am trying my best

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why you always get on our nerves during contests?

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Don't you think the Tenjiku Arc should have a better ending?

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Don't you have something better to do?

→ Reply
»
11 months ago, # |
  Vote: I like it +69 Vote: I do not like it

Hello. Can you give us your location, so that we can send a nuke eliminating you from existence?

→ Reply
»
11 months ago, # |
  Vote: I like it +35 Vote: I do not like it

pretest1 vs Pretest2 vs pretest3 vs pretest4

Here they are, the codeforces authorities. Who is your favorite?

→ Reply
»
11 months ago, # |
  Vote: I like it -11 Vote: I do not like it

i have posted a question in my blog can you solve that for me

→ Reply
»
11 months ago, # |
  Vote: I like it +33 Vote: I do not like it

Here's where you born (first WA on test 2 in first codeforces contest):

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why do you always give me FST?

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Because sometimes I feel weak

    → Reply
    • »
      »
      »
      11 months ago, # ^ |
        Vote: I like it -8 Vote: I do not like it

      For reference:(Question link)

      I need proof for this: The idea is to apply Moore’s Voting algorithm, as there can be at max k – 1 elements present in the array which appears more than n/k times so there will be k – 1 candidates. When we encounter an element that is one of our candidates then increment the count else decrement the count.

      Can you help? and Consider me a beginner.

      → Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Please suggest me a roadmap. I want to be Specialist.

→ Reply