ak2006's blog

By ak2006, history, 3 years ago, In English

Hello everyone

In the last Codeforces round, one possible solution to Div 2 Problem D / Div 1 Problem B (named "Integers have Friends") used sparse table data structure to handle range GCD queries. So I posted a new video tutorial explaining what a sparse table is and how we can use it to handle range GCD queries.

Link to the tutorial

After watching that tutorial, you should be able to solve / up-solve (if you did the contest and didnt solve it in contest) the Codeforces problem.

I also made a video editorial for that problem: Link to the video editorial for Integers have Friends

Hope this helps some of you.

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

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

Heartly thanks bro, sparse table is my favourite data structure, its great you are making these videos :) please make one on this This

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

thanks for the videoeditorial ak2006

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

    You are welcome. Its my pleasure to help the CP community.