ACM Plan UVa - 927 Integer Sequences from Addition of Terms

#include <iostream>
#include <vector>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
ll getNum(vector<int> &v, int n)// 求出an的值
{
    ll ans = 0;
    for(int i = 0; i < v.size(); i++)
        ans += v[i] * pow(n, i);
    return ans;
}
int main()
{
    // freopen("i.txt", "r", stdin);
    // freopen("o.txt", "w", stdout);
    int t; scanf("%d", &t);
    while(t--)
    {
        int i; scanf("%d", &i);
        vector<int> v(i + 1);
        for(int j = 0; j < v.size(); j++) scanf("%d", &v[j]);//储存系数
        int d, k; scanf("%d%d", &d, &k);
        int n;
        for(n = 1; ; n++)//核心代码，根据数量关系得到应该计算的n的值
            if((k -= n * d) <= 0) break;
        printf("%lld\n", getNum(v, n));
    }
    return 0;
}