玲珑1052 See car

DESCRIPTION

You are the god of cars, standing at (a, b) point.There are some cars at point $(x_i,y_i)$. If lots of cars and you are in one line, you can only see the car that is nearest to yourself. How many cars can you see?
It is guaranteed that $x_i>a$ and $y_i>b$.

INPUT

There are multiple test cases.The first line is a number T (T $\le 11$), which means the number of cases.For each case, first line has three integers $a,b,n(-{10}^9\le a,b\le {10}^9,0\le n\le {10}^5)$.next $n$ lines, each line contains two integer $(x_i,y_i)(-{10}^9\le x_i,y_i\le {10}^9)$, which means the position of car.

OUTPUT

one line --- the number of car that you can see.

SAMPLE INPUT

20 0 31 1 2 23 30 0 41 12 22 34 6

SAMPLE OUTPUT

12

SOLUTION

“玲珑杯”ACM比赛 Round #4

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <sstream>
#include <queue>
#include <map>
using namespace std;
map<double,int> judge;
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        judge.clear();
        long long a,b,n,i,j,x,y;
        long long res = 0;
        scanf("%lld%lld%lld",&a,&b,&n);
        for(i=1;i<=n;i++){
            scanf("%lld%lld",&x,&y);
            //cout<<(y-b)<<" "<<(x-a)<<" "<<(double)(y-b)/(x-a)<<endl;
            if(judge[(double)(y-b)/(double)(x-a)]==0){
                res++;
                judge[(double)(y-b)/(double)(x-a)]++;
            }
        }
        printf("%lld\n",res);
    }
    
    return 0;
}