Hi. Today i learnt about geometry and I suddent think about that question. Suppose, we have multipoint(2D) are given(we call the number of points is N) , and we must answer for multiquery is a,b such as a line y = a * x + b(and M is multiqueries). The problem is that how can we count how many point in lines for each queries. Suppose N and M <= 1e5. Can we solve for this limitation? I hope some one have solution for this. Thank for your help.

Hello everyone. Today i meet a problem like find the intersection areas of n rectangles. i use IT tree but i can't not solve with case have a area that more than 3 rectangles intersection. Very thanks you help me to solve this proplem.

Hi guys. Today i meet the problem that calculate sum of (n / gcd(i,n)) with i = 1,...,n and n <= 1e7 and have 1e6 testcase with n. I can find sum of (n / gcd(i,n)) = sum of (t * phi(t)) with t is divisor of n and phi(t) is euler totient function. Help me to make it fast and can run 1s on codeforces. Thanks for your help.

Hi. Today,i try a problem about number theory. This is a problem : Given three positive integers M, A, P where P is a prime number and find minimum positive integer B : M ≡ A^B (mod P) Sorry because my english is not good . Thanks your help about this problem