2024-02-29 13:23:40 +00:00
|
|
|
#include <stdio.h>
|
2024-03-04 15:40:30 +00:00
|
|
|
#include <stdlib.h>
|
2024-02-29 13:23:40 +00:00
|
|
|
|
2024-03-04 13:48:32 +00:00
|
|
|
#define SIZE 100
|
2024-02-29 13:23:40 +00:00
|
|
|
|
|
|
|
int main() {
|
2024-03-04 13:44:02 +00:00
|
|
|
double coefs[SIZE] = {0.0};
|
|
|
|
double x = 0.0;
|
|
|
|
double input = 0.0;
|
2024-02-29 13:23:40 +00:00
|
|
|
int count = 0;
|
2024-03-04 13:40:37 +00:00
|
|
|
int length = 0;
|
|
|
|
double result = 0.0;
|
2024-03-04 12:55:19 +00:00
|
|
|
|
2024-03-04 18:57:08 +00:00
|
|
|
while (count < SIZE)
|
|
|
|
{
|
2024-03-04 19:04:14 +00:00
|
|
|
if (coefs[count] == '\n')
|
2024-03-04 18:57:08 +00:00
|
|
|
{
|
2024-03-04 19:01:11 +00:00
|
|
|
return;
|
2024-03-04 18:57:08 +00:00
|
|
|
}
|
|
|
|
|
2024-03-04 18:52:12 +00:00
|
|
|
|
2024-03-04 18:58:09 +00:00
|
|
|
else if (scanf("%d", &input) != 1)
|
2024-03-04 18:57:08 +00:00
|
|
|
{
|
|
|
|
printf("Nepodarilo sa nacitat polynom na %d mieste.", count);
|
2024-03-04 19:07:16 +00:00
|
|
|
break;
|
2024-03-04 18:52:12 +00:00
|
|
|
}
|
2024-03-04 13:02:52 +00:00
|
|
|
coefs[count] = input;
|
|
|
|
count++;
|
|
|
|
}
|
2024-03-04 12:55:19 +00:00
|
|
|
|
2024-03-04 13:35:38 +00:00
|
|
|
x = coefs[0];
|
|
|
|
|
2024-03-04 13:14:10 +00:00
|
|
|
length = count;
|
|
|
|
|
2024-03-04 18:57:08 +00:00
|
|
|
for (int i = 1; i < length; i ++)
|
|
|
|
{
|
|
|
|
result = result * x + coefs[i];
|
2024-03-04 13:14:10 +00:00
|
|
|
}
|
|
|
|
|
2024-03-04 13:41:35 +00:00
|
|
|
printf("Vysledok je: %.2lf\n", result);
|
2024-02-29 13:23:40 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2024-03-04 13:02:52 +00:00
|
|
|
|
2024-03-04 13:14:10 +00:00
|
|
|
|