diff --git a/2025.04.04/14Ex/code.c b/2025.04.04/14Ex/code.c new file mode 100644 index 0000000..3acefc3 --- /dev/null +++ b/2025.04.04/14Ex/code.c @@ -0,0 +1,19 @@ +#include + +int main (void) +{ + int num = 0; + char digit = 0; + printf("Enter your digit:\n"); + if (!canf("%c", &digit)) + { + printf("WRONG FORMAT!\n"); + return -1; + } + + num = digit - '0' + printf("Your digit is: %d\n" num); + + return 0; +} + diff --git a/2025.04.04/dist/Krivoruchenko_SK/profile.txt b/2025.04.04/dist/Krivoruchenko_SK/profile.txt new file mode 100644 index 0000000..f14a7c1 --- /dev/null +++ b/2025.04.04/dist/Krivoruchenko_SK/profile.txt @@ -0,0 +1,173 @@ +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls ms/call ms/call name + 46.09 75.80 75.80 get_r2 + 46.00 151.45 75.65 get_r1 + 4.20 158.36 6.91 t14_solve + 3.70 164.44 6.08 2000 3.04 3.04 gauss_inverse + 0.01 164.46 0.02 LeakTracer::registerAlloc(unsigned long, AllocType, void*) + 0.01 164.47 0.01 8000000 0.00 0.00 f1 + 0.01 164.48 0.01 1 10.00 10.00 get_matrix_norm + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2018 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 2 byte(s) for 0.01% of 164.48 seconds + +index % time self children called name + +[1] 46.1 75.80 0.00 get_r2 [1] +----------------------------------------------- + +[2] 46.0 75.65 0.00 get_r1 [2] +----------------------------------------------- + +[3] 7.9 6.91 6.09 t14_solve [3] + 6.08 0.00 2000/2000 gauss_inverse [4] + 0.01 0.00 1/1 get_matrix_norm [7] +----------------------------------------------- + 6.08 0.00 2000/2000 t14_solve [3] +[4] 3.7 6.08 0.00 2000 gauss_inverse [4] +----------------------------------------------- + +[5] 0.0 0.02 0.00 LeakTracer::registerAlloc(unsigned long, AllocType, void*) [5] +----------------------------------------------- + 0.01 0.00 8000000/8000000 read_or_init_matrix [8] +[6] 0.0 0.01 0.00 8000000 f1 [6] +----------------------------------------------- + 0.01 0.00 1/1 t14_solve [3] +[7] 0.0 0.01 0.00 1 get_matrix_norm [7] +----------------------------------------------- + +[8] 0.0 0.00 0.01 read_or_init_matrix [8] + 0.01 0.00 8000000/8000000 f1 [6] +----------------------------------------------- + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2018 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + + [5] LeakTracer::registerAlloc(unsigned long, AllocType, void*) [7] get_matrix_norm [3] t14_solve + [6] f1 [2] get_r1 + [4] gauss_inverse [1] get_r2 diff --git a/2025.04.04/dist/Krivoruchenko_SK_old/profile.txt b/2025.04.04/dist/Krivoruchenko_SK_old/profile.txt new file mode 100644 index 0000000..daf2507 --- /dev/null +++ b/2025.04.04/dist/Krivoruchenko_SK_old/profile.txt @@ -0,0 +1,174 @@ +Flat profile: + +Each sample counts as 0.01 seconds. + % cumulative self self total + time seconds seconds calls ms/call ms/call name + 46.34 76.23 76.23 get_r1 + 45.73 151.46 75.23 get_r2 + 4.04 158.11 6.65 t14_solve + 3.85 164.44 6.33 2000 3.17 3.17 gauss_inverse + 0.03 164.48 0.05 8000000 0.00 0.00 f1 + 0.02 164.51 0.03 read_or_init_matrix + 0.01 164.53 0.02 LeakTracer::registerAlloc(unsigned long, AllocType, void*) + 0.01 164.54 0.01 1 10.00 10.00 get_matrix_norm + + % the percentage of the total running time of the +time program used by this function. + +cumulative a running sum of the number of seconds accounted + seconds for by this function and those listed above it. + + self the number of seconds accounted for by this +seconds function alone. This is the major sort for this + listing. + +calls the number of times this function was invoked, if + this function is profiled, else blank. + + self the average number of milliseconds spent in this +ms/call function per call, if this function is profiled, + else blank. + + total the average number of milliseconds spent in this +ms/call function and its descendents per call, if this + function is profiled, else blank. + +name the name of the function. This is the minor sort + for this listing. The index shows the location of + the function in the gprof listing. If the index is + in parenthesis it shows where it would appear in + the gprof listing if it were to be printed. + +Copyright (C) 2012-2018 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + + Call graph (explanation follows) + + +granularity: each sample hit covers 2 byte(s) for 0.01% of 164.54 seconds + +index % time self children called name + +[1] 46.3 76.23 0.00 get_r1 [1] +----------------------------------------------- + +[2] 45.7 75.23 0.00 get_r2 [2] +----------------------------------------------- + +[3] 7.9 6.65 6.34 t14_solve [3] + 6.33 0.00 2000/2000 gauss_inverse [4] + 0.01 0.00 1/1 get_matrix_norm [8] +----------------------------------------------- + 6.33 0.00 2000/2000 t14_solve [3] +[4] 3.8 6.33 0.00 2000 gauss_inverse [4] +----------------------------------------------- + +[5] 0.0 0.03 0.05 read_or_init_matrix [5] + 0.05 0.00 8000000/8000000 f1 [6] +----------------------------------------------- + 0.05 0.00 8000000/8000000 read_or_init_matrix [5] +[6] 0.0 0.05 0.00 8000000 f1 [6] +----------------------------------------------- + +[7] 0.0 0.02 0.00 LeakTracer::registerAlloc(unsigned long, AllocType, void*) [7] +----------------------------------------------- + 0.01 0.00 1/1 t14_solve [3] +[8] 0.0 0.01 0.00 1 get_matrix_norm [8] +----------------------------------------------- + + This table describes the call tree of the program, and was sorted by + the total amount of time spent in each function and its children. + + Each entry in this table consists of several lines. The line with the + index number at the left hand margin lists the current function. + The lines above it list the functions that called this function, + and the lines below it list the functions this one called. + This line lists: + index A unique number given to each element of the table. + Index numbers are sorted numerically. + The index number is printed next to every function name so + it is easier to look up where the function is in the table. + + % time This is the percentage of the `total' time that was spent + in this function and its children. Note that due to + different viewpoints, functions excluded by options, etc, + these numbers will NOT add up to 100%. + + self This is the total amount of time spent in this function. + + children This is the total amount of time propagated into this + function by its children. + + called This is the number of times the function was called. + If the function called itself recursively, the number + only includes non-recursive calls, and is followed by + a `+' and the number of recursive calls. + + name The name of the current function. The index number is + printed after it. If the function is a member of a + cycle, the cycle number is printed between the + function's name and the index number. + + + For the function's parents, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the function into this parent. + + children This is the amount of time that was propagated from + the function's children into this parent. + + called This is the number of times this parent called the + function `/' the total number of times the function + was called. Recursive calls to the function are not + included in the number after the `/'. + + name This is the name of the parent. The parent's index + number is printed after it. If the parent is a + member of a cycle, the cycle number is printed between + the name and the index number. + + If the parents of the function cannot be determined, the word + `' is printed in the `name' field, and all the other + fields are blank. + + For the function's children, the fields have the following meanings: + + self This is the amount of time that was propagated directly + from the child into the function. + + children This is the amount of time that was propagated from the + child's children to the function. + + called This is the number of times the function called + this child `/' the total number of times the child + was called. Recursive calls by the child are not + listed in the number after the `/'. + + name This is the name of the child. The child's index + number is printed after it. If the child is a + member of a cycle, the cycle number is printed + between the name and the index number. + + If there are any cycles (circles) in the call graph, there is an + entry for the cycle-as-a-whole. This entry shows who called the + cycle (as parents) and the members of the cycle (as children.) + The `+' recursive calls entry shows the number of function calls that + were internal to the cycle, and the calls entry for each member shows, + for that member, how many times it was called from other members of + the cycle. + +Copyright (C) 2012-2018 Free Software Foundation, Inc. + +Copying and distribution of this file, with or without modification, +are permitted in any medium without royalty provided the copyright +notice and this notice are preserved. + +Index by function name + + [7] LeakTracer::registerAlloc(unsigned long, AllocType, void*) [8] get_matrix_norm [5] read_or_init_matrix + [6] f1 [1] get_r1 [3] t14_solve + [4] gauss_inverse [2] get_r2 diff --git a/2025.04.18/04Ex/solve.c b/2025.04.18/04Ex/solve.c index c9f282b..56eca10 100644 --- a/2025.04.18/04Ex/solve.c +++ b/2025.04.18/04Ex/solve.c @@ -34,38 +34,51 @@ double t4_solve ( for (int i = 1; i < n; ++i) printf ("f(x%d, x%d) = %lf\n", i-1, i, Y[i]); - for (int k = 0; k < n-1; ++k) + for (int k = 1; k < n-1; ++k) { double f_j = D[n-1]; printf ("------- K = %d -------\n", k); - for (int l = n*2-3; l >= k; --l) + for (int l = n*2-2; l > k*2; --l) { const int i = l >> 1; - const double x_i = X[i-k]; - double f_i; - x_j = X[i+1]; - + double x_i, f_i, *f; + + if (l & 1) + { + x_i = X[i-k]; + + f_i = D[i]; + f = Y + i + 1; + } else + { + x_j = X[i]; + x_i = X[i-k]; + + f_i = Y[i]; + f = D + i; + } + if (fabs(x_j - x_i) < DBL_EPSILON) return DBL_MAX; - if (l & 1) - { - f_i = D[i]; - Y[i+1] = (f_j - f_i) / (x_j - x_i); - printf ("f(x%d, x%d, ..., x%d) = %lf\n", i-k, i-k, i+1, Y[i+1]); - } else - { - f_i = Y[i]; - D[i+1] = (f_j - f_i) / (x_j - x_i); - printf ("f(x%d, ..., x%d, x%d) = %lf\n", i-k, i+1, i+1, D[i+1]); - } + *f = (f_j - f_i) / (x_j - x_i); +// printf ("f(x%d, x%d, ..., x%d) = %lf\n", i-k, i-k, i+1, Y[i+1]); +// printf ("f(x%d, ..., x%d, x%d) = %lf\n", i-k, i+1, i+1, D[i+1]); f_j = f_i; // printf ("I = %d, f(x%d, ... , x%d) = %lf\n", i, i-k+1, i+2, Y[i+1]); } + + printf("------- Y -------\n"); + for (int i = 0; i < n; ++i) + printf("Y[%d] = %lf\n", i, Y[i]); + + printf("------- D -------\n"); + for (int i = 0; i < n; ++i) + printf("D[%d] = %lf\n", i, D[i]); } start_value = 1; @@ -81,11 +94,11 @@ double t4_solve ( for (int i = 0; i < n; ++i) { - const double x_i = X[i]; + const double diff = (x_0 - X[i]); value += Y[i] * start_value; - start_value *= (x_0 - x_i); + start_value *= diff; value += D[i] * start_value; - start_value *= (x_0 - x_i); + start_value *= diff; } return value; diff --git a/2025.04.18/tests/x_2_d.txt b/2025.04.18/tests/x_2_d.txt new file mode 100644 index 0000000..9fd8479 --- /dev/null +++ b/2025.04.18/tests/x_2_d.txt @@ -0,0 +1,3 @@ +1 1 2 +2 4 4 +3 9 6