Pagini recente » Cod sursa (job #1574843) | Cod sursa (job #1461653) | Cod sursa (job #2423914) | Cod sursa (job #2017945) | Cod sursa (job #1305963)
#include<fstream>
#include<algorithm>
using namespace std;
int n, i, nr, x, y, j, ii, jj, v[4];
double a[4][50001];
ifstream fin("pachete.in");
ofstream fout("pachete.out");
int main(){
fin>> n >> x >> y;
for(i = 1; i <= n; i++){
fin>> ii >> jj;
if(ii >= x){
if(jj > y){
a[0][++v[0]] = (x - ii) / (y - jj);
}
else{
a[1][++v[1]] = (x - ii) / (y - jj);
}
}
else{
if(jj <= y){
a[2][++v[2]] = (x - ii) / (y - jj);
}
else{
a[3][++v[3]] = (x - ii) / (y - jj);
}
}
}
for(j = 0; j < 4; j++){
sort(a[j] + 1, a[j] + v[j] + 1);
if(v[j] != 0)
nr++;
for(i = 2; i <= v[j]; i++){
if(a[j][i] != a[j][i-1]){
nr++;
}
}
}
fout<< nr;
return 0;
}