pjcode0's blog

By pjcode0, 13 days ago, In English

Hello Codeforces,

Hope everyone is doing well! Actually, in my college and peers, almost nobody is doing (or did) CP.. and that is the reason why I can't do beautiful discussions on problems and things like peer pressure and all those things don't happen with me... I think doing CP with peers is way more fun and way better than doing it alone (at least a discussion must be there).

If you're up, to do CP with me kindly comment down and if you agree, please upvote...

At start, our schedule might be:

Two Div2 contests daily (virtual or live).. and solving problems at least till C. Or We can also do like 3 contests daily and upsolving problems till C the next day (We can adjust the schedule accordingly).

Wish you everyone, more ratings and learning....

UPD: On public demand, I have created a whatsapp group for the same... Enjoy! Join Now

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

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can u Please elaborate more like how the concept of pair-programming may benefit the 2 users?

  • »
    »
    13 days ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    Well, peer-programming can be helpful: (i) We can solve the same problems together and then discuss our approaches, sharing ideas will be beneficial (ii) It helps to keep the momentum up since you have someone who keeps you motivated.. (iii) Can play virtual contests together and compare the scores...

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

It's a great idea I'm a newbie pm me whenever you want to solve problems :)

»
13 days ago, # |
  Vote: I like it +103 Vote: I do not like it

Forget peer programming, is anyone up for beer programming?

  • »
    »
    13 days ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    That was ultra smooth..cheers

  • »
    »
    13 days ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    I'm sending you the tickets... Let's meet in India and do some beer programming and stuff.. ;)

  • »
    »
    13 days ago, # ^ |
      Vote: I like it +47 Vote: I do not like it

    bear programming?

    • »
      »
      »
      13 days ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      yes bears, pandas and little bit of pussy cats ;)

    • »
      »
      »
      13 days ago, # ^ |
        Vote: I like it -10 Vote: I do not like it

      do u like bear? i remember you wore a bear shirt on one of your videos

  • »
    »
    13 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    HELLO MR RED 
        By observing my rating graph can you tell me when I will  become pupil.
    • »
      »
      »
      13 days ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      not Mr red here,

      but just wanted to tell you that you are practicing really hard! Just keep doing that and you'll become a pupil real soon :)

  • »
    »
    13 days ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    idk about that..

    all i do is fear programming.

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Hello, I am also in college and almost none of my peers are interested in CP. I would be very happy if you agree to do CP with me :) (sorry for my bad English, this is not my native language).

  • »
    »
    13 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    just pm me here on codeforces whenever you want to solve some problems or do a contest.. you can also message me on wa I’ve messaged you my contact...

    • »
      »
      »
      12 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      hey Pratham, would like to join it too. feel free to dm here on CF.

»
13 days ago, # |
  Vote: I like it -10 Vote: I do not like it

could any one help me with some LIS(dp) pair vector problem , the statement we got array a of {wieghts, IQ} of elephants, we want longset subset of the seq (print seq too) that validate w(a[i]) < w[a[i+1]) and IQ(a[i]) > IQ(a[i+1]). could any one solve it in O(n log(n))n any idea ?

»
13 days ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

could any one help me with some LIS(dp) pair vector problem , the statement we got array a of {wieghts, IQ} of elephants, we want max subset of the seq (**print seq** too) that validate w(a[i]) < w[a[i+1]) and IQ(a[i]) > IQ(a[i+1]). could any one solve it in O(n log(n))n any idea ?

  • »
    »
    12 days ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    As far as I know the only solutions I know are using 2d segment trees or divide and conquer with a fenwick tree or segment tree

    Both of which are quite advanced I feel (relative to your rating)

    Edit: I just realized I'm not sure if you're allowed to reorder the elephants, if you are allowed to then its just a standard LIS problem

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Yes!

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

If you are interested in peer programming then you can join this whatapp group. They keep virtuals almost everyday. And you can find good people for discussions there( Including masters) .

https://chat.whatsapp.com/HXQ4pvymMEmKa2BxwZPlJh

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Consider watching Geothermal Errichto or SecondThread streams

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Any discord server for peer programming ? Like is there any server with the option to pair up with others and train together?

»
12 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Yes,I am ready.

»
12 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Are you guys creating a group or something if so kindly add me too

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

I would also love to be in the WhatsApp group. Kindly add me too. Thanks.

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

Do you mind if I join too? Thanks :)