honer 알고리즘

#include <iostream>

using namespace std;

int main(void)
{
    int n;
    int temp;
    int sum = 0;
    int x;
    int val[1000];
    cout << "Input n :";
    cin >> n;

    for (int i = 0; i <= n; i++)
    {
        if (i != n)
        {
            cout << "?x^" << n - i << " :";
        }
        else
        {
            cout << "?constant :";
        }
        cin >> temp;
        val[i] = temp;
    }
    cout << "x? :";
    cin >> x;
    sum = val[0];
    for (int i = 0; i < n; i++)
    {
        sum = sum * x + val[i + 1];
    }
    for (int i = 0; i <= n; i++)
    {
        cout << val[i];
        if (i != n)
        {
            cout << "x"
                 << "^" << n - i << " + ";
        }
    }
    cout << endl;
    cout << "f(" << x << ")"
         << " = " << sum;
}