PAT_A1104#Sum of Number Segments
Source:
Description:
Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segments: (0.1) (0.1, 0.2) (0.1, 0.2, 0.3) (0.1, 0.2, 0.3, 0.4) (0.2) (0.2, 0.3) (0.2, 0.3, 0.4) (0.3) (0.3, 0.4) and (0.4).
Now given a sequence, you are supposed to find the sum of all the numbers in all the segments. For the previous example, the sum of all the 10 segments is 0.1 + 0.3 + 0.6 + 1.0 + 0.2 + 0.5 + 0.9 + 0.3 + 0.7 + 0.4 = 5.0.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N, the size of the sequence which is no more than 1. The next line contains N positive numbers in the sequence, each no more than 1.0, separated by a space.
Output Specification:
For each test case, print in one line the sum of all the numbers in all the segments, accurate up to 2 decimal places.
Sample Input:
4
0.1 0.2 0.3 0.4
Sample Output:
5.00
Key:
- 模拟题
Attention:
- i*(n-i+1)*x,3和4测试点会报错
Code:
#include<cstdio> int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("Test.txt", "r", stdin);
#endif // ONLINE_JUDGE int n;
double x,sum=;
scanf("%d", &n);
for(int i=; i<=n; i++)
{
scanf("%lf", &x);
sum += (x*i*(n-i+));
}
printf("%.2f\n", sum); return ;
}
最新文章
- 翻译:使用 ASP.NET MVC 4, EF, Knockoutjs and Bootstrap 设计和开发站点 - 1
- JQ倒计时天时分秒
- 详解FindBugs的各项检测器 .
- Shell 之外 试试不操作 shell 来实现同样的效果
- mysql通过binlog日志来恢复数据
- 排版字号对应多少pt
- oracle数据库什么情况下创建索引比较好
- JavaWeb学习记录(二十六)——在线人数统计HttpSessionListener监听实现
- sirius的学习笔记(3)
- 字符串编码---hash函数的应用
- destoon实现底部添加你是第几位访问者的方法
- Invalid character constant
- HDU 2955 Robberies(01背包)
- 100本最棒的web前端图书推荐
- 基于Babylonjs自制WebGL3D模型编辑器
- 【css】盒子模型 之 概述
- Java基础概念1
- window mysql8.0 zip版本安装
- 页面跳转时,url 传大数据的参数不全的问题+序列化对象
- javascript之奇淫技巧