Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

Ashishgup's blog

By Ashishgup, 5 weeks ago, In English,

Hi everyone!

I would like to invite you to my fourth Codeforces Round, which I have made with my friends FastestFinger and TheOneYouWant. In terms of problems, it is my favorite among all my rounds.

With that said, I bring to your attention our new Codeforces Round #646 (Div. 2) that will take place on May/31/2020 17:35 (Moscow time). If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition.

I would really like to thank:

You will be given 6 problems and 2 hours to solve them. Scoring distribution will be announced later.

Good luck! :D

UPD: Scoring Distribution: $$$500-1000-1500-2000-2250-3000$$$

UPD2: Editorial (with memes, and detailed explanation) — Hope you guys enjoyed the contest! :D

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

»
5 weeks ago, # |
  Vote: I like it +59 Vote: I do not like it

I really like your problemsets. Hope this round is interesting too. Good luck :)

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

    Thank you. The statements are concise and hopefully you'll enjoy solving them.

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it -56 Vote: I do not like it

      Are the pretests strong

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it -14 Vote: I do not like it

        Stronger is better.

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it -21 Vote: I do not like it

        You need to understand that setters always try to make pretests as strong as possible. It's just that they miss trivial/edge cases sometimes and that is completely unintentional. Sometimes, these are suggested by other people involved in setting the contest and sometimes, it just misses everyone's head. Well, there are very very rare exceptions to what I just said.

    • »
      »
      »
      5 weeks ago, # ^ |
      Rev. 2   Vote: I like it -8 Vote: I do not like it

      concise... nice!

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it -41 Vote: I do not like it

      Wouldn't be a surprise it you said that you will not enjoy solving them.

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it -31 Vote: I do not like it

        Would be a surprise if you said I put my own thoughts in comments.

        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
          Rev. 2   Vote: I like it -30 Vote: I do not like it

          I remember this comment.

          • »
            »
            »
            »
            »
            »
            5 weeks ago, # ^ |
              Vote: I like it -21 Vote: I do not like it

            So, you are the real owner of that account haha

          • »
            »
            »
            »
            »
            »
            5 weeks ago, # ^ |
              Vote: I like it -20 Vote: I do not like it

            Btw how many accounts you have and how you use them getting upvotes on your own post

            • »
              »
              »
              »
              »
              »
              »
              5 weeks ago, # ^ |
                Vote: I like it -23 Vote: I do not like it

              Suppose i have n accounts. I login of one and upvote all except that account's comment. I down vote you comment. So up votes=n-1 Down votes=n From my side. But unfortunately n=1;

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

                this is not funny

              • »
                »
                »
                »
                »
                »
                »
                »
                5 weeks ago, # ^ |
                  Vote: I like it -20 Vote: I do not like it

                And btw how long it took to arriving at this shitty math puzzle

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                  Rev. 2   Vote: I like it -13 Vote: I do not like it

                  Neither it was intended to be. As i said earlier go fuck yourself.

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                    Vote: I like it -14 Vote: I do not like it

                  Put your ass away from me, it's swelling

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Problem D concise. Hmm...

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

        If you look at the statement barring input and interaction section, it looks concise to me. Interaction section of such problems has to be a bit descriptive. Some contestants found the description a bit confusing, so I'd like to know if this is what most people felt.

        I personally feel the statement is simple enough to grasp after reading it once or probably twice.

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

          Agree with you. I also don't see much scope in reduction of statement. I liked the problem though. For a while, I thought a better example could have brought more clarity but then realized that it could lead giving out unnecessary hints. Hence, I do think it was a decent enough statement. Anyway, in general, interactive problems tend to go lengthy.

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

      Sir , itna tough , one of the toughest A problems i have seen

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

      Problem C man! Problem C. Wrote a huge code which took 20 minutes of debugging and even after that just missed the deadline and then you present a solution like that. Felt so dumb after that.

»
5 weeks ago, # |
  Vote: I like it +178 Vote: I do not like it

Indian Round :)

Thanks for this round.

»
5 weeks ago, # |
Rev. 3   Vote: I like it +158 Vote: I do not like it

AshishGup fanclub; Can't wait for contest :3

