55 lines
1.3 KiB
C
55 lines
1.3 KiB
C
#include <stdio.h>
|
|
#include <time.h>
|
|
#include <math.h>
|
|
#include "add.h"
|
|
#include "solve.h"
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
double a=0;
|
|
double b=0;
|
|
double e=0;
|
|
int M=0;
|
|
int k=0;
|
|
int res=0;
|
|
int count=0;
|
|
double x=0;
|
|
double t=0;
|
|
double (*f[7])(double) = {f0,f1,f2,f3,f4,f5,f6};
|
|
if (argc!=6)
|
|
{
|
|
printf("Usage: %s a b e[>0] M[>0] k[0-6]\n", argv[0]);
|
|
return -1;
|
|
}
|
|
if (sscanf(argv[1], "%lf", &a)!=1 || sscanf(argv[2], "%lf", &b)!=1 || sscanf(argv[3], "%lf", &e)!=1 || sscanf(argv[4], "%d", &M)!=1 || sscanf(argv[5], "%d", &k)!=1)
|
|
{
|
|
printf("Usage: %s a b e[>0] M[>0] k[0-6]\n", argv[0]);
|
|
return -1;
|
|
}
|
|
if (k<0 || k>6)
|
|
{
|
|
printf("Usage: %s a b e[>0] M[>0] k[0-6]\n", argv[0]);
|
|
return -1;
|
|
}
|
|
e=fabs(e);
|
|
if (b<a)
|
|
{
|
|
double tmp=a;
|
|
a=b;
|
|
b=tmp;
|
|
}
|
|
|
|
t=clock();
|
|
res=solve5(f[k], a, b, e, M, &x);
|
|
t=(clock()-t)/CLOCKS_PER_SEC;
|
|
count=get_count();
|
|
if (res<0)
|
|
{
|
|
printf ("%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], 5, count, t);
|
|
}
|
|
else
|
|
{
|
|
printf ("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], 5, x, f[k](x), res, count, t);
|
|
}
|
|
return 0;
|
|
}
|