1104. Sum of Number Segments (20)
来源:互联网 发布:java同步锁的种类 编辑:程序博客网 时间:2024/05/21 06:18
AC代码
#include<stdio.h>#include<vector> using namespace std;vector<double> a;int main(){int n;scanf("%d",&n);double sum=0;for(int i=0;i<n;i++){double temp;scanf("%lf",&temp);a.push_back(temp);}for(int i=0;i<n;i++){sum+=a[i]*(n-i)*(i+1);}printf("%.2lf\n",sum);}
原先写的,和上面的应该一样,但就是一个测试点不过
#include<stdio.h>#include<vector> using namespace std;vector<double> a;int main(){int n;scanf("%d",&n);double sum=0;for(int i=0;i<n;i++){double temp;scanf("%lf",&temp);a.push_back(temp);}for(int i=0;i<n/2;i++){sum+=(a[i]+a[n-1-i])*(n-i)*(i+1);}if(n%2==1){sum+=a[n/2]*(n-n/2)*(n/2+1);}printf("%.2lf\n",sum);}
0 0
- 【PAT】1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- PAT 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- PAT 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- [pat]1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- PAT 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)
- 1104.Sum of Number Segments (20)
- (十七)迭代器模式详解(foreach的精髓)
- C语言——使用scanf函数时需要注意的问题
- 【HTML5】Curved motion
- (十八)享元模式详解(都市异能版)
- Shell部分12
- 1104. Sum of Number Segments (20)
- 一个前辈写的网络协议学习方法
- 批次
- CSDN2016前端开发概况
- NNU_20161103_PAT1002. 写出这个数
- (十九)组合模式详解
- js事件on动态绑定数据,绑定多个事件
- Android 开发之Android Studio使用小技巧
- 第七节 创建web服务器