»
5 weeks ago, # |
  Vote: I like it +168 Vote: I do not like it

As a tester, I found the problems interesting and the contest to be well balanced in terms of topics/difficulty. Highly recommend taking part in the contest

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

    I see this becoming tradition since 4-5 rounds, I mean a confirmation by tester. Good one!

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

      Uh-oh. Soon we will see loads of comments like

      tEStErs yOu fORgoT tO coNFirM tHe pROBlEMsET wAS gOoD

      below every round announcement without these comments

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

    Just tell me that contest doesn't have geometry problems ..XD

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

      2c55fbcf16febd50357e2eea11cc5cf62aaa9cbf.jpg

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

      No Ashish Gupta dont like geometry problems and ya he said its his favorite among all.. So hopefully hopefully

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

      Yes please, at least not some trigonometry problems.. I hate them

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

    Were you paid to said this?

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

    Faith in these types of comments restored.

»
5 weeks ago, # |
Rev. 3   Vote: I like it +40 Vote: I do not like it

It's my first time participating in a live Ashishgup contest and I feel so proud!( there aren't many Indian rounds :') )
Big fan here !

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -56 Vote: I do not like it

    For me it's a normal div2 round and not feeling so proud, what should I do? Die..

    • »
      »
      »
      5 weeks ago, # ^ |
      Rev. 2   Vote: I like it +11 Vote: I do not like it

      villazer i think u should shut the f*** up

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it -36 Vote: I do not like it

        Why, bcz I don't know Ashishgup? Come on b***h

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

          u asked "what should i do?" at least its better then dying

»
5 weeks ago, # |
  Vote: I like it +20 Vote: I do not like it

hope,setter provides short statements.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Wow

»
5 weeks ago, # |
  Vote: I like it +29 Vote: I do not like it

Wow, Indian Round.

»
5 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I have already started liking the contest.

»
5 weeks ago, # |
  Vote: I like it -15 Vote: I do not like it

It's kinda proud feeling for me to participate in Indian rounds..So excited...Jai Hind !!!

»
5 weeks ago, # |
  Vote: I like it -13 Vote: I do not like it

After seeing this name ashishgup it gives me goosebumps

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -43 Vote: I do not like it

    Ik feeling proud Indian Army in background..

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it -17 Vote: I do not like it

    How do so many people know him.. just wondering, no offense.

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

      He is on the first page of codechef, among Indians top rated participants, and is also consistent on codeforces.

    • »
      »
      »
      5 weeks ago, # ^ |
      Rev. 2   Vote: I like it +19 Vote: I do not like it

      And most of his solutions are clear and self-explanatory as well.

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      He is one of the best coders of India and also he is quite popular on Quora platform where he writes about programming and competitive coding.

»
5 weeks ago, # |
Rev. 7   Vote: I like it +5 Vote: I do not like it

