Horner's law 구현하기

 #include <iostream>  
 using namespace std;
 
 int Horner(int x, int a[], int n) {
 	if(n>=0) return a[n]+x*Horner(x,a,n-1);
 	else return 0;
 }
 
 void main(void) {
     int x,n,a[50];
 	cout << "Enter X value:";
     cin >> x;
     cout << "Enter Max-Exp of f(x):";
     cin >> n;
     for(int i=0; i<=n; i++)
     {
        cout << "Value of constants X^" << n-i << ":";
 	   cin >> a[i];
     }
     cout << Horner(x, a, n) << endl;
 }