Read in data.

This commit is contained in:
unlockable
2023-12-06 12:09:01 +08:00
parent b62f20d8eb
commit b2fab0279c

60
2023207/main.cpp Normal file
View File

@@ -0,0 +1,60 @@
#include <stdio.h>
#include <math.h>
int p = 0;
int m = 0, n = 0;
double A[5][10000], Z[10000];
double get_content(int row, int column) {
if (abs(row - column) > p / 2) {
return 0;
}
if (row < 0 || row >= n) {
return 0;
}
if (column < 0 || column >= n) {
return 0;
}
return A[(row - column + p / 2)][column];
}
int get_content(int row, int column, double val) {
if (abs(row - column) > p / 2) {
return 0;
}
if (row < 0 || row >= n) {
return 0;
}
if (column < 0 || column >= n) {
return 0;
}
A[(row - column + p / 2)][column] = val;
return 0;
}
int main() {
scanf("%d", &p);
scanf("%d %d", &n, &m);
for (int i = 0; i < p; i++) {
for (int j = 0; j < n - abs(i - p / 2); j++) {
scanf("%lf", &A[i][j]);
}
}
for (int col = 0; col < n; col++) {
for (int row = col + 1; row < n; row++) {
double diag_elem = get_content(row, row);
double base = get_content(row, col);
if (base != 0) {
}
}
}
// for (int i = 0; i < p; i++) {
// for (int j = 0; j < n; j++) {
// printf("%lf ", get_content(i, j));
// }
// printf("\n");
// }
return 0;
}