Personal profile

Hello everyone , I am a 2022 year 3 Ranked third in the rookie list in January ༺Blog༒Hacker༻
Stand by me ： give the thumbs-up + Collection ️+ Leaving a message.
Maxim ：༺ Always do high quality ༒programmer༻
Series column ：CF & UVA
Personal home page ：༺Blog༒Hacker༻️

notes （ Please refer to CF665B Shopping）:

️ my Update time It's going to change , monthly 2-5 piece , Thank you for your long-term support ！

CF514B Han Solo and Lazer Gun

️ Title Description
️There are $n$ Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates $(x,y)$ on this plane.

️Han Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point $(x_0,y_0)$. In one shot it can can destroy all the stormtroopers, situated on some line that crosses point $(x_0,y_0)$.

️Your task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.

️The gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don’t have enough time to realize what’s happening and change their location.

️ I/o sample

️ Input  #1
4 0 0
1 1
2 2
2 0
-1 -1
️ Output  #1
2
️ Input  #2
2 1 2
1 1
1 0
️ Output  #2
1

CODE

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    
    ll n,k=0,t=1;
    double x_0,y_0,x,y,a[1005];
    cin>>n>>x_0>>y_0;
    for(int i=1;i<=n;++i)
    {
    
        cin>>x>>y;
        if(x_0-x==0)
            a[++k]=100000;
        else
            a[++k]=(y_0-y)/(x_0-x);
    }
    sort(a+1,a+k+1);
    for(int i=1;i<k;++i)
        if(a[i]!=a[i+1])
            t++;
    cout<<t;
    return 0;
}

Thank you for your long-term support , Like collection is my motivation to update , See you next time , Bye-bye ！！！