SICRANO  Sicrano
Sicrano has a problem ... a geometry problem. He is not a very good in this area,
so he's asking for your help.
Given a set of points and a set of segments, tell, for each segment, how much
points lie in it.
Input
The first integer T (T <= 20) in the input says that there are T test cases in the input. Each test case begins with two integer N and M (1 <= N, M <= 50). N means how many points exists in that test case, and M means how many segments exists in that test case. The next N pairs of integers represents the points. Each pair describes the coordinates x and y of a point. (0 <= x, y <= 100). After that, the segments will be listed. Each segment is described by the coordinates of its two extreme points. All values in the input are integers. See the sample input for clarification.
Output
For each segment, print how many points are in it.
Example
Input:
1
4 3
1 1
2 2
3 3
4 4
0 0 5 5
3 3 4 4
0 0 1 0 Output: 4
2
0
hide comments
vetox:
20170102 14:45:09
Make sure to make use of a small delta value (~0.000001) for tolerance when comparing two double values especially in Java. 

Piyush Kumar:
20160702 15:53:25
I don't think it was absolutely vital to leave a spoiler in the comments, even with a star studded warning. 

rishabh_1997:
20160212 06:43:36
ac in one go.....


agaurav77:
20140520 14:33:17
Good Question, AC finally!


strg:
20130609 03:25:49
good ques.........finally got AC.........


Akshat Jain:
20130529 02:49:58
are same points considrd same or diff..??? 

Ouditchya Sinha:
20130222 15:32:26
Good question, finally AC :) ... no special cases, but consider all possibilities. 

numerix:
20120907 15:30:25
1. Is a segment of length 0 a segment?


akb:
20120906 12:19:05
Don't know why i read the comment before solving it...:( 
Added by:  Paulo Costa 
Date:  20120119 
Time limit:  0.479s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  UFPE 