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
原创粉丝点击