UVA 927 - Integer Sequences from Addition of Terms

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define MAX 23
long long coeffecients[MAX];
int d,k,n;

int main(){
	int t;
	scanf("%d",&t);
	while (t--)
	{
		int curPos=0;
		scanf("%d",&n);
		for (int i=0;i<=n;++i)
		{
			scanf("%d",&coeffecients[i]);//多项式系数
		}
		scanf("%d%d",&d,&k);
		for (int i=1;;++i)
		{
			long long v=0;
			for (int j=0;j<=n;++j)
			{
				v+=coeffecients[j]*pow(i,j);//计算多项式的值
			}
			int stride=d*i;				//范围
			curPos+=stride;
			if(curPos>=k){//如果位置大于所要求的位置,当前多项式的值就是答案
				printf("%lld\n",v);
				break;
			}
		}
	}
}