uva 10014 - Simple calculations

这到题推公式其实并不难  主要是耐心和仔细的写好每一项   刚开始推的时候心很烦    推了半天都推不出来索性不推了   后来静下心来一下就推出来了

最后为    a[1]=(n*a[0]+a[n+1]-2*n*c[1]-2*(n-1)*c[2]-...-2*c[n])/(n+1)

#include<cstdio>

int main()
{
    int N;
    while(scanf("%d",&N)!=EOF)
    {
        double num_0,num_n;
        scanf("%lf%lf",&num_0,&num_n);
        double c[N+1];
        for(int i = 1;i <= N; i++)
            scanf("%lf",&c[i]);
        double a1 = N*num_0 +num_n;
        int t = N;
        for(int i = 1 ;i <= N ;i++)
           a1 -= 2*c[i]*t--;
        a1 /= N+1;
        printf("%.2lf\n",a1);
    }
    return 0;
}