PAT甲题题解-1104. Sum of Number Segments (20)-(水题)
2016-11-30 18:43
399 查看
#include <iostream> #include <cstdio> #include <algorithm> #include <string.h> using namespace std; /* 对于第i个数字(i=0~n-1),它每组出现的次数为n-i,出现在前i+1个组中 */ const int maxn=100000+5; double num[maxn]; int main() { int n; scanf("%d",&n); double sum=0.0f; for(int i=0;i<n;i++){ scanf("%lf",&num[i]); sum+=num[i]*(n-i)*(i+1); } printf("%.2lf",sum); return 0; }
相关文章推荐
- 1104. Sum of Number Segments (20)-PAT甲级真题
- PAT(甲)1104. Sum of Number Segments (20)
- PAT(甲)1104. Sum of Number Segments (20)
- PAT 甲1104. Sum of Number Segments (20)
- PAT(甲)1104. Sum of Number Segments (20)
- PAT(甲)1104. Sum of Number Segments (20)
- PAT 甲级 1104. Sum of Number Segments (20)
- PAT(甲)1104. Sum of Number Segments (20)
- 【PAT】1104. Sum of Number Segments (20)
- PAT 1104. Sum of Number Segments (20)
- pat-a1104. Sum of Number Segments (20)
- PAT甲级 1104. Sum of Number Segments (20)
- 【PAT】【Advanced Level】1104. Sum of Number Segments (20)
- Pat(A) 1104. Sum of Number Segments (20)
- PAT1104. Sum of Number Segments (20) double计算和整数溢出
- PAT 1104. Sum of Number Segments (20)
- 1104. Sum of Number Segments (20)【数学题】——PAT (Advanced Level) Practise
- 1049. 数列的片段和(20) PAT乙级 &1104. Sum of Number Segments (20)PAT甲级
- PAT(甲)1104. Sum of Number Segments (20)
- PAT 1104. Sum of Number Segments (20) double要在int型前面!未解之谜