You're given N (N ≤ 2000) and N points, then you are given Q (Q ≤ 10⁶), the number of queries, and next Q lines consist A_i, B_i, C_i. For each query you should find how many points are on this line, i.e. how many j that A_i * X_j + B_i * Y_j + C_i = 0.

Hello everyone!

Can someone tell me how to make update on segment (from l to r)?

If you can write a code, please send me.

Thanks for attention!

Hello everyone!!!

Can someone give me problems for this topics :

1. Sqrt-decomposition.
2. Games (on graph).
3. DSU.
4. Segment tree.
5. Fenwick tree.

Thanks for help and attention!!!