EasyCoding's blog

By EasyCoding, history, 5 years ago, In English

You're given N (N ≤ 2000) and N points, then you are given Q (Q ≤ 106), the number of queries, and next Q lines consist Ai, Bi, Ci. For each query you should find how many points are on this line, i.e. how many j that Ai * Xj + Bi * Yj + Ci = 0.

Read more »

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

By EasyCoding, 7 years ago, In English

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!

Read more »

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

By EasyCoding, 7 years ago, In English

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!!!

Read more »

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