2022-03-17 10:59:47 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
2022-03-18 14:37:22 +00:00
|
|
|
#define LINE_SIZE 100
|
2022-03-17 10:59:47 +00:00
|
|
|
|
2022-03-18 14:37:22 +00:00
|
|
|
//#include<conio.h>
|
2022-03-18 11:45:58 +00:00
|
|
|
|
2022-03-18 14:37:22 +00:00
|
|
|
/*void main() {
|
2022-03-18 11:45:58 +00:00
|
|
|
int degree,x;
|
|
|
|
int coeff[10], i;
|
|
|
|
int sum = 0;
|
|
|
|
|
2022-03-18 14:37:22 +00:00
|
|
|
// Getting the value of the variable
|
|
|
|
printf("\nEnter the value of x: ");
|
|
|
|
scanf("%d",&x);
|
|
|
|
|
2022-03-18 11:45:58 +00:00
|
|
|
// Getting the degreee of the polynomial
|
|
|
|
printf("\nEnter the degree of the polynomial: ");
|
|
|
|
scanf("%d",°ree);
|
|
|
|
|
2022-03-18 14:37:22 +00:00
|
|
|
// Getting the coefficients of all terms of the polynomial
|
2022-03-18 11:45:58 +00:00
|
|
|
printf("\nEnter the coeffients from lower order to higher order: \n");
|
|
|
|
for(i=0; i<=degree; i++) {
|
|
|
|
scanf("%d",&coeff[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Applying Horner's rule
|
|
|
|
sum = coeff[degree];
|
|
|
|
for(i=degree-1; i>=0; i--) {
|
|
|
|
sum = sum*x + coeff[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Printing result
|
|
|
|
printf("\nResult: %d",sum);
|
2022-03-18 14:37:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
int main(){
|
|
|
|
int pole[LINE_SIZE];
|
|
|
|
int n=0;
|
|
|
|
char*vstup;
|
|
|
|
char riadok[LINE_SIZE];
|
|
|
|
do {
|
|
|
|
vstup=fgets(riadok,LINE_SIZE,stdin);
|
|
|
|
n++;
|
|
|
|
}while(*vstup!='\n');
|
|
|
|
//printf("%s",*vstup);
|
|
|
|
for(int i=0;n>i;i++){
|
|
|
|
printf("%s",vstup);
|
|
|
|
}
|
2022-03-17 10:59:47 +00:00
|
|
|
}
|