#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define endl '\n'
#define N 100005
const int inf=0x3f3f3f3f;
const double pi=acos(-1.0);
using namespace std;
int a[N];
signed main()
{
ios::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,x;
int sum=0;
cin>>n>>x;
for(int i=0;i<=n;i++)
cin>>a[i];
for(int i=n;i>=0;i--)
sum =sum*x+a[i];
cout<<sum<<endl;
return 0;
}
SWUST OJ#539 Horner scheme(多项式)
最新推荐文章于 2024-07-19 15:56:27 发布