vansh_ag's blog

By vansh_ag, history, 9 months ago, In English

Hello everyone From past 2 contest we get interactive problems in the contests which i found so difficult to solve, this is my first time when i solved the interactive problems for the very first time so i need your suggestion from where to practice problems like this and more over this how to efficiently approach these type of question... Any suggestion in the comment box will be appreciable

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

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

Go to the Codeforces problemset, select the interactive tag and practice problems slightly above your rating.

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

Consider Binary Search.When meeting interactive problems about permutations, try to find 1 or n first, then also try Binary Search.

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

    Like CF1918E。Although its 2200, but you can use the way i suggest you.

    find 1 and n first. Then try Binary Search.

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

    okay

»
9 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Another easy interactive problem likes CF1937 C.You should now that a | a equals a.

Then you find n and the number x that n ^ x is the maxium.

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

    When you want to find number that is kth.Also try Binary Search.

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

This is a very basic one.

lightOJ problem

cf 1520F1

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

    Thanks for sharing!!!

    Are you sure it is a basic problem it is 3500 rated...?

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

that is something that you must find out for yourself