'''

»
5 weeks ago, # |
  Vote: I like it +15 Vote: I do not like it

A graph prob for sure.

»
5 weeks ago, # |
  Vote: I like it -35 Vote: I do not like it

Favorite comment on cf of all time.... (https://codeforces.com/blog/entry/62744)

»
5 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Feels like an Adrenaline Rush .... Can't wait XD

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

Great to see you back after more than a year. Looking forward to an educative and interesting round :)

»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

I am proud of my country India. Thank you very much Ashishgup..

»
5 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it

Question related to cricket? Please?

»
5 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Please make sure the problem difficulties are balanced and don't go from 1000 in B to 1700 in C...!

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    C is supposed to be in the range of 1500-1800

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

      What I meant was, don't have a huge gap in the difficulties of problems, space it out properly.

»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

It was a pleasant surprise waking up this morning seeing a contest blog and a contest scheduled just after a day too.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

So excited to see Indian Round in Codeforces

»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

Really excited to participate for the very first time in an Indian round. :')

»
5 weeks ago, # |
Rev. 3   Vote: I like it +2 Vote: I do not like it

First time, i will get a chance to part in competition by Ashishgup .

Big Fan Ashishgup :)

»
5 weeks ago, # |
  Vote: I like it +38 Vote: I do not like it

Man, it has been a long time that comments go in such a very positive way. And it’s really cheerful to see these support and confidence to a problemsetter. I hope the round goes well and thanks for the great efforts!

»
5 weeks ago, # |
  Vote: I like it +17 Vote: I do not like it

Wow, An Indian Round and that too of Ashish Gupta. Can't wait to participate in it !!!

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks a lot codeforces for these contests !

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Woke up, and saw two more div 2 contests in a small span of time ,with the next contest prepared by Indians. This inspires me more! Thanks Codeforces!!

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

back to back round in codeforces! Thanks for another div 2 round.

»
5 weeks ago, # |
Rev. 3   Vote: I like it -20 Vote: I do not like it

Excited!

»
5 weeks ago, # |
  Vote: I like it +377 Vote: I do not like it

»
5 weeks ago, # |
Rev. 3   Vote: I like it -42 Vote: I do not like it

Woah! An Indian CF Contest, after a long time! It will be fun! ;)

Thanks!

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it -16 Vote: I do not like it

    Can someone please explain, why so many downvotes, on my above comment?

    I didn't make a wrong statement! I haven't made any wrong claim! I didn't say anything wrong about anyone!

    I just thanked the authors! What's so downvoting in that?

»
5 weeks ago, # |
  Vote: I like it +37 Vote: I do not like it

Good to see aryanc403 as one of the testers.

»
5 weeks ago, # |
  Vote: I like it +138 Vote: I do not like it

Woah, Indian round! That's so nice

»
5 weeks ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it
»
5 weeks ago, # |
  Vote: I like it -17 Vote: I do not like it

That's great !!! Being an Indian & a big fan of Ashishgup I'm really really excited... Hope I can write some clean codes & submit it quick like our hero !!!

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope strong pretest and clear statement!

»
5 weeks ago, # |
  Vote: I like it +61 Vote: I do not like it

After a long time Ashishgup wouldn't participate in a contest XD.

»
5 weeks ago, # |
  Vote: I like it -52 Vote: I do not like it

$$$I \,\,am\,\, from\,\, India\,\, and \,\,Participating \,\,for \,\,the \,\,1st\,\, time\,\, in \,\,Indian \,\,authored \,\,contest.\,\, Quite \,\,excited!!$$$

»
5 weeks ago, # |
  Vote: I like it -92 Vote: I do not like it

There are many red coders from India. I request Mike to give the opportunity to make one contest by an Indian in a month.

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

    It is not about Mike giving an opportunity to them, everyone has an opportunity to make a contest. Just that they need to submit a nice problem set and apply to set a contest.

»
5 weeks ago, # |
  Vote: I like it -50 Vote: I do not like it

It's good to see Indian Problem Setters ! Expecting :) Great Problemset :)

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -45 Vote: I do not like it

    I don't know why I got so many down votes for this comment But Yeah atleast I know they werent Indians who disliked this ! :) :)

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

      Categorizing people by nationality obviously does not make you feel uncomfortable. I wonder which categorization would.

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it -25 Vote: I do not like it

        spookywooky idk why it bothers you That an Indian is happy about Indian setting problems on Cf :) :) , It is not categorizing but a sort a patriotic sentiment :) Am not uncomfortable with having such a sentiment

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

      The people are downvoting such comments, because every comment is the same, It is almost like a spam.

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

        Pred Oh I agree to that :) :) ! It's really looking a kind of spam with many People commenting the same thing :( Sry for that

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it -17 Vote: I do not like it

      grow up kiddo

»
5 weeks ago, # |
  Vote: I like it -19 Vote: I do not like it

gonna attempt my first indian round .. #excited

»
5 weeks ago, # |
  Vote: I like it -17 Vote: I do not like it

WoW! I am excited for an Indian round, I hope problem statements will also match to our psychology,
A great fan of Ashishgup
Jai Hind
\‾(*_*)

»
5 weeks ago, # |
Rev. 2   Vote: I like it -14 Vote: I do not like it

After long time Indian setters...hoping for a great contest

»
5 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

WOW!! Extremely excited for a contest by GRANDMASTER FastestFinger

»
5 weeks ago, # |
Rev. 2   Vote: I like it +8 Vote: I do not like it

Eagerly waited for this trio to set problems. :D :D

»
5 weeks ago, # |
Rev. 2   Vote: I like it -21 Vote: I do not like it

Good luck! Hoping for an interesting round

»
5 weeks ago, # |
  Vote: I like it -9 Vote: I do not like it

It is my first Indian Codeforces Round. XD Overexited to participate in it. Hope that this contest goes very well :D

»
5 weeks ago, # |
  Vote: I like it +117 Vote: I do not like it

I hope one day problemsetters will be hyped caused by quality of problems instead of nationality.

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it +122 Vote: I do not like it

    I agree. The reason behind the hype is only the fact that there aren't many Indian problem setters and the last round by Indian setters was quite a while ago, so this round comes as a pleasant surprise to many.

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

    I agree. The setter is not hyped here. You can see the past contest prepared by him. The quality of problems prepared by him are always good. Indian contests are rare on Codeforces which is the very reason of the excitement.

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

    Problem-setters are hyped for their problem quality indeed, McDic, Monogon, FieryPhoenix to name a few! And Ashishgup does make good contests!

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

      I think that DarthKnight's problems are really nice. But he did not offer problems for a while...

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I saw too much hate speech in his last round. Sadly.

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
          Rev. 4   Vote: I like it 0 Vote: I do not like it

          I don't know what kind of drug(s) you're on, but I suggest you change your dealer man.

          めんどくさい

          • »
            »
            »
            »
            »
            »
            2 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Maybe I am mistaken. I thought there was something happened around #406 and later two guys who claimed to be your student.

            I thought the community wasn't kind to you that time and I felt bad for you. Now I know, I were in drug then maybe.

            Anyway, good to know that wasn't the case.

            Btw, your logic has fallency, if my drug works so well, I shouldn't change the dealer, right?

            • »
              »
              »
              »
              »
              »
              »
              2 weeks ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Greatly depends on what kind of drugs you use ;)

»
5 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Congrats to our indian problemsetters, I'm really excited about this round!

And talking about excitement, we will upsolve the problems 5 mins after the round:

https://youtu.be/yDdzbZhSYD0

See you on Algopedia!

»
5 weeks ago, # |
Rev. 2   Vote: I like it -50 Vote: I do not like it

bro contest is Indian!!!!!!!!

»
5 weeks ago, # |
Rev. 2   Vote: I like it +47 Vote: I do not like it

It's a Div. 2 round. So why there is no Expert or Specialist testing the round?

»
5 weeks ago, # |
Rev. 2   Vote: I like it +21 Vote: I do not like it

Can't wait to compete in another round after a yearr! >.< so excited. cc LalisaManoban

»
5 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

We are expecting short background story. I hope there will nothing like this

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I liked the editorial very much. It's the first time I've seen something like that and it's cool ig.

»
5 weeks ago, # |
  Vote: I like it -46 Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it

wow Indian round :) . Hope for good problemset. First time participation in a south Asian problem setter contest in codeforces...

»
5 weeks ago, # |
  Vote: I like it +66 Vote: I do not like it

I'm an Indian and also admire Ashishgup but I swear majority Indians get proud even if the word "India" is mentioned lol.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it
»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

We will remember this round!

»
5 weeks ago, # |
Rev. 3   Vote: I like it -39 Vote: I do not like it

Another contest in May!

This is going to be the 11th rated round hosted in the month of May. Though, out of the previous 10, one got declared unrated due to long queues, but still it's an effort worth appreciating. Kudos!

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -32 Vote: I do not like it

    Yet Another HateForces and FollowTheHerdForces Problem!

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

      Dude that meme has been posted thousand times in codeforces comments section.Stop crying for downvotes everytime. The community knows better.

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

      How 'bout reflectin' on your comment's content first bub.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Ashishgup, see the number of your fan followers XD

»
5 weeks ago, # |
  Vote: I like it +55 Vote: I do not like it

I really had enjoyed testing it ,and highly recommend it for every one

»
5 weeks ago, # |
  Vote: I like it -25 Vote: I do not like it

Indian round... wow..!
Happy coding... :)

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Happy to see Indian problem setters!!

»
5 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

How can i miss my favourite coder's contest !! Very excited :)

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I hope current long queue won't effect this contest :(

»
5 weeks ago, # |
  Vote: I like it +34 Vote: I do not like it

As the Round number is a palindrome!(646) . Thinking that some tasks will be pal IND romic

»
5 weeks ago, # |
Rev. 2   Vote: I like it +12 Vote: I do not like it

How many problems fastestfinger set? I am afraid that my typing speed is not so good.

»
5 weeks ago, # |
  Vote: I like it -17 Vote: I do not like it

(❁´◡`❁) HIGHlight is THAT it is A Indian round after so long.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

it's been a while since i have participated in contest, keenly looking forward for this round

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it -12 Vote: I do not like it

    me also, will target pruple this time

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

      I think both you are same person !! Why did both of you not give the contest ?

      • »
        »
        »
        »
        5 weeks ago, # ^ |
        Rev. 2   Vote: I like it +2 Vote: I do not like it

        oh yeah, sorry i am same, actually i was about to give from the above account and i was really excited about it, but unfortunately my internet connection messed up, it took a long time to load the question so i skipped

        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
          Rev. 2   Vote: I like it +2 Vote: I do not like it

          Dont worry about it. I too have multiple accounts . Now I just feel like Sherlock :P

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

            hahaha xD

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

              Yeah I understand mobile data problems especially these when the traffic is so heavy on the website. I hope you get a broadband installed soon :D.

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

                you are indeed sherlock, my honour sir i have talked to service provider today only :0

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  Woah !! That was not expected. But be careful, dont start downloading movies and stop coding, because thats the only way you can get red with all of your ids :)...

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  ab to sach bolde bsdk.jpeg xD

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  ?

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  5 weeks ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  ___ / \ o o

»
5 weeks ago, # |
  Vote: I like it -36 Vote: I do not like it
»
5 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Ashishgup :: "TheOneYouWant for helping with preparing problems and giving new ideas"

Me :: You are really good friends. :-D

»
5 weeks ago, # |
Rev. 2   Vote: I like it +8 Vote: I do not like it

Indian Round :D

Hopefully, there will have no ugly geometry.

»
5 weeks ago, # |
  Vote: I like it -14 Vote: I do not like it

hope to solve problem C ..

»
5 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

This round is so much more famous than other codeforces rounds so far . Seriously, just have a look at the number of upvotes it has so far.

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

    https://codeforces.com/blog/entry/76777

    Also, by famous do you mean famous in one place or just really famous worldwide? Because the second one can't be accurately deduced by codeforces upvotes (see the number of participants from each country).

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Though the number of participants are almost same but the number of upvotes says about the popularity of these guys in India and the number of Indian participants taking part regularly in CF contests.

»
5 weeks ago, # |
  Vote: I like it +19 Vote: I do not like it

Even the contest is Made In India by the "Make In India" initiative!!! Aur kitne ache din chaiye Mitron!

»
5 weeks ago, # |
  Vote: I like it +29 Vote: I do not like it

enjoy this round

»
5 weeks ago, # |
Rev. 2   Vote: I like it -30 Vote: I do not like it

Good contest!!

»
5 weeks ago, # |
  Vote: I like it -28 Vote: I do not like it

Good!

»
5 weeks ago, # |
  Vote: I like it -93 Vote: I do not like it

If you like indian contests, give me upvotes LOL

»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

Hoping to see short and concise problem statements!

»
5 weeks ago, # |
  Vote: I like it -51 Vote: I do not like it

Problem setters from other countries write contests every week: Nothing happened Problem setters from Indian: "wow, Indian round" Indian, Indian everywhere Plz stop yelling Indiots!

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -34 Vote: I do not like it

    What's the problem saying an Indian round, Indian round.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -28 Vote: I do not like it

    Shut up asshole! Who the fuck are u to call us idiots?

»
5 weeks ago, # |
  Vote: I like it -48 Vote: I do not like it

It will be my first Indian round. Hope to have a good contest!

»
5 weeks ago, # |
  Vote: I like it +16 Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it +31 Vote: I do not like it

amnesiac_dusk Waiting for your round

»
5 weeks ago, # |
  Vote: I like it -15 Vote: I do not like it

Why is every Indian comment getting so many Downvotes?

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it +70 Vote: I do not like it

    Its really cringy to associate codeforces contest with patriotism lol, which many are doing here. Thats why they are getting downvotes

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it -19 Vote: I do not like it

      But I have seen similar comments during the Chinese contest's but none of them got any downvotes. Can you give the reason for that as well

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

        https://codeforces.com/blog/entry/76895

        This right here is the blog for the previous chinese round. I have scrolled through the entire comment section and found very few, probably less than five comments that are being "patriotic" about the chinese round. (Of course, I counted two, but I'm willing to admit I may have lost a few because of the sea of comments complaining that it interferes with breaking fast on the Indian subcontinent).

        I haven't counted the number of "patriotic" comments on this blog, but I'm willing to bet that it's a bit more than five. Reading that kind of thing gets annoying very quickly.

        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it -6 Vote: I do not like it

          And none of those comments have more than 1 downvote.

»
5 weeks ago, # |
  Vote: I like it +68 Vote: I do not like it

every comment on this round

»
5 weeks ago, # |
  Vote: I like it +40 Vote: I do not like it

Wow, even I'm Indian, but this comment section is next level cringe.

»
5 weeks ago, # |
  Vote: I like it +37 Vote: I do not like it

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You work for McLaren F1 team or in the other department?

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

    just imagine tourist on this scale

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Tourist would be Godzilla on this scale.

»
5 weeks ago, # |
  Vote: I like it -6 Vote: I do not like it

thanks this statement is something help me because I like simple model of computer system

»
5 weeks ago, # |
  Vote: I like it -25 Vote: I do not like it

let's see what INDIAN red coders have got up their sleeve..SALUD!!

»
5 weeks ago, # |
  Vote: I like it -54 Vote: I do not like it

Thoda time jane do. CF pe indian rounds hi dikhenge.

»
5 weeks ago, # |
  Vote: I like it -19 Vote: I do not like it

When do you guys have dinner since the contest runs from 8pm to 10pm in India?

»
5 weeks ago, # |
  Vote: I like it -19 Vote: I do not like it

Although final sem exams from tomorrow, how can I miss this contest set by great Ashishgup!

»
5 weeks ago, # |
Rev. 2   Vote: I like it -16 Vote: I do not like it

Here's the problem statement:

for comment in comments:
    if 'india' in comment.lower():
        downvote()

Please explain the logic of this Problem??

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -23 Vote: I do not like it

    I am also curious to know the exact reason behind it. I have seen similar comments for Chinese rounds earlier but none of them got the downvotes. Then why this is happening specifically for India.

  • »
    »
    5 weeks ago, # ^ |
    Rev. 2   Vote: I like it +100 Vote: I do not like it

    Don't touch/think if code works.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I hope to do well.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Looking forward to it!!!!

»
5 weeks ago, # |
  Vote: I like it +23 Vote: I do not like it

Itne excited hai sab kahi chutiya na kat jaye.

»
5 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

Docking Complete !!

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck, have fun, guys!

»
5 weeks ago, # |
Rev. 2   Vote: I like it +18 Vote: I do not like it

Now I am seriously doubting myself why I started CP in the first place.

  • »
    »
    5 weeks ago, # ^ |
    Rev. 3   Vote: I like it 0 Vote: I do not like it

    All the Indian hype down in drain for me :) The problems were great or I dont know who am I to judge. But I couldnt solve even one :sob:

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

The quality of the problems are really good! thank you for the contest.

»
5 weeks ago, # |
  Vote: I like it +54 Vote: I do not like it

Short statement and Nice Problem Thanks :)

»
5 weeks ago, # |
  Vote: I like it +43 Vote: I do not like it

Thanks for the contest! IMO the problems are really interesting!

»
5 weeks ago, # |
  Vote: I like it +17 Vote: I do not like it

Man I made stupid mistakes ugh... I could have done better

»
5 weeks ago, # |
  Vote: I like it -6 Vote: I do not like it

I think this was an easy $$$C$$$.

»
5 weeks ago, # |
Rev. 2   Vote: I like it +12 Vote: I do not like it

problem C -> Test case 3, please reveal yourself :( :( :(

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    all values are odd

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    There's only one node in the graph...

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

    Could be something like this- 1 4 1 1 2 2 3 3 4 A skewed tree considering the special element as root. Answer is always 'Ayush' in such cases

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

    EDIT -> I am stupid to have read the problem incorrectly. Ignore below

    I tried a few approaches, but one approach which looked really correct was -> If x is leaf then -> Ayush, else if K = N — 1 — degree[x] (number of nodes not counting level 0, 1 when tree is rooted at x) is odd then player 1 else player 2.

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      if x isn't a leaf, x will become a leaf only after N-2 removals, so change your K to N-2 and it will work.

»
5 weeks ago, # |
  Vote: I like it +58 Vote: I do not like it

Either D or E alone would have made this contest worth all two hours of it. Nice problems. :)

»
5 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it
»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

How do you do problem E? I tried constructing an euler tree and sorting by values and doing some stuff with that using sqrt decomposition but it failed pretest #9... I didn't use segment tree because I'm bad and don't know how to update ranges from [l,r] to 0 and find sum from [l,r]. Is that the correct method?

  • »
    »
    5 weeks ago, # ^ |
    Rev. 3   Vote: I like it +3 Vote: I do not like it

    Problem E is just a greedy observation. First, you observe that you should replace each value of A with the root-to-leaf minimum (since if you can swap here you can swap at any ancestor). Then, within each node, you just swap as much as possible (such that as many 0s and 1s are in the right positions as possible). This can be implemented with a depth-first search to find how many swaps you perform on each node.

    At least, I assume that's the correct greedy observation. Systests could end up proving me wrong.

    Edit: passed systest. Seems my greedy is correct after all.

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Ohhhh ok I was thinking of the root-to-leaf thing during contest but didn't go through with it ahhh, that's very smart. Cool problem

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

    Actually the solution is easier: first check that number of 1-0 and 0-1 vertices is equal. Then mark all such vertices that there is no vertex on the simple path between them and root of smaller value. Now notice that you only want to shuffle equal number of 1-0 and 0-1 vertices at a time. Go through the marked vertices in dfs traversal order and match the maximum possible number of 1-0 and 0-1 vertices in their subtree. You can return the leftover vertices from dfs to the parent call to avoid any complicated technique of tracking what's been matched and what's not.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It was a simple dfs, nothing special.

    Key idea
»
5 weeks ago, # |
Rev. 2   Vote: I like it +6 Vote: I do not like it

Why is this incorrect in D — Find maximum. Then use binary searchto find which subset contains that max element. Ask another query not containing that subset

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

    I passed by doing this. Did you see that when only 2 elements remain, 1 query is enough?

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I also did this but I think my binary search is lousy. So it may be taking more than $$$10$$$ for worst case of $$$n=1000$$$.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it
»
5 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Damn man, I don't remember having such nice concise no bs questions before. And not to mention that I loved both the graph problems. Jolly good contest bois.

»
5 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

I was only able to solve the first three (took way too long on C) but those were really good and interesting. I especially liked the short and direct statements. Waiting for the editorial..

»
5 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Very nice contest. Problem E was very interesting.

»
5 weeks ago, # |
Rev. 2   Vote: I like it -28 Vote: I do not like it

Indian rounds are allways great!

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

In D I am getting WA on pretest $$$4$$$. But I think in worst case I am querying only $$$12$$$ times.

My approach is to first put all indexes of subsets in query to get the maximum element. Then I binary search the appropriate subset which has maximum. This should take maximum $$$10$$$ query. Then I leave that subset and query all other subset. This is $$$1$$$ query.

In total $$$12$$$ query where I went wrong? Thank you. Reference submission: link

  • »
    »
    5 weeks ago, # ^ |
    Rev. 3   Vote: I like it +6 Vote: I do not like it

    The union of all subsets may be not the whole array $$$A$$$, so if the maximum value is not in any subset, you will get a WA. Try this:

    1
    3 1
    1 1
    

    and array A is $$${1, 2, 3}$$$.

»
5 weeks ago, # |
  Vote: I like it +28 Vote: I do not like it

Why do I feel that A is always harder then B and C /:

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    WAT IS IN PROBLEM A PRETEST 3? SAME STUCKED ON PRETEST 3

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

    always go for bruteforce if constraints allow in such scenarios.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

life of a div2 scrub:

WA on div2A twice, take 15 minutes to solve

skip problem B because misread and thought it was too hard

go to problem C, misread and overcomplicate solution, then spend next hour tilting because you overlooked one bug in your code that messed up an otherwise correct solution (after WAing 6 times)

go back to problem B, realize it's not as hard, but since you have like 10 minutes left you code a greedy solution that probably will TLE once they use stronger tests

pog champ tbh

»
5 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

After 10 mins: +4000 submissions for A and only 800 AC.

This feels like: Bro, am I joke to you? xDD

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can somebody please help me out on why my solution fails for problem A- https://codeforces.com/contest/1363/submission/82135360

»
5 weeks ago, # |
  Vote: I like it +54 Vote: I do not like it

I'm surprised that D didn't have as many solves as E. Maybe the somewhat confusing problem statement threw people off.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    That's usually the case with interactive problems, people just get scared of them

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone tell why my solution 82140244 shows WA on pretest 1?

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

    your solution gives $$$!$$$ $$$3$$$ $$$4$$$ as the final answer. It is different from $$$!$$$ $$$4$$$ $$$3$$$ as order matters

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Problems are interesting and tricky both.Though i just read a,b,c and solved a & b(with many WA).

»
5 weeks ago, # |
Rev. 2   Vote: I like it +47 Vote: I do not like it

A — Find the number of odd and even values in the array, then enumerate how many odd numbers are chosen (or, equivalently, how many even numbers are chosen).

B — A good string is always either some number of 0's followed by some number of 1's, or some number of 1's followed by some number of 0's. Enumerate where this change happens, and maintain the number of 0's and 1's on each side.

C — If x is a leaf, the first player wins. Otherwise, if n is even, the first player wins; if n is odd, the second player wins (I do not know how to prove...)

D — Consider the maximum element of the array. Note that all but at most one value in the password will be this maximum element (because at most one subset can include it). We find the maximum value of the array using 1 query, and binary search to find where it is. Use another query to find the value in the password whose subset contains this maximum element. When n = 1000, exactly 12 queries are used (10 for binary search and also 2 other queries).

E — Set all a[i] to be the minimum a[i] of itself and its ancestors. Then do a DFS and greedily try to match as many values as possible, leaving values that cannot be matched to operations performed further above.

I do not know how to solve F.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    Had the same solution in mind for 'B' but my solution failed for some pretests, can u please help me out https://codeforces.com/contest/1363/submission/82098367

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    C is because in the 2 node case whoever's turn to move wins otherwise it's a race to put the other guy into a losing situation (if anyone knows the 21 game it's kinda like that)

  • »
    »
    5 weeks ago, # ^ |
    Rev. 3   Vote: I like it 0 Vote: I do not like it

    In problem C, you keep removing nodes until a node — x is connected to only 2 nodes. then if player 1 removes the next node then the player 2 wins.

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

    For C, consider this tree of 4 nodes 1 2 1 3 1 4

    and the special element being 1. In this case won't the winner be second player?

    • »
      »
      »
      5 weeks ago, # ^ |
      Rev. 2   Vote: I like it +1 Vote: I do not like it

      No. The first player would win in this case.

      After the first player removes a leaf (let's arbitrarily assume it is node 2), the tree will become (1, 3) and (1, 4).

      After the second player removes either 3 or 4, node 1 becomes a leaf and the first player can remove it, thus winning the game.

      Remember that the tree is not rooted.

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

        Thanks for clarifying, I mistook 1 to be a leaf for the whole contest and was trying an overcomplicated solution. Looks like I should stop practicing coding and start practicing reading.

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

    My solution for C was very different: Let dis[i] be distance of i from node x.

    Choose a leaf where dis[i] is even and smallest, and remove it.

    If no even dis[i] exist then: Choose a leaf where dis[i] is largest, and remove it.

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

    You can see editorial for the proof of C :)

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How to find subsets with max value with one query ?

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can somebody help me out with problem B. I couldn't really come up with an algorithm.