UVA10014- Simple calculations

來源:互聯網
上載者:User

思路:剛開始依照題目所給的a[i]= (a[i - 1] + a[i + 1]) / 2 - c[i],列出1到i的式子,然後全部相加,化簡,得到a[1] = a[i + 1] - a[i] + a[0] - 2C(i);

            之後就蒙了。。。不懂怎麼搞了,後來網上看來下才發現化簡的式子在進行累加的話,可以把a[i]化去,最後得到公式(i + 1)a[1] = a[i + 1] + n * a[0] - 2 * (C(1)-C(i));

#include<stdio.h>#include<string.h>#define N 3005int main() {int cas;double c[N], sum, a, b;scanf("%d", &cas);while (cas--) {int n, m;scanf("%d", &n);scanf("%lf %lf", &a, &b);memset(c, 0, sizeof(c));for(int i = 1; i <= n; i++)scanf("%lf", &c[i]);sum = 0;m = n;for(int i = 1; i <= n; i++) {for(int j = 1; j <= m; j++) sum += c[j];m--;}printf("%.2lf\n", (b + n * a - 2 * sum) / (n + 1));if (cas)printf("\n");}return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.