### vansh_ag's blog

By vansh_ag, history, 7 weeks ago,

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

• +1

 » 7 weeks ago, # |   +5 Go to the Codeforces problemset, select the interactive tag and practice problems slightly above your rating.
•  » » 7 weeks ago, # ^ |   +2 good idea
•  » » 7 weeks ago, # ^ |   0 i will try for sure
 » 7 weeks ago, # |   0 Consider Binary Search.When meeting interactive problems about permutations, try to find 1 or n first, then also try Binary Search.
•  » » 7 weeks ago, # ^ |   +3 Like CF1918E。Although its 2200, but you can use the way i suggest you.find 1 and n first. Then try Binary Search.
•  » » 7 weeks ago, # ^ |   0 okay
 » 7 weeks ago, # |   +3 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.
•  » » 7 weeks ago, # ^ |   +1 When you want to find number that is kth.Also try Binary Search.
 » 7 weeks ago, # | ← Rev. 2 →   0 This is a very basic one. lightOJ problemcf 1520F1
 » 7 weeks ago, # |   0 Another basic problem for practice 1924F - Anti-Proxy Attendance
•  » » 7 weeks ago, # ^ | ← Rev. 2 →   0 Thanks for sharing!!!Are you sure it is a basic problem it is 3500 rated...?
•  » » » 7 weeks ago, # ^ |   0 It's a good warm up for sure
 » 7 weeks ago, # |   0 that is something that you must find out for yourself