【c语言】一元多项式的求解，线性时间复杂度o(n)

#include<stdio.h>
#include<stdlib.h>

int main() {
	int n,x,i;
	int res = 0;
	printf("请输入一元多项式的幂(n)和x\n");
	scanf("%d%d", &n, &x);
	int* coefficient = (int*)malloc((n+1) * sizeof(int));
	printf("请输入系数(从高到底)\n");
	for (i = 0; i < n+1; i++) {
		scanf("%d", &coefficient[i]);
	}
	int item = 1;//表示x的多少次方1-->x-->x2
	for (i = n; i >=0; i--) {
		res += coefficient[n--] * item;
		item *= x;
	}
	printf("结果:%d", res);
	free(coefficient);
	return 0;
}