1104. Sum of Number Segments (20)
来源:互联网 发布:超级卡司是真是假 知乎 编辑:程序博客网 时间:2024/05/21 15:45
#include <iostream>#include <cstdio>using namespace std;int main(){int n;scanf("%d", &n);double sum = 0, num = 0;int times = 0;for(int i = 0; i < n; ++i){scanf("%lf", &num);sum += num * (i+1)*(n-i);}printf("%.2f", sum);return 0;}
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)
- PAT-A1059. Prime Factors (25(素数)
- MySQL数据库表的基本操作
- struts2学习笔记------接受请求参数
- nyoj 171 聪明的kk(数塔演变)
- Redhat如何查看和修改IP地址
- 1104. Sum of Number Segments (20)
- java中四种引用类型
- ubuntu+caffe+gpu 安装配置流程
- java实现一个过滤器
- BZOJ-1625 宝石手镯 01背包(傻逼题)
- shell之循环 (for、while、until)
- 在论坛看到的一个反射的例子
- 演员电影评分排序
- 程序员面试宝典第四版第一部分笔记