hoj 2086 A1 = ?
2012-09-26 13:00
323 查看
//找规律吧,还挺简单的,注意是实数
#include<stdio.h> #include<math.h> double c[3005]; int main(){ int i,n,temp; double a0,a1; double sum; while(scanf("%d",&n)!=EOF){ scanf("%lf%lf",&a0,&a1); temp=n; sum=n*a0+a1; for(i=1;i<=n;i++){ scanf("%lf",&c[i]); sum-=2*temp*c[i]; temp--; } sum/=(n+1); printf("%.2lf\n",sum); } return 0; }
相关文章推荐
- hoj 1018 - Multiple
- hoj 1070 图的m可着色优化问题
- hoj 2473 Fish Can Fly解题报告
- hoj2824
- hoj 1040 As Easy As A+B
- HOJ 1026 Run Away
- hoj1356 Miller_Rabbin算法
- hoj 1533 Fibonacci Numbers
- hoj 3005 Game Rigging 强联通分量求缩点
- HOJ 位图[BFS]
- HOJ---10814 Wooden Sticks[线性DP-求最少不递增子序列+结构体排序]
- HOJ 2608 Assemble(二分)
- Factstone Benchmark hoj 数学题
- hoj 2089不要62
- hoj 1917 2-sat 模板题
- HOJ 2892 YY, and YY again
- HOJ 2267 Alice and Bob
- HOJ 2012 Sort and Merge
- HOJ 1637 HangOver
- HOJ 1439 The Circumference of the Circle