Is binary lifting considered a data structure with embedded sparse table or is it a algorithm that is somewhat similar to binary search?

Если мы вычисляем префиксные суммы используя формулу p[i + 1] = s[i] + p[i], является ли это динамическим программированием?

Sorry for the stupid question, couldn't find anything on stackoverflow, cuz have no idea how to google that.

I was solving one graph problem, and met this declaration of adjacency list 49661413, I am confused, how is it possible that vector of vectors is declared using vector<int> name[], and it is not a simple vector, I don't even realize what's that. Couldn't you please explain to me what's that or give me a link to website with some info? Thanks in advance

This is an example of problem form Russian state exam, you have to precompute unswer and fill in blank with this answer, you are given 4 hours for the whole exam, and this one is not the hardest, can someone please me help with fast solution.

Find all integer number on the segment [106 000 000, 107 000 000] which have 3 different even dividers. Put this numbers in the answer.