博客
关于我
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 2965 The Pilots Brothers' refrigerator-1
    查看>>
    poj 3026( Borg Maze BFS + Prim)
    查看>>
    POJ 3041 - 最大二分匹配
    查看>>
    POJ 3041 Asteroids(二分匹配模板题)
    查看>>
    Qt笔记——标准文件对话框QFileDialog
    查看>>
    poj 3083 Children of the Candy Corn
    查看>>
    POJ 3083 Children of the Candy Corn 解题报告
    查看>>
    POJ 3253 Fence Repair C++ STL multiset 可解 (同51nod 1117 聪明的木匠)
    查看>>
    Qt笔记——控件总结
    查看>>
    poj 3262 Protecting the Flowers 贪心
    查看>>
    poj 3264(简单线段树)
    查看>>
    Qt笔记——布局管理三件套分割窗口、停靠窗口和堆栈窗口
    查看>>
    poj 3277 线段树
    查看>>
    POJ 3349 Snowflake Snow Snowflakes
    查看>>
    POJ 3411 DFS
    查看>>
    poj 3422 Kaka's Matrix Travels (费用流 + 拆点)
    查看>>
    Qt笔记——官方文档全局定义(二)Functions函数
    查看>>
    POJ 3468 A Simple Problem with Integers
    查看>>
    poj 3468 A Simple Problem with Integers 降维线段树
    查看>>
    poj 3468 A Simple Problem with Integers(线段树 插线问线)
    查看>>