博客
关于我
2018蓝桥杯C++A组——付账问题
阅读量:111 次
发布时间:2019-02-26

本文共 1242 字,大约阅读时间需要 4 分钟。

????

????????????????????????????????????????? n ????????? S???????????????????????????????

??

?????????

  • ??????????n ? S????????????????
  • ??????? n ?????????????

??

?????????????????????

????

5 2333666 666 666 666 666 666

????

0.0000

????

???????????????????????????????????????????????????????????????????

[ s = \sqrt{\frac{1}{n} \sum_{i=1}^{n} \left(b_i - \frac{1}{n} \sum_{i=1}^{n} b_i \right)^2} ]

???( s ) ?????( b_i ) ?????????( n ) ?????????

???????????????????????????????????????????????????????????????

  • ?????????????? ( \mu = \frac{S}{n} )?
  • ???????????????
  • ?????
    • ??????????????????????
    • ???????????????????????????????????????? cur_avg??? cur_avg ??????????
  • ???????????????????????????????????

    C++??

    #include 
    using namespace std;typedef long long LL;int n;LL S;double ans = 0.0;double avg = 1.0 * S / n;LL *a = new LL[n];void work() { scanf("%d %lld", &n, &S); ans = 0.0; avg = 1.0 * S / n; LL *a = new LL[n]; for (int i = 0; i < n; ++i) { scanf("%lld", &a[i]); } // ????? double sum = 0.0; for (int i = 0; i < n; ++i) { double diff = a[i] - avg; sum += diff * diff; } ans = sqrt(sum / n); printf("%.4f", ans);}

    ??

    ????????????????

    0.0000

    ???????????????????? 0.0000?

    转载地址:http://swqu.baihongyu.com/

    你可能感兴趣的文章
    POJ 3468 A Simple Problem with Integers
    查看>>
    poj 3468 A Simple Problem with Integers 降维线段树
    查看>>
    poj 3468 A Simple Problem with Integers(线段树 插线问线)
    查看>>
    poj 3485 区间选点
    查看>>
    poj 3518 Prime Gap
    查看>>
    poj 3539 Elevator——同余类bfs
    查看>>
    Qt笔记——官方文档全局定义(三)Macros宏
    查看>>
    poj 3628 Bookshelf 2
    查看>>
    Qt笔记——官方文档全局定义(一)Types数据类型
    查看>>
    POJ 3670 DP LIS?
    查看>>
    POJ 3683 Priest John's Busiest Day (算竞进阶习题)
    查看>>
    POJ 3988 Selecting courses
    查看>>
    POJ 4020 NEERC John's inversion 贪心+归并求逆序对
    查看>>
    poj 4044 Score Sequence(暴力)
    查看>>
    POJ 基础数据结构
    查看>>
    POJ 题目3020 Antenna Placement(二分图)
    查看>>
    Poj(1797) Dijkstra对松弛条件的变形
    查看>>
    SpringBoot为什么不需要xml配置文件?
    查看>>
    POJ--2391--Ombrophobic Bovines【分割点+Floyd+Dinic优化+二分法答案】最大网络流量
    查看>>
    Qt笔记——SQLite初探QSqlDatabase QSqlQuery
    查看>>