uva 10014 - Simple calculations

最新推荐文章于 2017-09-06 15:16:57 发布

张亚军

最新推荐文章于 2017-09-06 15:16:57 发布

阅读量471

点赞数

文章标签：数学 uva

Simple calculations

The Problem

There is a sequence of n+2 elements a₀, a₁,…, a_n+1 (n <= 3000; -1000 <= a_i 1000). It is known that a_i = (a_i–1 + a_i+1)/2 – c_i for each i=1, 2, ..., n. You are given a₀, a_n+1, c₁, ... , c_n. Write a program which calculates a₁.

The Input

The first line is the number of test cases, followed by a blank line.

For each test case, the first line of an input file contains an integer n. The next two lines consist of numbers a₀ and a_n+1 each having two digits after decimal point, and the next n lines contain numbers c_i (also with two digits after decimal point), one number per line.

Each test case will be separated by a single line.

The Output

For each test case, the output file should contain a₁ in the same format as a₀ and a_n+1.

Print a blank line between the outputs for two consecutive test cases.

Sample Input

1150.5025.5010.15

Sample Output

27.85

A[i]=(A[i-1]+A[i+1])/2-C[i];
2*(A[i]+C[i])=A[i-1]+A[i+1]

A[1]-A[0]=A[2]-A[1]-2*C[1]
A[2]-A[1]=A[3]-A[2]-2*C[2]
...
A[i]-A[i-1]=A[i+1]-A[i]-2*C[i]
A[i]-A[0]=A[i+1]-A[1]-2C

A[1]=A[i+1]-A[i]+A[0]-2C(N)[N项和]
做到这没思路了，估计大多数人都和我一样Y-Y，只要再累加下去答案就出来了。
成功就是坚持做已经做过的事情O(∩_∩)O哈哈~
n=1 A[1]=A[2]-A[1]+A[0]-2C(1)
n=2 A[1]=A[3]-A[2]+A[0]-2C(2)
n=3 A[1]=A[4]-A[3]+A[0]-2C(3)
n*A[1]=A[n+1]-A[1]+n*A[0]-2*[c(1)+...C(n)]

(n+1)A[1]=A[n+1]+N*A[0]-2*[c(1)+c(n)]

1. 尽量推出a[1]与各项之间的关系

2 分数化整数

#include <stdio.h>
#include <math.h>
void main()
{
    double c[3001],s[3001],x,y;
    int n,i,t;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d",&n);
        scanf("%lf%lf",&x,&y);
        for (i=1;i<=n;i++)
            scanf("%lf",&c[i]);
        s[1]=c[1]; 
        s[0]=s[1];
        for (i=2;i<=n;i++)
            {
                s[i]=s[i-1]+c[i]；
                s[0]+=s[i];
            }   
    printf("%.2lf\n",(n*x+y-2*s[0])/(n+1));
    if (t) printf("\n");
    }
}