From a8b4e4358df2bcf78c22c6470277b407b7eb45a7 Mon Sep 17 00:00:00 2001 From: AZEN-SGG <74971141+AZEN-SGG@users.noreply.github.com> Date: Fri, 2 May 2025 04:37:16 +0300 Subject: [PATCH] Add my dist --- 2025.05.02/02Ex/io_status.h | 16 -- 2025.05.02/02Ex/main.c | 8 +- 2025.05.02/02Ex/solve.c | 5 +- 2025.05.02/08Ex/solve.c | 2 - 2025.05.02/Krivoruchenko_SK.zip | Bin 0 -> 6531 bytes 2025.05.02/dist/Krivoruchenko_SK/Makefile | 14 + 2025.05.02/dist/Krivoruchenko_SK/a01.c | 49 ++++ 2025.05.02/dist/Krivoruchenko_SK/a02.c | 49 ++++ 2025.05.02/dist/Krivoruchenko_SK/a03.c | 49 ++++ 2025.05.02/dist/Krivoruchenko_SK/a04.c | 49 ++++ 2025.05.02/dist/Krivoruchenko_SK/a07.c | 47 ++++ 2025.05.02/dist/Krivoruchenko_SK/a08.c | 49 ++++ 2025.05.02/dist/Krivoruchenko_SK/init_f.c | 128 ++++++++++ 2025.05.02/dist/Krivoruchenko_SK/init_f.h | 29 +++ 2025.05.02/dist/Krivoruchenko_SK/solve.c | 295 ++++++++++++++++++++++ 2025.05.02/dist/Krivoruchenko_SK/solve.h | 41 +++ 16 files changed, 807 insertions(+), 23 deletions(-) delete mode 100644 2025.05.02/02Ex/io_status.h create mode 100644 2025.05.02/Krivoruchenko_SK.zip create mode 100644 2025.05.02/dist/Krivoruchenko_SK/Makefile create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a01.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a02.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a03.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a04.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a07.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/a08.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/init_f.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/init_f.h create mode 100644 2025.05.02/dist/Krivoruchenko_SK/solve.c create mode 100644 2025.05.02/dist/Krivoruchenko_SK/solve.h diff --git a/2025.05.02/02Ex/io_status.h b/2025.05.02/02Ex/io_status.h deleted file mode 100644 index 8867bee..0000000 --- a/2025.05.02/02Ex/io_status.h +++ /dev/null @@ -1,16 +0,0 @@ -#ifndef IO_STATUS_H -#define IO_STATUS_H - -#define ERR_MEM "Error: Not enough memory!" -#define ERR_OPEN "Error: Cannot open file" -#define ERR_READ "Error: Cannot read file" -#define ERR_FUNC "Error: Algorithm is not applicable!" - -typedef enum _io_status -{ - SUCCESS, - ERROR_OPEN, - ERROR_READ -} io_status; - -#endif diff --git a/2025.05.02/02Ex/main.c b/2025.05.02/02Ex/main.c index abb10e8..0c0d7c0 100644 --- a/2025.05.02/02Ex/main.c +++ b/2025.05.02/02Ex/main.c @@ -12,8 +12,8 @@ int main(int argc, char *argv[]) int m, k, cl, it, task = 2; double (*f) (double); - double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6, sin}; // TODO: Remove sin - double (*d_lst[]) (double) = {d0, d1, d2, d3, d4, d5, d6, cos}; // TODO: Remove cos + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + double (*d_lst[]) (double) = {d0, d1, d2, d3, d4, d5, d6}; int len_f = sizeof(f_lst) / sizeof(f_lst[0]); @@ -36,13 +36,13 @@ int main(int argc, char *argv[]) cl = get_call_function_count(); - if (it > m) + if (it < 0) { fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); return -2; } else { - printf("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + fprintf(stdout, "%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); return 0; } } diff --git a/2025.05.02/02Ex/solve.c b/2025.05.02/02Ex/solve.c index d53ea28..b288e9c 100644 --- a/2025.05.02/02Ex/solve.c +++ b/2025.05.02/02Ex/solve.c @@ -21,12 +21,15 @@ int t2_solve ( if (fabs(dy) < DBL_EPSILON) { - it = m+1; + it = -1; break; } x_0 -= (y / dy); } + + if (it > m) + it = -1; *x = x_0; return it; diff --git a/2025.05.02/08Ex/solve.c b/2025.05.02/08Ex/solve.c index aab65a9..de3a921 100644 --- a/2025.05.02/08Ex/solve.c +++ b/2025.05.02/08Ex/solve.c @@ -2,8 +2,6 @@ #include #include -#include - int t8_solve ( double (*f) (double), diff --git a/2025.05.02/Krivoruchenko_SK.zip b/2025.05.02/Krivoruchenko_SK.zip new file mode 100644 index 0000000000000000000000000000000000000000..4f1eecb2840f871977b877575566129396776592 GIT binary patch literal 6531 zcmZ{oby(By*T*-yq$H%f1pz5Rq?Bf~(lua?2BlFL0>Wqp(!!8#X$eKTk?ux75C*7p zJmYzOU*-FF{kH4cxjy^jwX^$v-{-vVqosz4MF9W+@Br$pSw^y&&AAL10Dw6b0Dz7D z)>2SH03507Xum8=dXaVpU%ww8nN7P*n4|y6i=W=JM9F@s8ByM0dczPAXBuwu%^&5k z4At3Dz*Mlc&4Adh+kEPPX4j~}U}C)zTg6H{LpIBi`MzSa#U<+-c5P4x`6)wj-UsOg z)Rv}BwUMAi&x#UYC&sej3Nik)sW|9{*nLp4zSl>%-$VPi?=((&9d3s?`8r6yb3%0eKLLM9DQBwUvHDgw`-qOC)gjuF| zpD$FccP74gd5127^en^mr8PSx4j9&Crb8Px7B1lP^FtIaZ53O_v&~ZLs$kYZo<77H zpKEY#=}vz}ycKl;oLCAZ&?lzpI?T2bDe1(e8^xSFgMX`nE#VP<_6 z68Xd)&v(7AG|eoPoCCKTduEE}xwt#zFuifLe(Q$>t)H0sq<#{#epr9&NBsZvGb2cP zar+W(tQbf!+gNRi)Y#{+w{&n+Ol@H%?0A;lW>6EJ6JI`jIWNVdmKODy=rsy7`0j_a z=S31#*!*n{qDa$R8;CS9F;D8+z67GvLnB$CFqWzyQV%kh|5d#pgCi%kiQPO{%$3;EgbPaysc-awuMl zC?@$35e9kqExJ@9k~_ODnqM6`0#0R3#ztbrJU&X$v;KHwNj9cLmzkcGj!b{|!e>r@ zv?7#3UgO004ZOh^>v{CDw=*n4uD>Ad=MMpo3Av%_OEJ4SVbt$3oOIEo0$yhZj@&E!W$YZoCf&juZkUD0eFaOCr;0k(SgdqYDh?47#Dce=y@)lN&$*C`C?gp<+&bM@@{xDP zeDf5mG&?fRV2hhaJoxJ=jTMrmkfPkPWJw1hk0W5Y_N44XP{TJOr`%}I3`_aiqtytr zbXcM1_ro#gGHE-1+3i=OiYIXma1`HpW@3;pwDCtft^aODaBba$AK%%h9}`c0&Jwv0 zIR8=1B1@K$h$qh)6IwC)zZD~LrI-chX+hGLpbI$N%`QbAEY;I57@F4wA6z}rkLyL%AV(^9+N)^pq`I#sHH{b->-uZ-3R0tG^M(d^g~Orz4gPGMMS9jov3)R-reWQeGrux1M z;u6M)<(W!q;`o^ub_{0&ES$AlY3;^jg`)Pb_)ukrkVw1Rn+vhHwy%Y9%zTv0UU`|3 zPrRuuGWa^@nZ$Y|v$EW#Y){mI;oDRttW%U|`g7wM1Bu8}r3X}_rrl2oA8BhP;r5F! z6F8bKq?*&T3+N^=c%;cEy@*|MknJFJp9SU8%F#}vTNXH>lc#dGEyb21VXNC3T=Wzn ziAz{<>!9Z|P0!N6$9{-8>K&7~=g@h7AG&23kh!p_Q#{Mbl30L*Fyw)fJJ2o5TlYUL z>vo}yW0|Xz`QneWrGuNcVya(FCe59>w>X~AnQb>fM`fyhDRA@8C+_E+KIj4@$AfjUg2Xm6 z;L@K_9n*o5E5zc9Jrq)*OeHAUM7OL|xt4=+<-8+w0fP8@UZkysO$%TXRT<_!f=KU2 zvml%vN>?n|YQ%!`W7i78Y|t&M?K#p6JNOLUvP|cBYH%cO%Qike0@749yiB2++!cXT zEq>+2XEFRiK3(@Ry&vW`pIs1>R63Y6^?Rx=WWO8&B8-Qa9Dw zkC|9)1L(W=Swobb&(ZeB3a9XbHAUceaxjNLSgq@A--8;V>W@~8? zJgs<+T<>u|j#6Yn(X$_XowGIZ`jbCYEo*FuA*1`AdTEj? zMlt;bm^kMTDOEb~-p1Mcyl2qlwAT$rj82n<3OWqJ?w0p6_-90Xl5QudjousCP9iup z%Ob5K=LFU1xav4O1BchufD3>Qip>-hzspD(pJ6yU)lHMOLF~F)Tfx74l zRN(^=Uv^s5&d50HlfOV>WGLJKl}-rVJ`GM=T`7Q3k2Ctkpq!QN>)caP|*0n+UO z|7a+PJ^L4LFFHiv-d^yJXL;jiNI-j-^REx z1#c^lkLf5}8USZU zK&Bm(6lnW5LAAd znIKuZYUt?z`jpORteA za5dSAzgC;dCn3Yy5DU}3Y7Y+bw9@Tvh({Q!xFQqj;_IH2{Kch&z$9~Ewak`Nv~l_& z-u6jrQ>ZTu2`i)ZeYjWr9{aLNM`b94#{A)IX%91|_b==}8JnUr=1yaGG)8Cp5?#Hn zGS;xPx3Psf*f{EZ2B9;S)-AY(j!423zydD+_KAfwi)Ppxv6hfYq4Y0AX;W^wl{|(E^0p${Ra>xK zrN)$JN8NToZE4OU=1(335PoDJY0vT*JF)y=tw=x=IfFBOkVK4gky<Zv7{W;5pmrUJ1F!M%Yw!DUzm<1}el$B}6vfTpO+}DI?I6bvp`TnW-w2 zPce%t+!HflOVzWiT-}l1-F@^t&u%}9Ilns+VAL+z>81*iUl2##=MZGV9y!^Qm;=XJqFAooLFZcRu0aQm@ zYE?ug--ZnK47}?y1n@>?T+MOLv`=mZN3kh(bJrW!<*iBvj9{Zw{5g)BIS@)-Az4y2 zvSqkWs2S7bxr$*$K6Qn`E7G`&#MvqJUgfxsSy-jVk5Qle&Ru>SBi8Y<6{^-YWV7xH zslcbK`(EFXYo#frT`D9HUr*g~7Zn$4DYsvmrsbv=>f%~-gG;jHY}OOLBlVNvkHA%p z=KG8rQH;F~xzpVrSV>OCzX1;a=(wNMl>bKhKufrM>jLesSwD?ju%~kNC5Jo=jWNRp zkdSBz6m1Git=dPQ4TNak%+J*xeqbf1we+w`d*j69ix>Vc!Rinm!rXDeR_P_d5XOl6 zoey7yAt^z0)HNywMnMC^$_MRaaqh;h=Pix?i~;->@J#JijbE%in9su&h0F|S!4(}H zJ`U5{=X)(P^FAoNR7FBnS~4%*s`nVwyY!fQ2Ea%aSuKOq;Bc8)iA(VT|4diah;H|s z9oa#cQy7@wO$yHdZR$60YQYZNT_g6Cwuu%lD$J zhTN?AC!=Li+?$)97rZDwK9xnYKMS52fDC#{Wuk99y~O_kXcv8HGWY9>CG3Eec)s z{+zm}x&!LHYAPDKcn630&ms>Ob#UB-f9NdvmG(7~2a~rREuW=T=waUw01d>S4QJCc z>+)&n%3-z)jcUs(vu|?C8me@)6kxYY5-_*AE$tgo%0e~l^BEM`Cy~g6K+`PNd08dk zlwu~u1GPx#rVt1e%Fp@yeR~>~aVQB_{t{J{2C%2VnE`FOZ2q^&1Y zjYUUFPa1hQsd=#nEXpJcPaf^4ytKluz%Yar%RXl2i=m`$cu{S%hLkTr-+1Ns>M@v3l=j@pTZE;t zC|sh24q(rOaXD{F93n@6skCur(4v>ay7Cfw_=p^Ln zC9m}s88R}HpAjkh5>094TV7K<&~1#CB`46xy5l&Olun~ z=#`dh_(Fda+F0`xsPr8QrpeA#PfZ+u?^W>fe8Kd&V(JOvgR0Q;XA`>|W6z|;)tie{-?q|BSwk5{(2l7<8XK4fY-XQy!1oubTM zNxKCxwh?EG?Y~fZnHP;7n9Qzr(AMq_5Y!x59F2QM@0YpZxciqYlxe8}F_-}VZAi(LG&c=IyQs* zbnLQz1{kI^d+Wbp{~qvM$GV|Ugry*Q+;bh9FD;sRg&l`@G5j~|-?#qj*eaYWEP4iT z9oyyL|Kb9T?Msd3_;1+1Z-dvdKhPG-QV@MN{1^6)9p4o;gameYwZ{L%>udY>1>rhY zobbHR2oBSW}zt%#^ +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out a b eps M k */ +int main(int argc, char *argv[]) +{ + double t, a, b, eps, x = 0; + int m, k, cl, it, task = 1; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + if ( + !((argc == 6) && + sscanf(argv[1], "%lf", &a) == 1 && + sscanf(argv[2], "%lf", &b) == 1 && + (a <= b) && + (sscanf(argv[3], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[4], "%d", &m) == 1) && m > 0) && + ((sscanf(argv[5], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s a b eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t1_solve(f, a, b, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + printf("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/a02.c b/2025.05.02/dist/Krivoruchenko_SK/a02.c new file mode 100644 index 0000000..0c0d7c0 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/a02.c @@ -0,0 +1,49 @@ +#include +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out x_0 eps M k */ +int main(int argc, char *argv[]) +{ + double t, x_0, eps, x = 0; + int m, k, cl, it, task = 2; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + double (*d_lst[]) (double) = {d0, d1, d2, d3, d4, d5, d6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + + if ( + !((argc == 5) && + sscanf(argv[1], "%lf", &x_0) == 1 && + (sscanf(argv[2], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[3], "%d", &m) == 1) && (m > 0)) && + ((sscanf(argv[4], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s x_0 eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t2_solve(f, d_lst[k], x_0, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_function_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + fprintf(stdout, "%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/a03.c b/2025.05.02/dist/Krivoruchenko_SK/a03.c new file mode 100644 index 0000000..0dc3eb4 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/a03.c @@ -0,0 +1,49 @@ +#include +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out a b eps M k */ +int main(int argc, char *argv[]) +{ + double t, a, b, eps, x = 0; + int m, k, cl, it, task = 3; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + if ( + !((argc == 6) && + sscanf(argv[1], "%lf", &a) == 1 && + sscanf(argv[2], "%lf", &b) == 1 && + (a <= b) && + (sscanf(argv[3], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[4], "%d", &m) == 1) && m > 0) && + ((sscanf(argv[5], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s a b eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t3_solve(f, a, b, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + fprintf(stdout, "%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/a04.c b/2025.05.02/dist/Krivoruchenko_SK/a04.c new file mode 100644 index 0000000..3403844 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/a04.c @@ -0,0 +1,49 @@ +#include +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out a b eps M k */ +int main(int argc, char *argv[]) +{ + double t, a, b, eps, x = 0; + int m, k, cl, it, task = 4; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + if ( + !((argc == 6) && + sscanf(argv[1], "%lf", &a) == 1 && + sscanf(argv[2], "%lf", &b) == 1 && + (a <= b) && + (sscanf(argv[3], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[4], "%d", &m) == 1) && m > 0) && + ((sscanf(argv[5], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s a b eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t4_solve(f, a, b, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + printf("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/a07.c b/2025.05.02/dist/Krivoruchenko_SK/a07.c new file mode 100644 index 0000000..c426a06 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/a07.c @@ -0,0 +1,47 @@ +#include +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out x_0 eps M k */ +int main(int argc, char *argv[]) +{ + double t, x_0, eps, x = 0; + int m, k, cl, it, task = 7; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + if ( + !((argc == 5) && + sscanf(argv[1], "%lf", &x_0) == 1 && + (sscanf(argv[2], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[3], "%d", &m) == 1) && (m > 0)) && + ((sscanf(argv[4], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s x_0 eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t7_solve(f, x_0, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + printf("%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/a08.c b/2025.05.02/dist/Krivoruchenko_SK/a08.c new file mode 100644 index 0000000..4c307e6 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/a08.c @@ -0,0 +1,49 @@ +#include +#include +#include + +#include "init_f.h" +#include "solve.h" + +/* ./a.out a b eps M k */ +int main(int argc, char *argv[]) +{ + double t, a, b, eps, x = 0; + int m, k, it, cl, task = 8; + + double (*f) (double); + double (*f_lst[]) (double) = {f0, f1, f2, f3, f4, f5, f6}; + int len_f = sizeof(f_lst) / sizeof(f_lst[0]); + + if ( + !((argc == 6) && + sscanf(argv[1], "%lf", &a) == 1 && + sscanf(argv[2], "%lf", &b) == 1 && + (a <= b) && + (sscanf(argv[3], "%lf", &eps) == 1 && (eps >= 0)) && + ((sscanf(argv[4], "%d", &m) == 1) && m > 0) && + ((sscanf(argv[5], "%d", &k) == 1) && ((0 <= k) && (k <= len_f)))) + ) { + fprintf(stderr, "Usage: %s a b eps M k\n", argv[0]); + return -1; + } + + f = f_lst[k]; + + t = clock(); + it = t8_solve(f, a, b, eps, m, &x); + t = (clock() - t) / CLOCKS_PER_SEC; + + cl = get_call_count(); + + if (it < 0) + { + fprintf(stdout, "%s : Task = %d NOT FOUND Count = %d T = %.2f\n", argv[0], task, cl, t); + return -2; + } else + { + fprintf(stdout, "%s : Task = %d X = %e Res = %e Its = %d Count = %d T = %.2f\n", argv[0], task, x, f(x), it, cl, t); + return 0; + } +} + diff --git a/2025.05.02/dist/Krivoruchenko_SK/init_f.c b/2025.05.02/dist/Krivoruchenko_SK/init_f.c new file mode 100644 index 0000000..b14a5a9 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/init_f.c @@ -0,0 +1,128 @@ +#include "init_f.h" + +#include +#include + + +static int cl_f = 0; +static int cl_d = 0; + +int get_call_count (void) +{ + return cl_f; +} + +int get_call_function_count (void) +{ + return cl_f; +} + +int get_call_derivative_count (void) +{ + return cl_d; +} + +double f0 (double x) +{ + cl_f++; + (void)x; + + return 1; +} + +double d0 (double x) +{ + cl_d++; + (void)x; + + return 0; +} + +double f1 (double x) +{ + cl_f++; + return ((x * 1e-100) - 1.0) * 1e100; +} + +double d1 (double x) +{ + (void)x; + cl_d++; + return 1; +} + +double f2 (double x) +{ + cl_f++; + return 4 - x * x; +} + +double d2 (double x) +{ + cl_d++; + return -2 * x; +} + +double f3 (double x) +{ + double x_2 = x * x; + cl_f++; + + return x * x_2 + 3 * x_2 + 16; +} + +double d3 (double x) +{ + cl_d++; + + return 3 * x * x + 6 * x; +} + +double f4 (double x) +{ + double x_2 = x * x; + cl_f++; + + return 3 - 2 * x_2 - x_2 * x_2; +} + +double d4 (double x) +{ + cl_d++; + + return -4 * x - 4 * ((x * x) * x); +} + +double f5 (double x) +{ + cl_f++; + return sqrt(fabs(x) + 1) - 2; +} + +double d5 (double x) +{ + cl_d++; + if (x < -DBL_EPSILON) + return (-1.0 / (sqrt(fabs(x) + 1))) * 0.5; + else if (x > DBL_EPSILON) + return (1.0 / (sqrt(fabs(x) + 1))) * 0.5; + return 0; +} + +double f6 (double x) +{ + cl_f++; + return sqrt(sqrt(fabs(x) + 1) + 1) - 2; +} + +double d6 (double x) +{ + double sqrt_x = sqrt(fabs(x) + 1); + cl_d++; + + if (x < -DBL_EPSILON) + return (-1.0 / (sqrt(sqrt_x + 1) * sqrt_x)) * 0.25; + else if (x > DBL_EPSILON) + return (1.0 / (sqrt(sqrt_x + 1) * sqrt_x)) * 0.25; + return 0; +} diff --git a/2025.05.02/dist/Krivoruchenko_SK/init_f.h b/2025.05.02/dist/Krivoruchenko_SK/init_f.h new file mode 100644 index 0000000..c927c42 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/init_f.h @@ -0,0 +1,29 @@ +#ifndef INIT_F_H +#define INIT_F_H + +int get_call_count (void); +int get_call_function_count (void) ; +int get_call_derivative_count (void); + +double f0 (double x); +double d0 (double x); + +double f1 (double x); +double d1 (double x); + +double f2 (double x); +double d2 (double x); + +double f3 (double x); +double d3 (double x); + +double f4 (double x); +double d4 (double x); + +double f5 (double x); +double d5 (double x); + +double f6 (double x); +double d6 (double x); + +#endif diff --git a/2025.05.02/dist/Krivoruchenko_SK/solve.c b/2025.05.02/dist/Krivoruchenko_SK/solve.c new file mode 100644 index 0000000..34dfbde --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/solve.c @@ -0,0 +1,295 @@ +#include "solve.h" + +#include +#include +#include +#include +#include + +int t1_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x +) { + int it = 0; + uint64_t bits; + double c = DBL_MAX, y, y_a = f(a), y_b = f(b); + bool sgn_a, sgn_b, sgn_c; + + memcpy(&bits, &y_a, sizeof(bits)); + sgn_a = (bits >> 63) & 1; + memcpy(&bits, &y_b, sizeof(bits)); + sgn_b = (bits >> 63) & 1; + + if (fabs(y_a) - eps < DBL_EPSILON) + { + *x = a; + return 1; + } if (fabs(y_b) - eps < DBL_EPSILON) + { + *x = b; + return 1; + } + + if (sgn_a == sgn_b) + { + *x = DBL_MAX; + return -1; + } + + for (it = 1; it <= m; ++it) + { + c = (a + b) * 0.5; + y = f(c); + + memcpy(&bits, &y, sizeof(bits)); + sgn_c = (bits >> 63) & 1; + + if (fabs(y) - eps < DBL_EPSILON) + break; + else if ((fabs(c - a) < DBL_EPSILON) || (fabs(c - b) < DBL_EPSILON)) + it = m+1; + else if (sgn_c == sgn_a) + { + a = c; + y_a = y; + } else if (sgn_c == sgn_b) + { + b = c; + y_b = y; + } + } + + if (it > m) + it = -1; + + *x = c; + + return it; +} + +int t2_solve ( + double (*f) (double), + double (*d) (double), + double x_0, double eps, + int m, double *x +) { + int it = 0; + + for (it = 1; it <= m; ++it) + { + double y = f(x_0); + double dy = d(x_0); + + if (fabs(y) - eps < DBL_EPSILON) + break; + + if (fabs(dy) < DBL_EPSILON) + { + it = -1; + break; + } + + x_0 -= (y / dy); + } + + if (it > m) + it = -1; + + *x = x_0; + return it; +} + +int t3_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x +) { + int it = 0; + uint64_t bits; + double c = DBL_MAX, y, y_a = f(a), y_b = f(b); + bool sgn_a, sgn_b, sgn_c; + + memcpy(&bits, &y_a, sizeof(bits)); + sgn_a = (bits >> 63) & 1; + memcpy(&bits, &y_b, sizeof(bits)); + sgn_b = (bits >> 63) & 1; + + if (fabs(y_a) - eps < DBL_EPSILON) + { + *x = a; + return 1; + } if (fabs(y_b) - eps < DBL_EPSILON) + { + *x = b; + return 1; + } + + if (sgn_a == sgn_b) + { + *x = DBL_MAX; + return -1; + } + + for (it = 1; it <= m; ++it) + { + c = a - ((a - b) / (y_a - y_b)) * y_a; + y = f(c); + + memcpy(&bits, &y, sizeof(bits)); + sgn_c = (bits >> 63) & 1; + + if ((c - a < DBL_EPSILON) || (c - b > DBL_EPSILON)) + it = m+1; + else if (fabs(y) - eps < DBL_EPSILON) + break; + else if (sgn_c == sgn_a) + { + a = c; + y_a = y; + } else if (sgn_c == sgn_b) + { + b = c; + y_b = y; + } + } + + if (it > m) + it = -1; + + *x = c; + + return it; +} + +int t4_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x +) { + int it = 0; + double c = DBL_MAX, y, y_a = f(a), y_b = f(b); + + if (fabs(y_a) - eps < DBL_EPSILON) + { + *x = a; + return 1; + } if (fabs(y_b) - eps < DBL_EPSILON) + { + *x = b; + return 1; + } if (fabs(fabs(y_b) - fabs(y_a)) < DBL_EPSILON) + { + *x = a; + return -1; + } + + for (it = 1; it <= m; ++it) + { + c = b - ((b - a) / (y_b - y_a)) * y_b; + y = f(c); + + if (fabs(y) - eps < DBL_EPSILON) + break; + else if (fabs(y_a) - fabs(y_b) > DBL_EPSILON) + { + a = c; + y_a = y; + } else if (fabs(y_b) - fabs(y_a) > DBL_EPSILON) + { + b = c; + y_b = y; + } else + it = m+1; + } + + if (it > m) + it = -1; + + *x = c; + + return it; +} + +int t7_solve ( + double (*f) (double), + double x_0, double eps, + int m, double *x +) { + int it = 0; + double y = f(x_0); + + if (fabs(y - x_0) - eps < DBL_EPSILON) + { + *x = x_0; + return 1; + } + + for (it = 1; it <= m; ++it) + { + x_0 = y; + y = f(x_0); + + if (fabs(y - x_0) - eps < DBL_EPSILON) + break; + } + + if (it > m) + it = -1; + + *x = x_0; + + return it; +} + +int t8_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x +) { + int it = 1; + double x_l = 0, y_l = 0, c = a, y = f(a); + + if (fabs(b - a) < DBL_EPSILON) + { + *x = a; + return 1; + } + + for (double h = (b - a) * 0.1; fabs(h) > DBL_EPSILON; h *= -0.1) + { + do { + if (it > m) + break; + + it++; + x_l = c; + y_l = y; + + c += h; + y = f(c); + } while (((y - y_l) - eps) > DBL_EPSILON); + + if (it > m) + { + it = -1; + break; + } + + if ((c - b) > DBL_EPSILON) + { + x_l = b; + y_l = f(b); + break; + } else if ((a - c) > DBL_EPSILON) + { + x_l = a; + y_l = f(b); + break; + } + } + + *x = x_l; + + return it; +} diff --git a/2025.05.02/dist/Krivoruchenko_SK/solve.h b/2025.05.02/dist/Krivoruchenko_SK/solve.h new file mode 100644 index 0000000..84f1cb9 --- /dev/null +++ b/2025.05.02/dist/Krivoruchenko_SK/solve.h @@ -0,0 +1,41 @@ +#ifndef SOLVE_H +#define SOLVE_H + +int t1_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x + ); + +int t2_solve ( + double (*f) (double), + double (*d) (double), + double x_0, double eps, + int m, double *x + ); + +int t3_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x + ); + +int t4_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x + ); + +int t7_solve ( + double (*f) (double), + double x_0, double eps, + int m, double *x + ); + +int t8_solve ( + double (*f) (double), + double a, double b, + double eps, int m, double *x + ); + +#endif