100 lines
2.4 KiB
C++
100 lines
2.4 KiB
C++
#include <stdio.h>
|
|
#include <math.h>
|
|
#define EPSILON 1e-6
|
|
|
|
double A[5051] = {0};
|
|
double point_xs[101] = {0};
|
|
int valid_point_num = 0;
|
|
|
|
double get_num(int row, int col) {
|
|
if (col > row) {
|
|
return 0;
|
|
}
|
|
return A[row * (row + 1) / 2 + col];
|
|
}
|
|
|
|
double set_num(int row, int col, double content) {
|
|
if (col > row) {
|
|
return 0;
|
|
}
|
|
return A[row * (row + 1) / 2 + col] = content;
|
|
}
|
|
|
|
bool compare_double(long double a, long double b) {
|
|
return (a - b > 0 ? a - b : -(a - b)) < EPSILON;
|
|
}
|
|
|
|
double evaluate(double x, int highest) {
|
|
double ans = get_num(highest, highest);
|
|
for (int j = highest - 1; j >= 0; j--) {
|
|
ans *= x - point_xs[j];
|
|
ans += get_num(j, j);
|
|
}
|
|
return ans;
|
|
}
|
|
|
|
int display_mat() {
|
|
for (int i = 0; i < valid_point_num; i++) {
|
|
for (int j = 0; j < valid_point_num; j++) {
|
|
printf("%lf ", get_num(i, j));
|
|
}
|
|
printf("\n");
|
|
}
|
|
printf("\n");
|
|
return 0;
|
|
}
|
|
|
|
int main() {
|
|
int n, m;
|
|
scanf("%d %d", &n, &m);
|
|
for (int i = 0; i < n; i++) {
|
|
bool found_duplicate = false;
|
|
double read_x, read_y;
|
|
scanf("%lf %lf", &read_x, &read_y);
|
|
for (int j = 0; j < valid_point_num; j++) {
|
|
if (compare_double(read_x, point_xs[j])) {
|
|
found_duplicate = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!found_duplicate) {
|
|
point_xs[valid_point_num] = read_x;
|
|
set_num(valid_point_num, 0, read_y);
|
|
valid_point_num++;
|
|
}
|
|
}
|
|
|
|
// Go create the full table
|
|
for (int col = 1; col < valid_point_num; col++) {
|
|
int delta = col;
|
|
for (int row = col; row < valid_point_num; row++) {
|
|
set_num(row, col, (get_num(row, col - 1) - get_num(row - 1, col - 1)) / (point_xs[row] - point_xs[row - delta]));
|
|
}
|
|
if (compare_double(get_num(col, col) / 1000, 0)) {
|
|
set_num(col, col, 0);
|
|
}
|
|
// display_mat();
|
|
}
|
|
|
|
|
|
// Find the highest
|
|
int highest = valid_point_num - 1;
|
|
for (; highest >= 0; highest--) {
|
|
if (compare_double(get_num(highest, highest) / 1000, 0)) {
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
|
|
printf("%d\n", highest);
|
|
|
|
double to_be_evaled = 0;
|
|
for (int i = 0; i < m; i++) {
|
|
scanf("%lf", &to_be_evaled);
|
|
printf("%lf\n", evaluate(to_be_evaled, highest));
|
|
}
|
|
|
|
|
|
return 0;
|
|
} |