8a7aac7c23
- Renamed all folders from format NEx (e.g., 1Ex, 2Ex...) to 0NEx (01Ex, 02Ex, etc.) - Updated subdirectories and files accordingly - Removed old main Makefile and tasks (a01.c–a09.c, solve.c, io_status.h), likely obsolete - Cleaned up deprecated task binaries and configs
70 lines
1.5 KiB
C
70 lines
1.5 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
#include "array_io.h"
|
|
#include "io_status.h"
|
|
#include "solve.h"
|
|
|
|
/* ./a.out i j g n m p k [filename] */
|
|
int main(int argc, char *argv[])
|
|
{
|
|
double g, t, res, *a;
|
|
int i, j, n, m, p, k, task = 8;
|
|
char *name = 0;
|
|
|
|
if (!((argc == 8 || argc == 9) &&
|
|
sscanf(argv[1], "%d", &i) == 1 &&
|
|
sscanf(argv[2], "%d", &j) == 1 &&
|
|
sscanf(argv[3], "%lf", &g) == 1 &&
|
|
sscanf(argv[4], "%d", &n) == 1 &&
|
|
sscanf(argv[5], "%d", &m) == 1 &&
|
|
sscanf(argv[6], "%d", &p) == 1 &&
|
|
sscanf(argv[7], "%d", &k) == 1 &&
|
|
k >= 0 && k <= 4 && (!(k == 0 && argc != 9)) &&
|
|
(i <= n && j <= m) && (i > 0 && j > 0)))
|
|
{
|
|
printf("Usage: %s i j g n m p k [filename]\n", argv[0]);
|
|
return 1;
|
|
}
|
|
if (argc == 9) name = argv[8];
|
|
|
|
a = (double *)malloc(n * m * sizeof(double));
|
|
if (!a)
|
|
{
|
|
printf("Not enough memory\n");
|
|
return 2;
|
|
}
|
|
|
|
if (name)
|
|
{ /* из файла */
|
|
io_status ret;
|
|
ret = read_matrix(a, n, m, name);
|
|
do {
|
|
switch (ret)
|
|
{
|
|
case SUCCESS:
|
|
continue;
|
|
case ERROR_OPEN:
|
|
printf("Cannot open %s\n", name);
|
|
break;
|
|
case ERROR_READ:
|
|
printf("Cannot read %s\n", name);
|
|
}
|
|
free(a);
|
|
return 3;
|
|
} while (0);
|
|
} else init_matrix(a, n, m, k);
|
|
|
|
printf("Initial matrix:\n");
|
|
print_matrix(a, n, m, p);
|
|
|
|
t = clock();
|
|
t8_solve(a, n, m, i-1, j-1, g);
|
|
t = (clock() - t) / CLOCKS_PER_SEC;
|
|
|
|
printf("Result matrix:\n");
|
|
print_matrix(a, n, m, p);
|
|
printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t);
|
|
free(a);
|
|
return 0;
|
|
}
|