# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741679 | jongjip | Intercastellar (JOI22_ho_t1) | C11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
int x[n], y[n];
for (int i = 0; i < n; i++) {
scanf("%d %d", &x[i], &y[i]);
}
int dx = x[n - 1] - x[0];
int dy = y[n - 1] - y[0];
int d = sqrt(dx * dx + dy * dy);
int ans = 0;
for (int i = 0; i < n; i++) {
int nx = x[i] + m * dx;
int ny = y[i] + m * dy;
int dist = sqrt((nx - x[0]) * (nx - x[0]) + (ny - y[0]) * (ny - y[0]));
if (dist <= d) {
ans++;
}
}
printf("%d\n", ans);
}